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-177946993700404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 103K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-30b-LTLFireability-00
FORMULA_NAME DES-PT-30b-LTLFireability-01
FORMULA_NAME DES-PT-30b-LTLFireability-02
FORMULA_NAME DES-PT-30b-LTLFireability-03
FORMULA_NAME DES-PT-30b-LTLFireability-04
FORMULA_NAME DES-PT-30b-LTLFireability-05
FORMULA_NAME DES-PT-30b-LTLFireability-06
FORMULA_NAME DES-PT-30b-LTLFireability-07
FORMULA_NAME DES-PT-30b-LTLFireability-08
FORMULA_NAME DES-PT-30b-LTLFireability-09
FORMULA_NAME DES-PT-30b-LTLFireability-10
FORMULA_NAME DES-PT-30b-LTLFireability-11
FORMULA_NAME DES-PT-30b-LTLFireability-12
FORMULA_NAME DES-PT-30b-LTLFireability-13
FORMULA_NAME DES-PT-30b-LTLFireability-14
FORMULA_NAME DES-PT-30b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779703906114

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:11:49] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2026-05-25 10:11:49] [INFO ] Transformed 399 places.
[2026-05-25 10:11:49] [INFO ] Transformed 350 transitions.
[2026-05-25 10:11:49] [INFO ] Found NUPN structural information;
[2026-05-25 10:11:49] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DES-PT-30b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 375 transition count 329
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 375 transition count 329
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 361 transition count 315
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 361 transition count 315
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 83 place count 361 transition count 305
Applied a total of 83 rules in 224 ms. Remains 361 /399 variables (removed 38) and now considering 305/350 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3463401487948670104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6022923620832306.kers'
[2026-05-25 10:11:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3463401487948670104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6022923620832306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 305 rows 361 cols 1027 entries
Finished phase 1 with 168 SingleSign rule and 131 generalized
[2026-05-25 10:11:49] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6022923620832306.kers
Total runtime 6 ms.
[2026-05-25 10:11:50] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2026-05-25 10:11:50] [INFO ] Invariant cache hit.
[2026-05-25 10:11:52] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 2632 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-05-25 10:11:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 305/666 variables, 361/423 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 16/439 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 439 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/666 variables, and 115 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/304 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Starting structural reductions in LTL mode, iteration 1 : 361/399 places, 305/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63321 ms. Remains : 361/399 places, 305/350 transitions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Applied a total of 0 rules in 44 ms. Remains 361 /361 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2026-05-25 10:12:52] [INFO ] Invariant cache hit.
[2026-05-25 10:12:53] [INFO ] Implicit Places using invariants in 553 ms returned []
[2026-05-25 10:12:53] [INFO ] Invariant cache hit.
[2026-05-25 10:12:54] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 361/361 places, 305/305 transitions.
Support contains 35 out of 361 places after structural reductions.
[2026-05-25 10:12:55] [INFO ] Flatten gal took : 110 ms
[2026-05-25 10:12:55] [INFO ] Flatten gal took : 52 ms
[2026-05-25 10:12:55] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 34 out of 361 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (342 resets) in 2284 ms. (17 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40004 steps (47 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (59 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (56 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (53 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (62 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
[2026-05-25 10:12:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 32/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 130/175 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 168/343 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/346 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 292/638 variables, 346/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 18/656 variables, 10/418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/656 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/662 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/664 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/664 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/666 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/666 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 423 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 32/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 130/175 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 168/343 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/346 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 292/638 variables, 346/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 9/417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/666 variables, and 421 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 346/361 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9195ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 305/305 transitions.
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 355 transition count 284
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 339 transition count 283
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 339 transition count 272
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 328 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 325 transition count 269
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 325 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 322 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 322 transition count 266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 322 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 322 transition count 261
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 320 transition count 261
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 223 place count 247 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 242 transition count 188
Applied a total of 231 rules in 403 ms. Remains 242 /361 variables (removed 119) and now considering 188/305 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 242/361 places, 188/305 transitions.
RANDOM walk for 40000 steps (1580 resets) in 748 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (314 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (319 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (297 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (305 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (313 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (329 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (330 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (292 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (315 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 532248 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 9
Probabilistic random walk after 532248 steps, saw 84230 distinct states, run finished after 3008 ms. (steps per millisecond=176 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9319566049079292271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9965594289073127537.kers'
[2026-05-25 10:13:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9319566049079292271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9965594289073127537.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 188 rows 240 cols 872 entries
Finished phase 1 with 89 SingleSign rule and 93 generalized
[2026-05-25 10:13:10] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9965594289073127537.kers
Total runtime 2 ms.
[2026-05-25 10:13:10] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 58/87 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 124/211 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/213 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/214 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 188/402 variables, 214/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 28/430 variables, 28/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1487 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 58/87 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 124/211 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/213 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/214 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 188/402 variables, 214/275 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 28/430 variables, 28/316 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 327 constraints, problems are : Problem set: 0 solved, 9 unsolved in 23553 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25060ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 14547 ms.
Support contains 13 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 17 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-25 10:13:49] [INFO ] Invariant cache hit.
[2026-05-25 10:13:50] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-25 10:13:50] [INFO ] Invariant cache hit.
[2026-05-25 10:13:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:13:50] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2026-05-25 10:13:50] [INFO ] Redundant transitions in 10 ms returned []
Running 185 sub problems to find dead transitions.
[2026-05-25 10:13:50] [INFO ] Invariant cache hit.
[2026-05-25 10:13:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 188/430 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 309 constraints, problems are : Problem set: 0 solved, 185 unsolved in 19336 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 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/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 188/430 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 185/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 496 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49435ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 49438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50233 ms. Remains : 242/242 places, 188/188 transitions.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.25 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(((p1||F(G(p2))||G(p3))&&p0)))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 286
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 285
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 339 transition count 275
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 329 transition count 275
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 326 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 326 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 323 transition count 269
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 323 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 323 transition count 264
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 321 transition count 264
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 223 place count 245 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 243 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 241 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 240 transition count 188
Applied a total of 230 rules in 91 ms. Remains 240 /361 variables (removed 121) and now considering 188/305 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10405126143142197054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14353012218342856571.kers'
[2026-05-25 10:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10405126143142197054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14353012218342856571.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 188 rows 215 cols 763 entries
Finished phase 1 with 107 SingleSign rule and 75 generalized
[2026-05-25 10:14:40] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14353012218342856571.kers
Total runtime 4 ms.
[2026-05-25 10:14:40] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-25 10:14:40] [INFO ] Invariant cache hit.
[2026-05-25 10:14:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:14:41] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2026-05-25 10:14:41] [INFO ] Redundant transitions in 9 ms returned []
Running 185 sub problems to find dead transitions.
[2026-05-25 10:14:41] [INFO ] Invariant cache hit.
[2026-05-25 10:14:41] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 185 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/239 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 188/427 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 1/428 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 306 constraints, problems are : Problem set: 0 solved, 185 unsolved in 27666 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 240/240 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 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/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/238 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 1/239 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 188/427 variables, 239/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 185/490 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/428 variables, and 492 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/240 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57732ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 57734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 240/361 places, 188/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58778 ms. Remains : 240/361 places, 188/305 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(((F(G(p1))||G(p2)||p3)&&p0)))'
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : DES-PT-30b-LTLFireability-00
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 3 ms.
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-00 finished in 59381 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((X(X((G(p1) U p2)))||p0))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 300
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 356 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 353 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 353 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 353 transition count 293
Applied a total of 20 rules in 34 ms. Remains 353 /361 variables (removed 8) and now considering 293/305 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5736090737187357926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14689451958862300538.kers'
[2026-05-25 10:15:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5736090737187357926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14689451958862300538.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 353 cols 997 entries
Finished phase 1 with 161 SingleSign rule and 130 generalized
[2026-05-25 10:15:39] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14689451958862300538.kers
Total runtime 5 ms.
[2026-05-25 10:15:40] [INFO ] Implicit Places using invariants in 493 ms returned []
[2026-05-25 10:15:40] [INFO ] Invariant cache hit.
[2026-05-25 10:15:41] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-25 10:15:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 16/431 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 431 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/646 variables, and 125 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/292 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 353/361 places, 293/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61929 ms. Remains : 353/361 places, 293/305 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((X(X((G(p1) U p2)))||p0))))'
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-02
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 5 ms.
FORMULA DES-PT-30b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-02 finished in 62492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 354 transition count 285
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 338 transition count 284
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 338 transition count 273
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 327 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 324 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 324 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 322 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 322 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 321 transition count 265
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 218 place count 247 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 245 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 243 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 242 transition count 191
Applied a total of 225 rules in 126 ms. Remains 242 /361 variables (removed 119) and now considering 191/305 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17031037159984494975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17460648846801125935.kers'
[2026-05-25 10:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17031037159984494975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17460648846801125935.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 191 rows 217 cols 769 entries
Finished phase 1 with 142 SingleSign rule and 42 generalized
[2026-05-25 10:16:42] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17460648846801125935.kers
Total runtime 3 ms.
[2026-05-25 10:16:42] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-25 10:16:42] [INFO ] Invariant cache hit.
[2026-05-25 10:16:43] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2026-05-25 10:16:43] [INFO ] Redundant transitions in 4 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-25 10:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 1/240 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 2/242 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 191/433 variables, 242/300 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/433 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 306 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 1/240 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 191/433 variables, 242/306 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 188/494 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 494 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/361 places, 191/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61408 ms. Remains : 242/361 places, 191/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-03
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-03 finished in 61586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(!p1))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 357 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 357 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 357 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 355 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 355 transition count 296
Applied a total of 15 rules in 25 ms. Remains 355 /361 variables (removed 6) and now considering 296/305 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5273592731277215354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6431402080333735638.kers'
[2026-05-25 10:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5273592731277215354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6431402080333735638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 355 cols 1005 entries
Finished phase 1 with 162 SingleSign rule and 131 generalized
[2026-05-25 10:17:43] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6431402080333735638.kers
Total runtime 4 ms.
[2026-05-25 10:17:44] [INFO ] Implicit Places using invariants in 382 ms returned []
[2026-05-25 10:17:44] [INFO ] Invariant cache hit.
[2026-05-25 10:17:45] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-25 10:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 295 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/651 variables, 355/417 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 449 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 32/94 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/651 variables, and 119 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 0/295 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 355/361 places, 296/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61540 ms. Remains : 355/361 places, 296/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-04 finished in 61730 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(G(!p0)))||((p1 U (p2||G(p1)))&&X((p3&&X(!p0))))))))'
Support contains 5 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 357 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 357 transition count 301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 354 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 354 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 354 transition count 295
Applied a total of 17 rules in 35 ms. Remains 354 /361 variables (removed 7) and now considering 295/305 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4913832325343932494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18394165490662700718.kers'
[2026-05-25 10:18:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4913832325343932494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18394165490662700718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 354 cols 1001 entries
Finished phase 1 with 162 SingleSign rule and 130 generalized
[2026-05-25 10:18:45] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18394165490662700718.kers
Total runtime 5 ms.
[2026-05-25 10:18:46] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-05-25 10:18:46] [INFO ] Invariant cache hit.
[2026-05-25 10:18:47] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-25 10:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 436 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/649 variables, 354/458 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 294/752 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 752 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 354/361 places, 295/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61744 ms. Remains : 354/361 places, 295/305 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(G(!p0)))||((p1 U (p2||G(p1)))&&X((p3&&X(!p0))))))))'
Stuttering acceptance computed with spot in 778 ms :[true, p0, p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), p0, p0, p0, p0, p0, p0]
Running random walk in product with property : DES-PT-30b-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 509 ms.
Product exploration explored 100000 steps with 25000 reset in 363 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/354 stabilizing places and 168/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 16 factoid took 150 ms. Reduced automaton from 13 states, 42 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (349 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 850637 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 1
Probabilistic random walk after 850637 steps, saw 140215 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
[2026-05-25 10:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/160 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/333 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/339 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 282/621 variables, 339/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/639 variables, 10/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/645 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/645 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/647 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/649 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/649 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/649 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/160 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 173/333 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/339 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 282/621 variables, 339/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/639 variables, 10/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/639 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/639 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/645 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/645 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/647 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/649 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/649 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/649 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 932 ms.
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 295/295 transitions.
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 348 transition count 272
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 330 transition count 271
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 40 place count 330 transition count 259
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 318 transition count 259
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 214 place count 243 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 241 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 241 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 220 place count 240 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 239 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 238 transition count 184
Applied a total of 222 rules in 54 ms. Remains 238 /354 variables (removed 116) and now considering 184/295 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 238/354 places, 184/295 transitions.
RANDOM walk for 40000 steps (1824 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (317 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1182129 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :0 out of 1
Probabilistic random walk after 1182129 steps, saw 161432 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11322414184173822430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8596313820082062135.kers'
[2026-05-25 10:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11322414184173822430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8596313820082062135.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 184 rows 213 cols 753 entries
Finished phase 1 with 137 SingleSign rule and 41 generalized
[2026-05-25 10:20:00] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8596313820082062135.kers
Total runtime 6 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/113 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/128 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/130 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/186 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/205 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 184/389 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/422 variables, 33/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/422 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/113 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/128 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/130 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/186 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/205 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 184/389 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/422 variables, 33/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 299 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 424 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 184/184 transitions.
Applied a total of 0 rules in 12 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 238/238 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 184/184 transitions.
Applied a total of 0 rules in 12 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2026-05-25 10:20:01] [INFO ] Invariant cache hit.
[2026-05-25 10:20:02] [INFO ] Implicit Places using invariants in 433 ms returned []
[2026-05-25 10:20:02] [INFO ] Invariant cache hit.
[2026-05-25 10:20:02] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2026-05-25 10:20:02] [INFO ] Redundant transitions in 3 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 10:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 184/422 variables, 238/298 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/303 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 422/422 variables, and 303 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 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/235 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 2/238 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 184/422 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 181/484 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 486 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61245 ms. Remains : 238/238 places, 184/184 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-25 10:21:02] [INFO ] Invariant cache hit.
[2026-05-25 10:21:03] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2026-05-25 10:21:03] [INFO ] [Real]Absence check using 37 positive and 23 generalized place invariants in 24 ms returned sat
[2026-05-25 10:21:03] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 10:21:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2026-05-25 10:21:03] [INFO ] [Nat]Absence check using 37 positive and 23 generalized place invariants in 22 ms returned sat
[2026-05-25 10:21:03] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 10:21:03] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 10:21:03] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 534 ms.
Knowledge based reduction with 16 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 74782 ms.
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3229672040772464813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8046677551671558870.kers'
[2026-05-25 10:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3229672040772464813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8046677551671558870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 354 cols 1001 entries
Finished phase 1 with 162 SingleSign rule and 130 generalized
[2026-05-25 10:21:04] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8046677551671558870.kers
Total runtime 6 ms.
[2026-05-25 10:21:04] [INFO ] Implicit Places using invariants in 527 ms returned []
[2026-05-25 10:21:04] [INFO ] Invariant cache hit.
[2026-05-25 10:21:05] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-25 10:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 436 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/649 variables, 354/458 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 294/752 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 752 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in LTL mode , in 1 iterations and 61831 ms. Remains : 354/354 places, 295/295 transitions.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/354 stabilizing places and 168/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (345 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 856847 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Probabilistic random walk after 856847 steps, saw 141116 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2026-05-25 10:22:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/160 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/333 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/339 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 282/621 variables, 339/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/639 variables, 10/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/645 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/645 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/647 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/649 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/649 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/649 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/160 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 173/333 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/339 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 282/621 variables, 339/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/639 variables, 10/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/639 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/639 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/645 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/645 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/647 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/649 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/649 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/649 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3955ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 898 ms.
Support contains 2 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 295/295 transitions.
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 348 transition count 272
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 330 transition count 271
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 40 place count 330 transition count 259
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 318 transition count 259
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 214 place count 243 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 241 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 241 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 220 place count 240 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 239 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 238 transition count 184
Applied a total of 222 rules in 71 ms. Remains 238 /354 variables (removed 116) and now considering 184/295 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 238/354 places, 184/295 transitions.
RANDOM walk for 40000 steps (1756 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (320 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1124137 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :0 out of 1
Probabilistic random walk after 1124137 steps, saw 154598 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16957313313910282217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-402986261600159937.kers'
[2026-05-25 10:22:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16957313313910282217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-402986261600159937.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 184 rows 213 cols 753 entries
Finished phase 1 with 137 SingleSign rule and 41 generalized
[2026-05-25 10:22:17] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-402986261600159937.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/113 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/128 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/130 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/186 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/205 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 184/389 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/422 variables, 33/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/422 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/21 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/113 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/128 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/130 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/186 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/205 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 184/389 variables, 205/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/422 variables, 33/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/422 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 299 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 419 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 238/238 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2026-05-25 10:22:18] [INFO ] Invariant cache hit.
[2026-05-25 10:22:18] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-25 10:22:18] [INFO ] Invariant cache hit.
[2026-05-25 10:22:19] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2026-05-25 10:22:19] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 10:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 184/422 variables, 238/298 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 303 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 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/235 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 2/238 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 184/422 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 181/484 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 486 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61136 ms. Remains : 238/238 places, 184/184 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-25 10:23:19] [INFO ] Invariant cache hit.
[2026-05-25 10:23:19] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 10:23:19] [INFO ] [Real]Absence check using 37 positive and 23 generalized place invariants in 36 ms returned sat
[2026-05-25 10:23:19] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 10:23:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-25 10:23:19] [INFO ] [Nat]Absence check using 37 positive and 23 generalized place invariants in 34 ms returned sat
[2026-05-25 10:23:19] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 10:23:19] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 10:23:19] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 565 ms.
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 74299 ms.
Stuttering acceptance computed with spot in 214 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 211 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Product exploration explored 100000 steps with 25000 reset in 188 ms.
Spot run failed in 151 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14583770964439547799
[2026-05-25 10:23:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14583770964439547799
Running compilation step : cd /tmp/ltsmin14583770964439547799;'/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 1363 ms.
Running link step : cd /tmp/ltsmin14583770964439547799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin14583770964439547799;'/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/stateBased7180884203755494511.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA DES-PT-30b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30b-LTLFireability-06 finished in 277215 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 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 286
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 285
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 339 transition count 274
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 328 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 325 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 325 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 322 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 322 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 322 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 322 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 320 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 225 place count 244 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 229 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 239 transition count 187
Applied a total of 232 rules in 60 ms. Remains 239 /361 variables (removed 122) and now considering 187/305 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12296485056790586982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3221231013046711310.kers'
[2026-05-25 10:23:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12296485056790586982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3221231013046711310.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 187 rows 212 cols 729 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-25 10:23:22] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3221231013046711310.kers
Total runtime 3 ms.
[2026-05-25 10:23:23] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-25 10:23:23] [INFO ] Invariant cache hit.
[2026-05-25 10:23:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:23:23] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2026-05-25 10:23:23] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:23:23] [INFO ] Invariant cache hit.
[2026-05-25 10:23:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (OVERLAPS) 1/426 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 306 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 1/238 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 187/425 variables, 238/301 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 184/491 constraints. Problems are: Problem set: 0 solved, 184 unsolved
SMT process timed out in 60170ms, After SMT, problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/361 places, 187/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61238 ms. Remains : 239/361 places, 187/305 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 47 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-07
Product exploration explored 100000 steps with 4895 reset in 426 ms.
Product exploration explored 100000 steps with 4920 reset in 440 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge based reduction with 3 factoid took 84 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 (2006 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (401 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037451 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037451 steps, saw 142573 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2026-05-25 10:24:28] [INFO ] Invariant cache hit.
[2026-05-25 10:24:28] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/139 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/171 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/173 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/197 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/139 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/171 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/173 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/197 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 567 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 30 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1920 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (403 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 921085 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 1
Probabilistic random walk after 921085 steps, saw 126707 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-450077498250855559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11369786981336698399.kers'
[2026-05-25 10:24:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-450077498250855559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11369786981336698399.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 185 rows 211 cols 726 entries
Finished phase 1 with 139 SingleSign rule and 40 generalized
[2026-05-25 10:24:33] [INFO ] Computed 59 invariants in 3 ms
Computed 59 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11369786981336698399.kers
Total runtime 4 ms.
[2026-05-25 10:24:33] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/183 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/185 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/197 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/183 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/185 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/197 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/362 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/362 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/394 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/394 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/423 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 522 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2026-05-25 10:24:34] [INFO ] Invariant cache hit.
[2026-05-25 10:24:35] [INFO ] Implicit Places using invariants in 539 ms returned []
[2026-05-25 10:24:35] [INFO ] Invariant cache hit.
[2026-05-25 10:24:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:24:35] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2026-05-25 10:24:35] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-25 10:24:35] [INFO ] Invariant cache hit.
[2026-05-25 10:24:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 307 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 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/235 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 185/422 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 182/488 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 493 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 237/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61228 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 15 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18041547505968500190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14753413385384201033.kers'
[2026-05-25 10:25:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18041547505968500190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14753413385384201033.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 185 rows 211 cols 727 entries
Finished phase 1 with 139 SingleSign rule and 40 generalized
[2026-05-25 10:25:36] [INFO ] Computed 59 invariants in 3 ms
Computed 59 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14753413385384201033.kers
Total runtime 4 ms.
[2026-05-25 10:25:36] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 10:25:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2026-05-25 10:25:36] [INFO ] [Nat]Absence check using 39 positive and 20 generalized place invariants in 28 ms returned sat
[2026-05-25 10:25:36] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 10:25:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 1
[2026-05-25 10:25:36] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 10:25:36] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 597 ms.
Knowledge based reduction with 3 factoid took 51 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 71788 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8915124766508810392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13031143708701409091.kers'
[2026-05-25 10:25:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8915124766508810392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13031143708701409091.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 187 rows 212 cols 729 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-25 10:25:36] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13031143708701409091.kers
Total runtime 2 ms.
[2026-05-25 10:25:37] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-25 10:25:37] [INFO ] Invariant cache hit.
[2026-05-25 10:25:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:25:37] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2026-05-25 10:25:37] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:25:37] [INFO ] Invariant cache hit.
[2026-05-25 10:25:37] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (OVERLAPS) 1/426 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 1/238 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/300 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 184/490 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 490 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60804 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1958 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (410 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 944121 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 1
Probabilistic random walk after 944121 steps, saw 130080 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
[2026-05-25 10:26:40] [INFO ] Invariant cache hit.
[2026-05-25 10:26:40] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/139 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/171 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/173 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/197 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/139 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/171 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/173 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/197 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 798ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 496 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 26 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1913 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (365 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1075783 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 1
Probabilistic random walk after 1075783 steps, saw 147636 distinct states, run finished after 3002 ms. (steps per millisecond=358 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7466359659858135780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14650788648914430447.kers'
[2026-05-25 10:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7466359659858135780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14650788648914430447.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 185 rows 211 cols 726 entries
Finished phase 1 with 139 SingleSign rule and 40 generalized
[2026-05-25 10:26:45] [INFO ] Computed 59 invariants in 4 ms
Computed 59 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14650788648914430447.kers
Total runtime 5 ms.
[2026-05-25 10:26:45] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/183 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/185 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/197 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/145 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/183 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/185 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/197 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/200 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/362 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/362 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/394 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/394 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 29/423 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 524 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 8 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2026-05-25 10:26:46] [INFO ] Invariant cache hit.
[2026-05-25 10:26:47] [INFO ] Implicit Places using invariants in 473 ms returned []
[2026-05-25 10:26:47] [INFO ] Invariant cache hit.
[2026-05-25 10:26:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:26:48] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2026-05-25 10:26:48] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-25 10:26:48] [INFO ] Invariant cache hit.
[2026-05-25 10:26:48] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 308 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 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/235 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 185/422 variables, 237/301 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 182/489 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 492 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 237/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61375 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 16 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12745756077074526338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1148919673422514006.kers'
[2026-05-25 10:27:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12745756077074526338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1148919673422514006.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 185 rows 211 cols 727 entries
Finished phase 1 with 139 SingleSign rule and 40 generalized
[2026-05-25 10:27:48] [INFO ] Computed 59 invariants in 2 ms
Computed 59 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1148919673422514006.kers
Total runtime 4 ms.
[2026-05-25 10:27:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 10:27:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2026-05-25 10:27:48] [INFO ] [Nat]Absence check using 39 positive and 20 generalized place invariants in 28 ms returned sat
[2026-05-25 10:27:48] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 10:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
TRAPS : Iteration 1
[2026-05-25 10:27:48] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 10:27:48] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 598 ms.
Knowledge based reduction with 3 factoid took 67 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 55 ms :[(NOT p0)]
Knowledge-based reduction took 71413 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4939 reset in 377 ms.
Product exploration explored 100000 steps with 4883 reset in 442 ms.
Built C files in :
/tmp/ltsmin13980628289420086390
[2026-05-25 10:27:49] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2026-05-25 10:27:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:27:49] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2026-05-25 10:27:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:27:49] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2026-05-25 10:27:49] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:27:49] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13980628289420086390
Running compilation step : cd /tmp/ltsmin13980628289420086390;'/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 694 ms.
Running link step : cd /tmp/ltsmin13980628289420086390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin13980628289420086390;'/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/stateBased11214740184004052955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2501891809150128819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17493595802118835991.kers'
[2026-05-25 10:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2501891809150128819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17493595802118835991.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 187 rows 212 cols 729 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-25 10:28:04] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17493595802118835991.kers
Total runtime 3 ms.
[2026-05-25 10:28:05] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-25 10:28:05] [INFO ] Invariant cache hit.
[2026-05-25 10:28:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 10:28:05] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2026-05-25 10:28:05] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:28:05] [INFO ] Invariant cache hit.
[2026-05-25 10:28:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (OVERLAPS) 1/426 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 1/238 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/300 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 184/490 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 490 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60916 ms. Remains : 239/239 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin9005956947905517968
[2026-05-25 10:29:05] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2026-05-25 10:29:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:29:05] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2026-05-25 10:29:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:29:05] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2026-05-25 10:29:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:29:05] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9005956947905517968
Running compilation step : cd /tmp/ltsmin9005956947905517968;'/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 725 ms.
Running link step : cd /tmp/ltsmin9005956947905517968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9005956947905517968;'/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/stateBased7021824244110756773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:29:20] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:29:21] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:29:21] [INFO ] Time to serialize gal into /tmp/LTL6774350261199051388.gal : 6 ms
[2026-05-25 10:29:21] [INFO ] Time to serialize properties into /tmp/LTL5820612774780699760.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/LTL6774350261199051388.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5150277523221846776.hoa' '-atoms' '/tmp/LTL5820612774780699760.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...317
Loading property file /tmp/LTL5820612774780699760.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5150277523221846776.hoa
Detected timeout of ITS tools.
[2026-05-25 10:29:36] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:29:36] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:29:36] [INFO ] Time to serialize gal into /tmp/LTL1483052460421793146.gal : 5 ms
[2026-05-25 10:29:36] [INFO ] Time to serialize properties into /tmp/LTL9096720816137384992.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1483052460421793146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9096720816137384992.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p100==0)||(p149==0))"))))
Formula 0 simplified : GF!"((p100==0)||(p149==0))"
Detected timeout of ITS tools.
[2026-05-25 10:29:51] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:29:51] [INFO ] Applying decomposition
[2026-05-25 10:29:51] [INFO ] Flatten gal took : 33 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/graph33280448316874835.txt' '-o' '/tmp/graph33280448316874835.bin' '-w' '/tmp/graph33280448316874835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph33280448316874835.bin' '-l' '-1' '-v' '-w' '/tmp/graph33280448316874835.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:29:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:29:51] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-25 10:29:51] [INFO ] Flatten gal took : 276 ms
[2026-05-25 10:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 14 ms.
[2026-05-25 10:29:51] [INFO ] Time to serialize gal into /tmp/LTL18239237377089558970.gal : 45 ms
[2026-05-25 10:29:51] [INFO ] Time to serialize properties into /tmp/LTL12332323253597915076.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/LTL18239237377089558970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12332323253597915076.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((u2.p100==0)||(u2.p149==0))"))))
Formula 0 simplified : GF!"((u2.p100==0)||(u2.p149==0))"
Reverse transition relation is NOT exact ! Due to transitions t117_t125, t298_t79, t7_t48_t39, t266_t34, t265_t25, t107_t108_t124_t304_t131_t127_t128_t118,...739
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-07 finished in 404259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((F(p1) U G(p0)))) U p2))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 357 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 357 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 357 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 354 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 354 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 354 transition count 294
Applied a total of 18 rules in 26 ms. Remains 354 /361 variables (removed 7) and now considering 294/305 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-543933027340080280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4644262002107353214.kers'
[2026-05-25 10:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-543933027340080280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4644262002107353214.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 354 cols 999 entries
Finished phase 1 with 162 SingleSign rule and 130 generalized
[2026-05-25 10:30:07] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4644262002107353214.kers
Total runtime 3 ms.
[2026-05-25 10:30:07] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-25 10:30:07] [INFO ] Invariant cache hit.
[2026-05-25 10:30:08] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-25 10:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 438 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 22/84 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 16/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/648 variables, 354/464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 293/757 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 757 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 354/361 places, 294/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61551 ms. Remains : 354/361 places, 294/305 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((F(p1) U G(p0)))) U p2))'
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-08
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-08 finished in 61747 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 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Graph (complete) has 784 edges and 361 vertex of which 355 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 354 transition count 285
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 338 transition count 284
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 338 transition count 273
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 327 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 324 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 324 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 321 transition count 267
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 321 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 321 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 321 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 319 transition count 262
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 223 place count 245 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 243 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 241 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 240 transition count 188
Applied a total of 230 rules in 53 ms. Remains 240 /361 variables (removed 121) and now considering 188/305 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6630964966820844003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5894702272810638391.kers'
[2026-05-25 10:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6630964966820844003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5894702272810638391.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 188 rows 228 cols 770 entries
Finished phase 1 with 116 SingleSign rule and 66 generalized
[2026-05-25 10:31:08] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5894702272810638391.kers
Total runtime 6 ms.
[2026-05-25 10:31:09] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-25 10:31:09] [INFO ] Invariant cache hit.
[2026-05-25 10:31:09] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2026-05-25 10:31:09] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:31:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 2/239 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 188/427 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/428 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 301 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 2/239 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 188/427 variables, 239/300 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 184/484 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/428 variables, and 486 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/240 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 240/361 places, 188/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60825 ms. Remains : 240/361 places, 188/305 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 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-11
Product exploration explored 100000 steps with 5116 reset in 396 ms.
Product exploration explored 100000 steps with 5092 reset in 495 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge based reduction with 3 factoid took 69 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 7421 steps (362 resets) in 40 ms. (181 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 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 88 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 289 ms.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-25 10:32:10] [INFO ] Invariant cache hit.
[2026-05-25 10:32:11] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-25 10:32:11] [INFO ] Invariant cache hit.
[2026-05-25 10:32:11] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2026-05-25 10:32:11] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 240/240 places, 188/188 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge based reduction with 3 factoid took 56 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 6233 steps (336 resets) in 35 ms. (173 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 68 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 86 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 243 ms.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5110 reset in 387 ms.
Product exploration explored 100000 steps with 5004 reset in 374 ms.
Built C files in :
/tmp/ltsmin15285244278266421199
[2026-05-25 10:32:13] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2026-05-25 10:32:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:13] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2026-05-25 10:32:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:13] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2026-05-25 10:32:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:13] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15285244278266421199
Running compilation step : cd /tmp/ltsmin15285244278266421199;'/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 630 ms.
Running link step : cd /tmp/ltsmin15285244278266421199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15285244278266421199;'/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/stateBased9768106443678166991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-25 10:32:28] [INFO ] Invariant cache hit.
[2026-05-25 10:32:28] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-25 10:32:28] [INFO ] Invariant cache hit.
[2026-05-25 10:32:28] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2026-05-25 10:32:28] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 880 ms. Remains : 240/240 places, 188/188 transitions.
Built C files in :
/tmp/ltsmin14259338984505113745
[2026-05-25 10:32:28] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2026-05-25 10:32:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:28] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2026-05-25 10:32:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:28] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
[2026-05-25 10:32:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:28] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14259338984505113745
Running compilation step : cd /tmp/ltsmin14259338984505113745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin14259338984505113745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14259338984505113745;'/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/stateBased14902113696120098998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:32:44] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:32:44] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:32:44] [INFO ] Time to serialize gal into /tmp/LTL12479935036441713467.gal : 3 ms
[2026-05-25 10:32:44] [INFO ] Time to serialize properties into /tmp/LTL10562124135026484666.prop : 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/LTL12479935036441713467.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11231081969614236048.hoa' '-atoms' '/tmp/LTL10562124135026484666.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/LTL10562124135026484666.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11231081969614236048.hoa
Detected timeout of ITS tools.
[2026-05-25 10:32:59] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:32:59] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:32:59] [INFO ] Time to serialize gal into /tmp/LTL3920293324926491021.gal : 3 ms
[2026-05-25 10:32:59] [INFO ] Time to serialize properties into /tmp/LTL12228663476716108094.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/LTL3920293324926491021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12228663476716108094.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p354==0)||(p370==0))"))))
Formula 0 simplified : FG!"((p354==0)||(p370==0))"
Detected timeout of ITS tools.
[2026-05-25 10:33:14] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:33:14] [INFO ] Applying decomposition
[2026-05-25 10:33:14] [INFO ] Flatten gal took : 21 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/graph14960000684489536861.txt' '-o' '/tmp/graph14960000684489536861.bin' '-w' '/tmp/graph14960000684489536861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14960000684489536861.bin' '-l' '-1' '-v' '-w' '/tmp/graph14960000684489536861.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:33:14] [INFO ] Decomposing Gal with order
[2026-05-25 10:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:33:14] [INFO ] Removed a total of 48 redundant transitions.
[2026-05-25 10:33:14] [INFO ] Flatten gal took : 59 ms
[2026-05-25 10:33:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2026-05-25 10:33:14] [INFO ] Time to serialize gal into /tmp/LTL2020409806368783907.gal : 7 ms
[2026-05-25 10:33:14] [INFO ] Time to serialize properties into /tmp/LTL3903098933848035997.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/LTL2020409806368783907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3903098933848035997.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i8.i5.u39.p354==0)||(i0.u42.p370==0))"))))
Formula 0 simplified : FG!"((i8.i5.u39.p354==0)||(i0.u42.p370==0))"
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-11 finished in 140739 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 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 300
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 356 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 353 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 353 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 353 transition count 293
Applied a total of 20 rules in 22 ms. Remains 353 /361 variables (removed 8) and now considering 293/305 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18150913868513455441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11770990327981342993.kers'
[2026-05-25 10:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18150913868513455441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11770990327981342993.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 353 cols 997 entries
Finished phase 1 with 161 SingleSign rule and 130 generalized
[2026-05-25 10:33:29] [INFO ] Computed 62 invariants in 3 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11770990327981342993.kers
Total runtime 4 ms.
[2026-05-25 10:33:29] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-25 10:33:29] [INFO ] Invariant cache hit.
[2026-05-25 10:33:30] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-25 10:33:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 16/431 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 431 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/646 variables, and 116 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/292 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 353/361 places, 293/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61257 ms. Remains : 353/361 places, 293/305 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 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-13 finished in 61414 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((X(X(p0))&&F(!p1))) U p2)))'
Support contains 5 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 357 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 357 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 357 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 355 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 355 transition count 296
Applied a total of 15 rules in 32 ms. Remains 355 /361 variables (removed 6) and now considering 296/305 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18273137881113327241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16454630701600115554.kers'
[2026-05-25 10:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18273137881113327241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16454630701600115554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 355 cols 1005 entries
Finished phase 1 with 163 SingleSign rule and 130 generalized
[2026-05-25 10:34:30] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16454630701600115554.kers
Total runtime 5 ms.
[2026-05-25 10:34:31] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-05-25 10:34:31] [INFO ] Invariant cache hit.
[2026-05-25 10:34:32] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-25 10:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 295 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/651 variables, 355/417 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 18/435 constraints. Problems are: Problem set: 0 solved, 295 unsolved
SMT process timed out in 30062ms, After SMT, problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 30063ms
Starting structural reductions in LTL mode, iteration 1 : 355/361 places, 296/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31723 ms. Remains : 355/361 places, 296/305 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((X(X(p0))&&F(!p1))) U p2)))'
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DES-PT-30b-LTLFireability-14
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-14 finished in 32078 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))) U (p1 U p2))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 305/305 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 357 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 357 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 357 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 355 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 355 transition count 296
Applied a total of 15 rules in 34 ms. Remains 355 /361 variables (removed 6) and now considering 296/305 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13273767417859408648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13412371750941578155.kers'
[2026-05-25 10:35:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13273767417859408648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13412371750941578155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 355 cols 1005 entries
Finished phase 1 with 163 SingleSign rule and 130 generalized
[2026-05-25 10:35:03] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13412371750941578155.kers
Total runtime 5 ms.
[2026-05-25 10:35:03] [INFO ] Implicit Places using invariants in 540 ms returned []
[2026-05-25 10:35:03] [INFO ] Invariant cache hit.
[2026-05-25 10:35:04] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 355/361 places, 296/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1963 ms. Remains : 355/361 places, 296/305 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))) U (p1 U p2))))'
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-15
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-15 finished in 2146 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)))'
Spot run failed in 54 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.
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 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 10:35:05] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12507735254962224825
[2026-05-25 10:35:05] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2026-05-25 10:35:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:05] [INFO ] Applying decomposition
[2026-05-25 10:35:05] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2026-05-25 10:35:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:05] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:35:05] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2026-05-25 10:35:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:05] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12507735254962224825
Running compilation step : cd /tmp/ltsmin12507735254962224825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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/graph6598291201622407369.txt' '-o' '/tmp/graph6598291201622407369.bin' '-w' '/tmp/graph6598291201622407369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6598291201622407369.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598291201622407369.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:35:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:35:05] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-25 10:35:05] [INFO ] Flatten gal took : 35 ms
[2026-05-25 10:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2026-05-25 10:35:05] [INFO ] Time to serialize gal into /tmp/LTLFireability6249605871236972162.gal : 23 ms
[2026-05-25 10:35:05] [INFO ] Time to serialize properties into /tmp/LTLFireability11403067005615214080.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/LTLFireability6249605871236972162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11403067005615214080.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((i3.u10.p100==0)||(i3.u10.p149==0))"))))
Formula 0 simplified : GF!"((i3.u10.p100==0)||(i3.u10.p149==0))"
Compilation finished in 1433 ms.
Running link step : cd /tmp/ltsmin12507735254962224825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12507735254962224825;'/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'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t125, t226, t265, t266, t298, u32.t76, u31.t79, u76.t17, i3.t119, i3.u10.t197, i3.u1...1115
Computing Next relation with stutter on 1.89514e+08 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12507735254962224825;'/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'
Running LTSmin : cd /tmp/ltsmin12507735254962224825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 11:02:50] [INFO ] Applying decomposition
[2026-05-25 11:02:50] [INFO ] Flatten gal took : 10 ms
[2026-05-25 11:02:50] [INFO ] Decomposing Gal with order
[2026-05-25 11:02:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:02:50] [INFO ] Removed a total of 126 redundant transitions.
[2026-05-25 11:02:50] [INFO ] Flatten gal took : 28 ms
[2026-05-25 11:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 428 labels/synchronizations in 30 ms.
[2026-05-25 11:02:50] [INFO ] Time to serialize gal into /tmp/LTLFireability12511621793883134225.gal : 6 ms
[2026-05-25 11:02:50] [INFO ] Time to serialize properties into /tmp/LTLFireability9679241092367314098.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/LTLFireability12511621793883134225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9679241092367314098.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((i0.u7.p100==0)||(i1.i0.i0.i0.i0.i0.u17.p149==0))"))))
Formula 0 simplified : GF!"((i0.u7.p100==0)||(i1.i0.i0.i0.i0.i0.u17.p149==0))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12507735254962224825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12507735254962224825;'/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'

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="DES-PT-30b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DES-PT-30b, 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-177946993700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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