About the Execution of ITS-Tools for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3497.300 | 1485485.00 | 2326923.00 | 3435.60 | FFTFTFFFTFFFTFTF | 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-177946993700372.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 6 18:26 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.2K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 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 79K 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-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779676556230
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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 02:35:58] [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-25 02:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:35:59] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2026-05-25 02:35:59] [INFO ] Transformed 320 places.
[2026-05-25 02:35:59] [INFO ] Transformed 271 transitions.
[2026-05-25 02:35:59] [INFO ] Found NUPN structural information;
[2026-05-25 02:35:59] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-10b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 297 transition count 251
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 297 transition count 251
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 284 transition count 238
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 284 transition count 238
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 284 transition count 229
Applied a total of 78 rules in 173 ms. Remains 284 /320 variables (removed 36) and now considering 229/271 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-198028450902469134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-66146101258102593.kers'
[2026-05-25 02:35:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-198028450902469134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-66146101258102593.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 284 cols 719 entries
Finished phase 1 with 150 SingleSign rule and 72 generalized
[2026-05-25 02:35:59] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-66146101258102593.kers
Total runtime 6 ms.
[2026-05-25 02:36:00] [INFO ] Implicit Places using invariants in 822 ms returned []
[2026-05-25 02:36:00] [INFO ] Invariant cache hit.
[2026-05-25 02:36:01] [INFO ] Implicit Places using invariants and state equation in 577 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1474 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 283/320 places, 229/271 transitions.
Applied a total of 0 rules in 13 ms. Remains 283 /283 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1691 ms. Remains : 283/320 places, 229/271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Applied a total of 0 rules in 15 ms. Remains 283 /283 variables (removed 0) and now considering 229/229 (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-1063607247693247205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10271779316867388278.kers'
[2026-05-25 02:36:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1063607247693247205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10271779316867388278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 283 cols 717 entries
Finished phase 1 with 159 SingleSign rule and 63 generalized
[2026-05-25 02:36:01] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10271779316867388278.kers
Total runtime 4 ms.
[2026-05-25 02:36:01] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-25 02:36:01] [INFO ] Invariant cache hit.
[2026-05-25 02:36:02] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-25 02:36:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 229/512 variables, 283/346 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 16/362 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 382 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (OVERLAPS) 229/512 variables, 283/415 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 228/643 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 643 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in LTL mode , in 1 iterations and 61486 ms. Remains : 283/283 places, 229/229 transitions.
Support contains 61 out of 283 places after structural reductions.
[2026-05-25 02:37:03] [INFO ] Flatten gal took : 112 ms
[2026-05-25 02:37:03] [INFO ] Flatten gal took : 50 ms
[2026-05-25 02:37:03] [INFO ] Input system was already deterministic with 229 transitions.
RANDOM walk for 40000 steps (347 resets) in 2264 ms. (17 steps per ms) remains 6/34 properties
BEST_FIRST walk for 40003 steps (52 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
[2026-05-25 02:37:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/172 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 89/261 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/267 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 216/483 variables, 267/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 19/502 variables, 11/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/508 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/510 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/512 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/512 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/512 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 344 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/172 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 89/261 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/267 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 216/483 variables, 267/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 19/502 variables, 11/363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 6413ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6617 ms.
Support contains 9 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 208
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 262 transition count 207
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 262 transition count 196
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 251 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 246 transition count 191
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 246 transition count 191
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 242 transition count 187
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 242 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 242 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 80 place count 242 transition count 181
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 240 transition count 181
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 232 place count 166 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 164 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 164 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 163 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 162 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 161 transition count 107
Applied a total of 240 rules in 102 ms. Remains 161 /283 variables (removed 122) and now considering 107/229 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 161/283 places, 107/229 transitions.
RANDOM walk for 40000 steps (1736 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (338 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (313 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (329 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (319 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (356 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (316 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 337185 steps, run visited all 6 properties in 2261 ms. (steps per millisecond=149 )
Probabilistic random walk after 337185 steps, saw 79505 distinct states, run finished after 2267 ms. (steps per millisecond=148 ) properties seen :6
Computed a total of 97 stabilizing places and 90 stable transitions
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 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 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 277 transition count 210
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 262 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 262 transition count 198
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 251 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 246 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 246 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 242 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 242 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 240 transition count 183
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 228 place count 166 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 232 place count 164 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 162 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 235 place count 161 transition count 109
Applied a total of 235 rules in 100 ms. Remains 161 /283 variables (removed 122) and now considering 109/229 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12387678859432120046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9830965780515677497.kers'
[2026-05-25 02:37:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12387678859432120046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9830965780515677497.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 109 rows 151 cols 460 entries
Finished phase 1 with 55 SingleSign rule and 48 generalized
[2026-05-25 02:37:20] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9830965780515677497.kers
Total runtime 4 ms.
[2026-05-25 02:37:21] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-25 02:37:21] [INFO ] Invariant cache hit.
[2026-05-25 02:37:21] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2026-05-25 02:37:21] [INFO ] Redundant transitions in 5 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-25 02:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 2/160 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 109/269 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 232 constraints, problems are : Problem set: 0 solved, 105 unsolved in 21182 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/158 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 2/160 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 109/269 variables, 160/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 105/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 337 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51248ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 51251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/283 places, 109/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52181 ms. Remains : 161/283 places, 109/229 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 373 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-00
Stuttering criterion allowed to conclude after 82 steps with 3 reset in 8 ms.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-00 finished in 52695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 277 transition count 210
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 262 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 262 transition count 198
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 251 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 246 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 246 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 242 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 242 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 242 transition count 183
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 240 transition count 183
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 232 place count 164 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 162 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 160 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 159 transition count 107
Applied a total of 239 rules in 126 ms. Remains 159 /283 variables (removed 124) and now considering 107/229 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3768517338424729697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13659710952556744334.kers'
[2026-05-25 02:38:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3768517338424729697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13659710952556744334.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 107 rows 131 cols 400 entries
Finished phase 1 with 72 SingleSign rule and 29 generalized
[2026-05-25 02:38:13] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13659710952556744334.kers
Total runtime 2 ms.
[2026-05-25 02:38:13] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-25 02:38:13] [INFO ] Invariant cache hit.
[2026-05-25 02:38:14] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2026-05-25 02:38:14] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-25 02:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/158 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 107/265 variables, 158/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/266 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 220 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9806 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 2/158 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 107/265 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 104/323 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/266 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 324 constraints, problems are : Problem set: 0 solved, 104 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39883ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 39909ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/283 places, 107/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40625 ms. Remains : 159/283 places, 107/229 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-01 finished in 40728 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 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 211
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 263 transition count 210
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 263 transition count 199
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 252 transition count 199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 247 transition count 194
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 247 transition count 194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 243 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 243 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 243 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 74 place count 243 transition count 184
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 241 transition count 184
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 230 place count 165 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 160 transition count 108
Applied a total of 237 rules in 90 ms. Remains 160 /283 variables (removed 123) and now considering 108/229 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16707894524525932496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14717192113513860465.kers'
[2026-05-25 02:38:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16707894524525932496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14717192113513860465.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 108 rows 131 cols 397 entries
Finished phase 1 with 76 SingleSign rule and 26 generalized
[2026-05-25 02:38:54] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14717192113513860465.kers
Total runtime 2 ms.
[2026-05-25 02:38:54] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 02:38:54] [INFO ] Invariant cache hit.
[2026-05-25 02:38:55] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2026-05-25 02:38:55] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-25 02:38:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/159 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/267 variables, 159/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/268 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 224 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13258 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 2/159 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/267 variables, 159/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 105/328 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/268 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 329 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43300ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 43302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/283 places, 108/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44193 ms. Remains : 160/283 places, 108/229 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 58 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-02
Product exploration explored 100000 steps with 9123 reset in 530 ms.
Product exploration explored 100000 steps with 9047 reset in 428 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 45 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2026-05-25 02:39:39] [INFO ] Invariant cache hit.
[2026-05-25 02:39:39] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2026-05-25 02:39:39] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 22 ms returned sat
[2026-05-25 02:39:39] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2026-05-25 02:39:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:39:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2026-05-25 02:39:40] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 19 ms returned sat
[2026-05-25 02:39:40] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2026-05-25 02:39:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-25 02:39:40] [INFO ] Computed and/alt/rep : 94/196/94 causal constraints (skipped 11 transitions) in 11 ms.
[2026-05-25 02:39:40] [INFO ] Added : 80 causal constraints over 16 iterations in 387 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1496 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-25 02:39:40] [INFO ] Invariant cache hit.
[2026-05-25 02:39:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-25 02:39:41] [INFO ] Invariant cache hit.
[2026-05-25 02:39:41] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2026-05-25 02:39:41] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 160/160 places, 108/108 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2026-05-25 02:39:41] [INFO ] Invariant cache hit.
[2026-05-25 02:39:42] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2026-05-25 02:39:42] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 34 ms returned sat
[2026-05-25 02:39:42] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2026-05-25 02:39:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:39:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2026-05-25 02:39:42] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 27 ms returned sat
[2026-05-25 02:39:43] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2026-05-25 02:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2026-05-25 02:39:43] [INFO ] Computed and/alt/rep : 94/196/94 causal constraints (skipped 11 transitions) in 11 ms.
[2026-05-25 02:39:43] [INFO ] Added : 80 causal constraints over 16 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1991 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9065 reset in 399 ms.
Product exploration explored 100000 steps with 9038 reset in 360 ms.
Built C files in :
/tmp/ltsmin17199464519254543307
[2026-05-25 02:39:44] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2026-05-25 02:39:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:39:44] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2026-05-25 02:39:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:39:44] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2026-05-25 02:39:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:39:44] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17199464519254543307
Running compilation step : cd /tmp/ltsmin17199464519254543307;'/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 579 ms.
Running link step : cd /tmp/ltsmin17199464519254543307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin17199464519254543307;'/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/stateBased15872432527598655518.hoa' '--buchi-type=spotba'
LTSmin run took 710 ms.
FORMULA DES-PT-10b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-02 finished in 51907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((p1&&X(X(p2)))))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 278 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 278 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 278 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 275 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 275 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 275 transition count 217
Applied a total of 20 rules in 22 ms. Remains 275 /283 variables (removed 8) and now considering 217/229 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-802618541026675973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13267957638209958314.kers'
[2026-05-25 02:39:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-802618541026675973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13267957638209958314.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 275 cols 687 entries
Finished phase 1 with 151 SingleSign rule and 63 generalized
[2026-05-25 02:39:46] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13267957638209958314.kers
Total runtime 3 ms.
[2026-05-25 02:39:46] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-25 02:39:46] [INFO ] Invariant cache hit.
[2026-05-25 02:39:47] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 02:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/492 variables, 275/336 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 366 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 217/492 variables, 275/383 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 216/599 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 605 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 275/283 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61171 ms. Remains : 275/283 places, 217/229 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((p1&&X(X(p2)))))))'
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 61581 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(p0)||(p1 U (p2||G(p1)))))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 211
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 263 transition count 210
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 263 transition count 200
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 253 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 248 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 248 transition count 195
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 244 transition count 191
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 244 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 72 place count 244 transition count 185
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 242 transition count 185
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 224 place count 168 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 166 transition count 113
Applied a total of 228 rules in 69 ms. Remains 166 /283 variables (removed 117) and now considering 113/229 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16402619094920665457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-258185992226454682.kers'
[2026-05-25 02:40:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16402619094920665457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-258185992226454682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 166 cols 556 entries
Finished phase 1 with 37 SingleSign rule and 70 generalized
[2026-05-25 02:40:47] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-258185992226454682.kers
Total runtime 2 ms.
[2026-05-25 02:40:48] [INFO ] Implicit Places using invariants in 311 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/283 places, 113/229 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 165/283 places, 113/229 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(p0)||(p1 U (p2||G(p1)))))'
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-04
Product exploration explored 100000 steps with 16470 reset in 716 ms.
Product exploration explored 100000 steps with 16496 reset in 538 ms.
Computed a total of 60 stabilizing places and 55 stable transitions
Computed a total of 60 stabilizing places and 55 stable transitions
Detected a total of 60/165 stabilizing places and 55/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 14 factoid took 224 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (1674 resets) in 466 ms. (85 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (388 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-161727271471018136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1124665627682887863.kers'
[2026-05-25 02:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-161727271471018136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1124665627682887863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 165 cols 555 entries
Finished phase 1 with 37 SingleSign rule and 70 generalized
[2026-05-25 02:40:49] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1124665627682887863.kers
Total runtime 3 ms.
[2026-05-25 02:40:49] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/74 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/145 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/149 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 113/262 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 278/278 variables, and 229 constraints, problems are : Problem set: 1 solved, 0 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 165/165 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 395 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Knowledge-based reduction took 1233 ms.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 113/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 165 /165 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2026-05-25 02:40:50] [INFO ] Invariant cache hit.
[2026-05-25 02:40:51] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-25 02:40:51] [INFO ] Invariant cache hit.
[2026-05-25 02:40:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 02:40:51] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2026-05-25 02:40:51] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-25 02:40:51] [INFO ] Invariant cache hit.
[2026-05-25 02:40:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 113/277 variables, 164/222 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/278 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 234 constraints, problems are : Problem set: 0 solved, 111 unsolved in 11240 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 165/165 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 113/277 variables, 164/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 111/345 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/278 variables, and 349 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 164/165 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41286ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 41287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42108 ms. Remains : 165/165 places, 113/113 transitions.
Computed a total of 60 stabilizing places and 55 stable transitions
Computed a total of 60 stabilizing places and 55 stable transitions
Detected a total of 60/165 stabilizing places and 55/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 14 factoid took 194 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (1684 resets) in 193 ms. (206 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (382 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2026-05-25 02:41:33] [INFO ] Invariant cache hit.
[2026-05-25 02:41:33] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/74 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/145 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/149 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 113/262 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 278/278 variables, and 229 constraints, problems are : Problem set: 1 solved, 0 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 165/165 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 370 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Knowledge-based reduction took 1011 ms.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 16498 reset in 543 ms.
Product exploration explored 100000 steps with 16498 reset in 532 ms.
Built C files in :
/tmp/ltsmin4447502444743830332
[2026-05-25 02:41:35] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2026-05-25 02:41:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:41:35] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2026-05-25 02:41:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:41:35] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2026-05-25 02:41:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:41:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4447502444743830332
Running compilation step : cd /tmp/ltsmin4447502444743830332;'/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 543 ms.
Running link step : cd /tmp/ltsmin4447502444743830332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4447502444743830332;'/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/stateBased847681344955094979.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA DES-PT-10b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-04 finished in 48597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Graph (complete) has 550 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 277 transition count 210
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 262 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 262 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 251 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 246 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 246 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 242 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 242 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 240 transition count 183
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 226 place count 167 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 165 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 163 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 162 transition count 110
Applied a total of 233 rules in 65 ms. Remains 162 /283 variables (removed 121) and now considering 110/229 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10617320450627457180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12631475294481091488.kers'
[2026-05-25 02:41:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10617320450627457180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12631475294481091488.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 110 rows 155 cols 501 entries
Finished phase 1 with 48 SingleSign rule and 56 generalized
[2026-05-25 02:41:36] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12631475294481091488.kers
Total runtime 2 ms.
[2026-05-25 02:41:36] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-25 02:41:36] [INFO ] Invariant cache hit.
[2026-05-25 02:41:37] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2026-05-25 02:41:37] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-25 02:41:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/160 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 110/271 variables, 161/219 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 1/272 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 223 constraints, problems are : Problem set: 0 solved, 107 unsolved in 12628 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 110/271 variables, 161/226 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 107/333 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/272 variables, and 335 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 161/162 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42660ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 42661ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/283 places, 110/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43490 ms. Remains : 162/283 places, 110/229 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 43637 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)||(X(X(X(p1)))&&F((p2 U (p3||G(p2)))))))'
Support contains 10 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 277 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 277 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 273 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 273 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 273 transition count 214
Applied a total of 25 rules in 15 ms. Remains 273 /283 variables (removed 10) and now considering 214/229 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11749589646628096007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12869355735407990389.kers'
[2026-05-25 02:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11749589646628096007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12869355735407990389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 273 cols 679 entries
Finished phase 1 with 150 SingleSign rule and 62 generalized
[2026-05-25 02:42:19] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12869355735407990389.kers
Total runtime 3 ms.
[2026-05-25 02:42:20] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-25 02:42:20] [INFO ] Invariant cache hit.
[2026-05-25 02:42:20] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 02:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/487 variables, 273/335 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 17/364 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 10/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 214/487 variables, 273/395 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 213/608 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 608 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 273/283 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 273/283 places, 214/229 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(X(X(p1)))&&F((p2 U (p3||G(p2)))))))'
Stuttering acceptance computed with spot in 321 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 165 ms.
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/273 stabilizing places and 89/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 12 factoid took 103 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 3976 steps (31 resets) in 19 ms. (198 steps per ms) remains 0/3 properties
Knowledge based reduction with 12 factoid took 142 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-25 02:43:21] [INFO ] Invariant cache hit.
[2026-05-25 02:43:22] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2026-05-25 02:43:22] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 32 ms returned sat
[2026-05-25 02:43:22] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2026-05-25 02:43:22] [INFO ] Computed and/alt/rep : 208/383/208 causal constraints (skipped 5 transitions) in 22 ms.
[2026-05-25 02:43:22] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1251 ms.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 02:43:22] [INFO ] Invariant cache hit.
[2026-05-25 02:43:23] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 02:43:23] [INFO ] Invariant cache hit.
[2026-05-25 02:43:23] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1062 ms. Remains : 273/273 places, 214/214 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/273 stabilizing places and 89/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 3440 steps (26 resets) in 15 ms. (215 steps per ms) remains 0/3 properties
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-25 02:43:24] [INFO ] Invariant cache hit.
[2026-05-25 02:43:24] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-25 02:43:24] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 28 ms returned sat
[2026-05-25 02:43:24] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2026-05-25 02:43:24] [INFO ] Computed and/alt/rep : 208/383/208 causal constraints (skipped 5 transitions) in 23 ms.
[2026-05-25 02:43:25] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1113 ms.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Spot run failed in 151 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/ltsmin3329439851415037353
[2026-05-25 02:43:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3329439851415037353
Running compilation step : cd /tmp/ltsmin3329439851415037353;'/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 891 ms.
Running link step : cd /tmp/ltsmin3329439851415037353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3329439851415037353;'/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/stateBased11371133146430246984.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA DES-PT-10b-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-08 finished in 67171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U p0))))'
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 278 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 278 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 278 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 274 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 274 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 274 transition count 215
Applied a total of 23 rules in 25 ms. Remains 274 /283 variables (removed 9) and now considering 215/229 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15207018976884099443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17856134035408627174.kers'
[2026-05-25 02:43:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15207018976884099443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17856134035408627174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 274 cols 681 entries
Finished phase 1 with 151 SingleSign rule and 62 generalized
[2026-05-25 02:43:27] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17856134035408627174.kers
Total runtime 4 ms.
[2026-05-25 02:43:27] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-25 02:43:27] [INFO ] Invariant cache hit.
[2026-05-25 02:43:28] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-25 02:43:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/489 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 16/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 11/402 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/489 variables, and 402 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 67/128 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 215/489 variables, 274/409 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 214/623 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 627 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 274/283 places, 215/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61252 ms. Remains : 274/283 places, 215/229 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(G(p0)) U p0))))'
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-09
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-09 finished in 61489 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(p1)&&p0) U p2)||G(p3)))&&F(p3)))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 278 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 278 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 278 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 275 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 275 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 275 transition count 217
Applied a total of 20 rules in 22 ms. Remains 275 /283 variables (removed 8) and now considering 217/229 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4078432790479688923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15678209742588815727.kers'
[2026-05-25 02:44:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4078432790479688923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15678209742588815727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 275 cols 687 entries
Finished phase 1 with 151 SingleSign rule and 63 generalized
[2026-05-25 02:44:28] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15678209742588815727.kers
Total runtime 4 ms.
[2026-05-25 02:44:28] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-25 02:44:28] [INFO ] Invariant cache hit.
[2026-05-25 02:44:29] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 02:44:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/492 variables, 275/336 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 30052ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30054ms
Starting structural reductions in LTL mode, iteration 1 : 275/283 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30991 ms. Remains : 275/283 places, 217/229 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(p1)&&p0) U p2)||G(p3)))&&F(p3)))'
Stuttering acceptance computed with spot in 400 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-10 finished in 31451 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(X(X(p0))))||!(X(F(p1)) U !p2))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 277 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 277 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 273 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 273 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 273 transition count 214
Applied a total of 25 rules in 21 ms. Remains 273 /283 variables (removed 10) and now considering 214/229 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12785159095653517547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7551394784109865702.kers'
[2026-05-25 02:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12785159095653517547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7551394784109865702.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 273 cols 679 entries
Finished phase 1 with 150 SingleSign rule and 62 generalized
[2026-05-25 02:45:00] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7551394784109865702.kers
Total runtime 3 ms.
[2026-05-25 02:45:00] [INFO ] Implicit Places using invariants in 406 ms returned []
[2026-05-25 02:45:00] [INFO ] Invariant cache hit.
[2026-05-25 02:45:01] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 02:45:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/487 variables, 273/335 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 17/364 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 368 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 214/487 variables, 273/381 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 213/594 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 601 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 273/283 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61272 ms. Remains : 273/283 places, 214/229 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(X(X(p0))))||!(X(F(p1)) U !p2))))'
Stuttering acceptance computed with spot in 852 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) p1), p1, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-11 finished in 62183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(X(F(p0)))&&(X(!p1) U ((p0&&X(!p1))||X(G(!p1)))))||X((G(F(p0))||p2))))))'
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 277 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 277 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 273 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 273 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 273 transition count 214
Applied a total of 25 rules in 24 ms. Remains 273 /283 variables (removed 10) and now considering 214/229 (removed 15) transitions.
[2026-05-25 02:46:02] [INFO ] Invariant cache hit.
[2026-05-25 02:46:02] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-25 02:46:02] [INFO ] Invariant cache hit.
[2026-05-25 02:46:03] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 273/283 places, 214/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1235 ms. Remains : 273/283 places, 214/229 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G(F(p1))||p0))||(X(X(F(p1)))&&(X(!p2) U ((p1&&X(!p2))||X(G(!p2)))))))))'
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : DES-PT-10b-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Product exploration explored 100000 steps with 33333 reset in 195 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 527 edges and 273 vertex of which 268 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/273 stabilizing places and 89/214 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 12 factoid took 108 ms. Proved property starting from automaton with 7 states, 15 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 121 ms.
FORMULA DES-PT-10b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-12 finished in 2174 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(p1))&&(p2||G(p3)))))'
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 279 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 279 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 276 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 276 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 276 transition count 219
Applied a total of 17 rules in 23 ms. Remains 276 /283 variables (removed 7) and now considering 219/229 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4208979393880016951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3872653101497731359.kers'
[2026-05-25 02:46:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4208979393880016951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3872653101497731359.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 276 cols 691 entries
Finished phase 1 with 153 SingleSign rule and 62 generalized
[2026-05-25 02:46:04] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3872653101497731359.kers
Total runtime 4 ms.
[2026-05-25 02:46:04] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-25 02:46:04] [INFO ] Invariant cache hit.
[2026-05-25 02:46:05] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 02:46:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/495 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 11/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 218 unsolved
SMT process timed out in 30026ms, After SMT, problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 30027ms
Starting structural reductions in LTL mode, iteration 1 : 276/283 places, 219/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31122 ms. Remains : 276/283 places, 219/229 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(p1))&&(p2||G(p3)))))'
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : DES-PT-10b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-13 finished in 31376 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 G((X(X(F(!X(G((p0 U p1))))))||p2))))'
Support contains 8 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 229/229 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 278 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 278 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 278 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 275 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 275 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 275 transition count 217
Applied a total of 20 rules in 17 ms. Remains 275 /283 variables (removed 8) and now considering 217/229 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11754993444741707778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3620857782863456955.kers'
[2026-05-25 02:46:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11754993444741707778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3620857782863456955.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 275 cols 687 entries
Finished phase 1 with 152 SingleSign rule and 62 generalized
[2026-05-25 02:46:35] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3620857782863456955.kers
Total runtime 3 ms.
[2026-05-25 02:46:36] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-25 02:46:36] [INFO ] Invariant cache hit.
[2026-05-25 02:46:36] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 02:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 217/492 variables, 275/366 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 11/377 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 381 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 217/492 variables, 275/384 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 216/600 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 609 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 275/283 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61040 ms. Remains : 275/283 places, 217/229 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 G((X(X(F(!X(G((p0 U p1))))))||p2))))'
Stuttering acceptance computed with spot in 393 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-15
Product exploration explored 100000 steps with 20026 reset in 108 ms.
Product exploration explored 100000 steps with 19936 reset in 114 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 532 edges and 275 vertex of which 270 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge based reduction with 11 factoid took 76 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 6202 steps (52 resets) in 20 ms. (295 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[p1, p1, (AND p1 (NOT p2)), p1, p1]
Knowledge-based reduction took 407 ms.
Stuttering acceptance computed with spot in 227 ms :[p1, p1, (AND p1 (NOT p2)), p1, p1]
Support contains 8 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 217/217 transitions.
Applied a total of 0 rules in 5 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 02:47:38] [INFO ] Invariant cache hit.
[2026-05-25 02:47:38] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-25 02:47:38] [INFO ] Invariant cache hit.
[2026-05-25 02:47:39] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1007 ms. Remains : 275/275 places, 217/217 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 532 edges and 275 vertex of which 270 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 6804 steps (58 resets) in 32 ms. (206 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[p1, p1, (AND p1 (NOT p2)), p1, p1]
Knowledge-based reduction took 507 ms.
Stuttering acceptance computed with spot in 265 ms :[p1, p1, (AND p1 (NOT p2)), p1, p1]
Stuttering acceptance computed with spot in 261 ms :[p1, p1, (AND p1 (NOT p2)), p1, p1]
Product exploration explored 100000 steps with 20034 reset in 156 ms.
Product exploration explored 100000 steps with 19976 reset in 176 ms.
Spot run failed in 84 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/ltsmin12493054141247796301
[2026-05-25 02:47:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12493054141247796301
Running compilation step : cd /tmp/ltsmin12493054141247796301;'/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 862 ms.
Running link step : cd /tmp/ltsmin12493054141247796301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12493054141247796301;'/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/stateBased8144492817752310036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 02:47:55] [INFO ] Invariant cache hit.
[2026-05-25 02:47:55] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-25 02:47:55] [INFO ] Invariant cache hit.
[2026-05-25 02:47:56] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 275/275 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin14248601782562644994
[2026-05-25 02:47:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14248601782562644994
Running compilation step : cd /tmp/ltsmin14248601782562644994;'/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 628 ms.
Running link step : cd /tmp/ltsmin14248601782562644994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14248601782562644994;'/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/stateBased18065085751937654002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 02:48:11] [INFO ] Flatten gal took : 17 ms
[2026-05-25 02:48:11] [INFO ] Flatten gal took : 16 ms
[2026-05-25 02:48:11] [INFO ] Time to serialize gal into /tmp/LTL6115453133347190502.gal : 5 ms
[2026-05-25 02:48:11] [INFO ] Time to serialize properties into /tmp/LTL17577048184491164993.prop : 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/LTL6115453133347190502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18317470419202548232.hoa' '-atoms' '/tmp/LTL17577048184491164993.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/LTL17577048184491164993.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18317470419202548232.hoa
Detected timeout of ITS tools.
[2026-05-25 02:48:26] [INFO ] Flatten gal took : 16 ms
[2026-05-25 02:48:26] [INFO ] Flatten gal took : 15 ms
[2026-05-25 02:48:26] [INFO ] Time to serialize gal into /tmp/LTL7366077789041683768.gal : 3 ms
[2026-05-25 02:48:26] [INFO ] Time to serialize properties into /tmp/LTL16118634811991118574.ltl : 6 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/LTL7366077789041683768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16118634811991118574.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...276
Read 1 LTL properties
Checking formula 0 : !((("(p96==1)")U(G((X(X(F(!(X(G(("(p96==1)")U("(p225==1)"))))))))||("((((p56==1)&&(p63==1))&&((p85==1)&&(p87==1)))&&((p95==1)&&(p106==...165
Formula 0 simplified : !"(p96==1)" R F(!"((((p56==1)&&(p63==1))&&((p85==1)&&(p87==1)))&&((p95==1)&&(p106==1)))" & XXXG("(p96==1)" U "(p225==1)"))
Detected timeout of ITS tools.
[2026-05-25 02:48:42] [INFO ] Flatten gal took : 19 ms
[2026-05-25 02:48:42] [INFO ] Applying decomposition
[2026-05-25 02:48:42] [INFO ] Flatten gal took : 14 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/graph12236523470419703608.txt' '-o' '/tmp/graph12236523470419703608.bin' '-w' '/tmp/graph12236523470419703608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12236523470419703608.bin' '-l' '-1' '-v' '-w' '/tmp/graph12236523470419703608.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:48:42] [INFO ] Decomposing Gal with order
[2026-05-25 02:48:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:48:42] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 02:48:42] [INFO ] Flatten gal took : 138 ms
[2026-05-25 02:48:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2026-05-25 02:48:42] [INFO ] Time to serialize gal into /tmp/LTL10534200908430255984.gal : 8 ms
[2026-05-25 02:48:42] [INFO ] Time to serialize properties into /tmp/LTL14506559921287240529.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/LTL10534200908430255984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14506559921287240529.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...256
Read 1 LTL properties
Checking formula 0 : !((("(i3.u13.p96==1)")U(G((X(X(F(!(X(G(("(i3.u13.p96==1)")U("(i8.u50.p225==1)"))))))))||("((((i1.u6.p56==1)&&(i1.u7.p63==1))&&((i2.u8....225
Formula 0 simplified : !"(i3.u13.p96==1)" R F(!"((((i1.u6.p56==1)&&(i1.u7.p63==1))&&((i2.u8.p85==1)&&(i1.u11.p87==1)))&&((i3.u13.p95==1)&&(i3.u15.p106==1))...205
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t62, t91, t169, t188, t189, t221, u33.t76, u76.t17, u76.t150, i0.u31.t79, i1.t130, i...778
Computing Next relation with stutter on 9.60346e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLFireability-15 finished in 141750 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 G((X(X(F(!X(G((p0 U p1))))))||p2))))'
Spot run failed in 87 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-25 02:48:57] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5687811812026974935
[2026-05-25 02:48:57] [INFO ] Computing symmetric may disable matrix : 229 transitions.
[2026-05-25 02:48:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:48:57] [INFO ] Computing symmetric may enable matrix : 229 transitions.
[2026-05-25 02:48:57] [INFO ] Applying decomposition
[2026-05-25 02:48:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:48:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 02:48:57] [INFO ] Computing Do-Not-Accords matrix : 229 transitions.
[2026-05-25 02:48:57] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:48:57] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5687811812026974935
Running compilation step : cd /tmp/ltsmin5687811812026974935;'/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'
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/graph17431496196013164496.txt' '-o' '/tmp/graph17431496196013164496.bin' '-w' '/tmp/graph17431496196013164496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17431496196013164496.bin' '-l' '-1' '-v' '-w' '/tmp/graph17431496196013164496.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:48:57] [INFO ] Decomposing Gal with order
[2026-05-25 02:48:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:48:57] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 02:48:57] [INFO ] Flatten gal took : 28 ms
[2026-05-25 02:48:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-05-25 02:48:57] [INFO ] Time to serialize gal into /tmp/LTLFireability17954698265823772830.gal : 7 ms
[2026-05-25 02:48:57] [INFO ] Time to serialize properties into /tmp/LTLFireability4983048421918476384.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/LTLFireability17954698265823772830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4983048421918476384.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...277
Read 1 LTL properties
Checking formula 0 : !((("(i10.u14.p96==1)")U(G((X(X(F(!(X(G(("(i10.u14.p96==1)")U("(i9.u49.p225==1)"))))))))||("((((i1.u7.p56==1)&&(i1.u8.p63==1))&&((i2.u...229
Formula 0 simplified : !"(i10.u14.p96==1)" R F(!"((((i1.u7.p56==1)&&(i1.u8.p63==1))&&((i2.u11.p85==1)&&(i1.u12.p87==1)))&&((i10.u14.p95==1)&&(i6.u16.p106==...209
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin5687811812026974935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5687811812026974935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((LTLAPp0==true) U []((X(X(<>(!X([](((LTLAPp0==true) U (LTLAPp1==true)))))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t188, t189, t221, u32.t79, u34.t76, i1.t130, i1.u7.t135, i1.u7.t136, i1.u8.t132, i1....800
Computing Next relation with stutter on 1.97944e+07 deadlock states
9 unique states visited
6 strongly connected components in search stack
9 transitions explored
6 items max in DFS search stack
69341 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,693.471,2759704,1,0,6.01663e+06,11590,1388,5.45424e+06,445,71861,3187889
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1483030 ms.
BK_STOP 1779678041715
--------------------
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-10b"
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-10b, 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-177946993700372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;