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-177969019900163.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:19 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 99K 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-09-LTLCardinality-00
FORMULA_NAME MedleyA-PT-09-LTLCardinality-01
FORMULA_NAME MedleyA-PT-09-LTLCardinality-02
FORMULA_NAME MedleyA-PT-09-LTLCardinality-03
FORMULA_NAME MedleyA-PT-09-LTLCardinality-04
FORMULA_NAME MedleyA-PT-09-LTLCardinality-05
FORMULA_NAME MedleyA-PT-09-LTLCardinality-06
FORMULA_NAME MedleyA-PT-09-LTLCardinality-07
FORMULA_NAME MedleyA-PT-09-LTLCardinality-08
FORMULA_NAME MedleyA-PT-09-LTLCardinality-09
FORMULA_NAME MedleyA-PT-09-LTLCardinality-10
FORMULA_NAME MedleyA-PT-09-LTLCardinality-11
FORMULA_NAME MedleyA-PT-09-LTLCardinality-12
FORMULA_NAME MedleyA-PT-09-LTLCardinality-13
FORMULA_NAME MedleyA-PT-09-LTLCardinality-14
FORMULA_NAME MedleyA-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699555792

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:59:16] [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:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:59:17] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-25 08:59:17] [INFO ] Transformed 147 places.
[2026-05-25 08:59:17] [INFO ] Transformed 315 transitions.
[2026-05-25 08:59:17] [INFO ] Found NUPN structural information;
[2026-05-25 08:59:17] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 121 transition count 288
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 121 transition count 288
Applied a total of 46 rules in 37 ms. Remains 121 /145 variables (removed 24) and now considering 288/313 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6696401130274528456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12329186624774114064.kers'
[2026-05-25 08:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6696401130274528456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12329186624774114064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 121 cols 1527 entries
Finished phase 1 with 107 SingleSign rule and 4 generalized
[2026-05-25 08:59:17] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12329186624774114064.kers
Total runtime 2 ms.
[2026-05-25 08:59:17] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-25 08:59:17] [INFO ] Invariant cache hit.
[2026-05-25 08:59:17] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-25 08:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/121 variables, 5/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 12/22 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/22 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 288/409 variables, 121/143 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 6/149 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/150 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 4/154 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/154 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/409 variables, 0/154 constraints. Problems are: Problem set: 64 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 154 constraints, problems are : Problem set: 64 solved, 223 unsolved in 24440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 64 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 5/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 19/29 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 288/409 variables, 121/150 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 223/373 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 10/383 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 1/384 constraints. Problems are: Problem set: 64 solved, 223 unsolved
SMT process timed out in 54895ms, After SMT, problems are : Problem set: 64 solved, 223 unsolved
Search for dead transitions found 64 dead transitions in 54916ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 224/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55446 ms. Remains : 121/145 places, 224/313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 224/224 (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-4747829098930142067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7201092164667659046.kers'
[2026-05-25 09:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4747829098930142067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7201092164667659046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 121 cols 1015 entries
Finished phase 1 with 107 SingleSign rule and 4 generalized
[2026-05-25 09:00:12] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7201092164667659046.kers
Total runtime 4 ms.
[2026-05-25 09:00:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:00:12] [INFO ] Invariant cache hit.
[2026-05-25 09:00:13] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/345 variables, 121/144 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 153 constraints, problems are : Problem set: 0 solved, 223 unsolved in 29587 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/345 variables, 121/151 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 223/374 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 10/384 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 388 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 59688ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 59690ms
Finished structural reductions in LTL mode , in 1 iterations and 59945 ms. Remains : 121/121 places, 224/224 transitions.
Support contains 32 out of 121 places after structural reductions.
[2026-05-25 09:01:13] [INFO ] Flatten gal took : 70 ms
[2026-05-25 09:01:13] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:01:13] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 30 out of 121 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (1317 resets) in 1240 ms. (32 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (289 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (294 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2026-05-25 09:01:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/98 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 207/305 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/324 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/336 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/344 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/345 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/345 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/98 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 207/305 variables, 98/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/324 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/336 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/344 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/345 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/345 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/345 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/345 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 138 constraints, problems are : Problem set: 0 solved, 2 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 8237 steps, including 115 resets, run visited all 2 properties in 33 ms. (steps per millisecond=249 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 41 ms.
FORMULA MedleyA-PT-09-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-09-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 19 stable transitions
Graph (complete) has 404 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 108 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 206
Applied a total of 30 rules in 8 ms. Remains 106 /121 variables (removed 15) and now considering 206/224 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9170723446939705194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1703670789498091138.kers'
[2026-05-25 09:01:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9170723446939705194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1703670789498091138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 106 cols 979 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:01:15] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1703670789498091138.kers
Total runtime 1 ms.
[2026-05-25 09:01:15] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:01:15] [INFO ] Invariant cache hit.
[2026-05-25 09:01:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:01:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 128 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/331 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 337 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50785ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 50787ms
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 206/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51105 ms. Remains : 106/121 places, 206/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 371 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 29 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA MedleyA-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLCardinality-01 finished in 51922 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 X(p2)))&&F(p3)))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 109 transition count 212
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 109 transition count 212
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 107 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 107 transition count 208
Applied a total of 28 rules in 7 ms. Remains 107 /121 variables (removed 14) and now considering 208/224 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2259381828423770823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5185297062373735230.kers'
[2026-05-25 09:02:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2259381828423770823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5185297062373735230.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 107 cols 983 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:02:07] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5185297062373735230.kers
Total runtime 3 ms.
[2026-05-25 09:02:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 09:02:07] [INFO ] Invariant cache hit.
[2026-05-25 09:02:07] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-25 09:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/315 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 130 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13757 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/315 variables, 107/130 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 207/337 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 346 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43830ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 43831ms
Starting structural reductions in LTL mode, iteration 1 : 107/121 places, 208/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44030 ms. Remains : 107/121 places, 208/224 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 X(p2)))&&F(p3)))'
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Graph (complete) has 375 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 22 ms. Proved property starting from automaton with 8 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA MedleyA-PT-09-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLCardinality-03 finished in 44635 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 U X(p1)))&&F((p2||G(!p1)))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 108 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 108 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 208
Applied a total of 28 rules in 10 ms. Remains 107 /121 variables (removed 14) and now considering 208/224 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6563263324390171720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-658088437224431793.kers'
[2026-05-25 09:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6563263324390171720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-658088437224431793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 107 cols 983 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:02:51] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-658088437224431793.kers
Total runtime 1 ms.
[2026-05-25 09:02:51] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 09:02:51] [INFO ] Invariant cache hit.
[2026-05-25 09:02:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/121 places, 208/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 107/121 places, 208/224 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 U X(p1)))&&F((p2||G(!p1)))))'
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-06
Stuttering criterion allowed to conclude after 68 steps with 14 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-06 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Graph (complete) has 404 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 118 transition count 203
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 100 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 98 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 45 place count 98 transition count 193
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 94 transition count 193
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 66 place count 81 transition count 177
Iterating global reduction 3 with 13 rules applied. Total rules applied 79 place count 81 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 79 place count 81 transition count 175
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 79 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 78 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 78 transition count 173
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 135 place count 52 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 52 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 51 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 51 transition count 143
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 4 with 12 rules applied. Total rules applied 151 place count 45 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 163 place count 45 transition count 155
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 167 place count 43 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 42 transition count 177
Applied a total of 168 rules in 114 ms. Remains 42 /121 variables (removed 79) and now considering 177/224 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5997888446845281015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6346847852005311496.kers'
[2026-05-25 09:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5997888446845281015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6346847852005311496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 42 cols 846 entries
Finished phase 1 with 32 SingleSign rule and 2 generalized
[2026-05-25 09:02:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6346847852005311496.kers
Total runtime 2 ms.
[2026-05-25 09:02:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:02:52] [INFO ] Invariant cache hit.
[2026-05-25 09:02:52] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 09:02:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2026-05-25 09:02:52] [INFO ] Redundant transitions in 10 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-25 09:02:52] [INFO ] Invariant cache hit.
[2026-05-25 09:02:52] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 177/219 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/144 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 144 constraints, problems are : Problem set: 0 solved, 173 unsolved in 5209 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 177/219 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/144 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 173/317 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/219 variables, and 318 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35315ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 35316ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/121 places, 177/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35630 ms. Remains : 42/121 places, 177/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-07
Product exploration explored 100000 steps with 14399 reset in 229 ms.
Product exploration explored 100000 steps with 14402 reset in 286 ms.
Computed a total of 9 stabilizing places and 101 stable transitions
Computed a total of 9 stabilizing places and 101 stable transitions
Knowledge based reduction with 3 factoid took 69 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 23643 steps (3405 resets) in 142 ms. (165 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 53 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 30 ms :[(NOT p0)]
Knowledge-based reduction took 212 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 177/177 transitions.
Applied a total of 0 rules in 9 ms. Remains 42 /42 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-25 09:03:28] [INFO ] Invariant cache hit.
[2026-05-25 09:03:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:03:28] [INFO ] Invariant cache hit.
[2026-05-25 09:03:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 09:03:28] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-25 09:03:28] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 42/42 places, 177/177 transitions.
Computed a total of 9 stabilizing places and 101 stable transitions
Computed a total of 9 stabilizing places and 101 stable transitions
Knowledge based reduction with 3 factoid took 83 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 13615 steps (1970 resets) in 104 ms. (129 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 105 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 61 ms :[(NOT p0)]
Knowledge-based reduction took 309 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14430 reset in 301 ms.
Product exploration explored 100000 steps with 14355 reset in 259 ms.
Built C files in :
/tmp/ltsmin4639916294830334861
[2026-05-25 09:03:30] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2026-05-25 09:03:30] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:03:30] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2026-05-25 09:03:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:03:30] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2026-05-25 09:03:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:03:30] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4639916294830334861
Running compilation step : cd /tmp/ltsmin4639916294830334861;'/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 586 ms.
Running link step : cd /tmp/ltsmin4639916294830334861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 113 ms.
Running LTSmin : cd /tmp/ltsmin4639916294830334861;'/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/stateBased2107611000554211178.hoa' '--buchi-type=spotba'
LTSmin run took 4841 ms.
FORMULA MedleyA-PT-09-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLCardinality-07 finished in 43429 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) U p1))||F((G(!p2)||(!p2&&F(!p3))))))))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 108 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 106 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 106 transition count 206
Applied a total of 30 rules in 4 ms. Remains 106 /121 variables (removed 15) and now considering 206/224 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10848058657424896658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14840689989516793387.kers'
[2026-05-25 09:03:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10848058657424896658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14840689989516793387.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 106 cols 979 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:03:35] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14840689989516793387.kers
Total runtime 2 ms.
[2026-05-25 09:03:35] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:03:35] [INFO ] Invariant cache hit.
[2026-05-25 09:03:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:03:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (OVERLAPS) 0/312 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 131 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 340 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50857ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 50857ms
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 206/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51123 ms. Remains : 106/121 places, 206/224 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) U p1))||F((G(p2)||(F(p4)&&p3)))))))'
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p4) (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-09
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-09 finished in 51516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(G(p2))))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 224/224 transitions.
Graph (complete) has 404 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 118 transition count 202
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 43 place count 99 transition count 198
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 97 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 47 place count 97 transition count 191
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 57 place count 92 transition count 191
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 67 place count 82 transition count 178
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 82 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 77 place count 82 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 80 transition count 176
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 130 place count 55 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 55 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 54 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 54 transition count 146
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 4 with 12 rules applied. Total rules applied 146 place count 48 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 156 place count 48 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 160 place count 46 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 45 transition count 181
Applied a total of 161 rules in 33 ms. Remains 45 /121 variables (removed 76) and now considering 181/224 (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-5136652303521551546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17912843738448682031.kers'
[2026-05-25 09:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5136652303521551546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17912843738448682031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 45 cols 869 entries
Finished phase 1 with 33 SingleSign rule and 3 generalized
[2026-05-25 09:04:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17912843738448682031.kers
Total runtime 8 ms.
[2026-05-25 09:04:27] [INFO ] Implicit Places using invariants in 94 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/121 places, 181/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 44/121 places, 181/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(X(G(p1))&&p2))))'
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-10
Product exploration explored 100000 steps with 27695 reset in 287 ms.
Product exploration explored 100000 steps with 27746 reset in 292 ms.
Computed a total of 9 stabilizing places and 103 stable transitions
Computed a total of 9 stabilizing places and 103 stable transitions
Knowledge based reduction with 9 factoid took 363 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (5281 resets) in 256 ms. (155 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (1110 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1097 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12707667267243836136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4028496851699458685.kers'
[2026-05-25 09:04:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12707667267243836136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4028496851699458685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 44 cols 868 entries
Finished phase 1 with 34 SingleSign rule and 2 generalized
[2026-05-25 09:04:28] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4028496851699458685.kers
Total runtime 1 ms.
[2026-05-25 09:04:28] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/35 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 175/213 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 89/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/225 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/225 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 145 constraints, problems are : Problem set: 0 solved, 2 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/35 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 175/213 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 89/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Int declared 225/225 variables, and 141 constraints, problems are : Problem set: 2 solved, 0 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 44/44 constraints, ReadFeed: 89/93 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 20 ms. Proved property starting from automaton with 2 states, 5 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 990 ms.
FORMULA MedleyA-PT-09-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLCardinality-10 finished in 1833 ms.
All properties solved by simple procedures.
Total runtime 312020 ms.

BK_STOP 1779699869087

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-09"
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-09, 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-177969019900163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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