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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 14:02 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.8K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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 757K 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-08a-LTLFireability-00
FORMULA_NAME ASLink-PT-08a-LTLFireability-01
FORMULA_NAME ASLink-PT-08a-LTLFireability-02
FORMULA_NAME ASLink-PT-08a-LTLFireability-03
FORMULA_NAME ASLink-PT-08a-LTLFireability-04
FORMULA_NAME ASLink-PT-08a-LTLFireability-05
FORMULA_NAME ASLink-PT-08a-LTLFireability-06
FORMULA_NAME ASLink-PT-08a-LTLFireability-07
FORMULA_NAME ASLink-PT-08a-LTLFireability-08
FORMULA_NAME ASLink-PT-08a-LTLFireability-09
FORMULA_NAME ASLink-PT-08a-LTLFireability-10
FORMULA_NAME ASLink-PT-08a-LTLFireability-11
FORMULA_NAME ASLink-PT-08a-LTLFireability-12
FORMULA_NAME ASLink-PT-08a-LTLFireability-13
FORMULA_NAME ASLink-PT-08a-LTLFireability-14
FORMULA_NAME ASLink-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779482566344

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 20:42:47] [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 20:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:42:48] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-22 20:42:48] [INFO ] Transformed 1796 places.
[2026-05-22 20:42:48] [INFO ] Transformed 2646 transitions.
[2026-05-22 20:42:48] [INFO ] Found NUPN structural information;
[2026-05-22 20:42:48] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 59 place count 1737 transition count 2572
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 1736 transition count 2572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 1736 transition count 2570
Applied a total of 73 rules in 405 ms. Remains 1736 /1796 variables (removed 60) and now considering 2570/2618 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3632711523148498722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8218557940153531113.kers'
[2026-05-22 20:42:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3632711523148498722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8218557940153531113.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2570 rows 1736 cols 9594 entries
Finished phase 1 with 711 SingleSign rule and 728 generalized
[2026-05-22 20:42:48] [INFO ] Computed 297 invariants in 31 ms
Computed 297 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-8218557940153531113.kers
Total runtime 42 ms.
[2026-05-22 20:42:51] [INFO ] Implicit Places using invariants in 2498 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 402, 407, 408, 409, 445, 574, 590, 595, 596, 597, 633, 762, 778, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1159, 1160, 1180, 1198, 1343, 1348, 1349, 1350, 1368, 1515, 1520, 1532, 1537, 1538, 1539, 1574, 1576, 1579, 1597, 1598, 1599, 1600, 1617, 1625, 1633, 1639, 1645, 1651, 1657, 1665, 1671, 1677, 1685]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 2578 ms to find 72 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1664/1796 places, 2570/2618 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1651 transition count 2557
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1651 transition count 2557
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1641 transition count 2547
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1641 transition count 2547
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1636 transition count 2542
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1636 transition count 2542
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1634 transition count 2540
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1634 transition count 2540
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1632 transition count 2538
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1632 transition count 2538
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1631 transition count 2537
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1631 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1630 transition count 2536
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1630 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1629 transition count 2535
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1629 transition count 2535
Applied a total of 70 rules in 639 ms. Remains 1629 /1664 variables (removed 35) and now considering 2535/2570 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4632198162183104910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17222380044597008067.kers'
[2026-05-22 20:42:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4632198162183104910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17222380044597008067.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2535 rows 1629 cols 8939 entries
Finished phase 1 with 1015 SingleSign rule and 389 generalized
[2026-05-22 20:42:51] [INFO ] Computed 225 invariants in 46 ms
Computed 225 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-17222380044597008067.kers
Total runtime 49 ms.
[2026-05-22 20:42:53] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2026-05-22 20:42:53] [INFO ] Invariant cache hit.
[2026-05-22 20:42:58] [INFO ] Implicit Places using invariants and state equation in 4742 ms returned []
Implicit Place search using SMT with State Equation took 6176 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1629/1796 places, 2535/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9826 ms. Remains : 1629/1796 places, 2535/2618 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Applied a total of 0 rules in 91 ms. Remains 1629 /1629 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2026-05-22 20:42:58] [INFO ] Invariant cache hit.
[2026-05-22 20:42:59] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2026-05-22 20:42:59] [INFO ] Invariant cache hit.
[2026-05-22 20:43:04] [INFO ] Implicit Places using invariants and state equation in 4730 ms returned []
Implicit Place search using SMT with State Equation took 5925 ms to find 0 implicit places.
Running 2534 sub problems to find dead transitions.
[2026-05-22 20:43:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1628 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 2534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1628/4164 variables, and 163 constraints, problems are : Problem set: 0 solved, 2534 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 163/188 constraints, State Equation: 0/1629 constraints, PredecessorRefiner: 2534/2534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1628 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 2534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1628/4164 variables, and 163 constraints, problems are : Problem set: 0 solved, 2534 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 163/188 constraints, State Equation: 0/1629 constraints, PredecessorRefiner: 0/2534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61429ms problems are : Problem set: 0 solved, 2534 unsolved
Search for dead transitions found 0 dead transitions in 61485ms
Finished structural reductions in LTL mode , in 1 iterations and 67574 ms. Remains : 1629/1629 places, 2535/2535 transitions.
Support contains 55 out of 1629 places after structural reductions.
[2026-05-22 20:44:06] [INFO ] Flatten gal took : 173 ms
[2026-05-22 20:44:06] [INFO ] Flatten gal took : 114 ms
[2026-05-22 20:44:06] [INFO ] Input system was already deterministic with 2535 transitions.
RANDOM walk for 40000 steps (205 resets) in 1543 ms. (25 steps per ms) remains 18/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
[2026-05-22 20:44:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 145/179 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 388/567 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1009/1576 variables, 173/210 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1576 variables, 1/211 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 53/1629 variables, 15/226 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1629 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 17 unsolved
SMT process timed out in 5037ms, After SMT, problems are : Problem set: 1 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 1629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1629 transition count 2256
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1350 transition count 2255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1349 transition count 2255
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 211 Pre rules applied. Total rules applied 560 place count 1349 transition count 2044
Deduced a syphon composed of 211 places in 3 ms
Ensure Unique test removed 67 places
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 3 with 489 rules applied. Total rules applied 1049 place count 1071 transition count 2044
Discarding 6 places :
Implicit places reduction removed 6 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 3 with 7 rules applied. Total rules applied 1056 place count 1065 transition count 2043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1057 place count 1064 transition count 2043
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1057 place count 1064 transition count 2015
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1113 place count 1036 transition count 2015
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1115 place count 1034 transition count 2013
Iterating global reduction 5 with 2 rules applied. Total rules applied 1117 place count 1034 transition count 2013
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1118 place count 1034 transition count 2012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1119 place count 1033 transition count 2012
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1119 place count 1033 transition count 2011
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1121 place count 1032 transition count 2011
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 6 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 7 with 172 rules applied. Total rules applied 1293 place count 946 transition count 1925
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1299 place count 946 transition count 1919
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1305 place count 940 transition count 1919
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1333 place count 940 transition count 1891
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 1361 place count 912 transition count 1891
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1363 place count 912 transition count 1889
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 1386 place count 912 transition count 1889
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1392 place count 912 transition count 1889
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1395 place count 912 transition count 1886
Applied a total of 1395 rules in 772 ms. Remains 912 /1629 variables (removed 717) and now considering 1886/2535 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 912/1629 places, 1886/2535 transitions.
RANDOM walk for 40000 steps (521 resets) in 776 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 164798 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 17
Probabilistic random walk after 164798 steps, saw 83352 distinct states, run finished after 3011 ms. (steps per millisecond=54 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-632051611348703295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2015386908039526608.kers'
[2026-05-22 20:44:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-632051611348703295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2015386908039526608.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 1886 rows 903 cols 7778 entries
Finished phase 1 with 320 SingleSign rule and 440 generalized
[2026-05-22 20:44:16] [INFO ] Computed 152 invariants in 14 ms
Computed 152 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2015386908039526608.kers
Total runtime 16 ms.
[2026-05-22 20:44:16] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 232/263 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 236/499 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 393/892 variables, 104/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 20/912 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1886/2798 variables, 912/1064 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2798 variables, 39/1103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2798 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/2798 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2798/2798 variables, and 1103 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4705 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 912/912 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 232/263 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 236/499 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 393/892 variables, 104/147 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/892 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 20/912 variables, 5/154 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 12 (OVERLAPS) 1886/2798 variables, 912/1066 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2798 variables, 39/1105 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2798 variables, 5/1110 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2798 variables, 0/1110 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2798 variables, 0/1110 constraints. Problems are: Problem set: 11 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2798/2798 variables, and 1110 constraints, problems are : Problem set: 11 solved, 5 unsolved in 16046 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 912/912 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20822ms problems are : Problem set: 11 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 3055 ms.
Support contains 6 out of 912 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 912/912 places, 1886/1886 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 905 transition count 1879
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 905 transition count 1874
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 29 place count 895 transition count 1874
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 891 transition count 1862
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 891 transition count 1862
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 891 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 890 transition count 1851
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 890 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 889 transition count 1843
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 889 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 888 transition count 1835
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 888 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 887 transition count 1827
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 887 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 886 transition count 1819
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 886 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 885 transition count 1811
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 885 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 884 transition count 1803
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 884 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 883 transition count 1795
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 883 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 882 transition count 1787
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 882 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 881 transition count 1779
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 881 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 880 transition count 1771
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 880 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 879 transition count 1763
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 879 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 878 transition count 1755
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 878 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 877 transition count 1747
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 877 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 876 transition count 1739
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 876 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 875 transition count 1731
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 875 transition count 1731
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 874 transition count 1730
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 865 transition count 1730
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 82 place count 865 transition count 1713
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 123 place count 841 transition count 1713
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 839 transition count 1713
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 132 place count 832 transition count 1706
Iterating global reduction 4 with 7 rules applied. Total rules applied 139 place count 832 transition count 1706
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 146 place count 832 transition count 1699
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 154 place count 828 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 827 transition count 1694
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 827 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 827 transition count 1693
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 827 transition count 1691
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 163 place count 825 transition count 1689
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 825 transition count 1688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 824 transition count 1688
Applied a total of 165 rules in 717 ms. Remains 824 /912 variables (removed 88) and now considering 1688/1886 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 717 ms. Remains : 824/912 places, 1688/1886 transitions.
RANDOM walk for 40000 steps (568 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 149881 steps, run visited all 3 properties in 1396 ms. (steps per millisecond=107 )
Probabilistic random walk after 149881 steps, saw 63521 distinct states, run finished after 1400 ms. (steps per millisecond=107 ) properties seen :3
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-08a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-10 TRUE 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(F((G(p0)||(!p1&&X((p1||G(p0))))||G(p1)))))'
Support contains 3 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 1008 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4330432903951792274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18111402299933171876.kers'
[2026-05-22 20:44:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4330432903951792274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18111402299933171876.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1611 cols 8376 entries
Finished phase 1 with 1004 SingleSign rule and 382 generalized
[2026-05-22 20:44:44] [INFO ] Computed 225 invariants in 50 ms
Computed 225 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-18111402299933171876.kers
Total runtime 56 ms.
[2026-05-22 20:44:45] [INFO ] Implicit Places using invariants in 1638 ms returned [372, 409, 591, 756, 1115, 1120, 1283, 1337]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1651 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 59 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2719 ms. Remains : 1603/1629 places, 2392/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||G(p1)||(X((p1||G(p0)))&&!p1)))))'
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-00
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-00 finished in 3072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 1166 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
[2026-05-22 20:44:47] [INFO ] Invariant cache hit.
[2026-05-22 20:44:49] [INFO ] Implicit Places using invariants in 1948 ms returned [372, 409, 591, 756, 1115, 1120, 1283, 1337]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1962 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 60 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3189 ms. Remains : 1603/1629 places, 2392/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 1023 ms.
Product exploration explored 100000 steps with 50000 reset in 920 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 26 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 43 ms.
FORMULA ASLink-PT-08a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-01 finished in 5372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U !p1)&&X(F(p1)))))'
Support contains 3 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 1063 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
[2026-05-22 20:44:52] [INFO ] Invariant cache hit.
[2026-05-22 20:44:53] [INFO ] Implicit Places using invariants in 1097 ms returned [372, 409, 756, 1115, 1120, 1283, 1337]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 75 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2240 ms. Remains : 1604/1629 places, 2392/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U !p1)&&X(F(p1)))))'
Stuttering acceptance computed with spot in 228 ms :[true, true, (NOT p0), p1, (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-02
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-02 finished in 2503 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((X(F(((X(X(F(!p1)))&&G(p2))||G(F(!p1)))))||p0)))'
Support contains 5 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 987 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
[2026-05-22 20:44:54] [INFO ] Invariant cache hit.
[2026-05-22 20:44:56] [INFO ] Implicit Places using invariants in 1183 ms returned [372, 409, 591, 1115, 1120, 1283, 1337]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1207 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 58 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2252 ms. Remains : 1604/1629 places, 2392/2535 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((X(F(((X(X(F(p1)))&&G(p2))||G(F(p1)))))||p0)))'
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-03
Product exploration explored 100000 steps with 470 reset in 485 ms.
Product exploration explored 100000 steps with 475 reset in 448 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 11 factoid took 80 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (200 resets) in 647 ms. (61 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8100767566847507509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13829975030144627172.kers'
[2026-05-22 20:44:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8100767566847507509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13829975030144627172.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2392 rows 1604 cols 8310 entries
Finished phase 1 with 1061 SingleSign rule and 325 generalized
[2026-05-22 20:44:57] [INFO ] Computed 218 invariants in 16 ms
Computed 218 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13829975030144627172.kers
Total runtime 19 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 535/715 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 889/1604 variables, 176/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3996 variables, 1604/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3996 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3996 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3996/3996 variables, and 1822 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 1604/1604 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 535/715 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 889/1604 variables, 176/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3996 variables, 1604/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3996 variables, 3/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3996 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3996 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3996/3996 variables, and 1825 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 1604/1604 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6282ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 920 ms.
Support contains 5 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2392/2392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1604 transition count 2078
Reduce places removed 314 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 315 rules applied. Total rules applied 629 place count 1290 transition count 2077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 630 place count 1289 transition count 2077
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 630 place count 1289 transition count 1867
Deduced a syphon composed of 210 places in 3 ms
Ensure Unique test removed 66 places
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1116 place count 1013 transition count 1867
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 1137 place count 1001 transition count 1858
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1146 place count 992 transition count 1858
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 1146 place count 992 transition count 1831
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1200 place count 965 transition count 1831
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1205 place count 960 transition count 1826
Iterating global reduction 5 with 5 rules applied. Total rules applied 1210 place count 960 transition count 1826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1214 place count 960 transition count 1822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1215 place count 959 transition count 1822
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1215 place count 959 transition count 1821
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1217 place count 958 transition count 1821
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 7 with 174 rules applied. Total rules applied 1391 place count 871 transition count 1734
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1399 place count 871 transition count 1726
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1407 place count 863 transition count 1726
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1439 place count 863 transition count 1694
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 1472 place count 830 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1480 place count 830 transition count 1686
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 1505 place count 830 transition count 1686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1506 place count 829 transition count 1685
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1514 place count 821 transition count 1685
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1514 place count 821 transition count 1669
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1554 place count 797 transition count 1669
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1562 place count 789 transition count 1661
Iterating global reduction 10 with 8 rules applied. Total rules applied 1570 place count 789 transition count 1661
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1578 place count 789 transition count 1653
Applied a total of 1578 rules in 383 ms. Remains 789 /1604 variables (removed 815) and now considering 1653/2392 (removed 739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 789/1604 places, 1653/2392 transitions.
RANDOM walk for 40000 steps (586 resets) in 423 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (72 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 253159 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 3
Probabilistic random walk after 253159 steps, saw 75206 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14813574315349038240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2158536768658103998.kers'
[2026-05-22 20:45:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14813574315349038240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2158536768658103998.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 3 ms.
// Phase 1: matrix 1653 rows 782 cols 6754 entries
Finished phase 1 with 299 SingleSign rule and 367 generalized
[2026-05-22 20:45:08] [INFO ] Computed 123 invariants in 30 ms
Computed 123 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-2158536768658103998.kers
Total runtime 35 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/148 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 71/219 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/267 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 114/381 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 61/442 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/473 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 124/597 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 85/682 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/682 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 15/697 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/697 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 74/771 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/771 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/781 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/781 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 8/789 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/789 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1653/2442 variables, 789/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2442 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2442 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2442/2442 variables, and 912 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3629 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/148 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 71/219 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/267 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 114/381 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 61/442 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/473 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 124/597 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 85/682 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/682 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 15/697 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/697 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 74/771 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/771 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/781 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/781 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 8/789 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/789 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1653/2442 variables, 789/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2442 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2442 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/2442 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2442/2442 variables, and 915 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3822 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7514ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 475 ms.
Support contains 5 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1653/1653 transitions.
Applied a total of 0 rules in 26 ms. Remains 789 /789 variables (removed 0) and now considering 1653/1653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 789/789 places, 1653/1653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1653/1653 transitions.
Applied a total of 0 rules in 26 ms. Remains 789 /789 variables (removed 0) and now considering 1653/1653 (removed 0) transitions.
[2026-05-22 20:45:16] [INFO ] Invariant cache hit.
[2026-05-22 20:45:17] [INFO ] Implicit Places using invariants in 678 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 369, 374, 379, 380, 433, 450, 456, 459, 461, 462, 467, 468, 520, 537, 543, 546, 551, 552, 557, 558, 610, 627, 633, 636, 638, 639, 644, 645, 697, 714, 720, 723, 725, 726]
[2026-05-22 20:45:17] [INFO ] Actually due to overlaps returned [187, 274, 374, 462, 552, 639, 726, 88, 94, 99, 175, 181, 186, 262, 268, 273, 450, 456, 461, 537, 543, 551, 627, 633, 638, 714, 720, 725, 71, 100, 158, 245, 332, 369, 433, 520, 610, 697]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 682 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 751/789 places, 1653/1653 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 724 transition count 1626
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 724 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 717 transition count 1619
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 717 transition count 1619
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 98 place count 702 transition count 1604
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 702 transition count 1584
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 138 place count 682 transition count 1584
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 682 transition count 1576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 674 transition count 1576
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 674 transition count 1576
Applied a total of 155 rules in 198 ms. Remains 674 /751 variables (removed 77) and now considering 1576/1653 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2509560030809134415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12397649748579832347.kers'
[2026-05-22 20:45:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2509560030809134415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12397649748579832347.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1576 rows 674 cols 6601 entries
Finished phase 1 with 236 SingleSign rule and 353 generalized
[2026-05-22 20:45:17] [INFO ] Computed 85 invariants in 12 ms
Computed 85 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12397649748579832347.kers
Total runtime 13 ms.
[2026-05-22 20:45:18] [INFO ] Implicit Places using invariants in 646 ms returned [88, 89, 159, 160, 230, 231, 325, 326, 397, 398, 465, 474, 475, 545, 546]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 650 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 659/789 places, 1576/1653 transitions.
Applied a total of 0 rules in 50 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1606 ms. Remains : 659/789 places, 1576/1653 transitions.
RANDOM walk for 40000 steps (632 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 202265 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 202265 steps, saw 104353 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13468507569026591520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16128338647568534018.kers'
[2026-05-22 20:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13468507569026591520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16128338647568534018.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1576 rows 659 cols 6410 entries
Finished phase 1 with 236 SingleSign rule and 353 generalized
[2026-05-22 20:45:21] [INFO ] Computed 70 invariants in 14 ms
Computed 70 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-16128338647568534018.kers
Total runtime 16 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/193 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 134/327 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 110/437 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 68/505 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/511 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 147/658 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/658 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/658 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/659 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1576/2235 variables, 659/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2235 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2235 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2235/2235 variables, and 731 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3511 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/193 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 134/327 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 110/437 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 68/505 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/511 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 147/658 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/658 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/658 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/659 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1576/2235 variables, 659/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2235 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2235 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2235 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2235/2235 variables, and 734 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5556ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 467 ms.
Support contains 5 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1576/1576 transitions.
Applied a total of 0 rules in 26 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 659/659 places, 1576/1576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1576/1576 transitions.
Applied a total of 0 rules in 25 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
[2026-05-22 20:45:27] [INFO ] Invariant cache hit.
[2026-05-22 20:45:28] [INFO ] Implicit Places using invariants in 546 ms returned []
[2026-05-22 20:45:28] [INFO ] Invariant cache hit.
[2026-05-22 20:45:29] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2026-05-22 20:45:29] [INFO ] Redundant transitions in 142 ms returned []
Running 1538 sub problems to find dead transitions.
[2026-05-22 20:45:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/2235 variables, and 68 constraints, problems are : Problem set: 0 solved, 1538 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 34/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/659 constraints, PredecessorRefiner: 1538/1538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/2235 variables, and 68 constraints, problems are : Problem set: 0 solved, 1538 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 34/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/659 constraints, PredecessorRefiner: 0/1538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 1538 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62903 ms. Remains : 659/659 places, 1576/1576 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 25 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 20:46:30] [INFO ] Invariant cache hit.
[2026-05-22 20:46:30] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2026-05-22 20:46:30] [INFO ] [Real]Absence check using 36 positive and 34 generalized place invariants in 9 ms returned sat
[2026-05-22 20:46:31] [INFO ] After 901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 20:46:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2026-05-22 20:46:31] [INFO ] [Nat]Absence check using 36 positive and 34 generalized place invariants in 9 ms returned sat
[2026-05-22 20:46:32] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 20:46:32] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 20:46:32] [INFO ] After 1315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2271 ms.
Knowledge based reduction with 11 factoid took 86 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 95753 ms.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2392/2392 transitions.
Applied a total of 0 rules in 66 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5709514158875612121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1177200827718497507.kers'
[2026-05-22 20:46:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5709514158875612121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1177200827718497507.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2392 rows 1604 cols 8310 entries
Finished phase 1 with 1061 SingleSign rule and 325 generalized
[2026-05-22 20:46:33] [INFO ] Computed 218 invariants in 29 ms
Computed 218 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-1177200827718497507.kers
Total runtime 31 ms.
[2026-05-22 20:46:34] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2026-05-22 20:46:34] [INFO ] Invariant cache hit.
[2026-05-22 20:46:38] [INFO ] Implicit Places using invariants and state equation in 4315 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
Running 2391 sub problems to find dead transitions.
[2026-05-22 20:46:38] [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/1603 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 2391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1603/3996 variables, and 171 constraints, problems are : Problem set: 0 solved, 2391 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 171/181 constraints, State Equation: 0/1604 constraints, PredecessorRefiner: 2391/2391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1603 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 2391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1603/3996 variables, and 171 constraints, problems are : Problem set: 0 solved, 2391 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 171/181 constraints, State Equation: 0/1604 constraints, PredecessorRefiner: 0/2391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61099ms problems are : Problem set: 0 solved, 2391 unsolved
Search for dead transitions found 0 dead transitions in 61124ms
Finished structural reductions in LTL mode , in 1 iterations and 66778 ms. Remains : 1604/1604 places, 2392/2392 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 11 factoid took 61 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (186 resets) in 409 ms. (97 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
[2026-05-22 20:47:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 535/715 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 889/1604 variables, 176/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3996 variables, 1604/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3996 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3996 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3996/3996 variables, and 1822 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2614 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 1604/1604 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 68/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 535/715 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 889/1604 variables, 176/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1604 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3996 variables, 1604/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3996 variables, 3/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3996 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3996 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3996/3996 variables, and 1825 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 1604/1604 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5455ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1158 ms.
Support contains 5 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2392/2392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1604 transition count 2078
Reduce places removed 314 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 315 rules applied. Total rules applied 629 place count 1290 transition count 2077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 630 place count 1289 transition count 2077
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 630 place count 1289 transition count 1867
Deduced a syphon composed of 210 places in 3 ms
Ensure Unique test removed 66 places
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1116 place count 1013 transition count 1867
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 1137 place count 1001 transition count 1858
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1146 place count 992 transition count 1858
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 1146 place count 992 transition count 1831
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1200 place count 965 transition count 1831
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1205 place count 960 transition count 1826
Iterating global reduction 5 with 5 rules applied. Total rules applied 1210 place count 960 transition count 1826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1214 place count 960 transition count 1822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1215 place count 959 transition count 1822
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1215 place count 959 transition count 1821
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1217 place count 958 transition count 1821
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 7 with 174 rules applied. Total rules applied 1391 place count 871 transition count 1734
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1399 place count 871 transition count 1726
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1407 place count 863 transition count 1726
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1439 place count 863 transition count 1694
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 1472 place count 830 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1480 place count 830 transition count 1686
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 1505 place count 830 transition count 1686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1506 place count 829 transition count 1685
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1514 place count 821 transition count 1685
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1514 place count 821 transition count 1669
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1554 place count 797 transition count 1669
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1562 place count 789 transition count 1661
Iterating global reduction 10 with 8 rules applied. Total rules applied 1570 place count 789 transition count 1661
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1578 place count 789 transition count 1653
Applied a total of 1578 rules in 342 ms. Remains 789 /1604 variables (removed 815) and now considering 1653/2392 (removed 739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 789/1604 places, 1653/2392 transitions.
RANDOM walk for 40000 steps (575 resets) in 385 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (67 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (71 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 292107 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 292107 steps, saw 83333 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-422035582635874468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-728900153690884542.kers'
[2026-05-22 20:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-422035582635874468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-728900153690884542.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 1653 rows 782 cols 6754 entries
Finished phase 1 with 299 SingleSign rule and 367 generalized
[2026-05-22 20:47:50] [INFO ] Computed 123 invariants in 13 ms
Computed 123 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-728900153690884542.kers
Total runtime 17 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/148 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 71/219 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/267 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 114/381 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 61/442 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/473 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 124/597 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 85/682 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/682 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 15/697 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/697 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 74/771 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/771 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/781 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/781 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 8/789 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/789 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1653/2442 variables, 789/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2442 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2442 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2442/2442 variables, and 912 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3515 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/148 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 71/219 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 48/267 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 114/381 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 61/442 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/473 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 124/597 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 85/682 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/682 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 15/697 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/697 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 74/771 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/771 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/781 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/781 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 8/789 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/789 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1653/2442 variables, 789/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2442 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2442 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/2442 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2442/2442 variables, and 915 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5863ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 5 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1653/1653 transitions.
Applied a total of 0 rules in 25 ms. Remains 789 /789 variables (removed 0) and now considering 1653/1653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 789/789 places, 1653/1653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1653/1653 transitions.
Applied a total of 0 rules in 27 ms. Remains 789 /789 variables (removed 0) and now considering 1653/1653 (removed 0) transitions.
[2026-05-22 20:47:56] [INFO ] Invariant cache hit.
[2026-05-22 20:47:57] [INFO ] Implicit Places using invariants in 700 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 369, 374, 379, 380, 433, 450, 456, 459, 461, 462, 467, 468, 520, 537, 543, 546, 551, 552, 557, 558, 610, 627, 633, 636, 638, 639, 644, 645, 697, 714, 720, 723, 725, 726]
[2026-05-22 20:47:57] [INFO ] Actually due to overlaps returned [187, 274, 374, 462, 552, 639, 726, 88, 94, 99, 175, 181, 186, 262, 268, 273, 450, 456, 461, 537, 543, 551, 627, 633, 638, 714, 720, 725, 71, 100, 158, 245, 332, 369, 433, 520, 610, 697]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 718 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 751/789 places, 1653/1653 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 724 transition count 1626
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 724 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 717 transition count 1619
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 717 transition count 1619
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 98 place count 702 transition count 1604
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 702 transition count 1584
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 138 place count 682 transition count 1584
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 146 place count 682 transition count 1576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 674 transition count 1576
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 674 transition count 1576
Applied a total of 155 rules in 157 ms. Remains 674 /751 variables (removed 77) and now considering 1576/1653 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13585278174799408307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5440612360805241090.kers'
[2026-05-22 20:47:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13585278174799408307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5440612360805241090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1576 rows 674 cols 6601 entries
Finished phase 1 with 236 SingleSign rule and 353 generalized
[2026-05-22 20:47:57] [INFO ] Computed 85 invariants in 11 ms
Computed 85 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-5440612360805241090.kers
Total runtime 14 ms.
[2026-05-22 20:47:58] [INFO ] Implicit Places using invariants in 689 ms returned [88, 89, 159, 160, 230, 231, 325, 326, 397, 398, 465, 474, 475, 545, 546]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 693 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 659/789 places, 1576/1653 transitions.
Applied a total of 0 rules in 22 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1629 ms. Remains : 659/789 places, 1576/1653 transitions.
RANDOM walk for 40000 steps (644 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (88 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (83 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (90 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 187939 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 187939 steps, saw 95161 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5024240669529441520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3573524285721067305.kers'
[2026-05-22 20:48:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5024240669529441520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3573524285721067305.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1576 rows 659 cols 6410 entries
Finished phase 1 with 236 SingleSign rule and 353 generalized
[2026-05-22 20:48:01] [INFO ] Computed 70 invariants in 33 ms
Computed 70 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-3573524285721067305.kers
Total runtime 37 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/193 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 134/327 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 110/437 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 68/505 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/511 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 147/658 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/658 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/658 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/659 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1576/2235 variables, 659/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2235 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2235 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2235/2235 variables, and 731 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2978 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/193 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 134/327 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 110/437 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 68/505 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/511 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 147/658 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/658 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/658 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/659 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1576/2235 variables, 659/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2235 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2235 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2235 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2235/2235 variables, and 734 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4793ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 373 ms.
Support contains 5 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1576/1576 transitions.
Applied a total of 0 rules in 22 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 659/659 places, 1576/1576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1576/1576 transitions.
Applied a total of 0 rules in 22 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
[2026-05-22 20:48:06] [INFO ] Invariant cache hit.
[2026-05-22 20:48:07] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-22 20:48:07] [INFO ] Invariant cache hit.
[2026-05-22 20:48:08] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
[2026-05-22 20:48:08] [INFO ] Redundant transitions in 35 ms returned []
Running 1538 sub problems to find dead transitions.
[2026-05-22 20:48:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/2235 variables, and 68 constraints, problems are : Problem set: 0 solved, 1538 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 34/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/659 constraints, PredecessorRefiner: 1538/1538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/2235 variables, and 68 constraints, problems are : Problem set: 0 solved, 1538 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 34/36 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/659 constraints, PredecessorRefiner: 0/1538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60685ms problems are : Problem set: 0 solved, 1538 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62550 ms. Remains : 659/659 places, 1576/1576 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 659 /659 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 20:49:09] [INFO ] Invariant cache hit.
[2026-05-22 20:49:09] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2026-05-22 20:49:09] [INFO ] [Real]Absence check using 36 positive and 34 generalized place invariants in 34 ms returned sat
[2026-05-22 20:49:10] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 20:49:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2026-05-22 20:49:10] [INFO ] [Nat]Absence check using 36 positive and 34 generalized place invariants in 11 ms returned sat
[2026-05-22 20:49:11] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 20:49:11] [INFO ] After 1128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 20:49:11] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2465 ms.
Knowledge based reduction with 11 factoid took 84 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 92040 ms.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 479 reset in 386 ms.
Product exploration explored 100000 steps with 479 reset in 359 ms.
Spot run failed in 79 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/ltsmin16830111771990513390
[2026-05-22 20:49:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16830111771990513390
Running compilation step : cd /tmp/ltsmin16830111771990513390;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16830111771990513390;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16830111771990513390;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2392/2392 transitions.
Applied a total of 0 rules in 90 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17806801079181589694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6877490353555491814.kers'
[2026-05-22 20:49:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17806801079181589694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6877490353555491814.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1604 cols 8310 entries
Finished phase 1 with 1061 SingleSign rule and 325 generalized
[2026-05-22 20:49:16] [INFO ] Computed 218 invariants in 48 ms
Computed 218 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-6877490353555491814.kers
Total runtime 51 ms.
[2026-05-22 20:49:17] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2026-05-22 20:49:17] [INFO ] Invariant cache hit.
[2026-05-22 20:49:22] [INFO ] Implicit Places using invariants and state equation in 4530 ms returned []
Implicit Place search using SMT with State Equation took 5880 ms to find 0 implicit places.
Running 2391 sub problems to find dead transitions.
[2026-05-22 20:49:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1603 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 2391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1603/3996 variables, and 171 constraints, problems are : Problem set: 0 solved, 2391 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 171/181 constraints, State Equation: 0/1604 constraints, PredecessorRefiner: 2391/2391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1603 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 2391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1603/3996 variables, and 171 constraints, problems are : Problem set: 0 solved, 2391 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 171/181 constraints, State Equation: 0/1604 constraints, PredecessorRefiner: 0/2391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61080ms problems are : Problem set: 0 solved, 2391 unsolved
Search for dead transitions found 0 dead transitions in 61089ms
Finished structural reductions in LTL mode , in 1 iterations and 67070 ms. Remains : 1604/1604 places, 2392/2392 transitions.
Built C files in :
/tmp/ltsmin2540043709933688315
[2026-05-22 20:50:23] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2540043709933688315
Running compilation step : cd /tmp/ltsmin2540043709933688315;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2540043709933688315;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2540043709933688315;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:50:26] [INFO ] Flatten gal took : 68 ms
[2026-05-22 20:50:27] [INFO ] Flatten gal took : 59 ms
[2026-05-22 20:50:27] [INFO ] Time to serialize gal into /tmp/LTL14909843594276830307.gal : 25 ms
[2026-05-22 20:50:27] [INFO ] Time to serialize properties into /tmp/LTL1504014814341997703.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/LTL14909843594276830307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8126334508144088110.hoa' '-atoms' '/tmp/LTL1504014814341997703.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1504014814341997703.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8126334508144088110.hoa
Detected timeout of ITS tools.
[2026-05-22 20:50:42] [INFO ] Flatten gal took : 56 ms
[2026-05-22 20:50:42] [INFO ] Flatten gal took : 54 ms
[2026-05-22 20:50:42] [INFO ] Time to serialize gal into /tmp/LTL12138954620420101698.gal : 17 ms
[2026-05-22 20:50:42] [INFO ] Time to serialize properties into /tmp/LTL6728775205712407198.ltl : 9 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/LTL12138954620420101698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6728775205712407198.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(((p697==0)||(p700==0))||((p703==0)||(p812==0)))")||(X(F((G(F("(((p697!=1)||(p700!=1))||((p703!=1)||(p812!=1)))")))||((X(X(F("(...233
Formula 0 simplified : F(!"(((p697==0)||(p700==0))||((p703==0)||(p812==0)))" & XG(FG!"(((p697!=1)||(p700!=1))||((p703!=1)||(p812!=1)))" & (XXG!"(((p697!=1)...213
Detected timeout of ITS tools.
[2026-05-22 20:50:57] [INFO ] Flatten gal took : 45 ms
[2026-05-22 20:50:57] [INFO ] Applying decomposition
[2026-05-22 20:50:57] [INFO ] Flatten gal took : 48 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/graph4638187176594457393.txt' '-o' '/tmp/graph4638187176594457393.bin' '-w' '/tmp/graph4638187176594457393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4638187176594457393.bin' '-l' '-1' '-v' '-w' '/tmp/graph4638187176594457393.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:50:57] [INFO ] Decomposing Gal with order
[2026-05-22 20:50:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:50:58] [INFO ] Removed a total of 3189 redundant transitions.
[2026-05-22 20:50:58] [INFO ] Flatten gal took : 346 ms
[2026-05-22 20:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 53 ms.
[2026-05-22 20:50:58] [INFO ] Time to serialize gal into /tmp/LTL1888752762688585547.gal : 39 ms
[2026-05-22 20:50:58] [INFO ] Time to serialize properties into /tmp/LTL12692714937325146815.ltl : 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/LTL1888752762688585547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12692714937325146815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(((i6.u192.p697==0)||(i6.u193.p700==0))||((i6.u194.p703==0)||(i6.u185.p812==0)))")||(X(F((G(F("(((i6.u192.p697!=1)||(i6.u193.p7...338
Formula 0 simplified : F(!"(((i6.u192.p697==0)||(i6.u193.p700==0))||((i6.u194.p703==0)||(i6.u185.p812==0)))" & XG(FG!"(((i6.u192.p697!=1)||(i6.u193.p700!=1...318
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLFireability-03 finished in 379771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1)))&&!(p0 U p2)))'
Support contains 6 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1628 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1628 transition count 2526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1627 transition count 2518
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1627 transition count 2518
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2510
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2502
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2494
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2486
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2478
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2478
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2462
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2454
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2446
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2438
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2430
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2422
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2414
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2406
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2398
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2398
Applied a total of 34 rules in 1103 ms. Remains 1612 /1629 variables (removed 17) and now considering 2398/2535 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18354625992468117188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6309539490378829432.kers'
[2026-05-22 20:51:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18354625992468117188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6309539490378829432.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2398 rows 1612 cols 8400 entries
Finished phase 1 with 1006 SingleSign rule and 381 generalized
[2026-05-22 20:51:14] [INFO ] Computed 225 invariants in 29 ms
Computed 225 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-6309539490378829432.kers
Total runtime 41 ms.
[2026-05-22 20:51:16] [INFO ] Implicit Places using invariants in 1262 ms returned [409, 591, 756, 1115, 1284, 1338]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1277 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1606/1629 places, 2398/2535 transitions.
Applied a total of 0 rules in 72 ms. Remains 1606 /1606 variables (removed 0) and now considering 2398/2398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2468 ms. Remains : 1606/1629 places, 2398/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1)))&&!(p0 U p2)))'
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1) p2), true, p2, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-06
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-06 finished in 2832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 1048 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9959926751303918761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11907492060350840028.kers'
[2026-05-22 20:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9959926751303918761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11907492060350840028.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1611 cols 8376 entries
Finished phase 1 with 1004 SingleSign rule and 382 generalized
[2026-05-22 20:51:17] [INFO ] Computed 225 invariants in 56 ms
Computed 225 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-11907492060350840028.kers
Total runtime 64 ms.
[2026-05-22 20:51:18] [INFO ] Implicit Places using invariants in 1274 ms returned [372, 409, 591, 756, 1115, 1120, 1283, 1337]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1284 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 54 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2386 ms. Remains : 1603/1629 places, 2392/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-08 finished in 2514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 1629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1628 transition count 2251
Reduce places removed 292 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 299 rules applied. Total rules applied 582 place count 1336 transition count 2244
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 590 place count 1329 transition count 2243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 1328 transition count 2243
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 229 Pre rules applied. Total rules applied 591 place count 1328 transition count 2014
Deduced a syphon composed of 229 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 527 rules applied. Total rules applied 1118 place count 1030 transition count 2014
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 31 rules applied. Total rules applied 1149 place count 1014 transition count 1999
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1164 place count 999 transition count 1999
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1164 place count 999 transition count 1970
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1222 place count 970 transition count 1970
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1233 place count 959 transition count 1946
Iterating global reduction 6 with 11 rules applied. Total rules applied 1244 place count 959 transition count 1946
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 25 rules applied. Total rules applied 1269 place count 954 transition count 1926
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1282 place count 941 transition count 1926
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1282 place count 941 transition count 1925
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1284 place count 940 transition count 1925
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1288 place count 936 transition count 1914
Iterating global reduction 8 with 4 rules applied. Total rules applied 1292 place count 936 transition count 1914
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1295 place count 936 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1296 place count 935 transition count 1903
Iterating global reduction 9 with 1 rules applied. Total rules applied 1297 place count 935 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1298 place count 934 transition count 1895
Iterating global reduction 9 with 1 rules applied. Total rules applied 1299 place count 934 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1300 place count 933 transition count 1887
Iterating global reduction 9 with 1 rules applied. Total rules applied 1301 place count 933 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1302 place count 932 transition count 1879
Iterating global reduction 9 with 1 rules applied. Total rules applied 1303 place count 932 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1304 place count 931 transition count 1871
Iterating global reduction 9 with 1 rules applied. Total rules applied 1305 place count 931 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1306 place count 930 transition count 1863
Iterating global reduction 9 with 1 rules applied. Total rules applied 1307 place count 930 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1308 place count 929 transition count 1855
Iterating global reduction 9 with 1 rules applied. Total rules applied 1309 place count 929 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1310 place count 928 transition count 1847
Iterating global reduction 9 with 1 rules applied. Total rules applied 1311 place count 928 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1312 place count 927 transition count 1839
Iterating global reduction 9 with 1 rules applied. Total rules applied 1313 place count 927 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1314 place count 926 transition count 1831
Iterating global reduction 9 with 1 rules applied. Total rules applied 1315 place count 926 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1316 place count 925 transition count 1823
Iterating global reduction 9 with 1 rules applied. Total rules applied 1317 place count 925 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1318 place count 924 transition count 1815
Iterating global reduction 9 with 1 rules applied. Total rules applied 1319 place count 924 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1320 place count 923 transition count 1807
Iterating global reduction 9 with 1 rules applied. Total rules applied 1321 place count 923 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1322 place count 922 transition count 1799
Iterating global reduction 9 with 1 rules applied. Total rules applied 1323 place count 922 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1324 place count 921 transition count 1791
Iterating global reduction 9 with 1 rules applied. Total rules applied 1325 place count 921 transition count 1791
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 9 with 170 rules applied. Total rules applied 1495 place count 836 transition count 1706
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1497 place count 834 transition count 1704
Iterating global reduction 9 with 2 rules applied. Total rules applied 1499 place count 834 transition count 1704
Applied a total of 1499 rules in 586 ms. Remains 834 /1629 variables (removed 795) and now considering 1704/2535 (removed 831) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3637883127041389285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14620232679765480330.kers'
[2026-05-22 20:51:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3637883127041389285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14620232679765480330.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 9 ms.
// Phase 1: matrix 1704 rows 831 cols 6852 entries
Finished phase 1 with 316 SingleSign rule and 392 generalized
[2026-05-22 20:51:19] [INFO ] Computed 126 invariants in 43 ms
Computed 126 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-14620232679765480330.kers
Total runtime 45 ms.
[2026-05-22 20:51:20] [INFO ] Implicit Places using invariants in 698 ms returned [72, 89, 95, 100, 162, 179, 185, 191, 193, 194, 220, 255, 276, 284, 290, 292, 318, 353, 394, 403, 455, 472, 478, 483, 485, 545, 562, 568, 573, 575, 587, 640, 661, 667, 672, 674, 675, 718, 736, 754, 760, 765, 768, 831]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 701 ms to find 44 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 790/1629 places, 1704/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 790 transition count 1688
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 774 transition count 1687
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 33 place count 774 transition count 1683
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 770 transition count 1683
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 55 place count 756 transition count 1669
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 756 transition count 1669
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 83 place count 742 transition count 1655
Iterating global reduction 2 with 14 rules applied. Total rules applied 97 place count 742 transition count 1655
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 735 transition count 1648
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 735 transition count 1648
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 165 place count 708 transition count 1621
Applied a total of 165 rules in 117 ms. Remains 708 /790 variables (removed 82) and now considering 1621/1704 (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-17474597579740431822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-214476233456269419.kers'
[2026-05-22 20:51:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17474597579740431822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-214476233456269419.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1621 rows 708 cols 6531 entries
Finished phase 1 with 328 SingleSign rule and 298 generalized
[2026-05-22 20:51:20] [INFO ] Computed 82 invariants in 15 ms
Computed 82 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-214476233456269419.kers
Total runtime 17 ms.
[2026-05-22 20:51:20] [INFO ] Implicit Places using invariants in 545 ms returned [320, 326, 331]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 556 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 705/1629 places, 1621/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 703 transition count 1619
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 703 transition count 1619
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 701 transition count 1617
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 701 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 700 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 700 transition count 1616
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 0 with 2 rules applied. Total rules applied 12 place count 699 transition count 1615
Applied a total of 12 rules in 108 ms. Remains 699 /705 variables (removed 6) and now considering 1615/1621 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8254666009672187313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1211452522885647299.kers'
[2026-05-22 20:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8254666009672187313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1211452522885647299.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1615 rows 699 cols 6509 entries
Finished phase 1 with 326 SingleSign rule and 294 generalized
[2026-05-22 20:51:21] [INFO ] Computed 79 invariants in 12 ms
Computed 79 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-1211452522885647299.kers
Total runtime 29 ms.
[2026-05-22 20:51:21] [INFO ] Implicit Places using invariants in 580 ms returned []
[2026-05-22 20:51:21] [INFO ] Invariant cache hit.
[2026-05-22 20:51:23] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 699/1629 places, 1615/2535 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4240 ms. Remains : 699/1629 places, 1615/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-09
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-09 finished in 4307 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 1629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1628 transition count 2251
Reduce places removed 292 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 299 rules applied. Total rules applied 582 place count 1336 transition count 2244
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 589 place count 1329 transition count 2244
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 589 place count 1329 transition count 2016
Deduced a syphon composed of 228 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 525 rules applied. Total rules applied 1114 place count 1032 transition count 2016
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 31 rules applied. Total rules applied 1145 place count 1016 transition count 2001
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1160 place count 1001 transition count 2001
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1160 place count 1001 transition count 1972
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1218 place count 972 transition count 1972
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1229 place count 961 transition count 1948
Iterating global reduction 5 with 11 rules applied. Total rules applied 1240 place count 961 transition count 1948
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 25 rules applied. Total rules applied 1265 place count 956 transition count 1928
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1278 place count 943 transition count 1928
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1278 place count 943 transition count 1927
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1280 place count 942 transition count 1927
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1284 place count 938 transition count 1916
Iterating global reduction 7 with 4 rules applied. Total rules applied 1288 place count 938 transition count 1916
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1291 place count 938 transition count 1913
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1292 place count 937 transition count 1905
Iterating global reduction 8 with 1 rules applied. Total rules applied 1293 place count 937 transition count 1905
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1294 place count 936 transition count 1897
Iterating global reduction 8 with 1 rules applied. Total rules applied 1295 place count 936 transition count 1897
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1296 place count 935 transition count 1889
Iterating global reduction 8 with 1 rules applied. Total rules applied 1297 place count 935 transition count 1889
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1298 place count 934 transition count 1881
Iterating global reduction 8 with 1 rules applied. Total rules applied 1299 place count 934 transition count 1881
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1300 place count 933 transition count 1873
Iterating global reduction 8 with 1 rules applied. Total rules applied 1301 place count 933 transition count 1873
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1302 place count 932 transition count 1865
Iterating global reduction 8 with 1 rules applied. Total rules applied 1303 place count 932 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1304 place count 931 transition count 1857
Iterating global reduction 8 with 1 rules applied. Total rules applied 1305 place count 931 transition count 1857
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1306 place count 930 transition count 1849
Iterating global reduction 8 with 1 rules applied. Total rules applied 1307 place count 930 transition count 1849
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1308 place count 929 transition count 1841
Iterating global reduction 8 with 1 rules applied. Total rules applied 1309 place count 929 transition count 1841
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1310 place count 928 transition count 1833
Iterating global reduction 8 with 1 rules applied. Total rules applied 1311 place count 928 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1312 place count 927 transition count 1825
Iterating global reduction 8 with 1 rules applied. Total rules applied 1313 place count 927 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1314 place count 926 transition count 1817
Iterating global reduction 8 with 1 rules applied. Total rules applied 1315 place count 926 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1316 place count 925 transition count 1809
Iterating global reduction 8 with 1 rules applied. Total rules applied 1317 place count 925 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1318 place count 924 transition count 1801
Iterating global reduction 8 with 1 rules applied. Total rules applied 1319 place count 924 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1320 place count 923 transition count 1793
Iterating global reduction 8 with 1 rules applied. Total rules applied 1321 place count 923 transition count 1793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 8 with 170 rules applied. Total rules applied 1491 place count 838 transition count 1708
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1493 place count 836 transition count 1706
Iterating global reduction 8 with 2 rules applied. Total rules applied 1495 place count 836 transition count 1706
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1496 place count 836 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1497 place count 835 transition count 1705
Iterating global reduction 8 with 1 rules applied. Total rules applied 1498 place count 835 transition count 1705
Applied a total of 1498 rules in 711 ms. Remains 835 /1629 variables (removed 794) and now considering 1705/2535 (removed 830) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14777727806084496702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6597647989085959672.kers'
[2026-05-22 20:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14777727806084496702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6597647989085959672.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1705 rows 832 cols 6856 entries
Finished phase 1 with 313 SingleSign rule and 396 generalized
[2026-05-22 20:51:24] [INFO ] Computed 126 invariants in 12 ms
Computed 126 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-6597647989085959672.kers
Total runtime 18 ms.
[2026-05-22 20:51:24] [INFO ] Implicit Places using invariants in 734 ms returned [72, 89, 95, 100, 162, 179, 185, 190, 192, 193, 219, 254, 275, 283, 289, 291, 317, 352, 393, 402, 454, 471, 477, 482, 484, 544, 561, 567, 572, 574, 586, 639, 662, 668, 673, 675, 676, 719, 737, 755, 761, 766, 769, 832]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 738 ms to find 44 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 791/1629 places, 1705/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 791 transition count 1689
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 775 transition count 1687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 774 transition count 1687
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 774 transition count 1683
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 43 place count 770 transition count 1683
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 56 place count 757 transition count 1670
Iterating global reduction 3 with 13 rules applied. Total rules applied 69 place count 757 transition count 1670
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 82 place count 744 transition count 1657
Iterating global reduction 3 with 13 rules applied. Total rules applied 95 place count 744 transition count 1657
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 738 transition count 1651
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 738 transition count 1651
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 161 place count 711 transition count 1624
Applied a total of 161 rules in 113 ms. Remains 711 /791 variables (removed 80) and now considering 1624/1705 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7407948411761026520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11488543490279100570.kers'
[2026-05-22 20:51:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7407948411761026520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11488543490279100570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1624 rows 711 cols 6542 entries
Finished phase 1 with 327 SingleSign rule and 302 generalized
[2026-05-22 20:51:24] [INFO ] Computed 82 invariants in 11 ms
Computed 82 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11488543490279100570.kers
Total runtime 14 ms.
[2026-05-22 20:51:25] [INFO ] Implicit Places using invariants in 525 ms returned [319, 325, 330]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 534 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 708/1629 places, 1624/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 706 transition count 1622
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 706 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 704 transition count 1620
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 704 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 703 transition count 1619
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 703 transition count 1619
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 0 with 2 rules applied. Total rules applied 12 place count 702 transition count 1618
Applied a total of 12 rules in 119 ms. Remains 702 /708 variables (removed 6) and now considering 1618/1624 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9405042580284522867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2821636587551833535.kers'
[2026-05-22 20:51:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9405042580284522867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2821636587551833535.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1618 rows 702 cols 6520 entries
Finished phase 1 with 325 SingleSign rule and 298 generalized
[2026-05-22 20:51:25] [INFO ] Computed 79 invariants in 32 ms
Computed 79 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-2821636587551833535.kers
Total runtime 49 ms.
[2026-05-22 20:51:26] [INFO ] Implicit Places using invariants in 762 ms returned []
[2026-05-22 20:51:26] [INFO ] Invariant cache hit.
[2026-05-22 20:51:28] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 702/1629 places, 1618/2535 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5001 ms. Remains : 702/1629 places, 1618/2535 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 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 1333 reset in 266 ms.
Product exploration explored 100000 steps with 1279 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 91 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 5938 steps (78 resets) in 50 ms. (116 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 375 ms.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 36 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2026-05-22 20:51:29] [INFO ] Invariant cache hit.
[2026-05-22 20:51:30] [INFO ] Implicit Places using invariants in 875 ms returned []
[2026-05-22 20:51:30] [INFO ] Invariant cache hit.
[2026-05-22 20:51:32] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2026-05-22 20:51:32] [INFO ] Redundant transitions in 76 ms returned []
Running 1572 sub problems to find dead transitions.
[2026-05-22 20:51:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2320 variables, and 77 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2320 variables, and 77 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63332 ms. Remains : 702/702 places, 1618/1618 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 106 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 2835 steps (36 resets) in 22 ms. (123 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 333 ms.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1303 reset in 311 ms.
Product exploration explored 100000 steps with 1336 reset in 332 ms.
Built C files in :
/tmp/ltsmin5886043804872353682
[2026-05-22 20:52:34] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:52:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5886043804872353682
Running compilation step : cd /tmp/ltsmin5886043804872353682;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5886043804872353682;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5886043804872353682;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2026-05-22 20:52:37] [INFO ] Invariant cache hit.
[2026-05-22 20:52:37] [INFO ] Implicit Places using invariants in 683 ms returned []
[2026-05-22 20:52:37] [INFO ] Invariant cache hit.
[2026-05-22 20:52:39] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2026-05-22 20:52:39] [INFO ] Redundant transitions in 64 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2541 ms. Remains : 702/702 places, 1618/1618 transitions.
Built C files in :
/tmp/ltsmin7905845069228675091
[2026-05-22 20:52:39] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:52:39] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7905845069228675091
Running compilation step : cd /tmp/ltsmin7905845069228675091;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7905845069228675091;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7905845069228675091;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:52:42] [INFO ] Flatten gal took : 41 ms
[2026-05-22 20:52:42] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:52:42] [INFO ] Time to serialize gal into /tmp/LTL16856770221586566649.gal : 8 ms
[2026-05-22 20:52:42] [INFO ] Time to serialize properties into /tmp/LTL589506012191158318.prop : 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/LTL16856770221586566649.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2937777969426041585.hoa' '-atoms' '/tmp/LTL589506012191158318.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/LTL589506012191158318.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2937777969426041585.hoa
Detected timeout of ITS tools.
[2026-05-22 20:52:58] [INFO ] Flatten gal took : 34 ms
[2026-05-22 20:52:58] [INFO ] Flatten gal took : 34 ms
[2026-05-22 20:52:58] [INFO ] Time to serialize gal into /tmp/LTL2233932814448330730.gal : 7 ms
[2026-05-22 20:52:58] [INFO ] Time to serialize properties into /tmp/LTL16439105378344898334.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/LTL2233932814448330730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16439105378344898334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1292!=1)"))))
Formula 0 simplified : FG!"(p1292!=1)"
Detected timeout of ITS tools.
[2026-05-22 20:53:13] [INFO ] Flatten gal took : 53 ms
[2026-05-22 20:53:13] [INFO ] Applying decomposition
[2026-05-22 20:53:13] [INFO ] Flatten gal took : 41 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/graph2559124121631765071.txt' '-o' '/tmp/graph2559124121631765071.bin' '-w' '/tmp/graph2559124121631765071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2559124121631765071.bin' '-l' '-1' '-v' '-w' '/tmp/graph2559124121631765071.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:53:13] [INFO ] Decomposing Gal with order
[2026-05-22 20:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:53:13] [INFO ] Removed a total of 3222 redundant transitions.
[2026-05-22 20:53:13] [INFO ] Flatten gal took : 80 ms
[2026-05-22 20:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 34 ms.
[2026-05-22 20:53:13] [INFO ] Time to serialize gal into /tmp/LTL16488946115877052615.gal : 12 ms
[2026-05-22 20:53:13] [INFO ] Time to serialize properties into /tmp/LTL14206437276206525880.ltl : 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/LTL16488946115877052615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14206437276206525880.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i14.u136.p1292!=1)"))))
Formula 0 simplified : FG!"(i14.u136.p1292!=1)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLFireability-13 finished in 125497 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((X(F(p0)) U (X(X(X(!p1))) U p1)))))'
Support contains 3 out of 1629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1627 transition count 2520
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1627 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1626 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1626 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1625 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1625 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1624 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1624 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1623 transition count 2488
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1623 transition count 2488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1622 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1622 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1621 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1621 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1620 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1620 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1619 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1619 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1618 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1618 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1617 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1617 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1616 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1616 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1615 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1615 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1614 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1614 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1613 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1613 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1612 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1612 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1611 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1611 transition count 2392
Applied a total of 36 rules in 1025 ms. Remains 1611 /1629 variables (removed 18) and now considering 2392/2535 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10506107484214011228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2585900083366395842.kers'
[2026-05-22 20:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10506107484214011228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2585900083366395842.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1611 cols 8376 entries
Finished phase 1 with 1004 SingleSign rule and 382 generalized
[2026-05-22 20:53:29] [INFO ] Computed 225 invariants in 27 ms
Computed 225 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-2585900083366395842.kers
Total runtime 42 ms.
[2026-05-22 20:53:31] [INFO ] Implicit Places using invariants in 1178 ms returned [372, 409, 591, 756, 1115, 1120, 1337]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1183 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1629 places, 2392/2535 transitions.
Applied a total of 0 rules in 87 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2295 ms. Remains : 1604/1629 places, 2392/2535 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((X(F(p0)) U (X(X(X(!p1))) U p1)))))'
Stuttering acceptance computed with spot in 430 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), false, false, false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-14
Stuttering criterion allowed to conclude after 240 steps with 26 reset in 4 ms.
FORMULA ASLink-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-14 finished in 2837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1629/1629 places, 2535/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1629 transition count 2253
Reduce places removed 282 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 283 rules applied. Total rules applied 565 place count 1347 transition count 2252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 566 place count 1346 transition count 2252
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 211 Pre rules applied. Total rules applied 566 place count 1346 transition count 2041
Deduced a syphon composed of 211 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 491 rules applied. Total rules applied 1057 place count 1066 transition count 2041
Discarding 6 places :
Implicit places reduction removed 6 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 3 with 7 rules applied. Total rules applied 1064 place count 1060 transition count 2040
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1065 place count 1059 transition count 2040
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1065 place count 1059 transition count 2012
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1121 place count 1031 transition count 2012
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1125 place count 1027 transition count 1995
Iterating global reduction 5 with 4 rules applied. Total rules applied 1129 place count 1027 transition count 1995
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 18 rules applied. Total rules applied 1147 place count 1022 transition count 1982
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1160 place count 1009 transition count 1982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1160 place count 1009 transition count 1981
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 1008 transition count 1981
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1166 place count 1004 transition count 1970
Iterating global reduction 7 with 4 rules applied. Total rules applied 1170 place count 1004 transition count 1970
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1173 place count 1004 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1174 place count 1003 transition count 1959
Iterating global reduction 8 with 1 rules applied. Total rules applied 1175 place count 1003 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1176 place count 1002 transition count 1951
Iterating global reduction 8 with 1 rules applied. Total rules applied 1177 place count 1002 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1178 place count 1001 transition count 1943
Iterating global reduction 8 with 1 rules applied. Total rules applied 1179 place count 1001 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1180 place count 1000 transition count 1935
Iterating global reduction 8 with 1 rules applied. Total rules applied 1181 place count 1000 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1182 place count 999 transition count 1927
Iterating global reduction 8 with 1 rules applied. Total rules applied 1183 place count 999 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1184 place count 998 transition count 1919
Iterating global reduction 8 with 1 rules applied. Total rules applied 1185 place count 998 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1186 place count 997 transition count 1911
Iterating global reduction 8 with 1 rules applied. Total rules applied 1187 place count 997 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1188 place count 996 transition count 1903
Iterating global reduction 8 with 1 rules applied. Total rules applied 1189 place count 996 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1190 place count 995 transition count 1895
Iterating global reduction 8 with 1 rules applied. Total rules applied 1191 place count 995 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1192 place count 994 transition count 1887
Iterating global reduction 8 with 1 rules applied. Total rules applied 1193 place count 994 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1194 place count 993 transition count 1879
Iterating global reduction 8 with 1 rules applied. Total rules applied 1195 place count 993 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1196 place count 992 transition count 1871
Iterating global reduction 8 with 1 rules applied. Total rules applied 1197 place count 992 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1198 place count 991 transition count 1863
Iterating global reduction 8 with 1 rules applied. Total rules applied 1199 place count 991 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1200 place count 990 transition count 1855
Iterating global reduction 8 with 1 rules applied. Total rules applied 1201 place count 990 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1202 place count 989 transition count 1847
Iterating global reduction 8 with 1 rules applied. Total rules applied 1203 place count 989 transition count 1847
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 8 with 180 rules applied. Total rules applied 1383 place count 899 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1384 place count 898 transition count 1756
Iterating global reduction 8 with 1 rules applied. Total rules applied 1385 place count 898 transition count 1756
Applied a total of 1385 rules in 709 ms. Remains 898 /1629 variables (removed 731) and now considering 1756/2535 (removed 779) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16351707548514191342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17080112833315138577.kers'
[2026-05-22 20:53:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16351707548514191342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17080112833315138577.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 3 ms.
// Phase 1: matrix 1756 rows 889 cols 7052 entries
Finished phase 1 with 351 SingleSign rule and 402 generalized
[2026-05-22 20:53:32] [INFO ] Computed 145 invariants in 40 ms
Computed 145 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-17080112833315138577.kers
Total runtime 42 ms.
[2026-05-22 20:53:33] [INFO ] Implicit Places using invariants in 1063 ms returned [90, 96, 101, 120, 190, 196, 201, 207, 218, 236, 293, 301, 307, 324, 342, 433, 434, 504, 510, 515, 531, 602, 608, 613, 635, 636, 637, 712, 718, 723, 729, 740, 775, 812, 818, 823, 843, 895]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 860/1629 places, 1756/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 860 transition count 1739
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 843 transition count 1739
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 34 place count 843 transition count 1718
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 76 place count 822 transition count 1718
Discarding 2 places :
Implicit places reduction removed 2 places
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 2 with 4 rules applied. Total rules applied 80 place count 820 transition count 1716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 818 transition count 1716
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 98 place count 802 transition count 1700
Iterating global reduction 4 with 16 rules applied. Total rules applied 114 place count 802 transition count 1700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 802 transition count 1699
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 129 place count 788 transition count 1685
Iterating global reduction 5 with 14 rules applied. Total rules applied 143 place count 788 transition count 1685
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 150 place count 781 transition count 1678
Iterating global reduction 5 with 7 rules applied. Total rules applied 157 place count 781 transition count 1678
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 209 place count 755 transition count 1652
Applied a total of 209 rules in 138 ms. Remains 755 /860 variables (removed 105) and now considering 1652/1756 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4229917478505611606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4151369689637522856.kers'
[2026-05-22 20:53:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4229917478505611606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4151369689637522856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1652 rows 755 cols 6738 entries
Finished phase 1 with 333 SingleSign rule and 317 generalized
[2026-05-22 20:53:33] [INFO ] Computed 105 invariants in 12 ms
Computed 105 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4151369689637522856.kers
Total runtime 15 ms.
[2026-05-22 20:53:34] [INFO ] Implicit Places using invariants in 792 ms returned [93, 96, 177, 180, 261, 264, 342, 348, 353, 355, 358, 439, 442, 523, 526, 607, 610, 670, 691]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 795 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 736/1629 places, 1652/2535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 736 transition count 1645
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 729 transition count 1645
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 23 place count 720 transition count 1636
Iterating global reduction 2 with 9 rules applied. Total rules applied 32 place count 720 transition count 1636
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 39 place count 720 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 718 transition count 1627
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 718 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 717 transition count 1626
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 717 transition count 1626
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 51 place count 714 transition count 1623
Applied a total of 51 rules in 128 ms. Remains 714 /736 variables (removed 22) and now considering 1623/1652 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16146841123668583620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9434095943490950492.kers'
[2026-05-22 20:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16146841123668583620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9434095943490950492.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1623 rows 714 cols 6518 entries
Finished phase 1 with 325 SingleSign rule and 303 generalized
[2026-05-22 20:53:34] [INFO ] Computed 86 invariants in 34 ms
Computed 86 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-9434095943490950492.kers
Total runtime 38 ms.
[2026-05-22 20:53:35] [INFO ] Implicit Places using invariants in 738 ms returned [72, 151, 231, 312, 392, 472, 552]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 741 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 707/1629 places, 1623/2535 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 700 transition count 1616
Applied a total of 14 rules in 64 ms. Remains 700 /707 variables (removed 7) and now considering 1616/1623 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10173991536738171388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15943514537223397417.kers'
[2026-05-22 20:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10173991536738171388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15943514537223397417.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1616 rows 700 cols 6539 entries
Finished phase 1 with 325 SingleSign rule and 296 generalized
[2026-05-22 20:53:35] [INFO ] Computed 79 invariants in 14 ms
Computed 79 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15943514537223397417.kers
Total runtime 16 ms.
[2026-05-22 20:53:35] [INFO ] Implicit Places using invariants in 504 ms returned []
[2026-05-22 20:53:35] [INFO ] Invariant cache hit.
[2026-05-22 20:53:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-22 20:53:38] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 700/1629 places, 1616/2535 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 6634 ms. Remains : 700/1629 places, 1616/2535 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-15
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-15 finished in 6705 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((X(F(((X(X(F(!p1)))&&G(p2))||G(F(!p1)))))||p0)))'
Spot run failed in 46 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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)))'
Spot run failed in 35 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 20:53:38] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16220679884654647202
[2026-05-22 20:53:38] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:53:38] [INFO ] Applying decomposition
[2026-05-22 20:53:38] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16220679884654647202
Running compilation step : cd /tmp/ltsmin16220679884654647202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-22 20:53:38] [INFO ] Flatten gal took : 48 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/graph4511644320817270480.txt' '-o' '/tmp/graph4511644320817270480.bin' '-w' '/tmp/graph4511644320817270480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4511644320817270480.bin' '-l' '-1' '-v' '-w' '/tmp/graph4511644320817270480.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:53:38] [INFO ] Decomposing Gal with order
[2026-05-22 20:53:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:53:38] [INFO ] Removed a total of 3535 redundant transitions.
[2026-05-22 20:53:38] [INFO ] Flatten gal took : 110 ms
[2026-05-22 20:53:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 19 ms.
[2026-05-22 20:53:39] [INFO ] Time to serialize gal into /tmp/LTLFireability9088212479789045932.gal : 19 ms
[2026-05-22 20:53:39] [INFO ] Time to serialize properties into /tmp/LTLFireability15600949243476049010.ltl : 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/LTLFireability9088212479789045932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15600949243476049010.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...277
Read 2 LTL properties
Checking formula 0 : !((G(("(((i6.u197.p697==0)||(i6.u198.p700==0))||((i6.u199.p703==0)||(i6.u190.p812==0)))")||(X(F(((X(X(F(!("(((i6.u197.p697==1)&&(i6.u1...344
Formula 0 simplified : F(!"(((i6.u197.p697==0)||(i6.u198.p700==0))||((i6.u199.p703==0)||(i6.u190.p812==0)))" & XG(FG"(((i6.u197.p697==1)&&(i6.u198.p700==1)...316
Compilation finished in 5972 ms.
Running link step : cd /tmp/ltsmin16220679884654647202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16220679884654647202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(<>(((X(X(<>(!(LTLAPp1==true))))&&[]((LTLAPp2==true)))||[](<>(!(LTLAPp1==true))))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16220679884654647202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(<>(((X(X(<>(!(LTLAPp1==true))))&&[]((LTLAPp2==true)))||[](<>(!(LTLAPp1==true))))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16220679884654647202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 21:17:15] [INFO ] Applying decomposition
[2026-05-22 21:17:15] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:17:15] [INFO ] Decomposing Gal with order
[2026-05-22 21:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:17:15] [INFO ] Removed a total of 2951 redundant transitions.
[2026-05-22 21:17:15] [INFO ] Flatten gal took : 119 ms
[2026-05-22 21:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1048 labels/synchronizations in 80 ms.
[2026-05-22 21:17:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3727953796721321592.gal : 12 ms
[2026-05-22 21:17:16] [INFO ] Time to serialize properties into /tmp/LTLFireability101267951989672171.ltl : 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/LTLFireability3727953796721321592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability101267951989672171.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...275
Read 2 LTL properties
Checking formula 0 : !((G(("(((i29.i1.u115.p697==0)||(i29.i1.u116.p700==0))||((i29.i1.u117.p703==0)||(u143.p812==0)))")||(X(F(((X(X(F(!("(((i29.i1.u115.p69...374
Formula 0 simplified : F(!"(((i29.i1.u115.p697==0)||(i29.i1.u116.p700==0))||((i29.i1.u117.p703==0)||(u143.p812==0)))" & XG(FG"(((i29.i1.u115.p697==1)&&(i29...346
LTSmin run took 638418 ms.
FORMULA ASLink-PT-08a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin16220679884654647202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(<>(((X(X(<>(!(LTLAPp1==true))))&&[]((LTLAPp2==true)))||[](<>(!(LTLAPp1==true))))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 21:40:52] [INFO ] Flatten gal took : 47 ms
[2026-05-22 21:40:52] [INFO ] Input system was already deterministic with 2535 transitions.
[2026-05-22 21:40:52] [INFO ] Transformed 1629 places.
[2026-05-22 21:40:52] [INFO ] Transformed 2535 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 21:41:22] [INFO ] Time to serialize gal into /tmp/LTLFireability12557995336210067679.gal : 10 ms
[2026-05-22 21:41:22] [INFO ] Time to serialize properties into /tmp/LTLFireability12116173768414888051.ltl : 2 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/LTLFireability12557995336210067679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12116173768414888051.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(((p697==0)||(p700==0))||((p703==0)||(p812==0)))")||(X(F(((X(X(F(!("(((p697==1)&&(p700==1))&&((p703==1)&&(p812==1)))")))))&&(G(...239
Formula 0 simplified : F(!"(((p697==0)||(p700==0))||((p703==0)||(p812==0)))" & XG(FG"(((p697==1)&&(p700==1))&&((p703==1)&&(p812==1)))" & (XXG"(((p697==1)&&...211

BK_TIME_CONFINEMENT_REACHED

--------------------
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-08a"
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-08a, 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-177944366200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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