Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900155.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 90K 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 MedleyA-PT-08-LTLCardinality-00
FORMULA_NAME MedleyA-PT-08-LTLCardinality-01
FORMULA_NAME MedleyA-PT-08-LTLCardinality-02
FORMULA_NAME MedleyA-PT-08-LTLCardinality-03
FORMULA_NAME MedleyA-PT-08-LTLCardinality-04
FORMULA_NAME MedleyA-PT-08-LTLCardinality-05
FORMULA_NAME MedleyA-PT-08-LTLCardinality-06
FORMULA_NAME MedleyA-PT-08-LTLCardinality-07
FORMULA_NAME MedleyA-PT-08-LTLCardinality-08
FORMULA_NAME MedleyA-PT-08-LTLCardinality-09
FORMULA_NAME MedleyA-PT-08-LTLCardinality-10
FORMULA_NAME MedleyA-PT-08-LTLCardinality-11
FORMULA_NAME MedleyA-PT-08-LTLCardinality-12
FORMULA_NAME MedleyA-PT-08-LTLCardinality-13
FORMULA_NAME MedleyA-PT-08-LTLCardinality-14
FORMULA_NAME MedleyA-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699452502

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:57:34] [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-25 08:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:57:34] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 08:57:34] [INFO ] Transformed 147 places.
[2026-05-25 08:57:34] [INFO ] Transformed 312 transitions.
[2026-05-25 08:57:34] [INFO ] Found NUPN structural information;
[2026-05-25 08:57:34] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 114 transition count 275
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 114 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 114 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 109 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 109 transition count 261
Applied a total of 78 rules in 74 ms. Remains 109 /147 variables (removed 38) and now considering 261/312 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14908475767071842499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6322202008979643522.kers'
[2026-05-25 08:57:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14908475767071842499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6322202008979643522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 109 cols 1248 entries
Finished phase 1 with 95 SingleSign rule and 4 generalized
[2026-05-25 08:57:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6322202008979643522.kers
Total runtime 3 ms.
[2026-05-25 08:57:35] [INFO ] Implicit Places using invariants in 428 ms returned []
[2026-05-25 08:57:35] [INFO ] Invariant cache hit.
[2026-05-25 08:57:35] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 08:57:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 9/19 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 261/370 variables, 109/128 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 2/130 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/131 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 3/134 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/134 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/134 constraints. Problems are: Problem set: 48 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 134 constraints, problems are : Problem set: 48 solved, 212 unsolved in 26785 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 48 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 11/21 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/22 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/22 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 261/370 variables, 109/131 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 212/343 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/344 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 4/348 constraints. Problems are: Problem set: 48 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 3/351 constraints. Problems are: Problem set: 48 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 352 constraints, problems are : Problem set: 48 solved, 212 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 212/260 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 57213ms problems are : Problem set: 48 solved, 212 unsolved
Search for dead transitions found 48 dead transitions in 57225ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/147 places, 213/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58054 ms. Remains : 109/147 places, 213/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 213/213 (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-5310660164319334450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18361624270671396365.kers'
[2026-05-25 08:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5310660164319334450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18361624270671396365.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 109 cols 896 entries
Finished phase 1 with 95 SingleSign rule and 4 generalized
[2026-05-25 08:58:32] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18361624270671396365.kers
Total runtime 1 ms.
[2026-05-25 08:58:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 08:58:32] [INFO ] Invariant cache hit.
[2026-05-25 08:58:32] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 08:58:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/322 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 130 constraints, problems are : Problem set: 0 solved, 212 unsolved in 21120 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/322 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 212/340 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 347 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51263ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 51264ms
Finished structural reductions in LTL mode , in 1 iterations and 51481 ms. Remains : 109/109 places, 213/213 transitions.
Support contains 32 out of 109 places after structural reductions.
[2026-05-25 08:59:24] [INFO ] Flatten gal took : 45 ms
[2026-05-25 08:59:24] [INFO ] Flatten gal took : 28 ms
[2026-05-25 08:59:24] [INFO ] Input system was already deterministic with 213 transitions.
RANDOM walk for 40000 steps (1989 resets) in 1702 ms. (23 steps per ms) remains 9/21 properties
BEST_FIRST walk for 40004 steps (520 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (539 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (528 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (526 resets) in 268 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (520 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (533 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (520 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (621 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (643 resets) in 125 ms. (317 steps per ms) remains 7/9 properties
[2026-05-25 08:59:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 75/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/89 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 191/280 variables, 89/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 23/303 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/307 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 12/319 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/322 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 119 constraints, problems are : Problem set: 0 solved, 7 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 75/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/89 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 191/280 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 23/303 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/303 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/307 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 12/319 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 3/322 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 135 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2974ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 10321 steps, including 207 resets, run visited all 7 properties in 54 ms. (steps per millisecond=191 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 59 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 391 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 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(F(p1))||p0) U G(p2)) U p3))))'
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 102 transition count 204
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 102 transition count 204
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 99 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 99 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 193
Applied a total of 22 rules in 16 ms. Remains 98 /109 variables (removed 11) and now considering 193/213 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1346132522994541440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6722416153346638263.kers'
[2026-05-25 08:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1346132522994541440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6722416153346638263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 98 cols 834 entries
Finished phase 1 with 84 SingleSign rule and 4 generalized
[2026-05-25 08:59:29] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6722416153346638263.kers
Total runtime 1 ms.
[2026-05-25 08:59:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 08:59:29] [INFO ] Invariant cache hit.
[2026-05-25 08:59:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2026-05-25 08:59:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/291 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 115 constraints, problems are : Problem set: 0 solved, 192 unsolved in 13777 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/291 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 192/305 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 311 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43909ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 43909ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 193/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44088 ms. Remains : 98/109 places, 193/213 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(F(p1))||p0) U G(p2)) U p3))))'
Stuttering acceptance computed with spot in 635 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 352 edges and 98 vertex of which 93 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 30 ms. Proved property starting from automaton with 7 states, 18 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA MedleyA-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLCardinality-00 finished in 45258 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(p1))||p0)))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 202
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 97 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 97 transition count 186
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 94 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 94 transition count 178
Applied a total of 30 rules in 6 ms. Remains 94 /109 variables (removed 15) and now considering 178/213 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-131926951544008741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1368214031861153523.kers'
[2026-05-25 09:00:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-131926951544008741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1368214031861153523.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 94 cols 772 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:00:14] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1368214031861153523.kers
Total runtime 1 ms.
[2026-05-25 09:00:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 09:00:14] [INFO ] Invariant cache hit.
[2026-05-25 09:00:14] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-25 09:00:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/272 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 111 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10661 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/272 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 177/286 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 295 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40738ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 40739ms
Starting structural reductions in LTL mode, iteration 1 : 94/109 places, 178/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40968 ms. Remains : 94/109 places, 178/213 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(p1))||p0)))'
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-03
Product exploration explored 100000 steps with 4956 reset in 167 ms.
Entered a terminal (fully accepting) state of product in 18651 steps with 928 reset in 27 ms.
FORMULA MedleyA-PT-08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-03 finished in 41406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1 U p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Graph (complete) has 391 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 103 transition count 196
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 90 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 89 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 31 place count 89 transition count 190
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 37 place count 86 transition count 190
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 44 place count 79 transition count 181
Iterating global reduction 3 with 7 rules applied. Total rules applied 51 place count 79 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 79 transition count 180
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 78 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 75 transition count 170
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 75 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 73 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 73 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 72 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 72 transition count 162
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 95 place count 56 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 56 transition count 145
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 53 transition count 140
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 53 transition count 140
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 118 place count 46 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 138 place count 46 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 44 transition count 176
Applied a total of 142 rules in 51 ms. Remains 44 /109 variables (removed 65) and now considering 176/213 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5424565092853255197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15660680051281817620.kers'
[2026-05-25 09:00:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5424565092853255197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15660680051281817620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 44 cols 789 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-25 09:00:55] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15660680051281817620.kers
Total runtime 1 ms.
[2026-05-25 09:00:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:00:55] [INFO ] Invariant cache hit.
[2026-05-25 09:00:55] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-25 09:00:55] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2026-05-25 09:00:55] [INFO ] Redundant transitions in 26 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-25 09:00:55] [INFO ] Invariant cache hit.
[2026-05-25 09:00:55] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 175/218 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 87/136 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 2/220 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 137 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7194 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 175/218 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 87/136 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 167/303 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 2/220 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 307 constraints, problems are : Problem set: 0 solved, 170 unsolved in 18226 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25547ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 25548ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/109 places, 176/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25792 ms. Remains : 44/109 places, 176/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1 U p0)))'
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-04 finished in 25935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 200
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 94 transition count 188
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 92 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 92 transition count 182
Applied a total of 34 rules in 25 ms. Remains 92 /109 variables (removed 17) and now considering 182/213 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1456589322872757613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15690798709867681986.kers'
[2026-05-25 09:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1456589322872757613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15690798709867681986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 92 cols 796 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:01:21] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15690798709867681986.kers
Total runtime 3 ms.
[2026-05-25 09:01:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:01:21] [INFO ] Invariant cache hit.
[2026-05-25 09:01:21] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-25 09:01:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 107 constraints, problems are : Problem set: 0 solved, 181 unsolved in 16736 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 181/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 289 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46827ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 46828ms
Starting structural reductions in LTL mode, iteration 1 : 92/109 places, 182/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47057 ms. Remains : 92/109 places, 182/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 334 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 1 factoid took 85 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 (2003 resets) in 547 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (552 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43063 steps, run visited all 1 properties in 83 ms. (steps per millisecond=518 )
Probabilistic random walk after 43063 steps, saw 8982 distinct states, run finished after 86 ms. (steps per millisecond=500 ) properties seen :1
Knowledge based reduction with 1 factoid took 106 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 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 751 ms.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-25 09:02:10] [INFO ] Invariant cache hit.
[2026-05-25 09:02:10] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:02:10] [INFO ] Invariant cache hit.
[2026-05-25 09:02:10] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 92/92 places, 182/182 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 334 edges and 92 vertex of which 87 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 1 factoid took 46 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 (1987 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (536 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43063 steps, run visited all 1 properties in 62 ms. (steps per millisecond=694 )
Probabilistic random walk after 43063 steps, saw 8982 distinct states, run finished after 62 ms. (steps per millisecond=694 ) properties seen :1
Knowledge based reduction with 1 factoid took 67 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 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 393 ms.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Spot run failed in 95 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/ltsmin12250388089822236499
[2026-05-25 09:02:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12250388089822236499
Running compilation step : cd /tmp/ltsmin12250388089822236499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin12250388089822236499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin12250388089822236499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2326323780194748674.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA MedleyA-PT-08-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLCardinality-07 finished in 50687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Graph (complete) has 391 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 103 transition count 196
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 90 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 90 transition count 192
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 88 transition count 192
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 42 place count 79 transition count 180
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 79 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 51 place count 79 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 78 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 74 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 74 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 71 transition count 157
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 71 transition count 157
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 71 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 70 transition count 156
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 69 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 69 transition count 153
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 99 place count 54 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 54 transition count 137
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 105 place count 51 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 108 place count 51 transition count 132
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 120 place count 45 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 132 place count 45 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 44 transition count 155
Applied a total of 134 rules in 62 ms. Remains 44 /109 variables (removed 65) and now considering 155/213 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4007568329289611068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4998050940028301975.kers'
[2026-05-25 09:02:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4007568329289611068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4998050940028301975.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 44 cols 677 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-25 09:02:12] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4998050940028301975.kers
Total runtime 1 ms.
[2026-05-25 09:02:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:02:12] [INFO ] Invariant cache hit.
[2026-05-25 09:02:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2026-05-25 09:02:12] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2026-05-25 09:02:12] [INFO ] Redundant transitions in 43 ms returned []
Running 151 sub problems to find dead transitions.
[2026-05-25 09:02:12] [INFO ] Invariant cache hit.
[2026-05-25 09:02:12] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 154/197 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 76/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 126 constraints, problems are : Problem set: 0 solved, 151 unsolved in 6023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 154/197 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 76/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 148/273 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 2/199 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 199/199 variables, and 277 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36107ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 36108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/109 places, 155/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36467 ms. Remains : 44/109 places, 155/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Stuttering acceptance computed with spot in 110 ms :[p0, true, p0]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-08 finished in 36618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(F(!p1))||(!p0&&F(!p1)))))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 198
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 92 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 92 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 89 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 88 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 88 transition count 170
Applied a total of 42 rules in 18 ms. Remains 88 /109 variables (removed 21) and now considering 170/213 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16686296681563729294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18401108437581494415.kers'
[2026-05-25 09:02:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16686296681563729294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18401108437581494415.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 88 cols 752 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 09:02:48] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18401108437581494415.kers
Total runtime 3 ms.
[2026-05-25 09:02:49] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-25 09:02:49] [INFO ] Invariant cache hit.
[2026-05-25 09:02:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-25 09:02:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 102 constraints, problems are : Problem set: 0 solved, 169 unsolved in 9217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 273 constraints, problems are : Problem set: 0 solved, 169 unsolved in 23652 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32940ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 32940ms
Starting structural reductions in LTL mode, iteration 1 : 88/109 places, 170/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33202 ms. Remains : 88/109 places, 170/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(F(p1))||(!p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-09
Product exploration explored 100000 steps with 7526 reset in 85 ms.
Product exploration explored 100000 steps with 7502 reset in 137 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 314 edges and 88 vertex of which 83 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2026-05-25 09:03:22] [INFO ] Invariant cache hit.
[2026-05-25 09:03:22] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-25 09:03:22] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-25 09:03:22] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-25 09:03:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:03:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-25 09:03:23] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 09:03:23] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-25 09:03:23] [INFO ] Computed and/alt/rep : 143/609/143 causal constraints (skipped 26 transitions) in 13 ms.
[2026-05-25 09:03:23] [INFO ] Added : 81 causal constraints over 18 iterations in 531 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 1200 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 170/170 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-05-25 09:03:23] [INFO ] Invariant cache hit.
[2026-05-25 09:03:23] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:03:23] [INFO ] Invariant cache hit.
[2026-05-25 09:03:23] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 88/88 places, 170/170 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 314 edges and 88 vertex of which 83 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge based reduction with 2 factoid took 41 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2026-05-25 09:03:24] [INFO ] Invariant cache hit.
[2026-05-25 09:03:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 09:03:24] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 09:03:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 09:03:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:03:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 09:03:24] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 09:03:24] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-25 09:03:24] [INFO ] Computed and/alt/rep : 143/609/143 causal constraints (skipped 26 transitions) in 10 ms.
[2026-05-25 09:03:25] [INFO ] Added : 81 causal constraints over 18 iterations in 502 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 1115 ms.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7551 reset in 136 ms.
Product exploration explored 100000 steps with 7504 reset in 127 ms.
Spot run failed in 81 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/ltsmin6681418895341895069
[2026-05-25 09:03:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6681418895341895069
Running compilation step : cd /tmp/ltsmin6681418895341895069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin6681418895341895069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6681418895341895069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4760478064067574246.hoa' '--buchi-type=spotba'
LTSmin run took 158 ms.
FORMULA MedleyA-PT-08-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLCardinality-09 finished in 37406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1||X((X(p1) U (p1&&X(p1)))))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 201
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 96 transition count 191
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 96 transition count 191
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 94 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 94 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 93 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 93 transition count 183
Applied a total of 32 rules in 4 ms. Remains 93 /109 variables (removed 16) and now considering 183/213 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5106456165854046143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-256700993604601779.kers'
[2026-05-25 09:03:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5106456165854046143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-256700993604601779.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 93 cols 794 entries
Finished phase 1 with 79 SingleSign rule and 4 generalized
[2026-05-25 09:03:26] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-256700993604601779.kers
Total runtime 1 ms.
[2026-05-25 09:03:26] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:03:26] [INFO ] Invariant cache hit.
[2026-05-25 09:03:26] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-25 09:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 109 constraints, problems are : Problem set: 0 solved, 182 unsolved in 9805 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 182/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 294 constraints, problems are : Problem set: 0 solved, 182 unsolved in 29923 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39799ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 39799ms
Starting structural reductions in LTL mode, iteration 1 : 93/109 places, 183/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40005 ms. Remains : 93/109 places, 183/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1||X((X(p1) U (p1&&X(p1)))))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-10 finished in 40326 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)||G(p2))))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Graph (complete) has 391 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 103 transition count 195
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 89 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 31 place count 89 transition count 190
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 86 transition count 190
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 46 place count 77 transition count 178
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 77 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 77 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 76 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 72 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 72 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 70 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 70 transition count 157
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 70 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 69 transition count 156
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 96 place count 56 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 99 place count 56 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 101 place count 54 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 54 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 119 place count 46 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 141 place count 46 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 45 transition count 171
Applied a total of 143 rules in 52 ms. Remains 45 /109 variables (removed 64) and now considering 171/213 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17786494286549945013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4513904446011442843.kers'
[2026-05-25 09:04:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17786494286549945013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4513904446011442843.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 45 cols 768 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:04:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4513904446011442843.kers
Total runtime 2 ms.
[2026-05-25 09:04:06] [INFO ] Implicit Places using invariants in 94 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/109 places, 171/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 44/109 places, 171/213 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)||G(p2))))))'
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-13
Stuttering criterion allowed to conclude after 378 steps with 57 reset in 4 ms.
FORMULA MedleyA-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-13 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U !p1))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Graph (complete) has 391 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 196
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 90 transition count 194
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 31 place count 90 transition count 191
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 87 transition count 191
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 46 place count 78 transition count 179
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 78 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 78 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 77 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 73 transition count 164
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 73 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 70 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 70 transition count 156
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 70 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 69 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 68 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 68 transition count 152
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 100 place count 55 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 55 transition count 138
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 104 place count 53 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 53 transition count 134
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 120 place count 46 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 138 place count 46 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 142 place count 44 transition count 163
Applied a total of 142 rules in 49 ms. Remains 44 /109 variables (removed 65) and now considering 163/213 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6552846677423738847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15417425408814739855.kers'
[2026-05-25 09:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6552846677423738847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15417425408814739855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 44 cols 734 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:04:07] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15417425408814739855.kers
Total runtime 1 ms.
[2026-05-25 09:04:07] [INFO ] Implicit Places using invariants in 78 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/109 places, 163/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 43/109 places, 163/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U !p1))'
Stuttering acceptance computed with spot in 91 ms :[p1, (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-14
Product exploration explored 100000 steps with 22680 reset in 162 ms.
Product exploration explored 100000 steps with 22805 reset in 161 ms.
Computed a total of 8 stabilizing places and 78 stable transitions
Computed a total of 8 stabilizing places and 78 stable transitions
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Knowledge-based reduction took 428 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 43 /43 variables (removed 0) and now considering 163/163 (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-16544077003105323622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9160301207626510705.kers'
[2026-05-25 09:04:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16544077003105323622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9160301207626510705.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 43 cols 732 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 09:04:08] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9160301207626510705.kers
Total runtime 2 ms.
[2026-05-25 09:04:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 09:04:08] [INFO ] Invariant cache hit.
[2026-05-25 09:04:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:04:08] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2026-05-25 09:04:08] [INFO ] Redundant transitions in 27 ms returned [109]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 160 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2605605836249641690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10423815069601887656.kers'
[2026-05-25 09:04:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2605605836249641690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10423815069601887656.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 43 cols 730 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 09:04:08] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10423815069601887656.kers
Total runtime 1 ms.
[2026-05-25 09:04:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 162/205 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 73/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 122 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8189 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 162/205 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 73/122 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 160/282 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 283 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38284ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 38284ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 162/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38618 ms. Remains : 43/43 places, 162/163 transitions.
Computed a total of 8 stabilizing places and 78 stable transitions
Computed a total of 8 stabilizing places and 78 stable transitions
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Knowledge-based reduction took 184 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14685 reset in 189 ms.
Product exploration explored 100000 steps with 14737 reset in 182 ms.
Built C files in :
/tmp/ltsmin7214161602111075485
[2026-05-25 09:04:47] [INFO ] Computing symmetric may disable matrix : 162 transitions.
[2026-05-25 09:04:47] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:47] [INFO ] Computing symmetric may enable matrix : 162 transitions.
[2026-05-25 09:04:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:47] [INFO ] Computing Do-Not-Accords matrix : 162 transitions.
[2026-05-25 09:04:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:47] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7214161602111075485
Running compilation step : cd /tmp/ltsmin7214161602111075485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin7214161602111075485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7214161602111075485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14698136521609167476.hoa' '--buchi-type=spotba'
LTSmin run took 4607 ms.
FORMULA MedleyA-PT-08-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLCardinality-14 finished in 45579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(X(X(G(p1))))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 213/213 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 199
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 93 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 93 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 90 transition count 174
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 90 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 89 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 89 transition count 171
Applied a total of 40 rules in 4 ms. Remains 89 /109 variables (removed 20) and now considering 171/213 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11289096810821056457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3094573934655770729.kers'
[2026-05-25 09:04:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11289096810821056457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3094573934655770729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 89 cols 754 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:04:52] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3094573934655770729.kers
Total runtime 3 ms.
[2026-05-25 09:04:52] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:04:52] [INFO ] Invariant cache hit.
[2026-05-25 09:04:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-25 09:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 105 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9508 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 170/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 280 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39552ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 39552ms
Starting structural reductions in LTL mode, iteration 1 : 89/109 places, 171/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39710 ms. Remains : 89/109 places, 171/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(X(X(G(p1))))))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-08-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLCardinality-15 finished in 40033 ms.
All properties solved by simple procedures.
Total runtime 478443 ms.

BK_STOP 1779699932662

--------------------
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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r178-oct2-177969019900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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