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.r034-tall-177946842000508.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 BusinessProcesses-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 91K 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 BusinessProcesses-PT-08-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779615082660

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 09:31:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 09:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:31:23] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-24 09:31:23] [INFO ] Transformed 393 places.
[2026-05-24 09:31:23] [INFO ] Transformed 344 transitions.
[2026-05-24 09:31:23] [INFO ] Found NUPN structural information;
[2026-05-24 09:31:23] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 13 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-08-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 74 place count 306 transition count 265
Iterating global reduction 1 with 66 rules applied. Total rules applied 140 place count 306 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 141 place count 306 transition count 264
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 177 place count 270 transition count 228
Iterating global reduction 2 with 36 rules applied. Total rules applied 213 place count 270 transition count 228
Applied a total of 213 rules in 81 ms. Remains 270 /380 variables (removed 110) and now considering 228/331 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6312457307077945981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1249554900998694820.kers'
[2026-05-24 09:31:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6312457307077945981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1249554900998694820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 270 cols 671 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-24 09:31:24] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1249554900998694820.kers
Total runtime 2 ms.
[2026-05-24 09:31:24] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 09:31:24] [INFO ] Invariant cache hit.
[2026-05-24 09:31:24] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-24 09:31:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/498 variables, 270/348 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 359 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/498 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 227/583 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 227 unsolved
SMT process timed out in 60094ms, After SMT, problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 270/380 places, 228/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60988 ms. Remains : 270/380 places, 228/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Applied a total of 0 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-24 09:32:25] [INFO ] Invariant cache hit.
[2026-05-24 09:32:25] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-24 09:32:25] [INFO ] Invariant cache hit.
[2026-05-24 09:32:25] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 270/270 places, 228/228 transitions.
Support contains 27 out of 270 places after structural reductions.
[2026-05-24 09:32:25] [INFO ] Flatten gal took : 38 ms
[2026-05-24 09:32:25] [INFO ] Flatten gal took : 15 ms
[2026-05-24 09:32:25] [INFO ] Input system was already deterministic with 228 transitions.
RANDOM walk for 40000 steps (341 resets) in 1301 ms. (30 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40003 steps (50 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (59 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2026-05-24 09:32:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/248 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 209/457 variables, 248/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/490 variables, 16/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/498 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/248 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 209/457 variables, 248/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 33/490 variables, 16/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/498 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/498 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1293ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 268 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=89 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 92 stabilizing places and 88 stable transitions
Graph (complete) has 574 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(G(p1)))))))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 260 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 260 transition count 218
Applied a total of 20 rules in 18 ms. Remains 260 /270 variables (removed 10) and now considering 218/228 (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-6702175573497043332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3194717100814483135.kers'
[2026-05-24 09:32:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6702175573497043332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3194717100814483135.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 260 cols 651 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-24 09:32:28] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3194717100814483135.kers
Total runtime 1 ms.
[2026-05-24 09:32:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 09:32:28] [INFO ] Invariant cache hit.
[2026-05-24 09:32:28] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-24 09:32:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/332 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 341 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/555 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 217 unsolved
SMT process timed out in 60047ms, After SMT, problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 260/270 places, 218/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60541 ms. Remains : 260/270 places, 218/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(G(p1)))))))'
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-03
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-03 finished in 60965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 138 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 263 transition count 188
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 231 transition count 188
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 66 place count 231 transition count 135
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 182 place count 168 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 189 place count 161 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 196 place count 161 transition count 128
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 352 place count 82 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 81 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 80 transition count 50
Applied a total of 354 rules in 48 ms. Remains 80 /270 variables (removed 190) and now considering 50/228 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6817529333800381648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11815399400692568230.kers'
[2026-05-24 09:33:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6817529333800381648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11815399400692568230.kers]
Normalized transition count is 49 out of 50 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 49 rows 45 cols 146 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 09:33:28] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11815399400692568230.kers
Total runtime 3 ms.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants in 77 ms returned [5, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/270 places, 50/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 78/270 places, 50/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-04 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 141 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 263 transition count 187
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 230 transition count 187
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 68 place count 230 transition count 132
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 189 place count 164 transition count 132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 197 place count 156 transition count 124
Iterating global reduction 2 with 8 rules applied. Total rules applied 205 place count 156 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 356 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 358 place count 77 transition count 49
Applied a total of 358 rules in 35 ms. Remains 77 /270 variables (removed 193) and now considering 49/228 (removed 179) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14359669862993862337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1546815843233630114.kers'
[2026-05-24 09:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14359669862993862337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1546815843233630114.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 48 rows 54 cols 185 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-24 09:33:29] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1546815843233630114.kers
Total runtime 0 ms.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 09:33:29] [INFO ] Invariant cache hit.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [14, 15, 17, 19, 21, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 171 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/270 places, 49/228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 51 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 44 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 38 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 38 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 38 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 35 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 31 transition count 29
Applied a total of 40 rules in 8 ms. Remains 31 /51 variables (removed 20) and now considering 29/49 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17549979072139253345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12851934890466685471.kers'
[2026-05-24 09:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17549979072139253345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12851934890466685471.kers]
Normalized transition count is 28 out of 29 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 28 rows 20 cols 51 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-24 09:33:29] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12851934890466685471.kers
Total runtime 0 ms.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 09:33:29] [INFO ] Invariant cache hit.
[2026-05-24 09:33:29] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 86 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/270 places, 29/228 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 28
Applied a total of 1 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/29 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8619478468629540294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13164724966902064370.kers'
[2026-05-24 09:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8619478468629540294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13164724966902064370.kers]
Normalized transition count is 27 out of 28 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 20 cols 49 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-24 09:33:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13164724966902064370.kers
Total runtime 0 ms.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 09:33:29] [INFO ] Invariant cache hit.
[2026-05-24 09:33:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 20/270 places, 28/228 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 353 ms. Remains : 20/270 places, 28/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-05 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 261 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 261 transition count 219
Applied a total of 18 rules in 17 ms. Remains 261 /270 variables (removed 9) and now considering 219/228 (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-9760517927511347905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9722671329835046226.kers'
[2026-05-24 09:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9760517927511347905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9722671329835046226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 261 cols 653 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-24 09:33:29] [INFO ] Computed 50 invariants in 3 ms
Computed 50 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9722671329835046226.kers
Total runtime 3 ms.
[2026-05-24 09:33:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 09:33:29] [INFO ] Invariant cache hit.
[2026-05-24 09:33:30] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 09:33:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/333 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 343 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
SMT process timed out in 60049ms, After SMT, problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 261/270 places, 219/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60554 ms. Remains : 261/270 places, 219/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-07 finished in 60767 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)&&F(p1)) U p2) U !p0))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 139 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 263 transition count 187
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 230 transition count 187
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 68 place count 230 transition count 133
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 187 place count 165 transition count 133
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 194 place count 158 transition count 126
Iterating global reduction 2 with 7 rules applied. Total rules applied 201 place count 158 transition count 126
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 349 place count 83 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 82 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 81 transition count 52
Applied a total of 351 rules in 26 ms. Remains 81 /270 variables (removed 189) and now considering 52/228 (removed 176) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8295412737604228625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3074310999720574393.kers'
[2026-05-24 09:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8295412737604228625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3074310999720574393.kers]
Normalized transition count is 51 out of 52 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 51 rows 57 cols 181 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 09:34:30] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3074310999720574393.kers
Total runtime 1 ms.
[2026-05-24 09:34:30] [INFO ] Implicit Places using invariants in 62 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/270 places, 52/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 80/270 places, 52/228 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)&&F(p1)) U p2) U !p0))'
Stuttering acceptance computed with spot in 143 ms :[p0, (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-08 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((!p0||X(X(X(p1)))) U p2)))))'
Support contains 7 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 260 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 260 transition count 218
Applied a total of 20 rules in 12 ms. Remains 260 /270 variables (removed 10) and now considering 218/228 (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-6732665839117771220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8263631091165225342.kers'
[2026-05-24 09:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6732665839117771220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8263631091165225342.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 260 cols 651 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-24 09:34:30] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8263631091165225342.kers
Total runtime 1 ms.
[2026-05-24 09:34:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 09:34:30] [INFO ] Invariant cache hit.
[2026-05-24 09:34:31] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-24 09:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/332 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 343 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/555 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 564 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 260/270 places, 218/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 260/270 places, 218/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((!p0||X(X(X(p1)))) U p2)))))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-11
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-11 finished in 60854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 138 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 263 transition count 188
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 231 transition count 188
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 66 place count 231 transition count 135
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 183 place count 167 transition count 135
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 160 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 160 transition count 128
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 354 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 356 place count 78 transition count 50
Applied a total of 356 rules in 19 ms. Remains 78 /270 variables (removed 192) and now considering 50/228 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-453227531213247101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4784137399345066672.kers'
[2026-05-24 09:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-453227531213247101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4784137399345066672.kers]
Normalized transition count is 49 out of 50 initially.
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 49 rows 44 cols 141 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 09:35:31] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4784137399345066672.kers
Total runtime 0 ms.
[2026-05-24 09:35:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 09:35:31] [INFO ] Invariant cache hit.
[2026-05-24 09:35:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 49, 51, 53, 55, 57, 59, 61]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 163 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/270 places, 50/228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 42 transition count 44
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 36 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 30 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 30 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 30 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 27 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 36 place count 24 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 24 transition count 31
Applied a total of 37 rules in 8 ms. Remains 24 /42 variables (removed 18) and now considering 31/50 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2124391947820282728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14523491400468743547.kers'
[2026-05-24 09:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2124391947820282728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14523491400468743547.kers]
Normalized transition count is 30 out of 31 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 24 cols 67 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 09:35:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14523491400468743547.kers
Total runtime 0 ms.
[2026-05-24 09:35:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 09:35:31] [INFO ] Invariant cache hit.
[2026-05-24 09:35:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/270 places, 31/228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 24/270 places, 31/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-12 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1) U (p2||G(p3))))'
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 133 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 263 transition count 191
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 234 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 233 transition count 190
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 62 place count 233 transition count 138
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 176 place count 171 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 183 place count 164 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 190 place count 164 transition count 131
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 342 place count 87 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 343 place count 86 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 85 transition count 55
Applied a total of 344 rules in 21 ms. Remains 85 /270 variables (removed 185) and now considering 55/228 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6969776499830768009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4431884212152451359.kers'
[2026-05-24 09:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6969776499830768009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4431884212152451359.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 54 rows 66 cols 205 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-24 09:35:31] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4431884212152451359.kers
Total runtime 0 ms.
[2026-05-24 09:35:31] [INFO ] Implicit Places using invariants in 44 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/270 places, 55/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 84/270 places, 55/228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1) U (p2||G(p3))))'
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-13
Stuttering criterion allowed to conclude after 3829 steps with 502 reset in 21 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-13 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 264 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 264 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 263 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 263 transition count 221
Applied a total of 14 rules in 12 ms. Remains 263 /270 variables (removed 7) and now considering 221/228 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16941165149037801312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-405637992466712713.kers'
[2026-05-24 09:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16941165149037801312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-405637992466712713.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 263 cols 657 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 09:35:32] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-405637992466712713.kers
Total runtime 1 ms.
[2026-05-24 09:35:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-24 09:35:32] [INFO ] Invariant cache hit.
[2026-05-24 09:35:32] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 09:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 349 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/484 variables, 263/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 220/563 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 6/569 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60049ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 263/270 places, 221/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60435 ms. Remains : 263/270 places, 221/228 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(p0))&&(!p1 U (p2||G(!p1)))))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 20698 steps with 342 reset in 57 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-14 finished in 60679 ms.
All properties solved by simple procedures.
Total runtime 309126 ms.

BK_STOP 1779615392894

--------------------
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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r034-tall-177946842000508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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