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.r066-tall-177946967700356.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 CO4-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 132K 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 CO4-PT-10-LTLFireability-00
FORMULA_NAME CO4-PT-10-LTLFireability-01
FORMULA_NAME CO4-PT-10-LTLFireability-02
FORMULA_NAME CO4-PT-10-LTLFireability-03
FORMULA_NAME CO4-PT-10-LTLFireability-04
FORMULA_NAME CO4-PT-10-LTLFireability-05
FORMULA_NAME CO4-PT-10-LTLFireability-06
FORMULA_NAME CO4-PT-10-LTLFireability-07
FORMULA_NAME CO4-PT-10-LTLFireability-08
FORMULA_NAME CO4-PT-10-LTLFireability-09
FORMULA_NAME CO4-PT-10-LTLFireability-10
FORMULA_NAME CO4-PT-10-LTLFireability-11
FORMULA_NAME CO4-PT-10-LTLFireability-12
FORMULA_NAME CO4-PT-10-LTLFireability-13
FORMULA_NAME CO4-PT-10-LTLFireability-14
FORMULA_NAME CO4-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779522598243

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:49:59] [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-23 07:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:49:59] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2026-05-23 07:49:59] [INFO ] Transformed 544 places.
[2026-05-23 07:49:59] [INFO ] Transformed 615 transitions.
[2026-05-23 07:49:59] [INFO ] Found NUPN structural information;
[2026-05-23 07:49:59] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 157 places in 10 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 375 transition count 435
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 77 place count 313 transition count 371
Iterating global reduction 1 with 62 rules applied. Total rules applied 139 place count 313 transition count 371
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 191 place count 261 transition count 319
Iterating global reduction 1 with 52 rules applied. Total rules applied 243 place count 261 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 246 place count 261 transition count 316
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 237 transition count 292
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 237 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 237 transition count 291
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 309 place count 223 transition count 277
Iterating global reduction 3 with 14 rules applied. Total rules applied 323 place count 223 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 325 place count 223 transition count 275
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 330 place count 218 transition count 270
Iterating global reduction 4 with 5 rules applied. Total rules applied 335 place count 218 transition count 270
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 337 place count 216 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 339 place count 216 transition count 268
Applied a total of 339 rules in 172 ms. Remains 216 /387 variables (removed 171) and now considering 268/438 (removed 170) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10683215832853409545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8636410438082739338.kers'
[2026-05-23 07:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10683215832853409545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8636410438082739338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 216 cols 599 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:50:00] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8636410438082739338.kers
Total runtime 2 ms.
[2026-05-23 07:50:00] [INFO ] Implicit Places using invariants in 242 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 215/387 places, 268/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 215 /215 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 478 ms. Remains : 215/387 places, 268/438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Applied a total of 0 rules in 5 ms. Remains 215 /215 variables (removed 0) and now considering 268/268 (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-17050609485748441123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15001776518147857668.kers'
[2026-05-23 07:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17050609485748441123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15001776518147857668.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 215 cols 597 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:50:00] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15001776518147857668.kers
Total runtime 1 ms.
[2026-05-23 07:50:00] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 07:50:00] [INFO ] Invariant cache hit.
[2026-05-23 07:50:00] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/483 variables, 215/218 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/483 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 220 constraints, problems are : Problem set: 0 solved, 267 unsolved in 17690 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/483 variables, 215/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 267/487 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 488 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47801ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 47813ms
Finished structural reductions in LTL mode , in 1 iterations and 48069 ms. Remains : 215/215 places, 268/268 transitions.
Support contains 19 out of 215 places after structural reductions.
[2026-05-23 07:50:48] [INFO ] Flatten gal took : 43 ms
[2026-05-23 07:50:48] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:50:48] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 18 out of 215 places (down from 19) after GAL structural reductions.
RANDOM walk for 40000 steps (91 resets) in 1072 ms. (37 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40000 steps (45 resets) in 310 ms. (128 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40000 steps (46 resets) in 199 ms. (200 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (24 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (20 resets) in 380 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (61 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (33 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (36 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (42 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (65 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (28 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (33 resets) in 180 ms. (220 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (25 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
[2026-05-23 07:50:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 50/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 157/219 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 170/389 variables, 79/155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 12/401 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 64/465 variables, 44/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 14/479 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 4/483 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/483 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 218 constraints, problems are : Problem set: 0 solved, 10 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 50/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 157/219 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 170/389 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 12/401 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 64/465 variables, 44/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 14/479 variables, 9/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 4/483 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/483 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/483 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 229 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2094ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 397 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 334 edges and 215 vertex of which 209 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 208 transition count 261
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 206 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 206 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 205 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 205 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 204 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 204 transition count 256
Applied a total of 23 rules in 13 ms. Remains 204 /215 variables (removed 11) and now considering 256/268 (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-3244079497983380190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6567537428106591675.kers'
[2026-05-23 07:50:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3244079497983380190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6567537428106591675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 204 cols 574 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:50:52] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6567537428106591675.kers
Total runtime 2 ms.
[2026-05-23 07:50:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 07:50:52] [INFO ] Invariant cache hit.
[2026-05-23 07:50:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-23 07:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15795 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 465 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45842ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 45843ms
Starting structural reductions in LTL mode, iteration 1 : 204/215 places, 256/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46028 ms. Remains : 204/215 places, 256/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA CO4-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-03 finished in 46399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U G(p2))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 207 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 206 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 205 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 205 transition count 257
Applied a total of 21 rules in 19 ms. Remains 205 /215 variables (removed 10) and now considering 257/268 (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-1387965540802146147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4359825163173430398.kers'
[2026-05-23 07:51:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1387965540802146147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4359825163173430398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 205 cols 575 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:51:39] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4359825163173430398.kers
Total runtime 2 ms.
[2026-05-23 07:51:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 07:51:39] [INFO ] Invariant cache hit.
[2026-05-23 07:51:39] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-23 07:51:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/462 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 210 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15716 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/462 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 256/466 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 467 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45752ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 45754ms
Starting structural reductions in LTL mode, iteration 1 : 205/215 places, 257/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45951 ms. Remains : 205/215 places, 257/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1)) U G(p2))))'
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), true, (NOT p1), (AND (NOT p1) p2), (NOT p2)]
Running random walk in product with property : CO4-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-04 finished in 46187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((G(!p0)||(!p0&&F(p1))))))))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 263
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 263
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 208 transition count 261
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 207 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 206 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 206 transition count 258
Applied a total of 19 rules in 10 ms. Remains 206 /215 variables (removed 9) and now considering 258/268 (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-8396742268696899976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5790953163436548784.kers'
[2026-05-23 07:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8396742268696899976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5790953163436548784.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 206 cols 578 entries
Finished phase 1 with 203 SingleSign rule and 0 generalized
[2026-05-23 07:52:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5790953163436548784.kers
Total runtime 1 ms.
[2026-05-23 07:52:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 07:52:25] [INFO ] Invariant cache hit.
[2026-05-23 07:52:25] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 07:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 16160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46207ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 46207ms
Starting structural reductions in LTL mode, iteration 1 : 206/215 places, 258/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46393 ms. Remains : 206/215 places, 258/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((G(!p0)||(!p0&&F(p1))))))))'
Stuttering acceptance computed with spot in 171 ms :[true, true, p0, (AND p0 (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA CO4-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-08 finished in 46599 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 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Graph (trivial) has 221 edges and 215 vertex of which 3 / 215 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 332 edges and 213 vertex of which 207 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 206 transition count 172
Reduce places removed 86 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 120 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 178 place count 118 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 178 place count 118 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 218 place count 98 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 97 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 97 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 220 place count 97 transition count 148
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 222 place count 96 transition count 148
Performed 35 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 292 place count 61 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 295 place count 61 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 297 place count 59 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 299 place count 59 transition count 97
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 329 place count 44 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 338 place count 44 transition count 90
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 349 place count 33 transition count 68
Iterating global reduction 5 with 11 rules applied. Total rules applied 360 place count 33 transition count 68
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 368 place count 33 transition count 60
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 370 place count 31 transition count 54
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 31 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 373 place count 31 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 376 place count 31 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 378 place count 29 transition count 48
Applied a total of 378 rules in 50 ms. Remains 29 /215 variables (removed 186) and now considering 48/268 (removed 220) transitions.
[2026-05-23 07:53:12] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18399749241479907667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10843740749583216746.kers'
[2026-05-23 07:53:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18399749241479907667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10843740749583216746.kers]
Normalized transition count is 45 out of 46 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 45 rows 29 cols 136 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-23 07:53:12] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10843740749583216746.kers
Total runtime 0 ms.
[2026-05-23 07:53:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 07:53:12] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2026-05-23 07:53:12] [INFO ] Invariant cache hit.
[2026-05-23 07:53:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:53:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-23 07:53:12] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-23 07:53:12] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2026-05-23 07:53:12] [INFO ] Invariant cache hit.
[2026-05-23 07:53:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 45/73 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 34 constraints, problems are : Problem set: 0 solved, 42 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 45/73 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/75 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 76 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1790ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/215 places, 48/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1923 ms. Remains : 29/215 places, 48/268 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 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-10-LTLFireability-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-10 finished in 2025 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 p1) U (G(p0) U X(X(p2)))))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 207 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 206 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 205 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 205 transition count 257
Applied a total of 21 rules in 14 ms. Remains 205 /215 variables (removed 10) and now considering 257/268 (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-6980288457518555325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12587578064284806784.kers'
[2026-05-23 07:53:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6980288457518555325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12587578064284806784.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 205 cols 576 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:53:14] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12587578064284806784.kers
Total runtime 1 ms.
[2026-05-23 07:53:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 07:53:14] [INFO ] Invariant cache hit.
[2026-05-23 07:53:14] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-23 07:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/462 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 210 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/462 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 256/466 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 467 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45687ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 45689ms
Starting structural reductions in LTL mode, iteration 1 : 205/215 places, 257/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45863 ms. Remains : 205/215 places, 257/268 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 p1) U (G(p0) U X(X(p2)))))'
Stuttering acceptance computed with spot in 549 ms :[p2, p2, true, p2, p2, p2, (OR p0 p1), p2, p2, p2, p2, (OR (AND p1 p2) (AND p0 p2))]
Running random walk in product with property : CO4-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 324 edges and 205 vertex of which 200 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 12 states, 31 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA CO4-PT-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-10-LTLFireability-11 finished in 46798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(X(X(F(p1))))&&F(p2)))))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 208 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 208 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 208 transition count 260
Applied a total of 15 rules in 9 ms. Remains 208 /215 variables (removed 7) and now considering 260/268 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7778999741464860631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2539072220862022486.kers'
[2026-05-23 07:54:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7778999741464860631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2539072220862022486.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 208 cols 582 entries
Finished phase 1 with 205 SingleSign rule and 0 generalized
[2026-05-23 07:54:00] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2539072220862022486.kers
Total runtime 1 ms.
[2026-05-23 07:54:00] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 07:54:00] [INFO ] Invariant cache hit.
[2026-05-23 07:54:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-23 07:54:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/468 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 213 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/468 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 259/472 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 473 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46203ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 46204ms
Starting structural reductions in LTL mode, iteration 1 : 208/215 places, 260/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46382 ms. Remains : 208/215 places, 260/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(X(X(X(F(p1))))&&F(p2)))))'
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CO4-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 93 ms.
Product exploration explored 100000 steps with 20000 reset in 103 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 327 edges and 208 vertex of which 203 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge based reduction with 6 factoid took 59 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (37 resets) in 404 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (17 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (64 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (32 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (101 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Probably explored full state space saw : 387328 states, properties seen :3
Probabilistic random walk after 2253782 steps, saw 387328 distinct states, run finished after 2795 ms. (steps per millisecond=806 ) properties seen :3
Explored full state space saw : 387328 states, properties seen :0
Exhaustive walk after 2253782 steps, saw 387328 distinct states, run finished after 2003 ms. (steps per millisecond=1125 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 5501 ms.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-23 07:54:53] [INFO ] Invariant cache hit.
[2026-05-23 07:54:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:54:53] [INFO ] Invariant cache hit.
[2026-05-23 07:54:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 208/208 places, 260/260 transitions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 327 edges and 208 vertex of which 203 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 53 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 (85 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (64 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 98529 steps, run visited all 1 properties in 127 ms. (steps per millisecond=775 )
Probabilistic random walk after 98529 steps, saw 24439 distinct states, run finished after 131 ms. (steps per millisecond=752 ) properties seen :1
Knowledge based reduction with 1 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 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 524 ms.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 96 ms.
Product exploration explored 100000 steps with 20000 reset in 89 ms.
Spot run failed in 73 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/ltsmin14430137828055375804
[2026-05-23 07:54:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14430137828055375804
Running compilation step : cd /tmp/ltsmin14430137828055375804;'/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 471 ms.
Running link step : cd /tmp/ltsmin14430137828055375804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 111 ms.
Running LTSmin : cd /tmp/ltsmin14430137828055375804;'/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/stateBased11765794832779984616.hoa' '--buchi-type=spotba'
LTSmin run took 44 ms.
FORMULA CO4-PT-10-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-10-LTLFireability-13 finished in 54722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 208 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 208 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 207 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 207 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 206 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 206 transition count 259
Applied a total of 18 rules in 15 ms. Remains 206 /215 variables (removed 9) and now considering 259/268 (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-2921417617266508881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2100702973641395891.kers'
[2026-05-23 07:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2921417617266508881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2100702973641395891.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 206 cols 580 entries
Finished phase 1 with 203 SingleSign rule and 0 generalized
[2026-05-23 07:54:55] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2100702973641395891.kers
Total runtime 3 ms.
[2026-05-23 07:54:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 07:54:55] [INFO ] Invariant cache hit.
[2026-05-23 07:54:55] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-23 07:54:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/465 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 211 constraints, problems are : Problem set: 0 solved, 258 unsolved in 15780 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/465 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 258/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 470 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45816ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 45817ms
Starting structural reductions in LTL mode, iteration 1 : 206/215 places, 259/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45999 ms. Remains : 206/215 places, 259/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-14 finished in 46250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 268/268 transitions.
Graph (trivial) has 223 edges and 215 vertex of which 3 / 215 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 332 edges and 213 vertex of which 207 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 206 transition count 172
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 120 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 119 transition count 171
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 176 place count 119 transition count 150
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 218 place count 98 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 97 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 97 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 220 place count 97 transition count 148
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 222 place count 96 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 95 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 95 transition count 147
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 296 place count 59 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 299 place count 59 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 301 place count 57 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 303 place count 57 transition count 95
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 327 place count 45 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 335 place count 45 transition count 87
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 344 place count 36 transition count 69
Iterating global reduction 5 with 9 rules applied. Total rules applied 353 place count 36 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 360 place count 36 transition count 62
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 361 place count 35 transition count 59
Iterating global reduction 6 with 1 rules applied. Total rules applied 362 place count 35 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 365 place count 35 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 367 place count 33 transition count 54
Applied a total of 367 rules in 31 ms. Remains 33 /215 variables (removed 182) and now considering 54/268 (removed 214) transitions.
[2026-05-23 07:55:41] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5384155599418916314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13605659989646614368.kers'
[2026-05-23 07:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5384155599418916314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13605659989646614368.kers]
Normalized transition count is 49 out of 50 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 49 rows 33 cols 144 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-23 07:55:41] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13605659989646614368.kers
Total runtime 1 ms.
[2026-05-23 07:55:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 07:55:41] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
[2026-05-23 07:55:41] [INFO ] Invariant cache hit.
[2026-05-23 07:55:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:55:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2026-05-23 07:55:41] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-23 07:55:41] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
[2026-05-23 07:55:41] [INFO ] Invariant cache hit.
[2026-05-23 07:55:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 49/82 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 38 constraints, problems are : Problem set: 0 solved, 44 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 49/82 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/83 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1679ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/215 places, 54/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1793 ms. Remains : 33/215 places, 54/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-15 finished in 1865 ms.
All properties solved by simple procedures.
Total runtime 344284 ms.

BK_STOP 1779522943775

--------------------
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="CO4-PT-10"
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 CO4-PT-10, 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 r066-tall-177946967700356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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