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-177946993600236.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 DBSingleClientW-PT-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.9K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 6 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779624294924

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 12:04:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:04:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:04:58] [INFO ] Load time of PNML (sax parser for PT used): 598 ms
[2026-05-24 12:04:58] [INFO ] Transformed 4763 places.
[2026-05-24 12:04:58] [INFO ] Transformed 2478 transitions.
[2026-05-24 12:04:58] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 867 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1370
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1370
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1027 place count 760 transition count 1342
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1331 place count 456 transition count 1038
Iterating global reduction 2 with 304 rules applied. Total rules applied 1635 place count 456 transition count 1038
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1647 place count 456 transition count 1026
Discarding 224 places :
Symmetric choice reduction at 3 with 224 rule applications. Total rules 1871 place count 232 transition count 708
Iterating global reduction 3 with 224 rules applied. Total rules applied 2095 place count 232 transition count 708
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 3 with 249 rules applied. Total rules applied 2344 place count 232 transition count 459
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2366 place count 210 transition count 422
Iterating global reduction 4 with 22 rules applied. Total rules applied 2388 place count 210 transition count 422
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2408 place count 210 transition count 402
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 2420 place count 198 transition count 390
Iterating global reduction 5 with 12 rules applied. Total rules applied 2432 place count 198 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2436 place count 198 transition count 386
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2445 place count 189 transition count 377
Iterating global reduction 6 with 9 rules applied. Total rules applied 2454 place count 189 transition count 377
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2465 place count 189 transition count 366
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2467 place count 187 transition count 362
Iterating global reduction 7 with 2 rules applied. Total rules applied 2469 place count 187 transition count 362
Applied a total of 2469 rules in 349 ms. Remains 187 /1183 variables (removed 996) and now considering 362/2478 (removed 2116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6657879532866939609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7842140051572171815.kers'
[2026-05-24 12:04:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6657879532866939609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7842140051572171815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 362 rows 187 cols 1038 entries
Finished phase 1 with 183 SingleSign rule and 2 generalized
[2026-05-24 12:04:59] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7842140051572171815.kers
Total runtime 6 ms.
[2026-05-24 12:05:00] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2026-05-24 12:05:00] [INFO ] Invariant cache hit.
[2026-05-24 12:05:00] [INFO ] State equation strengthened by 192 read => feed constraints.
[2026-05-24 12:05:02] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2026-05-24 12:05:02] [INFO ] Invariant cache hit.
[2026-05-24 12:05:02] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 362/549 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 192/381 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 381 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 362/549 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 192/381 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 361/742 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 742 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60942ms
Starting structural reductions in LTL mode, iteration 1 : 187/1183 places, 362/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64616 ms. Remains : 187/1183 places, 362/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 187 /187 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2026-05-24 12:06:03] [INFO ] Invariant cache hit.
[2026-05-24 12:06:03] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-24 12:06:03] [INFO ] Invariant cache hit.
[2026-05-24 12:06:03] [INFO ] State equation strengthened by 192 read => feed constraints.
[2026-05-24 12:06:05] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1921 ms. Remains : 187/187 places, 362/362 transitions.
Support contains 27 out of 187 places after structural reductions.
[2026-05-24 12:06:05] [INFO ] Flatten gal took : 118 ms
[2026-05-24 12:06:05] [INFO ] Flatten gal took : 65 ms
[2026-05-24 12:06:05] [INFO ] Input system was already deterministic with 362 transitions.
RANDOM walk for 40000 steps (9244 resets) in 4145 ms. (9 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (182 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (176 resets) in 74 ms. (53 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (166 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (182 resets) in 43 ms. (91 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (193 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (191 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (406 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (176 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (190 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (175 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (175 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (156 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (172 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (611 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (175 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (176 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (139 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (360 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (199 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (166 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 553294 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :21 out of 23
Probabilistic random walk after 553294 steps, saw 229151 distinct states, run finished after 3007 ms. (steps per millisecond=184 ) properties seen :21
[2026-05-24 12:06:10] [INFO ] Invariant cache hit.
[2026-05-24 12:06:10] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 68/74 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/119 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/326 variables, 119/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 37/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 533/549 variables, and 218 constraints, problems are : Problem set: 2 solved, 0 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 179/187 constraints, ReadFeed: 37/192 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 29 stable transitions
Graph (complete) has 743 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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(!p0))) U (X(X(p2))&&p1)))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 169 transition count 294
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 169 transition count 294
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 45 place count 169 transition count 285
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 157 transition count 268
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 157 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 157 transition count 265
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 148 transition count 252
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 148 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 148 transition count 244
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 105 place count 141 transition count 209
Iterating global reduction 3 with 7 rules applied. Total rules applied 112 place count 141 transition count 209
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 138 transition count 206
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 138 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 138 transition count 205
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 137 transition count 204
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 137 transition count 204
Applied a total of 121 rules in 30 ms. Remains 137 /187 variables (removed 50) and now considering 204/362 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11136308226720166787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17564397457468381185.kers'
[2026-05-24 12:06:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11136308226720166787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17564397457468381185.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 137 cols 658 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-24 12:06:10] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17564397457468381185.kers
Total runtime 2 ms.
[2026-05-24 12:06:11] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 12:06:11] [INFO ] Invariant cache hit.
[2026-05-24 12:06:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 12:06:12] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 12:06:12] [INFO ] Invariant cache hit.
[2026-05-24 12:06:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/341 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 72/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 219 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/341 variables, 137/147 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 72/219 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 203/422 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 422 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 137/187 places, 204/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61561 ms. Remains : 137/187 places, 204/362 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(!p0))) U (X(X(p2))&&p1)))'
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), p0, p0, true, (AND p0 (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-01
Stuttering criterion allowed to conclude after 18 steps with 4 reset in 5 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-01 finished in 62369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 290
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 290
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 167 transition count 278
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 154 transition count 260
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 154 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 154 transition count 256
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 144 transition count 242
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 144 transition count 242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 110 place count 144 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 135 transition count 190
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 135 transition count 190
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 131 transition count 186
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 131 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 131 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 129 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 129 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 129 transition count 181
Applied a total of 143 rules in 27 ms. Remains 129 /187 variables (removed 58) and now considering 181/362 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9130631518793178272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7328013536599093768.kers'
[2026-05-24 12:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9130631518793178272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7328013536599093768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 129 cols 598 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 12:07:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7328013536599093768.kers
Total runtime 2 ms.
[2026-05-24 12:07:13] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-24 12:07:13] [INFO ] Invariant cache hit.
[2026-05-24 12:07:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 12:07:14] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-24 12:07:14] [INFO ] Invariant cache hit.
[2026-05-24 12:07:14] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/310 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 190 constraints, problems are : Problem set: 0 solved, 180 unsolved in 20947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 181/310 variables, 129/133 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 57/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51146ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 51147ms
Starting structural reductions in LTL mode, iteration 1 : 129/187 places, 181/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52138 ms. Remains : 129/187 places, 181/362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-02 finished in 52320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X(p1)&&(X(p2)||(G(!p2) U p1)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 168 transition count 292
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 168 transition count 292
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 48 place count 168 transition count 282
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 155 transition count 264
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 155 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 155 transition count 260
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 145 transition count 246
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 145 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 106 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 114 place count 137 transition count 201
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 137 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 133 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 133 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 133 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 131 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 131 transition count 193
Applied a total of 136 rules in 15 ms. Remains 131 /187 variables (removed 56) and now considering 193/362 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10403989229956452983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6883068999942184596.kers'
[2026-05-24 12:08:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10403989229956452983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6883068999942184596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 131 cols 622 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 12:08:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6883068999942184596.kers
Total runtime 1 ms.
[2026-05-24 12:08:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-24 12:08:05] [INFO ] Invariant cache hit.
[2026-05-24 12:08:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 12:08:06] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2026-05-24 12:08:06] [INFO ] Invariant cache hit.
[2026-05-24 12:08:06] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/324 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 68/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/324 variables, and 211 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/324 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 68/211 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 192/403 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 403 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 131/187 places, 193/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61175 ms. Remains : 131/187 places, 193/362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X(p1)&&(X(p2)||(G(!p2) U p1)))))'
Stuttering acceptance computed with spot in 393 ms :[(NOT p1), (NOT p1), false, (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03
Stuttering criterion allowed to conclude after 19 steps with 5 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 61623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X(X(X(p1)))||G(p2))))))'
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 169 transition count 301
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 169 transition count 301
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 46 place count 169 transition count 291
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 157 transition count 274
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 157 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 157 transition count 272
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 147 transition count 257
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 147 transition count 257
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 147 transition count 247
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 139 transition count 215
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 139 transition count 215
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 135 transition count 211
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 135 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 135 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 134 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 134 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 134 transition count 206
Applied a total of 132 rules in 13 ms. Remains 134 /187 variables (removed 53) and now considering 206/362 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12750566824996676452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16356503406105179277.kers'
[2026-05-24 12:09:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12750566824996676452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16356503406105179277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 134 cols 653 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 12:09:07] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16356503406105179277.kers
Total runtime 1 ms.
[2026-05-24 12:09:07] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 12:09:07] [INFO ] Invariant cache hit.
[2026-05-24 12:09:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 12:09:08] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-24 12:09:08] [INFO ] Invariant cache hit.
[2026-05-24 12:09:08] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/340 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 214 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/340 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 205/419 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 419 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50667ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 50668ms
Starting structural reductions in LTL mode, iteration 1 : 134/187 places, 206/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51999 ms. Remains : 134/187 places, 206/362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X(X(X(p1)))||G(p2))))))'
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 52489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 286
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 286
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 50 place count 167 transition count 276
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 154 transition count 259
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 154 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 154 transition count 257
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 143 transition count 241
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 143 transition count 241
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 143 transition count 232
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 118 place count 134 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 127 place count 134 transition count 194
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 129 transition count 189
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 129 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 129 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 127 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 127 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 127 transition count 183
Applied a total of 145 rules in 18 ms. Remains 127 /187 variables (removed 60) and now considering 183/362 (removed 179) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17489790044031014261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2045456278341328755.kers'
[2026-05-24 12:09:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17489790044031014261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2045456278341328755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 127 cols 594 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 12:09:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2045456278341328755.kers
Total runtime 2 ms.
[2026-05-24 12:09:59] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-24 12:09:59] [INFO ] Invariant cache hit.
[2026-05-24 12:10:00] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:10:00] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-24 12:10:00] [INFO ] Invariant cache hit.
[2026-05-24 12:10:00] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 16000 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46102ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 46102ms
Starting structural reductions in LTL mode, iteration 1 : 127/187 places, 183/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47411 ms. Remains : 127/187 places, 183/362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||p1)))))'
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08
Product exploration explored 100000 steps with 22958 reset in 638 ms.
Product exploration explored 100000 steps with 23059 reset in 364 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9155 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1764 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21057 steps, run visited all 1 properties in 230 ms. (steps per millisecond=91 )
Probabilistic random walk after 21057 steps, saw 10391 distinct states, run finished after 235 ms. (steps per millisecond=89 ) properties seen :1
Knowledge based reduction with 5 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 753 ms.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 183/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2026-05-24 12:10:49] [INFO ] Invariant cache hit.
[2026-05-24 12:10:49] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 12:10:49] [INFO ] Invariant cache hit.
[2026-05-24 12:10:49] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:10:50] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 127/127 places, 183/183 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9148 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21057 steps, run visited all 1 properties in 51 ms. (steps per millisecond=412 )
Probabilistic random walk after 21057 steps, saw 10391 distinct states, run finished after 51 ms. (steps per millisecond=412 ) properties seen :1
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 409 ms.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23116 reset in 359 ms.
Product exploration explored 100000 steps with 23013 reset in 378 ms.
Spot run failed in 162 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/ltsmin5991037931309013245
[2026-05-24 12:10:52] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5991037931309013245
Running compilation step : cd /tmp/ltsmin5991037931309013245;'/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 1053 ms.
Running link step : cd /tmp/ltsmin5991037931309013245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin5991037931309013245;'/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/stateBased9332300723204081683.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 53848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 290
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 290
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 167 transition count 278
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 154 transition count 260
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 154 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 154 transition count 256
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 144 transition count 242
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 144 transition count 242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 110 place count 144 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 135 transition count 190
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 135 transition count 190
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 131 transition count 186
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 131 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 129 transition count 182
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 129 transition count 182
Applied a total of 142 rules in 67 ms. Remains 129 /187 variables (removed 58) and now considering 182/362 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14128583313931152577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6744163076757458256.kers'
[2026-05-24 12:10:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14128583313931152577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6744163076757458256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 129 cols 602 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 12:10:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6744163076757458256.kers
Total runtime 3 ms.
[2026-05-24 12:10:53] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-24 12:10:53] [INFO ] Invariant cache hit.
[2026-05-24 12:10:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 12:10:55] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2026-05-24 12:10:55] [INFO ] Redundant transitions in 7 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-24 12:10:55] [INFO ] Invariant cache hit.
[2026-05-24 12:10:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/311 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/311 variables, 129/133 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 57/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/187 places, 182/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61698 ms. Remains : 129/187 places, 182/362 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 51 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 61789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 285
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 50 place count 167 transition count 275
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 154 transition count 257
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 154 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 154 transition count 254
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 144 transition count 240
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 144 transition count 240
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 144 transition count 232
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 116 place count 135 transition count 195
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 135 transition count 195
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 130 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 130 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 128 transition count 186
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 128 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 128 transition count 184
Applied a total of 143 rules in 21 ms. Remains 128 /187 variables (removed 59) and now considering 184/362 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15394729367757563196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4678814797878328515.kers'
[2026-05-24 12:11:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15394729367757563196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4678814797878328515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 128 cols 599 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 12:11:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4678814797878328515.kers
Total runtime 2 ms.
[2026-05-24 12:11:55] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-24 12:11:55] [INFO ] Invariant cache hit.
[2026-05-24 12:11:55] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:11:56] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2026-05-24 12:11:56] [INFO ] Invariant cache hit.
[2026-05-24 12:11:56] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/312 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 198 constraints, problems are : Problem set: 0 solved, 183 unsolved in 25007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/312 variables, 128/136 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 62/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 183/381 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 381 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55107ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 55108ms
Starting structural reductions in LTL mode, iteration 1 : 128/187 places, 184/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56241 ms. Remains : 128/187 places, 184/362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 56351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 166 transition count 284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 166 transition count 284
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 52 place count 166 transition count 274
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 152 transition count 255
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 152 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 152 transition count 252
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 141 transition count 236
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 141 transition count 236
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 114 place count 141 transition count 227
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 132 transition count 187
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 132 transition count 187
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 127 transition count 182
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 127 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 127 transition count 180
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 125 transition count 178
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 125 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 125 transition count 176
Applied a total of 150 rules in 39 ms. Remains 125 /187 variables (removed 62) and now considering 176/362 (removed 186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16669125223810650559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17900176981428021517.kers'
[2026-05-24 12:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16669125223810650559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17900176981428021517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 125 cols 577 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-05-24 12:12:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17900176981428021517.kers
Total runtime 1 ms.
[2026-05-24 12:12:51] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-24 12:12:51] [INFO ] Invariant cache hit.
[2026-05-24 12:12:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 12:12:52] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2026-05-24 12:12:52] [INFO ] Redundant transitions in 6 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-24 12:12:52] [INFO ] Invariant cache hit.
[2026-05-24 12:12:52] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 184 constraints, problems are : Problem set: 0 solved, 175 unsolved in 13857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 175/359 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 359 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43950ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 43952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/187 places, 176/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45235 ms. Remains : 125/187 places, 176/362 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 : DBSingleClientW-PT-d2m09-LTLFireability-11
Product exploration explored 100000 steps with 23160 reset in 372 ms.
Product exploration explored 100000 steps with 22935 reset in 464 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9144 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1804 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43134 steps, run visited all 1 properties in 101 ms. (steps per millisecond=427 )
Probabilistic random walk after 43134 steps, saw 20201 distinct states, run finished after 101 ms. (steps per millisecond=427 ) properties seen :1
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Knowledge-based reduction took 368 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-24 12:13:38] [INFO ] Invariant cache hit.
[2026-05-24 12:13:38] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-24 12:13:38] [INFO ] Invariant cache hit.
[2026-05-24 12:13:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 12:13:39] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2026-05-24 12:13:39] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9256 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1772 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 43134 steps, run visited all 1 properties in 105 ms. (steps per millisecond=410 )
Probabilistic random walk after 43134 steps, saw 20201 distinct states, run finished after 105 ms. (steps per millisecond=410 ) properties seen :1
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22999 reset in 451 ms.
Product exploration explored 100000 steps with 22997 reset in 396 ms.
Built C files in :
/tmp/ltsmin18047444581827618535
[2026-05-24 12:13:40] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2026-05-24 12:13:40] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:13:40] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2026-05-24 12:13:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:13:40] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2026-05-24 12:13:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:13:40] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18047444581827618535
Running compilation step : cd /tmp/ltsmin18047444581827618535;'/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 761 ms.
Running link step : cd /tmp/ltsmin18047444581827618535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18047444581827618535;'/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/stateBased11476031714014189015.hoa' '--buchi-type=spotba'
LTSmin run took 223 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-11 finished in 50022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(!p1))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 296
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 296
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 51 place count 167 transition count 285
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 153 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 153 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 84 place count 153 transition count 261
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 142 transition count 245
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 142 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 116 place count 142 transition count 235
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 133 transition count 197
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 133 transition count 197
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 128 transition count 192
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 128 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 128 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 126 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 126 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 126 transition count 186
Applied a total of 152 rules in 13 ms. Remains 126 /187 variables (removed 61) and now considering 186/362 (removed 176) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18284363714464665163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10011016286213805551.kers'
[2026-05-24 12:13:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18284363714464665163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10011016286213805551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 126 cols 596 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 12:13:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10011016286213805551.kers
Total runtime 1 ms.
[2026-05-24 12:13:41] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-24 12:13:41] [INFO ] Invariant cache hit.
[2026-05-24 12:13:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 12:13:42] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-24 12:13:42] [INFO ] Invariant cache hit.
[2026-05-24 12:13:42] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 15443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45538ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 45539ms
Starting structural reductions in LTL mode, iteration 1 : 126/187 places, 186/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46650 ms. Remains : 126/187 places, 186/362 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))&&p1))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12
Product exploration explored 100000 steps with 22949 reset in 350 ms.
Product exploration explored 100000 steps with 23003 reset in 418 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 460 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9184 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1860 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8293 steps, run visited all 1 properties in 27 ms. (steps per millisecond=307 )
Probabilistic random walk after 8293 steps, saw 3918 distinct states, run finished after 27 ms. (steps per millisecond=307 ) properties seen :1
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 255 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-24 12:14:29] [INFO ] Invariant cache hit.
[2026-05-24 12:14:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-24 12:14:29] [INFO ] Invariant cache hit.
[2026-05-24 12:14:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 12:14:30] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2026-05-24 12:14:30] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 968 ms. Remains : 126/126 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 460 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9208 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1806 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8293 steps, run visited all 1 properties in 24 ms. (steps per millisecond=345 )
Probabilistic random walk after 8293 steps, saw 3918 distinct states, run finished after 24 ms. (steps per millisecond=345 ) properties seen :1
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Knowledge-based reduction took 251 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23069 reset in 233 ms.
Product exploration explored 100000 steps with 22833 reset in 319 ms.
Built C files in :
/tmp/ltsmin17893103682911106512
[2026-05-24 12:14:31] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2026-05-24 12:14:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:14:31] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2026-05-24 12:14:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:14:31] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2026-05-24 12:14:31] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:14:31] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17893103682911106512
Running compilation step : cd /tmp/ltsmin17893103682911106512;'/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 789 ms.
Running link step : cd /tmp/ltsmin17893103682911106512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17893103682911106512;'/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/stateBased2994758869142749831.hoa' '--buchi-type=spotba'
LTSmin run took 292 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 51024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 167 transition count 285
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 167 transition count 285
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 50 place count 167 transition count 275
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 154 transition count 257
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 154 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 154 transition count 254
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 144 transition count 239
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 144 transition count 239
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 144 transition count 231
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 116 place count 135 transition count 193
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 135 transition count 193
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 130 transition count 188
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 130 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 130 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 128 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 128 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 128 transition count 182
Applied a total of 143 rules in 47 ms. Remains 128 /187 variables (removed 59) and now considering 182/362 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13735829947264307190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8287647962436701039.kers'
[2026-05-24 12:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13735829947264307190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8287647962436701039.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 128 cols 593 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 12:14:32] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8287647962436701039.kers
Total runtime 2 ms.
[2026-05-24 12:14:32] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-24 12:14:32] [INFO ] Invariant cache hit.
[2026-05-24 12:14:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 12:14:33] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2026-05-24 12:14:33] [INFO ] Redundant transitions in 3 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-24 12:14:33] [INFO ] Invariant cache hit.
[2026-05-24 12:14:33] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/310 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/310 variables, and 204 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/310 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 61/204 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 181/385 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 385 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/187 places, 182/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61463 ms. Remains : 128/187 places, 182/362 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 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13
Product exploration explored 100000 steps with 22903 reset in 223 ms.
Product exploration explored 100000 steps with 23031 reset in 243 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9226 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1782 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42152 steps, run visited all 1 properties in 163 ms. (steps per millisecond=258 )
Probabilistic random walk after 42152 steps, saw 19690 distinct states, run finished after 164 ms. (steps per millisecond=257 ) properties seen :1
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 490 ms.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 182/182 transitions.
Applied a total of 0 rules in 20 ms. Remains 128 /128 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-24 12:15:35] [INFO ] Invariant cache hit.
[2026-05-24 12:15:35] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-24 12:15:35] [INFO ] Invariant cache hit.
[2026-05-24 12:15:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 12:15:36] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2026-05-24 12:15:36] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1342 ms. Remains : 128/128 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9183 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1759 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42152 steps, run visited all 1 properties in 161 ms. (steps per millisecond=261 )
Probabilistic random walk after 42152 steps, saw 19690 distinct states, run finished after 161 ms. (steps per millisecond=261 ) properties seen :1
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 449 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22997 reset in 379 ms.
Product exploration explored 100000 steps with 22983 reset in 387 ms.
Built C files in :
/tmp/ltsmin2424048926122791466
[2026-05-24 12:15:38] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2026-05-24 12:15:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:38] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2026-05-24 12:15:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:38] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2026-05-24 12:15:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2424048926122791466
Running compilation step : cd /tmp/ltsmin2424048926122791466;'/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 827 ms.
Running link step : cd /tmp/ltsmin2424048926122791466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2424048926122791466;'/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/stateBased5675316550323562248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 182/182 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-24 12:15:53] [INFO ] Invariant cache hit.
[2026-05-24 12:15:53] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-24 12:15:53] [INFO ] Invariant cache hit.
[2026-05-24 12:15:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 12:15:54] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2026-05-24 12:15:54] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1350 ms. Remains : 128/128 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin17199162670882231082
[2026-05-24 12:15:54] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2026-05-24 12:15:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:54] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2026-05-24 12:15:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:54] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2026-05-24 12:15:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:15:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17199162670882231082
Running compilation step : cd /tmp/ltsmin17199162670882231082;'/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 869 ms.
Running link step : cd /tmp/ltsmin17199162670882231082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17199162670882231082;'/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/stateBased5935064509542324464.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 12:16:09] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:16:09] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:16:09] [INFO ] Time to serialize gal into /tmp/LTL12430754582035654445.gal : 5 ms
[2026-05-24 12:16:09] [INFO ] Time to serialize properties into /tmp/LTL16631041882315467978.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/LTL12430754582035654445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11487985317463212447.hoa' '-atoms' '/tmp/LTL16631041882315467978.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...320
Loading property file /tmp/LTL16631041882315467978.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11487985317463212447.hoa
Detected timeout of ITS tools.
[2026-05-24 12:16:24] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:16:24] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:16:24] [INFO ] Time to serialize gal into /tmp/LTL13904658240071503683.gal : 3 ms
[2026-05-24 12:16:24] [INFO ] Time to serialize properties into /tmp/LTL15744773944529730308.ltl : 3 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/LTL13904658240071503683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15744773944529730308.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l2627<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l2627<1))"
Detected timeout of ITS tools.
[2026-05-24 12:16:39] [INFO ] Flatten gal took : 12 ms
[2026-05-24 12:16:39] [INFO ] Applying decomposition
[2026-05-24 12:16:39] [INFO ] Flatten gal took : 13 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/graph4353986230574222052.txt' '-o' '/tmp/graph4353986230574222052.bin' '-w' '/tmp/graph4353986230574222052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4353986230574222052.bin' '-l' '-1' '-v' '-w' '/tmp/graph4353986230574222052.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:16:39] [INFO ] Decomposing Gal with order
[2026-05-24 12:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:16:40] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-24 12:16:40] [INFO ] Flatten gal took : 149 ms
[2026-05-24 12:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 26 ms.
[2026-05-24 12:16:40] [INFO ] Time to serialize gal into /tmp/LTL14389270174415388201.gal : 10 ms
[2026-05-24 12:16:40] [INFO ] Time to serialize properties into /tmp/LTL5950318165652060934.ltl : 0 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/LTL14389270174415388201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5950318165652060934.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.u0.s1<1)||(i3.u0.l2627<1))"))))
Formula 0 simplified : FG!"((i3.u0.s1<1)||(i3.u0.l2627<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 142522 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&&((p1 U p2)||G(!p0))))))'
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 362/362 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 169 transition count 304
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 169 transition count 304
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 47 place count 169 transition count 293
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 157 transition count 276
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 157 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 157 transition count 273
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 148 transition count 259
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 148 transition count 259
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 148 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 140 transition count 217
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 140 transition count 217
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 136 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 136 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 136 transition count 211
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 135 transition count 210
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 135 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 135 transition count 208
Applied a total of 132 rules in 24 ms. Remains 135 /187 variables (removed 52) and now considering 208/362 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2683169461422766588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12870774336827684281.kers'
[2026-05-24 12:16:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2683169461422766588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12870774336827684281.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 135 cols 659 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 12:16:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12870774336827684281.kers
Total runtime 2 ms.
[2026-05-24 12:16:55] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-24 12:16:55] [INFO ] Invariant cache hit.
[2026-05-24 12:16:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 12:16:56] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2026-05-24 12:16:56] [INFO ] Redundant transitions in 2 ms returned []
Running 207 sub problems to find dead transitions.
[2026-05-24 12:16:56] [INFO ] Invariant cache hit.
[2026-05-24 12:16:56] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/343 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 217 constraints, problems are : Problem set: 0 solved, 207 unsolved in 29656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 208/343 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 79/217 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 207/424 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 424 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59871ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 59873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/187 places, 208/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61504 ms. Remains : 135/187 places, 208/362 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&&((p1 U p2)||G(!p0))))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 61670 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)))'
Spot run failed in 81 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 12:17:57] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15511988710414541070
[2026-05-24 12:17:57] [INFO ] Computing symmetric may disable matrix : 362 transitions.
[2026-05-24 12:17:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:17:57] [INFO ] Applying decomposition
[2026-05-24 12:17:57] [INFO ] Computing symmetric may enable matrix : 362 transitions.
[2026-05-24 12:17:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:17:57] [INFO ] Computing Do-Not-Accords matrix : 362 transitions.
[2026-05-24 12:17:57] [INFO ] Flatten gal took : 49 ms
[2026-05-24 12:17:57] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:17:57] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15511988710414541070
Running compilation step : cd /tmp/ltsmin15511988710414541070;'/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/graph8558703970368815597.txt' '-o' '/tmp/graph8558703970368815597.bin' '-w' '/tmp/graph8558703970368815597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8558703970368815597.bin' '-l' '-1' '-v' '-w' '/tmp/graph8558703970368815597.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:17:57] [INFO ] Decomposing Gal with order
[2026-05-24 12:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:17:57] [INFO ] Removed a total of 327 redundant transitions.
[2026-05-24 12:17:57] [INFO ] Flatten gal took : 103 ms
[2026-05-24 12:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 249 labels/synchronizations in 32 ms.
[2026-05-24 12:17:57] [INFO ] Time to serialize gal into /tmp/LTLFireability16003992130765849071.gal : 11 ms
[2026-05-24 12:17:57] [INFO ] Time to serialize properties into /tmp/LTLFireability12538825305036813279.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/LTLFireability16003992130765849071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12538825305036813279.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u2.s1<1)||(i5.u14.l2627<1))"))))
Formula 0 simplified : FG!"((i2.u2.s1<1)||(i5.u14.l2627<1))"
Compilation finished in 1613 ms.
Running link step : cd /tmp/ltsmin15511988710414541070;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15511988710414541070;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 12:42:22] [INFO ] Flatten gal took : 557 ms
[2026-05-24 12:42:22] [INFO ] Time to serialize gal into /tmp/LTLFireability6609844712773255366.gal : 46 ms
[2026-05-24 12:42:22] [INFO ] Time to serialize properties into /tmp/LTLFireability73934742030728797.ltl : 8 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/LTLFireability6609844712773255366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability73934742030728797.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...295
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l2627<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l2627<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DBSingleClientW-PT-d2m09"
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 DBSingleClientW-PT-d2m09, 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-177946993600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m09.tgz
mv DBSingleClientW-PT-d2m09 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;