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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K 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 46K 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 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 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779623612924

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 11:53:34] [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 11:53:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:53:34] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-24 11:53:34] [INFO ] Transformed 630 places.
[2026-05-24 11:53:34] [INFO ] Transformed 566 transitions.
[2026-05-24 11:53:34] [INFO ] Found NUPN structural information;
[2026-05-24 11:53:34] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 219 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 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 87 place count 539 transition count 478
Iterating global reduction 1 with 84 rules applied. Total rules applied 171 place count 539 transition count 478
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 209 place count 501 transition count 440
Iterating global reduction 1 with 38 rules applied. Total rules applied 247 place count 501 transition count 440
Applied a total of 247 rules in 156 ms. Remains 501 /626 variables (removed 125) and now considering 440/562 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15178523302352225598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8297856800931376997.kers'
[2026-05-24 11:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15178523302352225598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8297856800931376997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 440 rows 501 cols 1411 entries
Finished phase 1 with 325 SingleSign rule and 77 generalized
[2026-05-24 11:53:34] [INFO ] Computed 99 invariants in 3 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8297856800931376997.kers
Total runtime 4 ms.
[2026-05-24 11:53:35] [INFO ] Implicit Places using invariants in 499 ms returned []
[2026-05-24 11:53:35] [INFO ] Invariant cache hit.
[2026-05-24 11:53:36] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2026-05-24 11:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/159 constraints. Problems are: Problem set: 4 solved, 435 unsolved
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 4 solved, 435 unsolved
Search for dead transitions found 4 dead transitions in 30199ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/626 places, 436/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 501 /501 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32516 ms. Remains : 501/626 places, 436/562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Applied a total of 0 rules in 26 ms. Remains 501 /501 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3346894159347151095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3452285263033351324.kers'
[2026-05-24 11:54:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3346894159347151095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3452285263033351324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 501 cols 1387 entries
Finished phase 1 with 325 SingleSign rule and 77 generalized
[2026-05-24 11:54:07] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3452285263033351324.kers
Total runtime 6 ms.
[2026-05-24 11:54:07] [INFO ] Implicit Places using invariants in 367 ms returned []
[2026-05-24 11:54:07] [INFO ] Invariant cache hit.
[2026-05-24 11:54:08] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-05-24 11:54:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 30077ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Finished structural reductions in LTL mode , in 1 iterations and 31699 ms. Remains : 501/501 places, 436/436 transitions.
Support contains 42 out of 501 places after structural reductions.
[2026-05-24 11:54:38] [INFO ] Flatten gal took : 61 ms
[2026-05-24 11:54:38] [INFO ] Flatten gal took : 27 ms
[2026-05-24 11:54:38] [INFO ] Input system was already deterministic with 436 transitions.
RANDOM walk for 40000 steps (268 resets) in 1053 ms. (37 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40002 steps (46 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (47 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (47 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (34 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (48 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (45 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (47 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 130 ms. (305 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
[2026-05-24 11:54:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 75/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 300/396 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 81/477 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 18/495 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 2/116 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 432/927 variables, 495/611 constraints. Problems are: Problem set: 1 solved, 11 unsolved
SMT process timed out in 5036ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 436/436 transitions.
Graph (complete) has 1118 edges and 501 vertex of which 500 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 500 transition count 386
Reduce places removed 49 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 451 transition count 382
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 447 transition count 382
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 107 place count 447 transition count 284
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 322 place count 330 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 329 place count 323 transition count 277
Iterating global reduction 3 with 7 rules applied. Total rules applied 336 place count 323 transition count 277
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 596 place count 191 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 597 place count 191 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 599 place count 190 transition count 152
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 605 place count 190 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 606 place count 189 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 607 place count 188 transition count 151
Applied a total of 607 rules in 87 ms. Remains 188 /501 variables (removed 313) and now considering 151/436 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 188/501 places, 151/436 transitions.
RANDOM walk for 40000 steps (5502 resets) in 1533 ms. (26 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1733 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1793 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1754 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1756 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1742 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1796 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1771 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1797 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1784 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1750 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1742 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
Probably explored full state space saw : 94626 states, properties seen :10
Probabilistic random walk after 492205 steps, saw 94626 distinct states, run finished after 1095 ms. (steps per millisecond=449 ) properties seen :10
Explored full state space saw : 94626 states, properties seen :0
Exhaustive walk after 492205 steps, saw 94626 distinct states, run finished after 1036 ms. (steps per millisecond=475 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 213 stabilizing places and 185 stable transitions
Graph (complete) has 1118 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
FORMULA BusinessProcesses-PT-15-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 490 transition count 425
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 490 transition count 425
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 484 transition count 419
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 484 transition count 419
Applied a total of 34 rules in 28 ms. Remains 484 /501 variables (removed 17) and now considering 419/436 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4268862136622150372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5656873570764191434.kers'
[2026-05-24 11:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4268862136622150372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5656873570764191434.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 419 rows 484 cols 1353 entries
Finished phase 1 with 308 SingleSign rule and 77 generalized
[2026-05-24 11:54:48] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5656873570764191434.kers
Total runtime 7 ms.
[2026-05-24 11:54:48] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-24 11:54:48] [INFO ] Invariant cache hit.
[2026-05-24 11:54:50] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 11:54:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 17 solved, 401 unsolved
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 19 solved, 399 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 23 solved, 395 unsolved
SMT process timed out in 30091ms, After SMT, problems are : Problem set: 23 solved, 395 unsolved
Search for dead transitions found 23 dead transitions in 30093ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/501 places, 396/436 transitions.
Applied a total of 0 rules in 10 ms. Remains 484 /484 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31998 ms. Remains : 484/501 places, 396/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 32376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X(!((p1 U p2)||X(X(p3)))))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 491 transition count 426
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 491 transition count 426
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 486 transition count 421
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 486 transition count 421
Applied a total of 30 rules in 31 ms. Remains 486 /501 variables (removed 15) and now considering 421/436 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5809811514278223817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17678910220550194433.kers'
[2026-05-24 11:55:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5809811514278223817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17678910220550194433.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 421 rows 486 cols 1357 entries
Finished phase 1 with 310 SingleSign rule and 77 generalized
[2026-05-24 11:55:20] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17678910220550194433.kers
Total runtime 8 ms.
[2026-05-24 11:55:21] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-24 11:55:21] [INFO ] Invariant cache hit.
[2026-05-24 11:55:22] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-05-24 11:55:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/907 variables, and 185 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 86/185 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/205 constraints. Problems are: Problem set: 10 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/225 constraints. Problems are: Problem set: 10 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/245 constraints. Problems are: Problem set: 10 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/265 constraints. Problems are: Problem set: 10 solved, 410 unsolved
Problem TDEAD354 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 20/285 constraints. Problems are: Problem set: 13 solved, 407 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 20/305 constraints. Problems are: Problem set: 13 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/907 variables, and 317 constraints, problems are : Problem set: 13 solved, 407 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 218/218 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 13 solved, 407 unsolved
Search for dead transitions found 13 dead transitions in 60100ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/501 places, 408/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 486 /486 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62247 ms. Remains : 486/501 places, 408/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X(!((p1 U p2)||X(X(p3)))))))'
Stuttering acceptance computed with spot in 1198 ms :[(OR p2 p3), (OR p2 p3), (OR p3 p2), (OR p2 p3), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), true, p2, p3, p3, p3, p3, (AND (NOT p1) p3), p2, (NOT p1), (AND (NOT p1) (NOT p2) p3), p3, (AND p2 p3), p3, p3, p3, (AND (NOT p1) p3), p3, (AND (NOT p1) p3), (AND p2 p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) p3)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-01 finished in 63525 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((p1&&F(G(p2))))||p0)))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 492 transition count 427
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 492 transition count 427
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 487 transition count 422
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 487 transition count 422
Applied a total of 28 rules in 29 ms. Remains 487 /501 variables (removed 14) and now considering 422/436 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15277845120662274937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15977663282173630696.kers'
[2026-05-24 11:56:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15277845120662274937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15977663282173630696.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 422 rows 487 cols 1359 entries
Finished phase 1 with 311 SingleSign rule and 77 generalized
[2026-05-24 11:56:24] [INFO ] Computed 99 invariants in 8 ms
Computed 99 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15977663282173630696.kers
Total runtime 10 ms.
[2026-05-24 11:56:24] [INFO ] Implicit Places using invariants in 304 ms returned []
[2026-05-24 11:56:24] [INFO ] Invariant cache hit.
[2026-05-24 11:56:26] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-24 11:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/159 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/179 constraints. Problems are: Problem set: 3 solved, 418 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/909 variables, and 181 constraints, problems are : Problem set: 3 solved, 418 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 15/15 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 78/93 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 6/99 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 82/181 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/201 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/221 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/241 constraints. Problems are: Problem set: 3 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/261 constraints. Problems are: Problem set: 3 solved, 418 unsolved
Problem TDEAD354 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/281 constraints. Problems are: Problem set: 11 solved, 410 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 20/301 constraints. Problems are: Problem set: 11 solved, 410 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 20/321 constraints. Problems are: Problem set: 11 solved, 410 unsolved
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 11 solved, 410 unsolved
Search for dead transitions found 11 dead transitions in 60163ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 487/501 places, 411/436 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62381 ms. Remains : 487/501 places, 411/436 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((p1&&F(G(p2))))||p0)))'
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 62614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 490 transition count 425
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 490 transition count 425
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 484 transition count 419
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 484 transition count 419
Applied a total of 34 rules in 31 ms. Remains 484 /501 variables (removed 17) and now considering 419/436 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11954791347223077750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16938798084549745726.kers'
[2026-05-24 11:57:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11954791347223077750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16938798084549745726.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 419 rows 484 cols 1353 entries
Finished phase 1 with 308 SingleSign rule and 77 generalized
[2026-05-24 11:57:26] [INFO ] Computed 99 invariants in 8 ms
Computed 99 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16938798084549745726.kers
Total runtime 10 ms.
[2026-05-24 11:57:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-24 11:57:27] [INFO ] Invariant cache hit.
[2026-05-24 11:57:28] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 11:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 17 solved, 401 unsolved
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 19 solved, 399 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 23 solved, 395 unsolved
SMT process timed out in 30047ms, After SMT, problems are : Problem set: 23 solved, 395 unsolved
Search for dead transitions found 23 dead transitions in 30051ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/501 places, 396/436 transitions.
Applied a total of 0 rules in 13 ms. Remains 484 /484 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32034 ms. Remains : 484/501 places, 396/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 32253 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 U (p1||G(!p0))))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Graph (complete) has 1118 edges and 501 vertex of which 500 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 499 transition count 383
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 448 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 446 transition count 381
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 107 place count 446 transition count 272
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 345 place count 317 transition count 272
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 355 place count 307 transition count 262
Iterating global reduction 3 with 10 rules applied. Total rules applied 365 place count 307 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 627 place count 174 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 628 place count 174 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 630 place count 173 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 631 place count 172 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 632 place count 171 transition count 135
Applied a total of 632 rules in 59 ms. Remains 171 /501 variables (removed 330) and now considering 135/436 (removed 301) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12871767473293516492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15083937114019963065.kers'
[2026-05-24 11:57:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12871767473293516492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15083937114019963065.kers]
Culling duplicate invariants (modulo rational): removing 42 columns.
Culled 42 columns in 0 ms.
// Phase 1: matrix 135 rows 129 cols 580 entries
Finished phase 1 with 66 SingleSign rule and 31 generalized
[2026-05-24 11:57:59] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15083937114019963065.kers
Total runtime 2 ms.
[2026-05-24 11:57:59] [INFO ] Implicit Places using invariants in 121 ms returned [41, 42, 43, 47, 48, 49, 50, 51, 52, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 122 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/501 places, 135/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 161/501 places, 135/436 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 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-04
Product exploration explored 100000 steps with 10758 reset in 310 ms.
Product exploration explored 100000 steps with 10805 reset in 260 ms.
Computed a total of 40 stabilizing places and 32 stable transitions
Computed a total of 40 stabilizing places and 32 stable transitions
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4331 resets) in 252 ms. (158 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (1098 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1105 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16660319948009912368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16487575898416300203.kers'
[2026-05-24 11:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16660319948009912368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16487575898416300203.kers]
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 0 ms.
// Phase 1: matrix 135 rows 129 cols 580 entries
Finished phase 1 with 65 SingleSign rule and 32 generalized
[2026-05-24 11:58:00] [INFO ] Computed 64 invariants in 0 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16487575898416300203.kers
Total runtime 1 ms.
[2026-05-24 11:58:00] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/47 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 48/95 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/103 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/105 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/109 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 135/244 variables, 109/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 52/296 variables, 52/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/296 variables, 25/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/296 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 161/161 constraints, ReadFeed: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/47 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 48/95 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/103 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/105 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/109 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 135/244 variables, 109/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 52/296 variables, 52/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/296 variables, 25/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/296 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/296 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 161/161 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 161/161 places, 135/135 transitions.
RANDOM walk for 40000 steps (4283 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1087 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1061 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 174 steps, run visited all 2 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 174 steps, saw 90 distinct states, run finished after 10 ms. (steps per millisecond=17 ) properties seen :2
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 1282 ms.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-24 11:58:01] [INFO ] Invariant cache hit.
[2026-05-24 11:58:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 11:58:01] [INFO ] Invariant cache hit.
[2026-05-24 11:58:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 11:58:01] [INFO ] Implicit Places using invariants and state equation in 453 ms returned [37, 39, 45, 47, 49, 51, 53, 55, 57, 68, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 563 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/161 places, 135/135 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 133 transition count 122
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 120 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 118 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 118 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 118 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 116 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 35 place count 115 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 115 transition count 117
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 50 place count 107 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 104 transition count 109
Applied a total of 55 rules in 17 ms. Remains 104 /133 variables (removed 29) and now considering 109/135 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2456985411400243757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15709924497404726443.kers'
[2026-05-24 11:58:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2456985411400243757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15709924497404726443.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 109 rows 92 cols 485 entries
Finished phase 1 with 41 SingleSign rule and 30 generalized
[2026-05-24 11:58:01] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15709924497404726443.kers
Total runtime 3 ms.
[2026-05-24 11:58:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 11:58:02] [INFO ] Invariant cache hit.
[2026-05-24 11:58:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-24 11:58:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [1, 2, 3, 8, 9, 10, 32, 33, 34]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 347 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/161 places, 109/135 transitions.
Graph (complete) has 361 edges and 95 vertex of which 86 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 77 transition count 74
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 77 transition count 74
Applied a total of 19 rules in 8 ms. Remains 77 /95 variables (removed 18) and now considering 74/109 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14627698111369248913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10679131467672166319.kers'
[2026-05-24 11:58:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14627698111369248913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10679131467672166319.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 74 rows 72 cols 291 entries
Finished phase 1 with 51 SingleSign rule and 7 generalized
[2026-05-24 11:58:02] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10679131467672166319.kers
Total runtime 2 ms.
[2026-05-24 11:58:02] [INFO ] Implicit Places using invariants in 56 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 75/161 places, 74/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1005 ms. Remains : 75/161 places, 74/135 transitions.
Computed a total of 18 stabilizing places and 20 stable transitions
Computed a total of 18 stabilizing places and 20 stable transitions
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4397 resets) in 169 ms. (235 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1084 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1081 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15155988809066948953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2744575577314808394.kers'
[2026-05-24 11:58:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15155988809066948953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2744575577314808394.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 74 rows 70 cols 275 entries
Finished phase 1 with 51 SingleSign rule and 7 generalized
[2026-05-24 11:58:02] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2744575577314808394.kers
Total runtime 0 ms.
[2026-05-24 11:58:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/30 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/42 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/116 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 33/149 variables, 33/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 98 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 6/6 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/30 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/42 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/116 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 33/149 variables, 33/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/149 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 74/74 transitions.
RANDOM walk for 40000 steps (4354 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1108 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1067 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 124 steps, run visited all 2 properties in 4 ms. (steps per millisecond=31 )
Probabilistic random walk after 124 steps, saw 74 distinct states, run finished after 4 ms. (steps per millisecond=31 ) properties seen :2
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 875 ms.
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 10935 reset in 106 ms.
Product exploration explored 100000 steps with 10930 reset in 121 ms.
Built C files in :
/tmp/ltsmin11294936650427542539
[2026-05-24 11:58:04] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2026-05-24 11:58:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:58:04] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2026-05-24 11:58:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:58:04] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2026-05-24 11:58:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:58:04] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11294936650427542539
Running compilation step : cd /tmp/ltsmin11294936650427542539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin11294936650427542539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11294936650427542539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14612000586427949681.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-04 finished in 5689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p0) U p1)))) U (p2 U p3)))'
Support contains 7 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 491 transition count 426
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 491 transition count 426
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 486 transition count 421
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 486 transition count 421
Applied a total of 30 rules in 58 ms. Remains 486 /501 variables (removed 15) and now considering 421/436 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4659960814194990461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14987860049794212162.kers'
[2026-05-24 11:58:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4659960814194990461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14987860049794212162.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 421 rows 486 cols 1357 entries
Finished phase 1 with 310 SingleSign rule and 77 generalized
[2026-05-24 11:58:04] [INFO ] Computed 99 invariants in 9 ms
Computed 99 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14987860049794212162.kers
Total runtime 11 ms.
[2026-05-24 11:58:05] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-24 11:58:05] [INFO ] Invariant cache hit.
[2026-05-24 11:58:06] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-05-24 11:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 420 unsolved
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 30150ms
Starting structural reductions in LTL mode, iteration 1 : 486/501 places, 421/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32271 ms. Remains : 486/501 places, 421/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p0) U p1)))) U (p2 U p3)))'
Stuttering acceptance computed with spot in 394 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-07 finished in 32724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(p1)))))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 491 transition count 426
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 491 transition count 426
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 485 transition count 420
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 485 transition count 420
Applied a total of 32 rules in 40 ms. Remains 485 /501 variables (removed 16) and now considering 420/436 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17418258560242169149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7343464782322882740.kers'
[2026-05-24 11:58:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17418258560242169149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7343464782322882740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 420 rows 485 cols 1355 entries
Finished phase 1 with 309 SingleSign rule and 77 generalized
[2026-05-24 11:58:37] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7343464782322882740.kers
Total runtime 8 ms.
[2026-05-24 11:58:37] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 11:58:37] [INFO ] Invariant cache hit.
[2026-05-24 11:58:39] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2026-05-24 11:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/159 constraints. Problems are: Problem set: 5 solved, 414 unsolved
SMT process timed out in 30080ms, After SMT, problems are : Problem set: 5 solved, 414 unsolved
Search for dead transitions found 5 dead transitions in 30082ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 485/501 places, 415/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 485 /485 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32314 ms. Remains : 485/501 places, 415/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(p1)))))))'
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 1288 reset in 218 ms.
Stack based approach found an accepted trace after 129 steps with 1 reset with depth 53 and stack size 53 in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 32747 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((p1||X(X(p1)))))))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 490 transition count 425
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 490 transition count 425
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 484 transition count 419
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 484 transition count 419
Applied a total of 34 rules in 33 ms. Remains 484 /501 variables (removed 17) and now considering 419/436 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11525261009569243740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8465953145601659130.kers'
[2026-05-24 11:59:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11525261009569243740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8465953145601659130.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 419 rows 484 cols 1353 entries
Finished phase 1 with 308 SingleSign rule and 77 generalized
[2026-05-24 11:59:10] [INFO ] Computed 99 invariants in 7 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8465953145601659130.kers
Total runtime 7 ms.
[2026-05-24 11:59:10] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 11:59:10] [INFO ] Invariant cache hit.
[2026-05-24 11:59:12] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 11:59:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 17 solved, 401 unsolved
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 19 solved, 399 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 23 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/903 variables, and 188 constraints, problems are : Problem set: 23 solved, 395 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 23 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 23 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 78/93 constraints. Problems are: Problem set: 23 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 6/99 constraints. Problems are: Problem set: 23 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 89/188 constraints. Problems are: Problem set: 23 solved, 395 unsolved
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/208 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/228 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/248 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/268 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 20/288 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 20/308 constraints. Problems are: Problem set: 24 solved, 394 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 20/328 constraints. Problems are: Problem set: 24 solved, 394 unsolved
SMT process timed out in 60156ms, After SMT, problems are : Problem set: 24 solved, 394 unsolved
Search for dead transitions found 24 dead transitions in 60158ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/501 places, 395/436 transitions.
Applied a total of 0 rules in 14 ms. Remains 484 /484 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62010 ms. Remains : 484/501 places, 395/436 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((p1||X(X(p1)))))))))'
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-09 finished in 62271 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 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Graph (complete) has 1118 edges and 501 vertex of which 500 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 499 transition count 382
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 447 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 445 transition count 380
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 109 place count 445 transition count 270
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 349 place count 315 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 360 place count 304 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 371 place count 304 transition count 259
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 631 place count 172 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 172 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 634 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 635 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 636 place count 169 transition count 133
Applied a total of 636 rules in 47 ms. Remains 169 /501 variables (removed 332) and now considering 133/436 (removed 303) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5574732022791546351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16824498260620756251.kers'
[2026-05-24 12:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5574732022791546351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16824498260620756251.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 0 ms.
// Phase 1: matrix 133 rows 136 cols 615 entries
Finished phase 1 with 61 SingleSign rule and 34 generalized
[2026-05-24 12:00:12] [INFO ] Computed 74 invariants in 0 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16824498260620756251.kers
Total runtime 1 ms.
[2026-05-24 12:00:12] [INFO ] Implicit Places using invariants in 127 ms returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/501 places, 133/436 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 167/501 places, 133/436 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 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 252 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) U X(X(X(p1))))))'
Support contains 5 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 492 transition count 427
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 492 transition count 427
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 486 transition count 421
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 486 transition count 421
Applied a total of 30 rules in 25 ms. Remains 486 /501 variables (removed 15) and now considering 421/436 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11860058682678485485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7775704653437403846.kers'
[2026-05-24 12:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11860058682678485485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7775704653437403846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 421 rows 486 cols 1357 entries
Finished phase 1 with 310 SingleSign rule and 77 generalized
[2026-05-24 12:00:12] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7775704653437403846.kers
Total runtime 4 ms.
[2026-05-24 12:00:13] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-24 12:00:13] [INFO ] Invariant cache hit.
[2026-05-24 12:00:14] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 486/501 places, 421/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1834 ms. Remains : 486/501 places, 421/436 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) U X(X(X(p1))))))'
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 2269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Graph (trivial) has 238 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1112 edges and 496 vertex of which 495 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 494 transition count 371
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 116 place count 437 transition count 371
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 116 place count 437 transition count 267
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 344 place count 313 transition count 267
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 354 place count 303 transition count 257
Iterating global reduction 2 with 10 rules applied. Total rules applied 364 place count 303 transition count 257
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 624 place count 171 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 626 place count 170 transition count 133
Applied a total of 626 rules in 36 ms. Remains 170 /501 variables (removed 331) and now considering 133/436 (removed 303) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6383984046222198485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11135071027013463890.kers'
[2026-05-24 12:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6383984046222198485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11135071027013463890.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 132 rows 169 cols 781 entries
Finished phase 1 with 58 SingleSign rule and 37 generalized
[2026-05-24 12:00:15] [INFO ] Computed 75 invariants in 0 ms
Computed 75 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11135071027013463890.kers
Total runtime 1 ms.
[2026-05-24 12:00:15] [INFO ] Implicit Places using invariants in 154 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 155 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/501 places, 133/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 148/501 places, 133/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X(p1)&&F(p2))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 492 transition count 427
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 492 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 488 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 488 transition count 423
Applied a total of 26 rules in 32 ms. Remains 488 /501 variables (removed 13) and now considering 423/436 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6421589835766406114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9847714581537786586.kers'
[2026-05-24 12:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6421589835766406114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9847714581537786586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 488 cols 1361 entries
Finished phase 1 with 312 SingleSign rule and 77 generalized
[2026-05-24 12:00:15] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9847714581537786586.kers
Total runtime 4 ms.
[2026-05-24 12:00:15] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-24 12:00:15] [INFO ] Invariant cache hit.
[2026-05-24 12:00:17] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2026-05-24 12:00:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 9 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 9 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 9 solved, 413 unsolved
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 9 solved, 413 unsolved
Search for dead transitions found 9 dead transitions in 30118ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/501 places, 414/436 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32308 ms. Remains : 488/501 places, 414/436 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-15 finished in 32482 ms.
All properties solved by simple procedures.
Total runtime 433764 ms.

BK_STOP 1779624047827

--------------------
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-15"
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-15, 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-177946842000564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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