About the Execution of ITS-Tools for MedleyA-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 646.359 | 128391.00 | 188289.00 | 176.50 | TFTFTFTFFTTFFTFT | normal |
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-177969020000203.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-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 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 46K 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-14-LTLCardinality-00
FORMULA_NAME MedleyA-PT-14-LTLCardinality-01
FORMULA_NAME MedleyA-PT-14-LTLCardinality-02
FORMULA_NAME MedleyA-PT-14-LTLCardinality-03
FORMULA_NAME MedleyA-PT-14-LTLCardinality-04
FORMULA_NAME MedleyA-PT-14-LTLCardinality-05
FORMULA_NAME MedleyA-PT-14-LTLCardinality-06
FORMULA_NAME MedleyA-PT-14-LTLCardinality-07
FORMULA_NAME MedleyA-PT-14-LTLCardinality-08
FORMULA_NAME MedleyA-PT-14-LTLCardinality-09
FORMULA_NAME MedleyA-PT-14-LTLCardinality-10
FORMULA_NAME MedleyA-PT-14-LTLCardinality-11
FORMULA_NAME MedleyA-PT-14-LTLCardinality-12
FORMULA_NAME MedleyA-PT-14-LTLCardinality-13
FORMULA_NAME MedleyA-PT-14-LTLCardinality-14
FORMULA_NAME MedleyA-PT-14-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779700368827
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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:12:50] [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 09:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:12:50] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2026-05-25 09:12:50] [INFO ] Transformed 184 places.
[2026-05-25 09:12:50] [INFO ] Transformed 178 transitions.
[2026-05-25 09:12:50] [INFO ] Found NUPN structural information;
[2026-05-25 09:12:50] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 148
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 151 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 151 transition count 145
Applied a total of 66 rules in 32 ms. Remains 151 /184 variables (removed 33) and now considering 145/178 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10441340001473434185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16111423354890751325.kers'
[2026-05-25 09:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10441340001473434185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16111423354890751325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 151 cols 420 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:12:51] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16111423354890751325.kers
Total runtime 2 ms.
[2026-05-25 09:12:51] [INFO ] Implicit Places using invariants in 408 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 476 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/184 places, 145/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 530 ms. Remains : 150/184 places, 145/178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 145/145 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 145/145 (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-10300453648942826514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9785192622177206895.kers'
[2026-05-25 09:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10300453648942826514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9785192622177206895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 150 cols 418 entries
Finished phase 1 with 119 SingleSign rule and 8 generalized
[2026-05-25 09:12:51] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9785192622177206895.kers
Total runtime 1 ms.
[2026-05-25 09:12:51] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-25 09:12:51] [INFO ] Invariant cache hit.
[2026-05-25 09:12:52] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-25 09:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 19/42 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/44 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 145/295 variables, 150/194 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/194 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 1/195 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/295 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 195 constraints, problems are : Problem set: 5 solved, 139 unsolved in 16154 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 6/150 variables, 16/21 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/23 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 21/44 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 145/295 variables, 150/194 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 139/333 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 5/338 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 1/339 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 1/340 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 2/342 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 3/345 constraints. Problems are: Problem set: 5 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 1/346 constraints. Problems are: Problem set: 5 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 346 constraints, problems are : Problem set: 5 solved, 139 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 139/144 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 46296ms problems are : Problem set: 5 solved, 139 unsolved
Search for dead transitions found 5 dead transitions in 46318ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 150/150 places, 140/145 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 18 ms. Remains 146 /150 variables (removed 4) and now considering 140/140 (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-13080906485418630737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15990299112454818260.kers'
[2026-05-25 09:13:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13080906485418630737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15990299112454818260.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 140 rows 145 cols 394 entries
Finished phase 1 with 117 SingleSign rule and 8 generalized
[2026-05-25 09:13:38] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15990299112454818260.kers
Total runtime 1 ms.
[2026-05-25 09:13:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-25 09:13:38] [INFO ] Invariant cache hit.
[2026-05-25 09:13:39] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/150 places, 140/145 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47470 ms. Remains : 146/150 places, 140/145 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 23 out of 145 places after structural reductions.
[2026-05-25 09:13:39] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:13:39] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:13:39] [INFO ] Input system was already deterministic with 140 transitions.
RANDOM walk for 40000 steps (8 resets) in 1071 ms. (37 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17744262092536171017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-283270045635003541.kers'
[2026-05-25 09:13:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17744262092536171017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-283270045635003541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 145 cols 394 entries
Finished phase 1 with 117 SingleSign rule and 8 generalized
[2026-05-25 09:13:39] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-283270045635003541.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/93 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 32/125 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 130/255 variables, 125/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/283 variables, 18/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/285 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/285 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/93 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 32/125 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 130/255 variables, 125/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 28/283 variables, 18/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/285 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/285 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 175 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1152ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 4655 steps, including 84 resets, run visited all 2 properties in 38 ms. (steps per millisecond=122 )
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 44 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 23 stabilizing places and 23 stable transitions
FORMULA MedleyA-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((F(p0) U ((p0 U p2)||p1))))||G(p3)))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 137 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 137 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 136 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 136 transition count 131
Applied a total of 18 rules in 6 ms. Remains 136 /145 variables (removed 9) and now considering 131/140 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5634896839501561575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3682029124897673044.kers'
[2026-05-25 09:13:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5634896839501561575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3682029124897673044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 136 cols 372 entries
Finished phase 1 with 108 SingleSign rule and 8 generalized
[2026-05-25 09:13:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3682029124897673044.kers
Total runtime 1 ms.
[2026-05-25 09:13:41] [INFO ] Implicit Places using invariants in 75 ms returned [70, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/145 places, 131/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 134/145 places, 131/140 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((F(p0) U ((p0 U p2)||p1))))||G(p3)))))'
Stuttering acceptance computed with spot in 616 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-00
Product exploration explored 100000 steps with 19982 reset in 197 ms.
Product exploration explored 100000 steps with 20079 reset in 149 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 472 ms. (84 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 388 ms. (102 steps per ms) remains 5/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10657920472542961572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10522873354847390.kers'
[2026-05-25 09:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10657920472542961572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10522873354847390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 134 cols 368 entries
Finished phase 1 with 110 SingleSign rule and 6 generalized
[2026-05-25 09:13:42] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10522873354847390.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/37 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/97 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/116 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 122/238 variables, 116/134 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/262 variables, 15/149 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/265 variables, 3/152 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 152 constraints, problems are : Problem set: 1 solved, 4 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/37 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/97 variables, 10/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/116 variables, 5/18 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 122/238 variables, 116/135 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/262 variables, 15/150 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 1/151 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/151 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/265 variables, 3/154 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/155 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/155 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/155 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 155 constraints, problems are : Problem set: 4 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge based reduction with 7 factoid took 199 ms. Proved property starting from automaton with 8 states, 14 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 1446 ms.
FORMULA MedleyA-PT-14-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-00 finished in 2606 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(F(p0))))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 135 transition count 130
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 135 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 134 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 134 transition count 129
Applied a total of 22 rules in 6 ms. Remains 134 /145 variables (removed 11) and now considering 129/140 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-921317791743952228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5573534703225526276.kers'
[2026-05-25 09:13:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-921317791743952228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5573534703225526276.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 134 cols 366 entries
Finished phase 1 with 106 SingleSign rule and 8 generalized
[2026-05-25 09:13:43] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5573534703225526276.kers
Total runtime 1 ms.
[2026-05-25 09:13:43] [INFO ] Implicit Places using invariants in 73 ms returned [70, 105]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/145 places, 129/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 132/145 places, 129/140 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(F(p0))))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-06
Product exploration explored 100000 steps with 16733 reset in 100 ms.
Product exploration explored 100000 steps with 16694 reset in 122 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Detected a total of 19/132 stabilizing places and 19/129 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8440088996379467677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8841738034342616773.kers'
[2026-05-25 09:13:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8440088996379467677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8841738034342616773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 132 cols 362 entries
Finished phase 1 with 108 SingleSign rule and 6 generalized
[2026-05-25 09:13:44] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8841738034342616773.kers
Total runtime 1 ms.
[2026-05-25 09:13:44] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2026-05-25 09:13:44] [INFO ] [Real]Absence check using 13 positive and 5 generalized place invariants in 22 ms returned sat
[2026-05-25 09:13:44] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 09:13:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:13:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-25 09:13:44] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 09:13:44] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 09:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-25 09:13:44] [INFO ] Computed and/alt/rep : 128/230/128 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 09:13:45] [INFO ] Added : 90 causal constraints over 18 iterations in 363 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1151 ms.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 129/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2026-05-25 09:13:45] [INFO ] Invariant cache hit.
[2026-05-25 09:13:45] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:13:45] [INFO ] Invariant cache hit.
[2026-05-25 09:13:45] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-25 09:13:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/261 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 159 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10481 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/261 variables, 132/160 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 128/288 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 297 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 40509ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 40510ms
Finished structural reductions in LTL mode , in 1 iterations and 40737 ms. Remains : 132/132 places, 129/129 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Detected a total of 19/132 stabilizing places and 19/129 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2026-05-25 09:14:26] [INFO ] Invariant cache hit.
[2026-05-25 09:14:26] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-25 09:14:26] [INFO ] [Real]Absence check using 13 positive and 5 generalized place invariants in 20 ms returned sat
[2026-05-25 09:14:26] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 09:14:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:14:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-25 09:14:26] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 09:14:26] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 09:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2026-05-25 09:14:26] [INFO ] Computed and/alt/rep : 128/230/128 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 09:14:27] [INFO ] Added : 90 causal constraints over 18 iterations in 278 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 985 ms.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16620 reset in 138 ms.
Product exploration explored 100000 steps with 16644 reset in 96 ms.
Spot run failed in 102 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/ltsmin1228161676388091552
[2026-05-25 09:14:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1228161676388091552
Running compilation step : cd /tmp/ltsmin1228161676388091552;'/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 505 ms.
Running link step : cd /tmp/ltsmin1228161676388091552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin1228161676388091552;'/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/stateBased17033387485472979971.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA MedleyA-PT-14-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-06 finished in 44831 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 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 144 transition count 133
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 138 transition count 133
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 138 transition count 115
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 120 transition count 115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 111 transition count 106
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 111 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 66 place count 111 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 107 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 106 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 106 transition count 101
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 118 place count 85 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 144 place count 72 transition count 96
Applied a total of 144 rules in 53 ms. Remains 72 /145 variables (removed 73) and now considering 96/140 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17689367855201578339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15684631905446710217.kers'
[2026-05-25 09:14:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17689367855201578339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15684631905446710217.kers]
Normalized transition count is 95 out of 96 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 72 cols 451 entries
Finished phase 1 with 44 SingleSign rule and 8 generalized
[2026-05-25 09:14:28] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15684631905446710217.kers
Total runtime 2 ms.
[2026-05-25 09:14:28] [INFO ] Implicit Places using invariants in 101 ms returned [5, 9, 23, 27, 36, 43, 47, 56]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/145 places, 96/140 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 64 transition count 91
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 59 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 56 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 22 place count 53 transition count 94
Applied a total of 22 rules in 20 ms. Remains 53 /64 variables (removed 11) and now considering 94/96 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5470600215927215442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2323063044528660434.kers'
[2026-05-25 09:14:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5470600215927215442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2323063044528660434.kers]
Normalized transition count is 93 out of 94 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 53 cols 417 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-25 09:14:28] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2323063044528660434.kers
Total runtime 2 ms.
[2026-05-25 09:14:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:14:28] [INFO ] Invariant cache hit.
[2026-05-25 09:14:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 09:14:28] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/145 places, 94/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 53/145 places, 94/140 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 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 485 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2194 steps, run visited all 1 properties in 11 ms. (steps per millisecond=199 )
Probabilistic random walk after 2194 steps, saw 639 distinct states, run finished after 13 ms. (steps per millisecond=168 ) properties seen :1
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 432 ms.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2026-05-25 09:14:29] [INFO ] Invariant cache hit.
[2026-05-25 09:14:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:14:30] [INFO ] Invariant cache hit.
[2026-05-25 09:14:30] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 09:14:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-25 09:14:30] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2026-05-25 09:14:30] [INFO ] Invariant cache hit.
[2026-05-25 09:14:30] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 93/146 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/147 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 78 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 93/146 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 86/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/147 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 165 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9489 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13229ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13459 ms. Remains : 53/53 places, 94/94 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 23373 steps (5 resets) in 52 ms. (441 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 345 ms.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 116 ms.
Built C files in :
/tmp/ltsmin15715547379608753019
[2026-05-25 09:14:44] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2026-05-25 09:14:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:44] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2026-05-25 09:14:44] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:44] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2026-05-25 09:14:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:44] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15715547379608753019
Running compilation step : cd /tmp/ltsmin15715547379608753019;'/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/ltsmin15715547379608753019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15715547379608753019;'/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/stateBased13410851995574513497.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA MedleyA-PT-14-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-07 finished in 16194 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 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 144 transition count 133
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 138 transition count 133
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 138 transition count 115
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 120 transition count 115
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 110 transition count 105
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 110 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 68 place count 110 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 105 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 104 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 104 transition count 99
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 120 place count 84 transition count 79
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 71 transition count 95
Applied a total of 146 rules in 27 ms. Remains 71 /145 variables (removed 74) and now considering 95/140 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2327421734503840741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8136539418970774507.kers'
[2026-05-25 09:14:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2327421734503840741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8136539418970774507.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 94 rows 70 cols 437 entries
Finished phase 1 with 43 SingleSign rule and 8 generalized
[2026-05-25 09:14:44] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8136539418970774507.kers
Total runtime 1 ms.
[2026-05-25 09:14:45] [INFO ] Implicit Places using invariants in 709 ms returned [5, 9, 23, 27, 43, 47, 56]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 722 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/145 places, 95/140 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 64 transition count 92
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 6 place count 61 transition count 92
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 12 place count 58 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 16 place count 56 transition count 93
Applied a total of 16 rules in 6 ms. Remains 56 /64 variables (removed 8) and now considering 93/95 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2697907931103689575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5245822679036037155.kers'
[2026-05-25 09:14:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2697907931103689575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5245822679036037155.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 55 cols 396 entries
Finished phase 1 with 40 SingleSign rule and 3 generalized
[2026-05-25 09:14:45] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5245822679036037155.kers
Total runtime 0 ms.
[2026-05-25 09:14:45] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 09:14:45] [INFO ] Invariant cache hit.
[2026-05-25 09:14:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 09:14:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [10, 24, 41]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 135 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/145 places, 93/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 52 transition count 92
Applied a total of 2 rules in 4 ms. Remains 52 /53 variables (removed 1) and now considering 92/93 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-193202922670907475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1482008088268982030.kers'
[2026-05-25 09:14:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-193202922670907475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1482008088268982030.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 51 cols 351 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-25 09:14:45] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1482008088268982030.kers
Total runtime 1 ms.
[2026-05-25 09:14:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:14:45] [INFO ] Invariant cache hit.
[2026-05-25 09:14:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 09:14:45] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/145 places, 92/140 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1054 ms. Remains : 52/145 places, 92/140 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 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 36672 steps (8 resets) in 143 ms. (254 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 349 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2026-05-25 09:14:46] [INFO ] Invariant cache hit.
[2026-05-25 09:14:46] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 09:14:46] [INFO ] Invariant cache hit.
[2026-05-25 09:14:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 09:14:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2026-05-25 09:14:46] [INFO ] Redundant transitions in 0 ms returned []
Running 84 sub problems to find dead transitions.
[2026-05-25 09:14:46] [INFO ] Invariant cache hit.
[2026-05-25 09:14:46] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 91/143 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 91 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 91/143 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/144 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 178 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5798 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8542ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8542ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8802 ms. Remains : 52/52 places, 92/92 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 30004 steps (6 resets) in 50 ms. (588 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 284 ms.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Built C files in :
/tmp/ltsmin6761644416708089482
[2026-05-25 09:14:55] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2026-05-25 09:14:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:55] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2026-05-25 09:14:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:56] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2026-05-25 09:14:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:14:56] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6761644416708089482
Running compilation step : cd /tmp/ltsmin6761644416708089482;'/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 238 ms.
Running link step : cd /tmp/ltsmin6761644416708089482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6761644416708089482;'/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/stateBased12053917793056539116.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA MedleyA-PT-14-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLCardinality-08 finished in 11617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 136 transition count 131
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 136 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 135 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 135 transition count 130
Applied a total of 20 rules in 7 ms. Remains 135 /145 variables (removed 10) and now considering 130/140 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13021358269282832726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6900415687692790818.kers'
[2026-05-25 09:14:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13021358269282832726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6900415687692790818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 135 cols 368 entries
Finished phase 1 with 107 SingleSign rule and 8 generalized
[2026-05-25 09:14:56] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6900415687692790818.kers
Total runtime 2 ms.
[2026-05-25 09:14:56] [INFO ] Implicit Places using invariants in 150 ms returned [70, 105]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 130/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 133/145 places, 130/140 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-14 finished in 310 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))&&F((p1||G(p2)))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 133
Applied a total of 14 rules in 2 ms. Remains 138 /145 variables (removed 7) and now considering 133/140 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12407369114768671142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7244391569526645518.kers'
[2026-05-25 09:14:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12407369114768671142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7244391569526645518.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 138 cols 376 entries
Finished phase 1 with 110 SingleSign rule and 8 generalized
[2026-05-25 09:14:56] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7244391569526645518.kers
Total runtime 0 ms.
[2026-05-25 09:14:56] [INFO ] Implicit Places using invariants in 117 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/145 places, 133/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 137/145 places, 133/140 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))&&F((p1||G(p2)))))'
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 15 ms. Proved property starting from automaton with 3 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA MedleyA-PT-14-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-15 finished in 519 ms.
All properties solved by simple procedures.
Total runtime 126468 ms.
BK_STOP 1779700497218
--------------------
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-14"
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-14, 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-177969020000203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-14.tgz
mv MedleyA-PT-14 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 '
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 ;
