About the Execution of ITS-Tools for DES-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1710.388 | 353384.00 | 473625.00 | 5857.80 | FTFFFTFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DES-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K Mar 6 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 6 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 6 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 DES-PT-05a-LTLFireability-00
FORMULA_NAME DES-PT-05a-LTLFireability-01
FORMULA_NAME DES-PT-05a-LTLFireability-02
FORMULA_NAME DES-PT-05a-LTLFireability-03
FORMULA_NAME DES-PT-05a-LTLFireability-04
FORMULA_NAME DES-PT-05a-LTLFireability-05
FORMULA_NAME DES-PT-05a-LTLFireability-06
FORMULA_NAME DES-PT-05a-LTLFireability-07
FORMULA_NAME DES-PT-05a-LTLFireability-08
FORMULA_NAME DES-PT-05a-LTLFireability-09
FORMULA_NAME DES-PT-05a-LTLFireability-10
FORMULA_NAME DES-PT-05a-LTLFireability-11
FORMULA_NAME DES-PT-05a-LTLFireability-12
FORMULA_NAME DES-PT-05a-LTLFireability-13
FORMULA_NAME DES-PT-05a-LTLFireability-14
FORMULA_NAME DES-PT-05a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779661378323
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 22:23:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 22:23:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:23:01] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-24 22:23:01] [INFO ] Transformed 135 places.
[2026-05-24 22:23:01] [INFO ] Transformed 92 transitions.
[2026-05-24 22:23:01] [INFO ] Found NUPN structural information;
[2026-05-24 22:23:01] [INFO ] Parsed PT model containing 135 places and 92 transitions and 457 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 40 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (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-16470269126928537109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7736802926205487163.kers'
[2026-05-24 22:23:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16470269126928537109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7736802926205487163.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 133 cols 386 entries
Finished phase 1 with 24 SingleSign rule and 51 generalized
[2026-05-24 22:23:01] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7736802926205487163.kers
Total runtime 3 ms.
[2026-05-24 22:23:01] [INFO ] Implicit Places using invariants in 419 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 470 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 539 ms. Remains : 133/135 places, 77/78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (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-5086587498004971974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13584342388940811646.kers'
[2026-05-24 22:23:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5086587498004971974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13584342388940811646.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 133 cols 386 entries
Finished phase 1 with 24 SingleSign rule and 51 generalized
[2026-05-24 22:23:01] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13584342388940811646.kers
Total runtime 1 ms.
[2026-05-24 22:23:02] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-24 22:23:02] [INFO ] Invariant cache hit.
[2026-05-24 22:23:02] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-24 22:23:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5431 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 271 constraints, problems are : Problem set: 0 solved, 76 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35570ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 35592ms
Finished structural reductions in LTL mode , in 1 iterations and 36366 ms. Remains : 133/133 places, 77/77 transitions.
Support contains 64 out of 133 places after structural reductions.
[2026-05-24 22:23:38] [INFO ] Flatten gal took : 76 ms
[2026-05-24 22:23:38] [INFO ] Flatten gal took : 31 ms
[2026-05-24 22:23:38] [INFO ] Input system was already deterministic with 77 transitions.
Support contains 53 out of 133 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (883 resets) in 1215 ms. (32 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40001 steps (175 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
[2026-05-24 22:23:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/74 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/121 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/125 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/201 variables, 125/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/210 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/74 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/121 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/125 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 76/201 variables, 125/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/210 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/210 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 77/77 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 75
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 133 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 132 transition count 74
Applied a total of 9 rules in 48 ms. Remains 132 /133 variables (removed 1) and now considering 74/77 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 132/133 places, 74/77 transitions.
RANDOM walk for 40000 steps (546 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (95 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1237208 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Probabilistic random walk after 1237208 steps, saw 173093 distinct states, run finished after 3009 ms. (steps per millisecond=411 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10187623736191452701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15172854549279694786.kers'
[2026-05-24 22:23:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10187623736191452701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15172854549279694786.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 74 rows 103 cols 279 entries
Finished phase 1 with 54 SingleSign rule and 18 generalized
[2026-05-24 22:23:43] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15172854549279694786.kers
Total runtime 2 ms.
[2026-05-24 22:23:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/43 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/64 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/66 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/99 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/116 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/182 variables, 116/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/194 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/195 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/195 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/195 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/202 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/202 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/202 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/206 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/206 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/206 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/43 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/64 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/66 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/99 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/116 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/182 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/194 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/195 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/195 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/202 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/202 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/202 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/206 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/206 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/206 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 581ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 74/74 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 132/132 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 74/74 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-24 22:23:43] [INFO ] Invariant cache hit.
[2026-05-24 22:23:44] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-24 22:23:44] [INFO ] Invariant cache hit.
[2026-05-24 22:23:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-24 22:23:44] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2026-05-24 22:23:44] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-24 22:23:44] [INFO ] Invariant cache hit.
[2026-05-24 22:23:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 74/205 variables, 131/191 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 200 constraints, problems are : Problem set: 0 solved, 71 unsolved in 8004 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 74/205 variables, 131/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 71/272 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 1/206 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 273 constraints, problems are : Problem set: 0 solved, 71 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28085ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 28087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28824 ms. Remains : 132/132 places, 74/74 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 74
Applied a total of 1 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10934089016393846247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10946588636883569380.kers'
[2026-05-24 22:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10934089016393846247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10946588636883569380.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 74 rows 103 cols 280 entries
Finished phase 1 with 57 SingleSign rule and 15 generalized
[2026-05-24 22:24:12] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10946588636883569380.kers
Total runtime 1 ms.
[2026-05-24 22:24:12] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2026-05-24 22:24:12] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 9 ms returned sat
[2026-05-24 22:24:12] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 22:24:12] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-24 22:24:13] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
FORMULA DES-PT-05a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36 stabilizing places and 31 stable 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) U p1)) U p1) U X(p2))))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (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-15082328191980787771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15895896974508873563.kers'
[2026-05-24 22:24:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15082328191980787771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15895896974508873563.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 133 cols 386 entries
Finished phase 1 with 24 SingleSign rule and 51 generalized
[2026-05-24 22:24:13] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15895896974508873563.kers
Total runtime 2 ms.
[2026-05-24 22:24:13] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 22:24:13] [INFO ] Invariant cache hit.
[2026-05-24 22:24:14] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-24 22:24:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 271 constraints, problems are : Problem set: 0 solved, 76 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35044ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 35045ms
Finished structural reductions in LTL mode , in 1 iterations and 35681 ms. Remains : 133/133 places, 77/77 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) U p1)) U p1) U X(p2))))'
Stuttering acceptance computed with spot in 640 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05a-LTLFireability-00
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 4 ms.
FORMULA DES-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-00 finished in 36487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:49] [INFO ] Invariant cache hit.
[2026-05-24 22:24:50] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-24 22:24:50] [INFO ] Invariant cache hit.
[2026-05-24 22:24:50] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 664 ms.
Product exploration explored 100000 steps with 25000 reset in 431 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 530 steps (9 resets) in 11 ms. (44 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 380 ms.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:52] [INFO ] Invariant cache hit.
[2026-05-24 22:24:52] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-24 22:24:52] [INFO ] Invariant cache hit.
[2026-05-24 22:24:53] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 981 steps (22 resets) in 11 ms. (81 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 281 ms.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 433 ms.
Product exploration explored 100000 steps with 25000 reset in 412 ms.
Spot run failed in 109 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/ltsmin386116815211546027
[2026-05-24 22:24:54] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin386116815211546027
Running compilation step : cd /tmp/ltsmin386116815211546027;'/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 603 ms.
Running link step : cd /tmp/ltsmin386116815211546027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin386116815211546027;'/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/stateBased13930892380434348159.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
FORMULA DES-PT-05a-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05a-LTLFireability-01 finished in 5455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!((F(X(p0))||G(p1)) U X(p1))))) U p1))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:55] [INFO ] Invariant cache hit.
[2026-05-24 22:24:55] [INFO ] Implicit Places using invariants in 262 ms returned []
[2026-05-24 22:24:55] [INFO ] Invariant cache hit.
[2026-05-24 22:24:56] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!((F(X(p0))||G(p1)) U X(p1))))) U p1))'
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), true, p1, p1, p1, true, (AND p1 p0), p0]
Running random walk in product with property : DES-PT-05a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 35564 steps with 798 reset in 230 ms.
FORMULA DES-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-03 finished in 1313 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) U p1)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:56] [INFO ] Invariant cache hit.
[2026-05-24 22:24:56] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 22:24:56] [INFO ] Invariant cache hit.
[2026-05-24 22:24:57] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 133/133 places, 77/77 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) U p1)))'
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DES-PT-05a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-04 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(G((X(p0)||F(p1))))&&F(p2))))'
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:57] [INFO ] Invariant cache hit.
[2026-05-24 22:24:57] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-24 22:24:57] [INFO ] Invariant cache hit.
[2026-05-24 22:24:58] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(G((X(p0)||F(p1))))&&F(p2))))'
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05a-LTLFireability-06
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-06 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X((p1||G(F(p2))))))))'
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:58] [INFO ] Invariant cache hit.
[2026-05-24 22:24:58] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 22:24:58] [INFO ] Invariant cache hit.
[2026-05-24 22:24:59] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X((G(F(p1))||p2))))))'
Stuttering acceptance computed with spot in 655 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05a-LTLFireability-07
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-07 finished in 1371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1))||G(p2))))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:24:59] [INFO ] Invariant cache hit.
[2026-05-24 22:25:00] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 22:25:00] [INFO ] Invariant cache hit.
[2026-05-24 22:25:00] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1))||G(p2))))'
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-05a-LTLFireability-10
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-10 finished in 914 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((G(p1)||p0))))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:25:00] [INFO ] Invariant cache hit.
[2026-05-24 22:25:01] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-24 22:25:01] [INFO ] Invariant cache hit.
[2026-05-24 22:25:01] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2026-05-24 22:25:01] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 133/133 places, 77/77 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05a-LTLFireability-11
Product exploration explored 100000 steps with 2329 reset in 521 ms.
Product exploration explored 100000 steps with 2382 reset in 503 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge based reduction with 9 factoid took 48 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 5711 steps (123 resets) in 27 ms. (203 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 233 ms.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:25:02] [INFO ] Invariant cache hit.
[2026-05-24 22:25:03] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 22:25:03] [INFO ] Invariant cache hit.
[2026-05-24 22:25:03] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2026-05-24 22:25:03] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge based reduction with 9 factoid took 49 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 3236 steps (64 resets) in 23 ms. (134 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 238 ms.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2355 reset in 323 ms.
Product exploration explored 100000 steps with 2350 reset in 631 ms.
Built C files in :
/tmp/ltsmin10798126927205497693
[2026-05-24 22:25:04] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2026-05-24 22:25:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:04] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2026-05-24 22:25:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:04] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2026-05-24 22:25:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10798126927205497693
Running compilation step : cd /tmp/ltsmin10798126927205497693;'/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 313 ms.
Running link step : cd /tmp/ltsmin10798126927205497693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10798126927205497693;'/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/stateBased11234892131946825090.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:25:19] [INFO ] Invariant cache hit.
[2026-05-24 22:25:19] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-24 22:25:19] [INFO ] Invariant cache hit.
[2026-05-24 22:25:20] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2026-05-24 22:25:20] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 133/133 places, 77/77 transitions.
Built C files in :
/tmp/ltsmin9335567786095035777
[2026-05-24 22:25:20] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2026-05-24 22:25:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:20] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2026-05-24 22:25:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:20] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2026-05-24 22:25:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:25:20] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9335567786095035777
Running compilation step : cd /tmp/ltsmin9335567786095035777;'/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 447 ms.
Running link step : cd /tmp/ltsmin9335567786095035777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9335567786095035777;'/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/stateBased13211738442241211009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 22:25:35] [INFO ] Flatten gal took : 14 ms
[2026-05-24 22:25:35] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:25:35] [INFO ] Time to serialize gal into /tmp/LTL14295092053649251893.gal : 4 ms
[2026-05-24 22:25:35] [INFO ] Time to serialize properties into /tmp/LTL3603881874455252178.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14295092053649251893.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17937887685793903487.hoa' '-atoms' '/tmp/LTL3603881874455252178.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3603881874455252178.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17937887685793903487.hoa
Detected timeout of ITS tools.
[2026-05-24 22:25:50] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:25:50] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:25:50] [INFO ] Time to serialize gal into /tmp/LTL15331382473325284159.gal : 3 ms
[2026-05-24 22:25:50] [INFO ] Time to serialize properties into /tmp/LTL11453587248884201579.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15331382473325284159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11453587248884201579.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((("((p33!=1)||(p40!=1))")||(("(p37==1)")||(G("((p31==1)&&(p125==1))"))))||("((p24==1)&&(p44==1))")))))
Formula 0 simplified : G(F!"((p31==1)&&(p125==1))" & FG(!"((p24==1)&&(p44==1))" & !"((p33!=1)||(p40!=1))" & !"(p37==1)"))
Detected timeout of ITS tools.
[2026-05-24 22:26:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:26:05] [INFO ] Applying decomposition
[2026-05-24 22:26:05] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17186704244690999320.txt' '-o' '/tmp/graph17186704244690999320.bin' '-w' '/tmp/graph17186704244690999320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17186704244690999320.bin' '-l' '-1' '-v' '-w' '/tmp/graph17186704244690999320.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:26:06] [INFO ] Decomposing Gal with order
[2026-05-24 22:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:26:06] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-24 22:26:06] [INFO ] Flatten gal took : 91 ms
[2026-05-24 22:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-24 22:26:06] [INFO ] Time to serialize gal into /tmp/LTL5772286093646352376.gal : 6 ms
[2026-05-24 22:26:06] [INFO ] Time to serialize properties into /tmp/LTL16234569278797564466.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5772286093646352376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16234569278797564466.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((("((i2.u5.p33!=1)||(i2.u8.p40!=1))")||(("(i1.u6.p37==1)")||(G("((i4.i2.u4.p31==1)&&(i4.i2.u47.p125==1))"))))||("((i2.u1.p24==1...180
Formula 0 simplified : G(F!"((i4.i2.u4.p31==1)&&(i4.i2.u47.p125==1))" & FG(!"((i2.u1.p24==1)&&(i2.u10.p44==1))" & !"((i2.u5.p33!=1)||(i2.u8.p40!=1))" & !"(...171
Reverse transition relation is NOT exact ! Due to transitions t1, t37, t38, u14.t11, u48.t5, u48.t16, i0.u2.t8, i0.u2.t21, i0.u2.t25, i1.t70, i1.u0.t10, i1...332
Computing Next relation with stutter on 33629 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-05a-LTLFireability-11 finished in 80442 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 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /133 variables (removed 1) and now considering 76/77 (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-7301821789180613643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-757185526713051897.kers'
[2026-05-24 22:26:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7301821789180613643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-757185526713051897.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 4 ms.
// Phase 1: matrix 76 rows 103 cols 267 entries
Finished phase 1 with 57 SingleSign rule and 17 generalized
[2026-05-24 22:26:21] [INFO ] Computed 58 invariants in 5 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-757185526713051897.kers
Total runtime 6 ms.
[2026-05-24 22:26:21] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-24 22:26:21] [INFO ] Invariant cache hit.
[2026-05-24 22:26:21] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2026-05-24 22:26:21] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-24 22:26:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 2/131 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/207 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 194 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4866 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 76/207 variables, 131/193 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 73/266 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 268 constraints, problems are : Problem set: 0 solved, 73 unsolved in 25670 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30553ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 30556ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31129 ms. Remains : 132/133 places, 76/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-12
Stuttering criterion allowed to conclude after 7192 steps with 1236 reset in 18 ms.
FORMULA DES-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-12 finished in 31250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&((!p1 U (G(!p1)||(!p1&&G(!p2)))) U p1)))'
Support contains 13 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (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-2059812980211840219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6988895092525858143.kers'
[2026-05-24 22:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2059812980211840219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6988895092525858143.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 133 cols 386 entries
Finished phase 1 with 24 SingleSign rule and 51 generalized
[2026-05-24 22:26:52] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6988895092525858143.kers
Total runtime 1 ms.
[2026-05-24 22:26:52] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-24 22:26:52] [INFO ] Invariant cache hit.
[2026-05-24 22:26:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-24 22:26:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/210 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4931 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/210 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 271 constraints, problems are : Problem set: 0 solved, 76 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34957ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 34958ms
Finished structural reductions in LTL mode , in 1 iterations and 35344 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&((!p1 U (G(!p1)||(!p1&&G(!p2)))) U p1)))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) p2), p2, (OR (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true, true]
Running random walk in product with property : DES-PT-05a-LTLFireability-13
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-13 finished in 35650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-24 22:27:28] [INFO ] Invariant cache hit.
[2026-05-24 22:27:28] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-24 22:27:28] [INFO ] Invariant cache hit.
[2026-05-24 22:27:28] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2026-05-24 22:27:28] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 133/133 places, 77/77 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-15
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-15 finished in 618 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((G(p1)||p0))))'
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 22:27:28] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9511779116466334962
[2026-05-24 22:27:28] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2026-05-24 22:27:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:27:28] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2026-05-24 22:27:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:27:28] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2026-05-24 22:27:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 22:27:28] [INFO ] Applying decomposition
[2026-05-24 22:27:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9511779116466334962
Running compilation step : cd /tmp/ltsmin9511779116466334962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 22:27:28] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3260008846978386413.txt' '-o' '/tmp/graph3260008846978386413.bin' '-w' '/tmp/graph3260008846978386413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3260008846978386413.bin' '-l' '-1' '-v' '-w' '/tmp/graph3260008846978386413.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:27:29] [INFO ] Decomposing Gal with order
[2026-05-24 22:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:27:29] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-24 22:27:29] [INFO ] Flatten gal took : 48 ms
[2026-05-24 22:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 22:27:29] [INFO ] Time to serialize gal into /tmp/LTLFireability17245355867573526448.gal : 8 ms
[2026-05-24 22:27:29] [INFO ] Time to serialize properties into /tmp/LTLFireability15971980479547833512.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17245355867573526448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15971980479547833512.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((i1.u5.p33!=1)||(i1.u8.p40!=1))||((i2.u6.p37==1)||((i1.u1.p24==1)&&(i1.u10.p44==1))))")||(G("((i13.i1.u4.p31==1)&&(i13.i1.u...174
Formula 0 simplified : G(F!"((i13.i1.u4.p31==1)&&(i13.i1.u47.p125==1))" & FG!"(((i1.u5.p33!=1)||(i1.u8.p40!=1))||((i2.u6.p37==1)||((i1.u1.p24==1)&&(i1.u10....167
Compilation finished in 560 ms.
Running link step : cd /tmp/ltsmin9511779116466334962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9511779116466334962;'/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' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t37, t38, t70, u13.t30, u14.t11, u48.t5, u48.t16, i0.u2.t8, i0.u2.t21, i0.u2.t25, i1.t74,...329
Computing Next relation with stutter on 33629 deadlock states
104 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
7554 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,75.5861,1157608,1,0,2.50889e+06,2667,1763,3.48379e+06,714,10249,1733027
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-05a-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 350998 ms.
BK_STOP 1779661731707
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DES-PT-05a"
export BK_EXAMINATION="LTLFireability"
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 DES-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05a.tgz
mv DES-PT-05a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;
