Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961108000539.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is LeafsetExtension-PT-S64C4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961108000539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 15 11:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 11:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C4-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779955800349

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-28 08:10:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 08:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 08:10:04] [INFO ] Load time of PNML (sax parser for PT used): 1147 ms
[2026-05-28 08:10:04] [INFO ] Transformed 21462 places.
[2026-05-28 08:10:04] [INFO ] Transformed 21129 transitions.
[2026-05-28 08:10:04] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1551 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4213 places and 0 transitions.
Iterating post reduction 0 with 4213 rules applied. Total rules applied 4213 place count 17249 transition count 21129
Applied a total of 4213 rules in 555 ms. Remains 17249 /21462 variables (removed 4213) and now considering 21129/21129 (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-9393943348820075928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11416125656442073973.kers'
[2026-05-28 08:10:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9393943348820075928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11416125656442073973.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 37 ms.
// Phase 1: matrix 21129 rows 17248 cols 54944 entries
Finished phase 1 with 12806 SingleSign rule and 4245 generalized
[2026-05-28 08:10:06] [INFO ] Computed 198 invariants in 1025 ms
Computed 198 P flows in 1027 ms.
Exported basis to /tmp/petrispot-output-11416125656442073973.kers
Total runtime 1056 ms.
[2026-05-28 08:10:33] [INFO ] Implicit Places using invariants in 28016 ms returned [264, 528, 791, 1054, 1317, 1580, 1843, 2107, 2370, 2633, 2896, 3159, 3422, 3685, 3949, 4213, 4476, 4739, 5002, 5265, 5528, 5791, 6054, 6318, 6581, 6844, 7107, 7370, 7633, 7896, 8159, 8423, 8425, 8688, 8951, 9214, 9477, 9740, 10003, 10266, 10529, 10792, 11055, 11318, 11581, 11845, 12108, 12371, 12635, 12898, 13162, 13425, 13689, 13952, 14216, 14479, 14742, 15005, 15268, 15532, 15795, 16059, 16322, 16586, 16849, 17112]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 28223 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17183/21462 places, 21129/21129 transitions.
Applied a total of 0 rules in 147 ms. Remains 17183 /17183 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28960 ms. Remains : 17183/21462 places, 21129/21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Applied a total of 0 rules in 151 ms. Remains 17183 /17183 variables (removed 0) and now considering 21129/21129 (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-11985730458010993903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13647245699478093989.kers'
[2026-05-28 08:10:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11985730458010993903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13647245699478093989.kers]
Culled 0 columns in 36 ms.
// Phase 1: matrix 21129 rows 17183 cols 50719 entries
Finished phase 1 with 12871 SingleSign rule and 4180 generalized
[2026-05-28 08:10:36] [INFO ] Computed 132 invariants in 2783 ms
Computed 132 P flows in 2785 ms.
Exported basis to /tmp/petrispot-output-13647245699478093989.kers
Total runtime 2811 ms.
[2026-05-28 08:10:50] [INFO ] Implicit Places using invariants in 16419 ms returned []
Implicit Place search using SMT only with invariants took 16423 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:10:51] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38312 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30905 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17183 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38312 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30423 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17183 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104965ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 105239ms
Finished structural reductions in LTL mode , in 1 iterations and 122011 ms. Remains : 17183/17183 places, 21129/21129 transitions.
Support contains 49 out of 17183 places after structural reductions.
[2026-05-28 08:12:37] [INFO ] Flatten gal took : 1032 ms
[2026-05-28 08:12:38] [INFO ] Flatten gal took : 571 ms
[2026-05-28 08:12:39] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 47 out of 17183 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (1203 resets) in 3070 ms. (13 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
[2026-05-28 08:12:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 16707/16737 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16737/38312 variables, and 7 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5082 ms.
Refiners :[Generalized P Invariants (flows): 7/132 constraints, State Equation: 0/17183 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 16707/16737 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16737/38312 variables, and 7 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 7/132 constraints, State Equation: 0/17183 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10304ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 17183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Graph (complete) has 33880 edges and 17183 vertex of which 1261 are kept as prefixes of interest. Removing 15922 places using SCC suffix rule.55 ms
Discarding 15922 places :
Also discarding 15191 output transitions
Drop transitions (Output transitions of discarded places.) removed 15191 transitions
Drop transitions (Empty/Sink Transition effects.) removed 610 transitions
Reduce isomorphic transitions removed 610 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 1115 rules applied. Total rules applied 1116 place count 1261 transition count 4823
Reduce places removed 507 places and 0 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 1 with 523 rules applied. Total rules applied 1639 place count 754 transition count 4807
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1655 place count 738 transition count 4807
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1655 place count 738 transition count 4778
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1713 place count 709 transition count 4778
Discarding 476 places :
Symmetric choice reduction at 3 with 476 rule applications. Total rules 2189 place count 233 transition count 4302
Iterating global reduction 3 with 476 rules applied. Total rules applied 2665 place count 233 transition count 4302
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 2723 place count 204 transition count 4273
Free-agglomeration rule (complex) applied 66 times.
Iterating global reduction 3 with 66 rules applied. Total rules applied 2789 place count 204 transition count 4207
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 2855 place count 138 transition count 4207
Applied a total of 2855 rules in 1414 ms. Remains 138 /17183 variables (removed 17045) and now considering 4207/21129 (removed 16922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1415 ms. Remains : 138/17183 places, 4207/21129 transitions.
RANDOM walk for 40000 steps (7493 resets) in 5154 ms. (7 steps per ms) remains 12/21 properties
BEST_FIRST walk for 40004 steps (16 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
[2026-05-28 08:12:54] [INFO ] Flow matrix only has 634 transitions (discarded 3573 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12880898300579675691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8710590624438618487.kers'
[2026-05-28 08:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12880898300579675691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8710590624438618487.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 634 rows 138 cols 1807 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-05-28 08:12:54] [INFO ] Computed 1 invariants in 3 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8710590624438618487.kers
Total runtime 4 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (OVERLAPS) 607/639 variables, 20/32 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 63/702 variables, 1/33 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 702/772 variables, and 96 constraints, problems are : Problem set: 12 solved, 0 unsolved in 517 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/138 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17183 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17183 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U X(p1))&&F(p2)))))'
Support contains 7 out of 17183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 17172 transition count 21129
Applied a total of 11 rules in 93 ms. Remains 17172 /17183 variables (removed 11) and now considering 21129/21129 (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-15769720665142934509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2651787915617228669.kers'
[2026-05-28 08:12:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15769720665142934509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2651787915617228669.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 21129 rows 17172 cols 50708 entries
Finished phase 1 with 12871 SingleSign rule and 4169 generalized
[2026-05-28 08:12:57] [INFO ] Computed 132 invariants in 2596 ms
Computed 132 P flows in 2597 ms.
Exported basis to /tmp/petrispot-output-2651787915617228669.kers
Total runtime 2620 ms.
[2026-05-28 08:13:10] [INFO ] Implicit Places using invariants in 15146 ms returned []
Implicit Place search using SMT only with invariants took 15153 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:13:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38301 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30630 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38301 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30614 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99600ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 99671ms
Starting structural reductions in LTL mode, iteration 1 : 17172/17183 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114985 ms. Remains : 17172/17183 places, 21129/21129 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U X(p1))&&F(p2)))))'
Stuttering acceptance computed with spot in 722 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLCardinality-03
Product exploration explored 100000 steps with 24993 reset in 4873 ms.
Product exploration explored 100000 steps with 24993 reset in 4884 ms.
Computed a total of 17172 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17172 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1199 resets) in 1138 ms. (35 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (37 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
[2026-05-28 08:15:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16715/38301 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3702 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16715/38301 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3831 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17172/17172 places, 21129/21129 transitions.
Graph (complete) has 33869 edges and 17172 vertex of which 212 are kept as prefixes of interest. Removing 16960 places using SCC suffix rule.9 ms
Discarding 16960 places :
Also discarding 17570 output transitions
Drop transitions (Output transitions of discarded places.) removed 17570 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2266 transitions
Reduce isomorphic transitions removed 2266 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 2330 rules applied. Total rules applied 2331 place count 212 transition count 1229
Reduce places removed 67 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 1 with 135 rules applied. Total rules applied 2466 place count 145 transition count 1161
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 2532 place count 79 transition count 1161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2532 place count 79 transition count 1157
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2540 place count 75 transition count 1157
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 2573 place count 75 transition count 1124
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 2606 place count 42 transition count 1124
Partial Free-agglomeration rule applied 62 times.
Drop transitions (Partial Free agglomeration) removed 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 2668 place count 42 transition count 1124
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2670 place count 40 transition count 1124
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2672 place count 40 transition count 1122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2674 place count 38 transition count 1122
Applied a total of 2674 rules in 325 ms. Remains 38 /17172 variables (removed 17134) and now considering 1122/21129 (removed 20007) transitions.
Running 2 sub problems to find dead transitions.
[2026-05-28 08:15:26] [INFO ] Flow matrix only has 100 transitions (discarded 1022 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13051715054211260135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14627232946998867430.kers'
[2026-05-28 08:15:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13051715054211260135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14627232946998867430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 38 cols 326 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-28 08:15:26] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14627232946998867430.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/138 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 99/104 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/138 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 38/17172 places, 1122/21129 transitions.
RANDOM walk for 1199 steps (314 resets) in 308 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Knowledge-based reduction took 26663 ms.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Support contains 7 out of 17172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17172/17172 places, 21129/21129 transitions.
Applied a total of 0 rules in 70 ms. Remains 17172 /17172 variables (removed 0) and now considering 21129/21129 (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-4904141028202851010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3675617628350137634.kers'
[2026-05-28 08:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4904141028202851010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3675617628350137634.kers]
Culled 0 columns in 34 ms.
// Phase 1: matrix 21129 rows 17172 cols 50708 entries
Finished phase 1 with 12871 SingleSign rule and 4169 generalized
[2026-05-28 08:15:30] [INFO ] Computed 132 invariants in 2765 ms
Computed 132 P flows in 2766 ms.
Exported basis to /tmp/petrispot-output-3675617628350137634.kers
Total runtime 2790 ms.
[2026-05-28 08:15:42] [INFO ] Implicit Places using invariants in 14932 ms returned []
Implicit Place search using SMT only with invariants took 14934 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38301 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30857 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
SMT process timed out in 101040ms, After SMT, problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 101115ms
Finished structural reductions in LTL mode , in 1 iterations and 116178 ms. Remains : 17172/17172 places, 21129/21129 transitions.
Computed a total of 17172 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17172 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1207 resets) in 1232 ms. (32 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
[2026-05-28 08:17:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16715/38301 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3932 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16715/38301 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3427 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17172/17172 places, 21129/21129 transitions.
Graph (complete) has 33869 edges and 17172 vertex of which 212 are kept as prefixes of interest. Removing 16960 places using SCC suffix rule.8 ms
Discarding 16960 places :
Also discarding 17570 output transitions
Drop transitions (Output transitions of discarded places.) removed 17570 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2266 transitions
Reduce isomorphic transitions removed 2266 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 2330 rules applied. Total rules applied 2331 place count 212 transition count 1229
Reduce places removed 67 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 1 with 135 rules applied. Total rules applied 2466 place count 145 transition count 1161
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 2532 place count 79 transition count 1161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2532 place count 79 transition count 1157
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 2540 place count 75 transition count 1157
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 2573 place count 75 transition count 1124
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 2606 place count 42 transition count 1124
Partial Free-agglomeration rule applied 62 times.
Drop transitions (Partial Free agglomeration) removed 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 2668 place count 42 transition count 1124
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2670 place count 40 transition count 1124
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2672 place count 40 transition count 1122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2674 place count 38 transition count 1122
Applied a total of 2674 rules in 241 ms. Remains 38 /17172 variables (removed 17134) and now considering 1122/21129 (removed 20007) transitions.
Running 2 sub problems to find dead transitions.
[2026-05-28 08:17:53] [INFO ] Flow matrix only has 100 transitions (discarded 1022 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-199119475596146233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5994396963959396719.kers'
[2026-05-28 08:17:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-199119475596146233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5994396963959396719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 38 cols 326 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-28 08:17:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5994396963959396719.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/138 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 99/104 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/138 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 38/17172 places, 1122/21129 transitions.
RANDOM walk for 1898 steps (488 resets) in 40 ms. (46 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Knowledge-based reduction took 30643 ms.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 24998 reset in 5390 ms.
Product exploration explored 100000 steps with 24997 reset in 4877 ms.
Spot run failed in 153 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/ltsmin2552571268170379678
[2026-05-28 08:18:06] [INFO ] Built C files in 491ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2552571268170379678
Running compilation step : cd /tmp/ltsmin2552571268170379678;'/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/ltsmin2552571268170379678;'/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/ltsmin2552571268170379678;'/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 7 out of 17172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17172/17172 places, 21129/21129 transitions.
Applied a total of 0 rules in 78 ms. Remains 17172 /17172 variables (removed 0) and now considering 21129/21129 (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-4472048375545225245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-410686750624755665.kers'
[2026-05-28 08:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4472048375545225245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-410686750624755665.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 21129 rows 17172 cols 50708 entries
Finished phase 1 with 12871 SingleSign rule and 4169 generalized
[2026-05-28 08:18:11] [INFO ] Computed 132 invariants in 2644 ms
Computed 132 P flows in 2645 ms.
Exported basis to /tmp/petrispot-output-410686750624755665.kers
Total runtime 2664 ms.
[2026-05-28 08:18:23] [INFO ] Implicit Places using invariants in 14434 ms returned []
Implicit Place search using SMT only with invariants took 14437 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38301 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30526 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17172 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
SMT process timed out in 97851ms, After SMT, problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 97920ms
Finished structural reductions in LTL mode , in 1 iterations and 112473 ms. Remains : 17172/17172 places, 21129/21129 transitions.
Built C files in :
/tmp/ltsmin10124012824160888693
[2026-05-28 08:20:02] [INFO ] Built C files in 376ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10124012824160888693
Running compilation step : cd /tmp/ltsmin10124012824160888693;'/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/ltsmin10124012824160888693;'/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/ltsmin10124012824160888693;'/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-28 08:20:06] [INFO ] Flatten gal took : 462 ms
[2026-05-28 08:20:06] [INFO ] Flatten gal took : 452 ms
[2026-05-28 08:20:06] [INFO ] Time to serialize gal into /tmp/LTL1929896788291155932.gal : 180 ms
[2026-05-28 08:20:06] [INFO ] Time to serialize properties into /tmp/LTL14327575707969628589.prop : 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/LTL1929896788291155932.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11210532278558213661.hoa' '-atoms' '/tmp/LTL14327575707969628589.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...319
Loading property file /tmp/LTL14327575707969628589.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11210532278558213661.hoa
Detected timeout of ITS tools.
[2026-05-28 08:20:22] [INFO ] Flatten gal took : 511 ms
[2026-05-28 08:20:23] [INFO ] Flatten gal took : 449 ms
[2026-05-28 08:20:23] [INFO ] Time to serialize gal into /tmp/LTL638570794110304405.gal : 124 ms
[2026-05-28 08:20:23] [INFO ] Time to serialize properties into /tmp/LTL12228111541779583432.ltl : 4 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/LTL638570794110304405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12228111541779583432.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(Node47FailureProcessedByNode7<=Node49FailureProcessedByNode31)"))U(X("(Node56ManageTheBreakDownOfNode3<1)")))&&(F("((Node...297
Formula 0 simplified : XX((F!"(Node47FailureProcessedByNode7<=Node49FailureProcessedByNode31)" R X!"(Node56ManageTheBreakDownOfNode3<1)") | G!"((Node24Fail...286
Detected timeout of ITS tools.
[2026-05-28 08:20:39] [INFO ] Flatten gal took : 709 ms
[2026-05-28 08:20:39] [INFO ] Applying decomposition
[2026-05-28 08:20:39] [INFO ] Flatten gal took : 410 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/graph14646364641118691278.txt' '-o' '/tmp/graph14646364641118691278.bin' '-w' '/tmp/graph14646364641118691278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14646364641118691278.bin' '-l' '-1' '-v' '-w' '/tmp/graph14646364641118691278.weights' '-q' '0' '-e' '0.001'
[2026-05-28 08:20:41] [INFO ] Decomposing Gal with order
[2026-05-28 08:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 08:21:41] [INFO ] Removed a total of 12022 redundant transitions.
[2026-05-28 08:21:42] [INFO ] Flatten gal took : 7986 ms
[2026-05-28 08:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 388 ms.
[2026-05-28 08:21:47] [INFO ] Time to serialize gal into /tmp/LTL2437541227433469636.gal : 234 ms
[2026-05-28 08:21:47] [INFO ] Time to serialize properties into /tmp/LTL17762409426617291232.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/LTL2437541227433469636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17762409426617291232.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(gu495.Node47FailureProcessedByNode7<=gu495.Node49FailureProcessedByNode31)"))U(X("(gi3.gi0.gi80.gu3591.Node56ManageTheBre...357
Formula 0 simplified : XX((F!"(gu495.Node47FailureProcessedByNode7<=gu495.Node49FailureProcessedByNode31)" R X!"(gi3.gi0.gi80.gu3591.Node56ManageTheBreakDo...346
Detected timeout of ITS tools.
Treatment of property LeafsetExtension-PT-S64C4-LTLCardinality-03 finished in 547761 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 2 out of 17183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Graph (complete) has 38237 edges and 17183 vertex of which 17166 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.97 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8318 transitions
Trivial Post-agglo rules discarded 8318 transitions
Performed 8318 trivial Post agglomeration. Transition count delta: 8318
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17166 transition count 12809
Reduce places removed 8318 places and 0 transitions.
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16637 place count 8848 transition count 12809
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16637 place count 8848 transition count 12679
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16897 place count 8718 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20926 place count 4689 transition count 8650
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24955 place count 4689 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24955 place count 4689 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24957 place count 4688 transition count 8649
Discarding 4028 places :
Symmetric choice reduction at 2 with 4028 rule applications. Total rules 28985 place count 660 transition count 4621
Iterating global reduction 2 with 4028 rules applied. Total rules applied 33013 place count 660 transition count 4621
Discarding 64 places :
Implicit places reduction removed 64 places
Iterating post reduction 2 with 64 rules applied. Total rules applied 33077 place count 596 transition count 4621
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 33077 place count 596 transition count 4557
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 33205 place count 532 transition count 4557
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 33268 place count 469 transition count 4494
Iterating global reduction 3 with 63 rules applied. Total rules applied 33331 place count 469 transition count 4494
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 33394 place count 406 transition count 4431
Iterating global reduction 3 with 63 rules applied. Total rules applied 33457 place count 406 transition count 4431
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 33593 place count 338 transition count 4363
Applied a total of 33593 rules in 3176 ms. Remains 338 /17183 variables (removed 16845) and now considering 4363/21129 (removed 16766) transitions.
[2026-05-28 08:22:05] [INFO ] Flow matrix only has 2348 transitions (discarded 2015 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13551914622920742607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9969412091725747322.kers'
[2026-05-28 08:22:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13551914622920742607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9969412091725747322.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2348 rows 338 cols 6941 entries
Finished phase 1 with 138 SingleSign rule and 132 generalized
[2026-05-28 08:22:05] [INFO ] Computed 68 invariants in 16 ms
Computed 68 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9969412091725747322.kers
Total runtime 21 ms.
[2026-05-28 08:22:06] [INFO ] Implicit Places using invariants in 591 ms returned [3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, 111, 115, 119, 123, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 167, 171, 175, 179, 183, 187, 191, 195, 199, 203, 207, 211, 215, 219, 223, 227, 231, 239, 244, 248, 252, 256, 260, 264]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 596 ms to find 65 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/17183 places, 4363/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 209 transition count 4299
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 209 transition count 4299
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 192 place count 145 transition count 4235
Iterating global reduction 0 with 64 rules applied. Total rules applied 256 place count 145 transition count 4235
Applied a total of 256 rules in 190 ms. Remains 145 /273 variables (removed 128) and now considering 4235/4363 (removed 128) transitions.
[2026-05-28 08:22:06] [INFO ] Flow matrix only has 174 transitions (discarded 4061 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16375226355416416655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3835029547326147890.kers'
[2026-05-28 08:22:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16375226355416416655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3835029547326147890.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 145 cols 448 entries
Finished phase 1 with 75 SingleSign rule and 67 generalized
[2026-05-28 08:22:06] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3835029547326147890.kers
Total runtime 3 ms.
[2026-05-28 08:22:07] [INFO ] Implicit Places using invariants in 531 ms returned []
[2026-05-28 08:22:07] [INFO ] Flow matrix only has 174 transitions (discarded 4061 similar events)
[2026-05-28 08:22:07] [INFO ] Invariant cache hit.
[2026-05-28 08:22:08] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 145/17183 places, 4235/21129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5594 ms. Remains : 145/17183 places, 4235/21129 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLCardinality-07 finished in 5704 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)&&F(G(p1)))))'
Support contains 4 out of 17183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Graph (complete) has 38237 edges and 17183 vertex of which 17166 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.18 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8316 transitions
Trivial Post-agglo rules discarded 8316 transitions
Performed 8316 trivial Post agglomeration. Transition count delta: 8316
Iterating post reduction 0 with 8316 rules applied. Total rules applied 8317 place count 17166 transition count 12811
Reduce places removed 8316 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16635 place count 8850 transition count 12809
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16637 place count 8848 transition count 12809
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16637 place count 8848 transition count 12679
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16897 place count 8718 transition count 12679
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20925 place count 4690 transition count 8651
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24953 place count 4690 transition count 8651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24953 place count 4690 transition count 8650
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24955 place count 4689 transition count 8650
Discarding 4026 places :
Symmetric choice reduction at 3 with 4026 rule applications. Total rules 28981 place count 663 transition count 4624
Iterating global reduction 3 with 4026 rules applied. Total rules applied 33007 place count 663 transition count 4624
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 33070 place count 600 transition count 4624
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 33070 place count 600 transition count 4561
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 33196 place count 537 transition count 4561
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 33258 place count 475 transition count 4499
Iterating global reduction 4 with 62 rules applied. Total rules applied 33320 place count 475 transition count 4499
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 33382 place count 413 transition count 4437
Iterating global reduction 4 with 62 rules applied. Total rules applied 33444 place count 413 transition count 4437
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 33584 place count 343 transition count 4367
Applied a total of 33584 rules in 3559 ms. Remains 343 /17183 variables (removed 16840) and now considering 4367/21129 (removed 16762) transitions.
[2026-05-28 08:22:12] [INFO ] Flow matrix only has 2384 transitions (discarded 1983 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3360675416697648204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1773242306343101635.kers'
[2026-05-28 08:22:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3360675416697648204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1773242306343101635.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2384 rows 343 cols 7047 entries
Finished phase 1 with 140 SingleSign rule and 134 generalized
[2026-05-28 08:22:12] [INFO ] Computed 69 invariants in 15 ms
Computed 69 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1773242306343101635.kers
Total runtime 19 ms.
[2026-05-28 08:22:12] [INFO ] Implicit Places using invariants in 721 ms returned [3, 7, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 136, 140, 147, 152, 156, 160, 164, 168, 172, 176, 180, 184, 188, 193, 197, 201, 205, 209, 213, 217, 221, 225, 229, 233, 237, 241, 245, 253, 258, 262, 266, 270]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 725 ms to find 65 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/17183 places, 4367/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 214 transition count 4303
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 214 transition count 4303
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 192 place count 150 transition count 4239
Iterating global reduction 0 with 64 rules applied. Total rules applied 256 place count 150 transition count 4239
Applied a total of 256 rules in 130 ms. Remains 150 /278 variables (removed 128) and now considering 4239/4367 (removed 128) transitions.
[2026-05-28 08:22:12] [INFO ] Flow matrix only has 211 transitions (discarded 4028 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-53701507460296570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15354851307065439035.kers'
[2026-05-28 08:22:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-53701507460296570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15354851307065439035.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 150 cols 556 entries
Finished phase 1 with 77 SingleSign rule and 69 generalized
[2026-05-28 08:22:12] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15354851307065439035.kers
Total runtime 2 ms.
[2026-05-28 08:22:13] [INFO ] Implicit Places using invariants in 547 ms returned []
[2026-05-28 08:22:13] [INFO ] Flow matrix only has 211 transitions (discarded 4028 similar events)
[2026-05-28 08:22:13] [INFO ] Invariant cache hit.
[2026-05-28 08:22:14] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/17183 places, 4239/21129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6479 ms. Remains : 150/17183 places, 4239/21129 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLCardinality-12
Stuttering criterion allowed to conclude after 2116 steps with 142 reset in 32 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLCardinality-12 finished in 6700 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((G(p0)||X(X(p1))))))'
Support contains 3 out of 17183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 17168 transition count 21129
Applied a total of 15 rules in 141 ms. Remains 17168 /17183 variables (removed 15) and now considering 21129/21129 (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-13694799750455247649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3945921008936577098.kers'
[2026-05-28 08:22:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13694799750455247649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3945921008936577098.kers]
Culled 0 columns in 35 ms.
// Phase 1: matrix 21129 rows 17168 cols 50704 entries
Finished phase 1 with 12871 SingleSign rule and 4165 generalized
[2026-05-28 08:22:18] [INFO ] Computed 132 invariants in 2903 ms
Computed 132 P flows in 2904 ms.
Exported basis to /tmp/petrispot-output-3945921008936577098.kers
Total runtime 2922 ms.
[2026-05-28 08:22:30] [INFO ] Implicit Places using invariants in 15427 ms returned []
Implicit Place search using SMT only with invariants took 15428 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:22:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38297 variables, and 129 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30858 ms.
Refiners :[Generalized P Invariants (flows): 129/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
SMT process timed out in 99381ms, After SMT, problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 99435ms
Starting structural reductions in LTL mode, iteration 1 : 17168/17183 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115038 ms. Remains : 17168/17183 places, 21129/21129 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((G(p0)||X(X(p1))))))'
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLCardinality-13
Product exploration explored 100000 steps with 16686 reset in 4574 ms.
Product exploration explored 100000 steps with 16661 reset in 4614 ms.
Computed a total of 17168 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17168 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1203 resets) in 1298 ms. (30 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (38 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (38 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
[2026-05-28 08:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16711/16714 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16714/38297 variables, and 2 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17168 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16711/16714 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16714/38297 variables, and 2 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10118ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 17168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17168/17168 places, 21129/21129 transitions.
Graph (complete) has 33865 edges and 17168 vertex of which 340 are kept as prefixes of interest. Removing 16828 places using SCC suffix rule.6 ms
Discarding 16828 places :
Also discarding 16478 output transitions
Drop transitions (Output transitions of discarded places.) removed 16478 transitions
Drop transitions (Empty/Sink Transition effects.) removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 383 rules applied. Total rules applied 384 place count 340 transition count 4268
Reduce places removed 99 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 166 rules applied. Total rules applied 550 place count 241 transition count 4201
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 585 place count 206 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 585 place count 206 transition count 4197
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 593 place count 202 transition count 4197
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 653 place count 142 transition count 4137
Iterating global reduction 3 with 60 rules applied. Total rules applied 713 place count 142 transition count 4137
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 721 place count 138 transition count 4133
Free-agglomeration rule (complex) applied 64 times.
Iterating global reduction 3 with 64 rules applied. Total rules applied 785 place count 138 transition count 4069
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 849 place count 74 transition count 4069
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 880 place count 74 transition count 4069
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 881 place count 73 transition count 4069
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 882 place count 73 transition count 4068
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 883 place count 72 transition count 4068
Applied a total of 883 rules in 539 ms. Remains 72 /17168 variables (removed 17096) and now considering 4068/21129 (removed 17061) transitions.
Running 4 sub problems to find dead transitions.
[2026-05-28 08:24:54] [INFO ] Flow matrix only has 164 transitions (discarded 3904 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17761600820408382346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9771580230500577110.kers'
[2026-05-28 08:24:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17761600820408382346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9771580230500577110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 72 cols 457 entries
Finished phase 1 with 68 SingleSign rule and 3 generalized
[2026-05-28 08:24:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9771580230500577110.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 129/203 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 32/235 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 32/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/236 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 73 constraints, problems are : Problem set: 0 solved, 4 unsolved in 349 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 129/203 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 32/235 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/236 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 77 constraints, problems are : Problem set: 0 solved, 4 unsolved in 383 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1284 ms. Remains : 72/17168 places, 4068/21129 transitions.
RANDOM walk for 3078 steps (665 resets) in 228 ms. (13 steps per ms) remains 0/3 properties
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 5 factoid took 47 ms. Proved property starting from automaton with 8 states, 13 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 35506 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C4-LTLCardinality-13 finished in 160181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(F(p1))) U X(X(X(p2)))))'
Support contains 6 out of 17183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17183/17183 places, 21129/21129 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 17168 transition count 21129
Applied a total of 15 rules in 138 ms. Remains 17168 /17183 variables (removed 15) and now considering 21129/21129 (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-5231989928973060082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-278815425726712812.kers'
[2026-05-28 08:24:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5231989928973060082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-278815425726712812.kers]
Culled 0 columns in 34 ms.
// Phase 1: matrix 21129 rows 17168 cols 50704 entries
Finished phase 1 with 12871 SingleSign rule and 4165 generalized
[2026-05-28 08:24:58] [INFO ] Computed 132 invariants in 2837 ms
Computed 132 P flows in 2837 ms.
Exported basis to /tmp/petrispot-output-278815425726712812.kers
Total runtime 2866 ms.
[2026-05-28 08:25:12] [INFO ] Implicit Places using invariants in 16482 ms returned []
Implicit Place search using SMT only with invariants took 16490 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2026-05-28 08:25:12] [INFO ] Invariant cache hit.
SMT process timed out in 76417ms, After SMT, problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 76459ms
Starting structural reductions in LTL mode, iteration 1 : 17168/17183 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93113 ms. Remains : 17168/17183 places, 21129/21129 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(F(p1))) U X(X(X(p2)))))'
Stuttering acceptance computed with spot in 992 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLCardinality-14
Product exploration explored 100000 steps with 3017 reset in 2365 ms.
Product exploration explored 100000 steps with 3013 reset in 2196 ms.
Computed a total of 17168 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17168 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 19 states, 38 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 30143 steps (905 resets) in 1416 ms. (21 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2026-05-28 08:26:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 38099 ms.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 17168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17168/17168 places, 21129/21129 transitions.
Applied a total of 0 rules in 496 ms. Remains 17168 /17168 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2026-05-28 08:27:13] [INFO ] Invariant cache hit.
[2026-05-28 08:27:24] [INFO ] Implicit Places using invariants in 11762 ms returned []
Implicit Place search using SMT only with invariants took 11764 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 12275 ms. Remains : 17168/17168 places, 21129/21129 transitions.
Computed a total of 17168 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17168 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1203 resets) in 1150 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (40 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9220 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :0 out of 1
Probabilistic random walk after 9220 steps, saw 5283 distinct states, run finished after 3015 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-28 08:27:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16714/38297 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3515 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16714/38297 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3838 ms.
Refiners :[Generalized P Invariants (flows): 2/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7498ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17168/17168 places, 21129/21129 transitions.
Graph (complete) has 33865 edges and 17168 vertex of which 146 are kept as prefixes of interest. Removing 17022 places using SCC suffix rule.32 ms
Discarding 17022 places :
Also discarding 17577 output transitions
Drop transitions (Output transitions of discarded places.) removed 17577 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2223 transitions
Reduce isomorphic transitions removed 2223 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 2255 rules applied. Total rules applied 2256 place count 146 transition count 1297
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 137 rules applied. Total rules applied 2393 place count 110 transition count 1196
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 2426 place count 77 transition count 1196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2426 place count 77 transition count 1194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2430 place count 75 transition count 1194
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 2463 place count 75 transition count 1161
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2464 place count 75 transition count 1160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2465 place count 74 transition count 1160
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 2498 place count 74 transition count 1127
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2532 place count 74 transition count 1093
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2566 place count 40 transition count 1093
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 2597 place count 40 transition count 1093
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 2598 place count 39 transition count 1093
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2599 place count 39 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2600 place count 38 transition count 1092
Applied a total of 2600 rules in 985 ms. Remains 38 /17168 variables (removed 17130) and now considering 1092/21129 (removed 20037) transitions.
Running 2 sub problems to find dead transitions.
[2026-05-28 08:27:56] [INFO ] Flow matrix only has 68 transitions (discarded 1024 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3356921796862662451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6343379948779392254.kers'
[2026-05-28 08:27:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3356921796862662451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6343379948779392254.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 38 cols 199 entries
Finished phase 1 with 33 SingleSign rule and 4 generalized
[2026-05-28 08:27:56] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6343379948779392254.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/73 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 67/73 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/105 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 163 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1307 ms. Remains : 38/17168 places, 1092/21129 transitions.
RANDOM walk for 303 steps (68 resets) in 7 ms. (37 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4852455627351832125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14495615021277909145.kers'
[2026-05-28 08:27:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4852455627351832125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14495615021277909145.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 21129 rows 17168 cols 50704 entries
Finished phase 1 with 12871 SingleSign rule and 4165 generalized
[2026-05-28 08:27:59] [INFO ] Computed 132 invariants in 2735 ms
Computed 132 P flows in 2736 ms.
Exported basis to /tmp/petrispot-output-14495615021277909145.kers
Total runtime 2753 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 49892 ms.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLCardinality-14 finished in 199715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U X(p1))&&F(p2)))))'
Spot run failed in 61 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-28 08:28:16] [INFO ] Flatten gal took : 898 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17040706927062946381
[2026-05-28 08:28:16] [INFO ] Too many transitions (21129) to apply POR reductions. Disabling POR matrices.
[2026-05-28 08:28:17] [INFO ] Applying decomposition
[2026-05-28 08:28:17] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17040706927062946381
Running compilation step : cd /tmp/ltsmin17040706927062946381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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-28 08:28:17] [INFO ] Flatten gal took : 553 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/graph1300116976186445850.txt' '-o' '/tmp/graph1300116976186445850.bin' '-w' '/tmp/graph1300116976186445850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1300116976186445850.bin' '-l' '-1' '-v' '-w' '/tmp/graph1300116976186445850.weights' '-q' '0' '-e' '0.001'
[2026-05-28 08:28:19] [INFO ] Decomposing Gal with order
[2026-05-28 08:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 08:29:00] [INFO ] Removed a total of 12027 redundant transitions.
[2026-05-28 08:29:01] [INFO ] Flatten gal took : 9344 ms
[2026-05-28 08:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 661 ms.
[2026-05-28 08:29:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality1584607012302864252.gal : 222 ms
[2026-05-28 08:29:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality5092735489125829770.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/LTLCardinality1584607012302864252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5092735489125829770.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...297
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(gu497.Node47FailureProcessedByNode7<=gu497.Node49FailureProcessedByNode31)"))U(X("(gi3.gi0.gi78.gu3595.Node56ManageTheBre...357
Formula 0 simplified : XX((F!"(gu497.Node47FailureProcessedByNode7<=gu497.Node49FailureProcessedByNode31)" R X!"(gi3.gi0.gi78.gu3595.Node56ManageTheBreakDo...346
Compilation finished in 464572 ms.
Running link step : cd /tmp/ltsmin17040706927062946381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 241 ms.
Running LTSmin : cd /tmp/ltsmin17040706927062946381;'/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((([]((LTLAPp0==true)) U X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2026-05-28 08:53:41] [INFO ] Flatten gal took : 7019 ms
[2026-05-28 08:53:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality6930835876451325735.gal : 390 ms
[2026-05-28 08:53:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality11165224385367026407.ltl : 11 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/LTLCardinality6930835876451325735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11165224385367026407.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X(((G("(Node47FailureProcessedByNode7<=Node49FailureProcessedByNode31)"))U(X("(Node56ManageTheBreakDownOfNode3<1)")))&&(F("((Node...297
Formula 0 simplified : XX((F!"(Node47FailureProcessedByNode7<=Node49FailureProcessedByNode31)" R X!"(Node56ManageTheBreakDownOfNode3<1)") | G!"((Node24Fail...286

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="LTLCardinality"
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 LeafsetExtension-PT-S64C4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961108000539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;