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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 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 48K 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-02-LTLCardinality-00
FORMULA_NAME MedleyA-PT-02-LTLCardinality-01
FORMULA_NAME MedleyA-PT-02-LTLCardinality-02
FORMULA_NAME MedleyA-PT-02-LTLCardinality-03
FORMULA_NAME MedleyA-PT-02-LTLCardinality-04
FORMULA_NAME MedleyA-PT-02-LTLCardinality-05
FORMULA_NAME MedleyA-PT-02-LTLCardinality-06
FORMULA_NAME MedleyA-PT-02-LTLCardinality-07
FORMULA_NAME MedleyA-PT-02-LTLCardinality-08
FORMULA_NAME MedleyA-PT-02-LTLCardinality-09
FORMULA_NAME MedleyA-PT-02-LTLCardinality-10
FORMULA_NAME MedleyA-PT-02-LTLCardinality-11
FORMULA_NAME MedleyA-PT-02-LTLCardinality-12
FORMULA_NAME MedleyA-PT-02-LTLCardinality-13
FORMULA_NAME MedleyA-PT-02-LTLCardinality-14
FORMULA_NAME MedleyA-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779698975840

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:49:37] [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:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:49:37] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-25 08:49:37] [INFO ] Transformed 69 places.
[2026-05-25 08:49:37] [INFO ] Transformed 168 transitions.
[2026-05-25 08:49:37] [INFO ] Found NUPN structural information;
[2026-05-25 08:49:37] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA MedleyA-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 58 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 58 transition count 147
Applied a total of 22 rules in 15 ms. Remains 58 /69 variables (removed 11) and now considering 147/162 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1746814662277641030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13988706767073821641.kers'
[2026-05-25 08:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1746814662277641030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13988706767073821641.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 58 cols 557 entries
Finished phase 1 with 48 SingleSign rule and 1 generalized
[2026-05-25 08:49:37] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13988706767073821641.kers
Total runtime 1 ms.
[2026-05-25 08:49:37] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-25 08:49:37] [INFO ] Invariant cache hit.
[2026-05-25 08:49:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:49:38] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 08:49:38] [INFO ] Invariant cache hit.
[2026-05-25 08:49:38] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/205 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 60/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 140 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8629 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/205 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 60/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 146/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 290 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21478 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30361ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 30383ms
Starting structural reductions in LTL mode, iteration 1 : 58/69 places, 147/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31115 ms. Remains : 58/69 places, 147/162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 08:50:08] [INFO ] Invariant cache hit.
[2026-05-25 08:50:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 08:50:08] [INFO ] Invariant cache hit.
[2026-05-25 08:50:08] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:50:08] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 58/58 places, 147/147 transitions.
Support contains 14 out of 58 places after structural reductions.
[2026-05-25 08:50:09] [INFO ] Flatten gal took : 63 ms
[2026-05-25 08:50:09] [INFO ] Flatten gal took : 25 ms
[2026-05-25 08:50:09] [INFO ] Input system was already deterministic with 147 transitions.
RANDOM walk for 40000 steps (3964 resets) in 1673 ms. (23 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (932 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (910 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (919 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
[2026-05-25 08:50:09] [INFO ] Invariant cache hit.
[2026-05-25 08:50:09] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/53 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 145/200 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 60/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/205 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 127 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/53 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 145/200 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 60/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/205 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 131 constraints, problems are : Problem set: 0 solved, 3 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1100ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1282 steps, including 76 resets, run visited all 3 properties in 6 ms. (steps per millisecond=213 )
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 3 properties in 10 ms.
Computed a total of 12 stabilizing places and 60 stable transitions
Graph (complete) has 319 edges and 58 vertex of which 56 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Graph (complete) has 319 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 53 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 11 place count 51 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 51 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 19 place count 48 transition count 124
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 29 place count 43 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 53 place count 43 transition count 135
Applied a total of 53 rules in 57 ms. Remains 43 /58 variables (removed 15) and now considering 135/147 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1218332934891020145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10083025691002842679.kers'
[2026-05-25 08:50:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1218332934891020145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10083025691002842679.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 43 cols 587 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 08:50:11] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10083025691002842679.kers
Total runtime 1 ms.
[2026-05-25 08:50:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 08:50:11] [INFO ] Invariant cache hit.
[2026-05-25 08:50:11] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-25 08:50:11] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2026-05-25 08:50:11] [INFO ] Redundant transitions in 2 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-25 08:50:11] [INFO ] Invariant cache hit.
[2026-05-25 08:50:11] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 135/178 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 64/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 118 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8762 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 135/178 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 64/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 131/249 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 249 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17271ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 17275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/58 places, 135/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17597 ms. Remains : 43/58 places, 135/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLCardinality-04 finished in 17954 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(p1)||p0)))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 49 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 49 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 48 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 115
Applied a total of 20 rules in 4 ms. Remains 48 /58 variables (removed 10) and now considering 115/147 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8804898528562655031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6611756400716957158.kers'
[2026-05-25 08:50:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8804898528562655031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6611756400716957158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 48 cols 452 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:50:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6611756400716957158.kers
Total runtime 1 ms.
[2026-05-25 08:50:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 08:50:29] [INFO ] Invariant cache hit.
[2026-05-25 08:50:29] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:50:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-25 08:50:29] [INFO ] Invariant cache hit.
[2026-05-25 08:50:29] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/163 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 112 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2934 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/163 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 114/226 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 227 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11365ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11366ms
Starting structural reductions in LTL mode, iteration 1 : 48/58 places, 115/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11608 ms. Remains : 48/58 places, 115/147 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(p1)||p0)))'
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-02-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Computed a total of 9 stabilizing places and 48 stable transitions
Graph (complete) has 266 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 48 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 41 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 48 ms.
FORMULA MedleyA-PT-02-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-02-LTLCardinality-07 finished in 12396 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(G((X(X(X(p1)))||p0))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 53 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 53 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 50 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 49 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 49 transition count 116
Applied a total of 18 rules in 7 ms. Remains 49 /58 variables (removed 9) and now considering 116/147 (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-4376475938258012868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3033001324518975071.kers'
[2026-05-25 08:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4376475938258012868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3033001324518975071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 49 cols 456 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 08:50:41] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3033001324518975071.kers
Total runtime 1 ms.
[2026-05-25 08:50:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-25 08:50:41] [INFO ] Invariant cache hit.
[2026-05-25 08:50:41] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:50:41] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-25 08:50:41] [INFO ] Invariant cache hit.
[2026-05-25 08:50:41] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/165 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 115 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/165 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 52/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 115/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 232 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11590ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 11590ms
Starting structural reductions in LTL mode, iteration 1 : 49/58 places, 116/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11843 ms. Remains : 49/58 places, 116/147 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(G((X(X(X(p1)))||p0))))))'
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-02-LTLCardinality-08
Product exploration explored 100000 steps with 10020 reset in 203 ms.
Product exploration explored 100000 steps with 9960 reset in 210 ms.
Computed a total of 10 stabilizing places and 49 stable transitions
Graph (complete) has 269 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 49 stable transitions
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (3980 resets) in 479 ms. (83 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (938 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2026-05-25 08:50:54] [INFO ] Invariant cache hit.
[2026-05-25 08:50:54] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/162 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/165 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/162 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/165 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1002 ms.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 116/116 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2026-05-25 08:50:55] [INFO ] Invariant cache hit.
[2026-05-25 08:50:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 08:50:55] [INFO ] Invariant cache hit.
[2026-05-25 08:50:55] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:50:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 49/49 places, 116/116 transitions.
Computed a total of 10 stabilizing places and 49 stable transitions
Graph (complete) has 269 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 49 stable transitions
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (3989 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
BEST_FIRST walk for 37509 steps (849 resets) in 24 ms. (1500 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 429 ms.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 9981 reset in 113 ms.
Product exploration explored 100000 steps with 9976 reset in 158 ms.
Spot run failed in 111 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/ltsmin110816790415780633
[2026-05-25 08:50:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin110816790415780633
Running compilation step : cd /tmp/ltsmin110816790415780633;'/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 390 ms.
Running link step : cd /tmp/ltsmin110816790415780633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin110816790415780633;'/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/stateBased15580388049412876405.hoa' '--buchi-type=spotba'
LTSmin run took 292 ms.
FORMULA MedleyA-PT-02-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-02-LTLCardinality-08 finished in 16019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Graph (complete) has 319 edges and 58 vertex of which 56 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 49 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 49 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 46 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 46 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 44 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 33 place count 39 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 57 place count 39 transition count 101
Applied a total of 57 rules in 10 ms. Remains 39 /58 variables (removed 19) and now considering 101/147 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9349719646053899840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4376375759616065418.kers'
[2026-05-25 08:50:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9349719646053899840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4376375759616065418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 39 cols 408 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:50:57] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4376375759616065418.kers
Total runtime 1 ms.
[2026-05-25 08:50:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 08:50:57] [INFO ] Invariant cache hit.
[2026-05-25 08:50:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 08:50:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2026-05-25 08:50:57] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2026-05-25 08:50:57] [INFO ] Invariant cache hit.
[2026-05-25 08:50:57] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 101/140 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 64 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 101/140 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 95/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 160 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4272 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7418ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/58 places, 101/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7598 ms. Remains : 39/58 places, 101/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLCardinality-09
Stuttering criterion allowed to conclude after 515 steps with 70 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLCardinality-09 finished in 7702 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 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 147/147 transitions.
Graph (complete) has 319 edges and 58 vertex of which 56 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
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 51 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 51 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 48 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 48 transition count 117
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 45 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 33 place count 40 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 61 place count 40 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 39 transition count 121
Applied a total of 63 rules in 32 ms. Remains 39 /58 variables (removed 19) and now considering 121/147 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15533705699684077094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12971601807188331864.kers'
[2026-05-25 08:51:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15533705699684077094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12971601807188331864.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 39 cols 524 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:51:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12971601807188331864.kers
Total runtime 0 ms.
[2026-05-25 08:51:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 08:51:05] [INFO ] Invariant cache hit.
[2026-05-25 08:51:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-25 08:51:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2026-05-25 08:51:05] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 08:51:05] [INFO ] Invariant cache hit.
[2026-05-25 08:51:05] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 121/160 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 61/114 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 114 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3781 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 121/160 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 61/115 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 119/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 234 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10926ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 10927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/58 places, 121/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11119 ms. Remains : 39/58 places, 121/147 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 29 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLCardinality-15
Product exploration explored 100000 steps with 13247 reset in 211 ms.
Product exploration explored 100000 steps with 13243 reset in 204 ms.
Computed a total of 9 stabilizing places and 61 stable transitions
Computed a total of 9 stabilizing places and 61 stable transitions
Knowledge based reduction with 2 factoid took 55 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 150 steps (20 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 66 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 165 ms.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2026-05-25 08:51:16] [INFO ] Invariant cache hit.
[2026-05-25 08:51:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 08:51:17] [INFO ] Invariant cache hit.
[2026-05-25 08:51:17] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-25 08:51:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-25 08:51:17] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 39/39 places, 121/121 transitions.
Computed a total of 9 stabilizing places and 61 stable transitions
Computed a total of 9 stabilizing places and 61 stable transitions
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).
RANDOM walk for 61 steps (8 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 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 35 ms :[(NOT p0)]
Knowledge-based reduction took 183 ms.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13204 reset in 171 ms.
Product exploration explored 100000 steps with 13149 reset in 188 ms.
Built C files in :
/tmp/ltsmin9968885870286518527
[2026-05-25 08:51:17] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2026-05-25 08:51:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:17] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2026-05-25 08:51:17] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:17] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2026-05-25 08:51:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:51:17] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9968885870286518527
Running compilation step : cd /tmp/ltsmin9968885870286518527;'/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 253 ms.
Running link step : cd /tmp/ltsmin9968885870286518527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9968885870286518527;'/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/stateBased18197681252858032543.hoa' '--buchi-type=spotba'
LTSmin run took 1397 ms.
FORMULA MedleyA-PT-02-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-02-LTLCardinality-15 finished in 14294 ms.
All properties solved by simple procedures.
Total runtime 102325 ms.

BK_STOP 1779699079513

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

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