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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.1K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 17:52 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:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:43 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 79K 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-04-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779610853031

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 08:20:54] [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 08:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:20:54] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-24 08:20:54] [INFO ] Transformed 288 places.
[2026-05-24 08:20:54] [INFO ] Transformed 283 transitions.
[2026-05-24 08:20:54] [INFO ] Found NUPN structural information;
[2026-05-24 08:20:54] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 182 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 3 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 284 transition count 281
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 249 transition count 246
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 249 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 249 transition count 245
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 90 place count 232 transition count 228
Iterating global reduction 2 with 17 rules applied. Total rules applied 107 place count 232 transition count 228
Applied a total of 107 rules in 75 ms. Remains 232 /286 variables (removed 54) and now considering 228/281 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5935567131113325704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10368274454508859830.kers'
[2026-05-24 08:20:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5935567131113325704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10368274454508859830.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 232 cols 804 entries
Finished phase 1 with 147 SingleSign rule and 43 generalized
[2026-05-24 08:20:54] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10368274454508859830.kers
Total runtime 2 ms.
[2026-05-24 08:20:54] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-24 08:20:54] [INFO ] Invariant cache hit.
[2026-05-24 08:20:55] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-24 08:20:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 20/82 constraints. Problems are: Problem set: 5 solved, 222 unsolved
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/102 constraints. Problems are: Problem set: 9 solved, 218 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 20/122 constraints. Problems are: Problem set: 16 solved, 211 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 20/142 constraints. Problems are: Problem set: 34 solved, 193 unsolved
Problem TDEAD181 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 16/158 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 8/166 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 8/174 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 8/182 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 3/185 constraints. Problems are: Problem set: 37 solved, 190 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 232/460 variables, and 195 constraints, problems are : Problem set: 37 solved, 190 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/232 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 153/153 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 14/14 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 25/39 constraints. Problems are: Problem set: 37 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 3/42 constraints. Problems are: Problem set: 37 solved, 190 unsolved
Problem TDEAD175 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 153/195 constraints. Problems are: Problem set: 38 solved, 189 unsolved
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 8/203 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 16/219 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 11/230 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 5/235 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 7/242 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/243 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/243 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 228/460 variables, 232/475 constraints. Problems are: Problem set: 40 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 187/662 constraints. Problems are: Problem set: 40 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 669 constraints, problems are : Problem set: 40 solved, 187 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 187/227 constraints, Known Traps: 208/208 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 40 solved, 187 unsolved
Search for dead transitions found 40 dead transitions in 60111ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 232/286 places, 188/281 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 227 transition count 188
Applied a total of 5 rules in 4 ms. Remains 227 /232 variables (removed 5) and now considering 188/188 (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-1661704923672240597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-865807336640288678.kers'
[2026-05-24 08:21:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1661704923672240597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-865807336640288678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 227 cols 554 entries
Finished phase 1 with 151 SingleSign rule and 28 generalized
[2026-05-24 08:21:55] [INFO ] Computed 48 invariants in 2 ms
Computed 48 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-865807336640288678.kers
Total runtime 3 ms.
[2026-05-24 08:21:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 08:21:55] [INFO ] Invariant cache hit.
[2026-05-24 08:21:55] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/286 places, 188/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61263 ms. Remains : 227/286 places, 188/281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-24 08:21:55] [INFO ] Invariant cache hit.
[2026-05-24 08:21:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 08:21:55] [INFO ] Invariant cache hit.
[2026-05-24 08:21:56] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2026-05-24 08:21:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 17/145 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/415 variables, and 193 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 145/145 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 145/193 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 9/202 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/415 variables, 227/436 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 187/623 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 9/632 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/415 variables, and 635 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 170/170 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Finished structural reductions in LTL mode , in 1 iterations and 60344 ms. Remains : 227/227 places, 188/188 transitions.
Support contains 33 out of 227 places after structural reductions.
[2026-05-24 08:22:56] [INFO ] Flatten gal took : 39 ms
[2026-05-24 08:22:56] [INFO ] Flatten gal took : 14 ms
[2026-05-24 08:22:56] [INFO ] Input system was already deterministic with 188 transitions.
RANDOM walk for 10626 steps (114 resets) in 464 ms. (22 steps per ms) remains 0/20 properties
FORMULA BusinessProcesses-PT-04-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 204 stabilizing places and 166 stable transitions
Graph (complete) has 468 edges and 227 vertex of which 225 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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((G(p0) U p1)))&&(F(p2) U p0)))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Graph (trivial) has 99 edges and 227 vertex of which 6 / 227 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 461 edges and 222 vertex of which 220 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 219 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 198 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 197 transition count 158
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 46 place count 197 transition count 113
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 142 place count 146 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 147 place count 141 transition count 108
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 141 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 152 place count 141 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 139 transition count 106
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 103 rules applied. Total rules applied 259 place count 82 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 81 transition count 63
Applied a total of 261 rules in 44 ms. Remains 81 /227 variables (removed 146) and now considering 63/188 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5076180543020919137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14428227738233265879.kers'
[2026-05-24 08:22:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5076180543020919137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14428227738233265879.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 80 cols 289 entries
Finished phase 1 with 44 SingleSign rule and 7 generalized
[2026-05-24 08:22:56] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14428227738233265879.kers
Total runtime 1 ms.
[2026-05-24 08:22:57] [INFO ] Implicit Places using invariants in 58 ms returned [1, 7, 19, 20, 21]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/227 places, 63/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 76/227 places, 63/188 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((G(p0) U p1)))&&(F(p2) U p0)))'
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-00 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Graph (trivial) has 101 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 461 edges and 222 vertex of which 220 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 219 transition count 158
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 197 transition count 158
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 46 place count 197 transition count 113
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 142 place count 146 transition count 113
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 140 transition count 107
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 140 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 154 place count 140 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 137 transition count 104
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 261 place count 81 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 263 place count 80 transition count 62
Applied a total of 263 rules in 30 ms. Remains 80 /227 variables (removed 147) and now considering 62/188 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18218820717743548664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4530187570640224263.kers'
[2026-05-24 08:22:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18218820717743548664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4530187570640224263.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 61 rows 79 cols 285 entries
Finished phase 1 with 43 SingleSign rule and 7 generalized
[2026-05-24 08:22:57] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4530187570640224263.kers
Total runtime 0 ms.
[2026-05-24 08:22:57] [INFO ] Implicit Places using invariants in 64 ms returned [1, 7, 18, 19, 20]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/227 places, 62/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 75/227 places, 62/188 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-01 finished in 217 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))&&(p1 U (p2||G(p1))))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 218 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 218 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 217 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 217 transition count 179
Applied a total of 19 rules in 18 ms. Remains 217 /227 variables (removed 10) and now considering 179/188 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5248962576586122632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2385945508216207436.kers'
[2026-05-24 08:22:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5248962576586122632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2385945508216207436.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 217 cols 535 entries
Finished phase 1 with 142 SingleSign rule and 28 generalized
[2026-05-24 08:22:57] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2385945508216207436.kers
Total runtime 1 ms.
[2026-05-24 08:22:57] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 08:22:57] [INFO ] Invariant cache hit.
[2026-05-24 08:22:57] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-24 08:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 17/124 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 21 (OVERLAPS) 179/396 variables, 217/361 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/396 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 100/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 179/396 variables, 217/373 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 178/551 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 555 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 217/227 places, 179/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60353 ms. Remains : 217/227 places, 179/188 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))&&(p1 U (p2||G(p1))))))'
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Computed a total of 194 stabilizing places and 157 stable transitions
Graph (complete) has 456 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 194 stabilizing places and 157 stable transitions
Detected a total of 194/217 stabilizing places and 157/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 13 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-03 finished in 60993 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||X(p0))&&(p1||(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Support contains 6 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 218 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 218 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 215 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 215 transition count 177
Applied a total of 23 rules in 15 ms. Remains 215 /227 variables (removed 12) and now considering 177/188 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2319168365967909602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9812586987827125161.kers'
[2026-05-24 08:23:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2319168365967909602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9812586987827125161.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 215 cols 531 entries
Finished phase 1 with 140 SingleSign rule and 28 generalized
[2026-05-24 08:23:58] [INFO ] Computed 47 invariants in 3 ms
Computed 47 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9812586987827125161.kers
Total runtime 4 ms.
[2026-05-24 08:23:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 08:23:58] [INFO ] Invariant cache hit.
[2026-05-24 08:23:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-24 08:23:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 17 (OVERLAPS) 177/392 variables, 215/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 345 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 78/125 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 177/392 variables, 215/357 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 176/533 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 5/539 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 539 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 215/227 places, 177/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60352 ms. Remains : 215/227 places, 177/188 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)||p0)&&((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))||p3))))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND p1 (NOT p3))), (OR (NOT p0) (AND p1 (NOT p3))), (NOT p0), p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-04 finished in 60666 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&&(F(p1) U X(X(X(!p2)))))))'
Support contains 8 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 221 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 221 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 220 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 220 transition count 181
Applied a total of 14 rules in 18 ms. Remains 220 /227 variables (removed 7) and now considering 181/188 (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-2773839190474440257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1299710370027394762.kers'
[2026-05-24 08:24:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2773839190474440257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1299710370027394762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 220 cols 540 entries
Finished phase 1 with 144 SingleSign rule and 28 generalized
[2026-05-24 08:24:59] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1299710370027394762.kers
Total runtime 1 ms.
[2026-05-24 08:24:59] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 08:24:59] [INFO ] Invariant cache hit.
[2026-05-24 08:24:59] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-24 08:24:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 2/220 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 17/135 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 16 (OVERLAPS) 181/401 variables, 220/382 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/401 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 394 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 2/220 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 123/171 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 181/401 variables, 220/400 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 180/580 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 5/585 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 180 unsolved
SMT process timed out in 60041ms, After SMT, problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 220/227 places, 181/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 220/227 places, 181/188 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(X(X(!p1))))&&p2)))'
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-06
Stuttering criterion allowed to conclude after 142 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-06 finished in 61025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(G(!p1))) U X(X(p2))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 218 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 218 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 216 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 216 transition count 178
Applied a total of 21 rules in 16 ms. Remains 216 /227 variables (removed 11) and now considering 178/188 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4123249761300075595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5641873514533075298.kers'
[2026-05-24 08:26:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4123249761300075595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5641873514533075298.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 216 cols 533 entries
Finished phase 1 with 141 SingleSign rule and 28 generalized
[2026-05-24 08:26:00] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5641873514533075298.kers
Total runtime 1 ms.
[2026-05-24 08:26:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 08:26:00] [INFO ] Invariant cache hit.
[2026-05-24 08:26:00] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 08:26:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 178/394 variables, 216/321 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 335 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 67/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/394 variables, 216/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 177/512 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 5/524 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 529 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 216/227 places, 178/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60435 ms. Remains : 216/227 places, 178/188 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(G(!p1))) U X(X(p2))))'
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Computed a total of 193 stabilizing places and 156 stable transitions
Graph (complete) has 453 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 193 stabilizing places and 156 stable transitions
Detected a total of 193/216 stabilizing places and 156/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 7 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-07 finished in 60990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Graph (trivial) has 102 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 461 edges and 222 vertex of which 220 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 219 transition count 157
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 196 transition count 157
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 48 place count 196 transition count 113
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 142 place count 146 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 139 transition count 106
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 139 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 156 place count 139 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 136 transition count 103
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 105 rules applied. Total rules applied 267 place count 78 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 269 place count 77 transition count 59
Applied a total of 269 rules in 27 ms. Remains 77 /227 variables (removed 150) and now considering 59/188 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4905555866151279866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8883443019365393517.kers'
[2026-05-24 08:27:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4905555866151279866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8883443019365393517.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 58 rows 76 cols 283 entries
Finished phase 1 with 40 SingleSign rule and 7 generalized
[2026-05-24 08:27:01] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8883443019365393517.kers
Total runtime 1 ms.
[2026-05-24 08:27:01] [INFO ] Implicit Places using invariants in 61 ms returned [1, 7, 19, 20, 21]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/227 places, 59/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 72/227 places, 59/188 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-14
Stuttering criterion allowed to conclude after 396 steps with 62 reset in 5 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-14 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 188/188 transitions.
Graph (trivial) has 102 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 461 edges and 222 vertex of which 220 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 219 transition count 157
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 196 transition count 157
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 48 place count 196 transition count 112
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 143 place count 146 transition count 112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 139 transition count 105
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 139 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 157 place count 139 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 136 transition count 102
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 264 place count 80 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 266 place count 79 transition count 60
Applied a total of 266 rules in 23 ms. Remains 79 /227 variables (removed 148) and now considering 60/188 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-320404810237982310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4734622053567033534.kers'
[2026-05-24 08:27:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-320404810237982310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4734622053567033534.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 59 rows 78 cols 275 entries
Finished phase 1 with 28 SingleSign rule and 20 generalized
[2026-05-24 08:27:01] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4734622053567033534.kers
Total runtime 1 ms.
[2026-05-24 08:27:01] [INFO ] Implicit Places using invariants in 57 ms returned [1, 7, 9, 19, 20, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 58 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/227 places, 60/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 73/227 places, 60/188 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 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-15 finished in 146 ms.
All properties solved by simple procedures.
Total runtime 367466 ms.

BK_STOP 1779611221705

--------------------
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//
++ 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 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-04"
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-04, 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-177946842000475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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