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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 3.8K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 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 146K 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-12-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779619386937

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 10:43:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 10:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:43:08] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-24 10:43:08] [INFO ] Transformed 586 places.
[2026-05-24 10:43:08] [INFO ] Transformed 525 transitions.
[2026-05-24 10:43:08] [INFO ] Found NUPN structural information;
[2026-05-24 10:43:08] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 82 place count 500 transition count 442
Iterating global reduction 1 with 79 rules applied. Total rules applied 161 place count 500 transition count 442
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 198 place count 463 transition count 405
Iterating global reduction 1 with 37 rules applied. Total rules applied 235 place count 463 transition count 405
Applied a total of 235 rules in 127 ms. Remains 463 /582 variables (removed 119) and now considering 405/521 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4724678366484553964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13126055394667826168.kers'
[2026-05-24 10:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4724678366484553964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13126055394667826168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 463 cols 1317 entries
Finished phase 1 with 296 SingleSign rule and 72 generalized
[2026-05-24 10:43:08] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13126055394667826168.kers
Total runtime 3 ms.
[2026-05-24 10:43:09] [INFO ] Implicit Places using invariants in 514 ms returned []
[2026-05-24 10:43:09] [INFO ] Invariant cache hit.
[2026-05-24 10:43:10] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2026-05-24 10:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/135 constraints. Problems are: Problem set: 9 solved, 395 unsolved
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/155 constraints. Problems are: Problem set: 13 solved, 391 unsolved
Problem TDEAD374 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/175 constraints. Problems are: Problem set: 17 solved, 387 unsolved
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 17 solved, 387 unsolved
Search for dead transitions found 17 dead transitions in 30261ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/582 places, 388/521 transitions.
Applied a total of 0 rules in 20 ms. Remains 463 /463 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32666 ms. Remains : 463/582 places, 388/521 transitions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 388/388 transitions.
Applied a total of 0 rules in 17 ms. Remains 463 /463 variables (removed 0) and now considering 388/388 (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-10666039279765281732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1600224303401197201.kers'
[2026-05-24 10:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10666039279765281732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1600224303401197201.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 388 rows 463 cols 1215 entries
Finished phase 1 with 296 SingleSign rule and 72 generalized
[2026-05-24 10:43:41] [INFO ] Computed 95 invariants in 7 ms
Computed 95 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1600224303401197201.kers
Total runtime 8 ms.
[2026-05-24 10:43:41] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-24 10:43:41] [INFO ] Invariant cache hit.
[2026-05-24 10:43:42] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/463 places, 388/388 transitions.
Applied a total of 0 rules in 14 ms. Remains 462 /462 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1650 ms. Remains : 462/463 places, 388/388 transitions.
Support contains 18 out of 462 places after structural reductions.
[2026-05-24 10:43:42] [INFO ] Flatten gal took : 62 ms
[2026-05-24 10:43:43] [INFO ] Flatten gal took : 32 ms
[2026-05-24 10:43:43] [INFO ] Input system was already deterministic with 388 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (289 resets) in 1375 ms. (29 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40002 steps (51 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (52 resets) in 209 ms. (190 steps per ms) remains 2/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7824125990390758979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7558230426366370624.kers'
[2026-05-24 10:43:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7824125990390758979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7558230426366370624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 462 cols 1213 entries
Finished phase 1 with 297 SingleSign rule and 71 generalized
[2026-05-24 10:43:43] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7558230426366370624.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 370/373 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 81/454 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/456 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 384/840 variables, 456/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/849 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 5/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/849 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 1/850 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/850 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/850 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 575 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 370/373 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 81/454 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/456 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 384/840 variables, 456/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 8/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/849 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 6/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/850 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/850 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/850 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/850 variables, and 585 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 5148ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 411 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 388/388 transitions.
Graph (trivial) has 212 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1000 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 51 place count 456 transition count 331
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 407 transition count 331
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 100 place count 407 transition count 234
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 312 place count 292 transition count 234
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 318 place count 286 transition count 228
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 325 place count 285 transition count 228
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 566 place count 163 transition count 109
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 2 with 2 rules applied. Total rules applied 568 place count 162 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 570 place count 162 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 572 place count 160 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 573 place count 160 transition count 111
Applied a total of 573 rules in 85 ms. Remains 160 /462 variables (removed 302) and now considering 111/388 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 160/462 places, 111/388 transitions.
RANDOM walk for 40000 steps (1449 resets) in 972 ms. (41 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (767 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10766984589613524371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7419018231749458205.kers'
[2026-05-24 10:43:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10766984589613524371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7419018231749458205.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 159 cols 670 entries
Finished phase 1 with 60 SingleSign rule and 28 generalized
[2026-05-24 10:43:49] [INFO ] Computed 72 invariants in 0 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7419018231749458205.kers
Total runtime 1 ms.
[2026-05-24 10:43:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/157 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/269 variables, 158/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 13/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/271 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 160/160 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/157 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/269 variables, 158/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 13/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/271 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 160/160 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 111/111 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 110
Applied a total of 2 rules in 16 ms. Remains 159 /160 variables (removed 1) and now considering 110/111 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 159/160 places, 110/111 transitions.
RANDOM walk for 40000 steps (1459 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (808 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2254 steps, run visited all 1 properties in 19 ms. (steps per millisecond=118 )
Probabilistic random walk after 2254 steps, saw 963 distinct states, run finished after 23 ms. (steps per millisecond=98 ) properties seen :1
Computed a total of 447 stabilizing places and 373 stable transitions
Graph (complete) has 1007 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 388/388 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 455 transition count 381
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 455 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 454 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 454 transition count 380
Applied a total of 16 rules in 31 ms. Remains 454 /462 variables (removed 8) and now considering 380/388 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15664534281883737513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3577455797893237963.kers'
[2026-05-24 10:43:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15664534281883737513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3577455797893237963.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 380 rows 454 cols 1197 entries
Finished phase 1 with 289 SingleSign rule and 71 generalized
[2026-05-24 10:43:50] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3577455797893237963.kers
Total runtime 3 ms.
[2026-05-24 10:43:50] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 10:43:50] [INFO ] Invariant cache hit.
[2026-05-24 10:43:52] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2026-05-24 10:43:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Problem TDEAD340 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/194 constraints. Problems are: Problem set: 1 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/834 variables, and 202 constraints, problems are : Problem set: 1 solved, 378 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 71/87 constraints. Problems are: Problem set: 1 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/94 constraints. Problems are: Problem set: 1 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 108/202 constraints. Problems are: Problem set: 1 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/222 constraints. Problems are: Problem set: 1 solved, 378 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/242 constraints. Problems are: Problem set: 4 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/262 constraints. Problems are: Problem set: 4 solved, 375 unsolved
Problem TDEAD358 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/282 constraints. Problems are: Problem set: 5 solved, 374 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 20/302 constraints. Problems are: Problem set: 5 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 20/322 constraints. Problems are: Problem set: 5 solved, 374 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 20/342 constraints. Problems are: Problem set: 5 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/834 variables, and 342 constraints, problems are : Problem set: 5 solved, 374 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 248/248 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 5 solved, 374 unsolved
Search for dead transitions found 5 dead transitions in 60090ms
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 : 454/462 places, 375/388 transitions.
Applied a total of 0 rules in 8 ms. Remains 454 /454 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61900 ms. Remains : 454/462 places, 375/388 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-01
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-01 finished in 62237 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(((F(p1)||p0) U (G(p2) U p3))) U X(p4)))))'
Support contains 7 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 388/388 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 458 transition count 384
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 458 transition count 384
Applied a total of 8 rules in 21 ms. Remains 458 /462 variables (removed 4) and now considering 384/388 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5402157051269281010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18194012064323533356.kers'
[2026-05-24 10:44:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5402157051269281010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18194012064323533356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 458 cols 1205 entries
Finished phase 1 with 293 SingleSign rule and 71 generalized
[2026-05-24 10:44:52] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18194012064323533356.kers
Total runtime 3 ms.
[2026-05-24 10:44:53] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-24 10:44:53] [INFO ] Invariant cache hit.
[2026-05-24 10:44:54] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2026-05-24 10:44:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/458 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 20/154 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 20/174 constraints. Problems are: Problem set: 4 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 20/194 constraints. Problems are: Problem set: 4 solved, 379 unsolved
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 4 solved, 379 unsolved
Search for dead transitions found 4 dead transitions in 30105ms
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 : 458/462 places, 380/388 transitions.
Applied a total of 0 rules in 11 ms. Remains 458 /458 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31926 ms. Remains : 458/462 places, 380/388 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(((F(p1)||p0) U (G(p2) U p3))) U X(p4)))))'
Stuttering acceptance computed with spot in 645 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), (OR (AND (NOT p1) p2 (NOT p4)) (AND (NOT p1) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p3) (NOT p4))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-10
Product exploration explored 100000 steps with 729 reset in 251 ms.
Stack based approach found an accepted trace after 6837 steps with 49 reset with depth 7 and stack size 7 in 20 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-10 finished in 32932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 388/388 transitions.
Graph (trivial) has 212 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1001 edges and 457 vertex of which 456 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 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 51 place count 455 transition count 331
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 406 transition count 331
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 100 place count 406 transition count 235
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 309 place count 293 transition count 235
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 285 transition count 227
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 326 place count 284 transition count 227
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 561 place count 165 transition count 111
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 2 with 2 rules applied. Total rules applied 563 place count 164 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 564 place count 163 transition count 114
Applied a total of 564 rules in 49 ms. Remains 163 /462 variables (removed 299) and now considering 114/388 (removed 274) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-58491091711117927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17512147182005671578.kers'
[2026-05-24 10:45:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-58491091711117927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17512147182005671578.kers]
Normalized transition count is 113 out of 114 initially.
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 113 rows 134 cols 516 entries
Finished phase 1 with 54 SingleSign rule and 36 generalized
[2026-05-24 10:45:25] [INFO ] Computed 73 invariants in 1 ms
Computed 73 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17512147182005671578.kers
Total runtime 2 ms.
[2026-05-24 10:45:25] [INFO ] Implicit Places using invariants in 132 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/462 places, 114/388 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 162/462 places, 114/388 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 743 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 965 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))))))'
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 388/388 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 455 transition count 381
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 455 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 454 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 454 transition count 380
Applied a total of 16 rules in 28 ms. Remains 454 /462 variables (removed 8) and now considering 380/388 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12947849442976840559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-494621765609402913.kers'
[2026-05-24 10:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12947849442976840559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-494621765609402913.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 380 rows 454 cols 1197 entries
Finished phase 1 with 289 SingleSign rule and 71 generalized
[2026-05-24 10:45:26] [INFO ] Computed 94 invariants in 8 ms
Computed 94 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-494621765609402913.kers
Total runtime 9 ms.
[2026-05-24 10:45:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-24 10:45:27] [INFO ] Invariant cache hit.
[2026-05-24 10:45:28] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2026-05-24 10:45:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 379 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 30103ms
Starting structural reductions in LTL mode, iteration 1 : 454/462 places, 380/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32043 ms. Remains : 454/462 places, 380/388 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))))))'
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 6254 steps with 45 reset in 23 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-13 finished in 32268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(!p1)||((G(!p1)||(!p1&&F(!p0)))&&X(!p2))))))'
Support contains 4 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 388/388 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 382
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 455 transition count 381
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 455 transition count 381
Applied a total of 14 rules in 29 ms. Remains 455 /462 variables (removed 7) and now considering 381/388 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11066479277534285842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16598927211304159897.kers'
[2026-05-24 10:45:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11066479277534285842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16598927211304159897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 455 cols 1199 entries
Finished phase 1 with 290 SingleSign rule and 71 generalized
[2026-05-24 10:45:59] [INFO ] Computed 94 invariants in 6 ms
Computed 94 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16598927211304159897.kers
Total runtime 7 ms.
[2026-05-24 10:45:59] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 10:45:59] [INFO ] Invariant cache hit.
[2026-05-24 10:46:00] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2026-05-24 10:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 380 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 30127ms
Starting structural reductions in LTL mode, iteration 1 : 455/462 places, 381/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31884 ms. Remains : 455/462 places, 381/388 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||((G(p1)||(F(!p0)&&p2))&&X(p3))))))'
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-14
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-14 finished in 32156 ms.
All properties solved by simple procedures.
Total runtime 203047 ms.

BK_STOP 1779619591166

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-12"
export BK_EXAMINATION="LTLCardinality"
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-12, examination is LTLCardinality"
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-177946842000539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;