About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 682.479 | 403601.00 | 504664.00 | 1938.40 | FFTFFTTTTFFFTTTT | normal |
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-177946842000571.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K 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-16-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779624475158
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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 12:07:56] [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 12:07:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:07:56] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-24 12:07:56] [INFO ] Transformed 638 places.
[2026-05-24 12:07:56] [INFO ] Transformed 578 transitions.
[2026-05-24 12:07:56] [INFO ] Found NUPN structural information;
[2026-05-24 12:07:56] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 193 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 1 formulas.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 97 place count 533 transition count 478
Iterating global reduction 1 with 92 rules applied. Total rules applied 189 place count 533 transition count 478
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 229 place count 493 transition count 438
Iterating global reduction 1 with 40 rules applied. Total rules applied 269 place count 493 transition count 438
Applied a total of 269 rules in 141 ms. Remains 493 /630 variables (removed 137) and now considering 438/570 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5308993999207615758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10804057373681962132.kers'
[2026-05-24 12:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5308993999207615758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10804057373681962132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 438 rows 493 cols 1409 entries
Finished phase 1 with 323 SingleSign rule and 75 generalized
[2026-05-24 12:07:56] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10804057373681962132.kers
Total runtime 3 ms.
[2026-05-24 12:07:57] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-05-24 12:07:57] [INFO ] Invariant cache hit.
[2026-05-24 12:07:58] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2026-05-24 12:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/493 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 20/135 constraints. Problems are: Problem set: 3 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/155 constraints. Problems are: Problem set: 3 solved, 434 unsolved
SMT process timed out in 30228ms, After SMT, problems are : Problem set: 3 solved, 434 unsolved
Search for dead transitions found 3 dead transitions in 30242ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 493/630 places, 435/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 493 /493 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32607 ms. Remains : 493/630 places, 435/570 transitions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 493 /493 variables (removed 0) and now considering 435/435 (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-17376875825572257425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9847188665152375774.kers'
[2026-05-24 12:08:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17376875825572257425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9847188665152375774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 493 cols 1391 entries
Finished phase 1 with 322 SingleSign rule and 76 generalized
[2026-05-24 12:08:29] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9847188665152375774.kers
Total runtime 4 ms.
[2026-05-24 12:08:29] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-24 12:08:29] [INFO ] Invariant cache hit.
[2026-05-24 12:08:30] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-24 12:08:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/493 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 20/115 constraints. Problems are: Problem set: 10 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 20/135 constraints. Problems are: Problem set: 10 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/155 constraints. Problems are: Problem set: 10 solved, 424 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 10 solved, 424 unsolved
Search for dead transitions found 10 dead transitions in 30172ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 493/493 places, 425/435 transitions.
Applied a total of 0 rules in 22 ms. Remains 493 /493 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31845 ms. Remains : 493/493 places, 425/435 transitions.
Support contains 49 out of 493 places after structural reductions.
[2026-05-24 12:09:01] [INFO ] Flatten gal took : 60 ms
[2026-05-24 12:09:01] [INFO ] Flatten gal took : 29 ms
[2026-05-24 12:09:01] [INFO ] Input system was already deterministic with 425 transitions.
RANDOM walk for 40000 steps (263 resets) in 1449 ms. (27 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40004 steps (47 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (47 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (45 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5993919054247650980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12389671062488918900.kers'
[2026-05-24 12:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5993919054247650980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12389671062488918900.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 493 cols 1331 entries
Finished phase 1 with 322 SingleSign rule and 76 generalized
[2026-05-24 12:09:02] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12389671062488918900.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 231/251 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 161/412 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 66/478 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 6/484 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 419/903 variables, 484/579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 13/916 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/918 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/918 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/918 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 918/918 variables, and 588 constraints, problems are : Problem set: 0 solved, 9 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 231/251 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 161/412 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/478 variables, 15/97 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 20/117 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 6027ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 425/425 transitions.
Graph (trivial) has 220 edges and 493 vertex of which 4 / 493 are part of one of the 1 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1085 edges and 490 vertex of which 489 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 489 transition count 376
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 445 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 444 transition count 375
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 92 place count 444 transition count 274
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 310 place count 327 transition count 274
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 319 place count 318 transition count 265
Iterating global reduction 3 with 9 rules applied. Total rules applied 328 place count 318 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 318 transition count 264
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 330 place count 317 transition count 264
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 581 place count 189 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 583 place count 188 transition count 145
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 586 place count 188 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 589 place count 185 transition count 142
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 592 place count 185 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 184 transition count 141
Applied a total of 593 rules in 115 ms. Remains 184 /493 variables (removed 309) and now considering 141/425 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 184/493 places, 141/425 transitions.
RANDOM walk for 40000 steps (10 resets) in 894 ms. (44 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12539211164260889680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5523362771821881844.kers'
[2026-05-24 12:09:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12539211164260889680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5523362771821881844.kers]
Culling duplicate invariants (modulo rational): removing 31 columns.
Culled 31 columns in 0 ms.
// Phase 1: matrix 141 rows 153 cols 593 entries
Finished phase 1 with 49 SingleSign rule and 61 generalized
[2026-05-24 12:09:08] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5523362771821881844.kers
Total runtime 1 ms.
[2026-05-24 12:09:08] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/75 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/121 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/125 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/127 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 137/264 variables, 127/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 60/324 variables, 56/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 27/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/325 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/325 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/75 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/121 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/125 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/127 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/264 variables, 127/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/324 variables, 56/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 27/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/324 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/325 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/325 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/325 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 6 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 131 stabilizing places and 124 stable transitions
Graph (complete) has 1089 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Graph (trivial) has 234 edges and 493 vertex of which 7 / 493 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1082 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 485 transition count 366
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 435 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 434 transition count 365
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 104 place count 434 transition count 265
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 320 place count 318 transition count 265
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 335 place count 303 transition count 250
Iterating global reduction 3 with 15 rules applied. Total rules applied 350 place count 303 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 350 place count 303 transition count 249
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 352 place count 302 transition count 249
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 603 place count 174 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 605 place count 173 transition count 130
Applied a total of 605 rules in 48 ms. Remains 173 /493 variables (removed 320) and now considering 130/425 (removed 295) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6513421396004999665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12221053827171627510.kers'
[2026-05-24 12:09:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6513421396004999665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12221053827171627510.kers]
Normalized transition count is 129 out of 130 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 129 rows 172 cols 721 entries
Finished phase 1 with 57 SingleSign rule and 42 generalized
[2026-05-24 12:09:09] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12221053827171627510.kers
Total runtime 2 ms.
[2026-05-24 12:09:09] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 29, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 148 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/493 places, 130/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 129
Applied a total of 2 rules in 11 ms. Remains 151 /152 variables (removed 1) and now considering 129/130 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10904977619930129850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4735203307357411169.kers'
[2026-05-24 12:09:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10904977619930129850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4735203307357411169.kers]
Normalized transition count is 128 out of 129 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 151 cols 625 entries
Finished phase 1 with 56 SingleSign rule and 42 generalized
[2026-05-24 12:09:09] [INFO ] Computed 53 invariants in 0 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4735203307357411169.kers
Total runtime 1 ms.
[2026-05-24 12:09:09] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-24 12:09:09] [INFO ] Invariant cache hit.
[2026-05-24 12:09:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 12:09:10] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [1, 3, 7, 10, 14, 54, 56, 58, 60, 62, 64, 66, 70, 72, 74, 76, 78, 80, 82, 84, 92, 94, 96, 98, 100, 139, 145, 149]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 500 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/493 places, 129/425 transitions.
Graph (complete) has 353 edges and 123 vertex of which 112 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 112 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 106 transition count 118
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 20 place count 99 transition count 97
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 99 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 98 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 98 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 48 place count 88 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 87 transition count 86
Applied a total of 50 rules in 19 ms. Remains 87 /123 variables (removed 36) and now considering 86/129 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14134063002883147933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14127106892081974146.kers'
[2026-05-24 12:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14134063002883147933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14127106892081974146.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 87 cols 305 entries
Finished phase 1 with 60 SingleSign rule and 9 generalized
[2026-05-24 12:09:10] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14127106892081974146.kers
Total runtime 1 ms.
[2026-05-24 12:09:10] [INFO ] Implicit Places using invariants in 65 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 86/493 places, 86/425 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 796 ms. Remains : 86/493 places, 86/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-00 finished in 1142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1)||X(G(!p2))))))'
Support contains 6 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 480 transition count 412
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 480 transition count 412
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 475 transition count 407
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 475 transition count 407
Applied a total of 36 rules in 25 ms. Remains 475 /493 variables (removed 18) and now considering 407/425 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13871939181987271998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16897104155473922571.kers'
[2026-05-24 12:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13871939181987271998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16897104155473922571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 407 rows 475 cols 1295 entries
Finished phase 1 with 304 SingleSign rule and 76 generalized
[2026-05-24 12:09:10] [INFO ] Computed 95 invariants in 5 ms
Computed 95 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16897104155473922571.kers
Total runtime 7 ms.
[2026-05-24 12:09:11] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-24 12:09:11] [INFO ] Invariant cache hit.
[2026-05-24 12:09:12] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2026-05-24 12:09:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/115 constraints. Problems are: Problem set: 5 solved, 401 unsolved
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/135 constraints. Problems are: Problem set: 6 solved, 400 unsolved
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/155 constraints. Problems are: Problem set: 9 solved, 397 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/175 constraints. Problems are: Problem set: 11 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/882 variables, and 182 constraints, problems are : Problem set: 11 solved, 395 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 15/15 constraints. Problems are: Problem set: 11 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 77/92 constraints. Problems are: Problem set: 11 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 3/95 constraints. Problems are: Problem set: 11 solved, 395 unsolved
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 87/182 constraints. Problems are: Problem set: 14 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/202 constraints. Problems are: Problem set: 14 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/222 constraints. Problems are: Problem set: 14 solved, 392 unsolved
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/242 constraints. Problems are: Problem set: 16 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/262 constraints. Problems are: Problem set: 16 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/282 constraints. Problems are: Problem set: 16 solved, 390 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 20/302 constraints. Problems are: Problem set: 16 solved, 390 unsolved
SMT process timed out in 60129ms, After SMT, problems are : Problem set: 16 solved, 390 unsolved
Search for dead transitions found 16 dead transitions in 60131ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 475/493 places, 391/425 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61995 ms. Remains : 475/493 places, 391/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1)||X(G(!p2))))))'
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 16907 steps with 112 reset in 64 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-01 finished in 62309 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 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Graph (trivial) has 238 edges and 493 vertex of which 7 / 493 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1082 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 485 transition count 365
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 434 transition count 365
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 104 place count 434 transition count 262
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 327 place count 314 transition count 262
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 342 place count 299 transition count 247
Iterating global reduction 2 with 15 rules applied. Total rules applied 357 place count 299 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 299 transition count 246
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 359 place count 298 transition count 246
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 616 place count 167 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 166 transition count 124
Applied a total of 618 rules in 45 ms. Remains 166 /493 variables (removed 327) and now considering 124/425 (removed 301) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16422925879642930386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18287703821555363805.kers'
[2026-05-24 12:10:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16422925879642930386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18287703821555363805.kers]
Normalized transition count is 123 out of 124 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 123 rows 165 cols 727 entries
Finished phase 1 with 53 SingleSign rule and 40 generalized
[2026-05-24 12:10:13] [INFO ] Computed 73 invariants in 1 ms
Computed 73 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18287703821555363805.kers
Total runtime 1 ms.
[2026-05-24 12:10:13] [INFO ] Implicit Places using invariants in 136 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 138 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/493 places, 124/425 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 146/493 places, 124/425 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 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 21844 reset in 241 ms.
Product exploration explored 100000 steps with 21816 reset in 294 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9923 resets) in 675 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3092 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12364 steps, run visited all 1 properties in 52 ms. (steps per millisecond=237 )
Probabilistic random walk after 12364 steps, saw 4031 distinct states, run finished after 55 ms. (steps per millisecond=224 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 482 ms.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 124/124 transitions.
Applied a total of 0 rules in 13 ms. Remains 146 /146 variables (removed 0) and now considering 124/124 (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-12999310104335303616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8301984408264711860.kers'
[2026-05-24 12:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12999310104335303616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8301984408264711860.kers]
Normalized transition count is 123 out of 124 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 146 cols 641 entries
Finished phase 1 with 52 SingleSign rule and 41 generalized
[2026-05-24 12:10:14] [INFO ] Computed 53 invariants in 0 ms
Computed 53 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8301984408264711860.kers
Total runtime 1 ms.
[2026-05-24 12:10:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 12:10:14] [INFO ] Invariant cache hit.
[2026-05-24 12:10:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 12:10:14] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [1, 3, 7, 10, 15, 34, 36, 38, 40, 41, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 66, 68, 70, 72, 74, 76, 78, 80, 88, 90, 92, 94, 96, 134, 140, 144]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 459 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/146 places, 124/124 transitions.
Graph (complete) has 327 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 98 transition count 111
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 90 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 89 transition count 110
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 29 place count 79 transition count 88
Iterating global reduction 3 with 10 rules applied. Total rules applied 39 place count 79 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 79 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 45 place count 76 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 46 place count 75 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 75 transition count 84
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 62 place count 67 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 66 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 66 transition count 76
Applied a total of 65 rules in 16 ms. Remains 66 /109 variables (removed 43) and now considering 76/124 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10538305774300328799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8529532430071352856.kers'
[2026-05-24 12:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10538305774300328799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8529532430071352856.kers]
Normalized transition count is 75 out of 76 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 66 cols 259 entries
Finished phase 1 with 54 SingleSign rule and 1 generalized
[2026-05-24 12:10:14] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8529532430071352856.kers
Total runtime 0 ms.
[2026-05-24 12:10:14] [INFO ] Implicit Places using invariants in 49 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/146 places, 76/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 540 ms. Remains : 65/146 places, 76/124 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (10274 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3041 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4785 steps, run visited all 1 properties in 9 ms. (steps per millisecond=531 )
Probabilistic random walk after 4785 steps, saw 1698 distinct states, run finished after 9 ms. (steps per millisecond=531 ) properties seen :1
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 218 ms.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22385 reset in 84 ms.
Product exploration explored 100000 steps with 22441 reset in 112 ms.
Built C files in :
/tmp/ltsmin12107538493967062725
[2026-05-24 12:10:15] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2026-05-24 12:10:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:10:15] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2026-05-24 12:10:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:10:15] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2026-05-24 12:10:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:10:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12107538493967062725
Running compilation step : cd /tmp/ltsmin12107538493967062725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin12107538493967062725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12107538493967062725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10875482780846903948.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLCardinality-02 finished in 2978 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((p1||X((X(X(!p2)) U ((!p2&&X(X(!p2)))||X(X(G(!p2))))))))||p0)))'
Support contains 8 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 478 transition count 410
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 478 transition count 410
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 473 transition count 405
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 473 transition count 405
Applied a total of 40 rules in 51 ms. Remains 473 /493 variables (removed 20) and now considering 405/425 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16828354292596495025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4824766900789262643.kers'
[2026-05-24 12:10:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16828354292596495025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4824766900789262643.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 405 rows 473 cols 1291 entries
Finished phase 1 with 302 SingleSign rule and 76 generalized
[2026-05-24 12:10:16] [INFO ] Computed 95 invariants in 8 ms
Computed 95 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4824766900789262643.kers
Total runtime 10 ms.
[2026-05-24 12:10:16] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 12:10:16] [INFO ] Invariant cache hit.
[2026-05-24 12:10:17] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2026-05-24 12:10:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 404 unsolved
SMT process timed out in 30055ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 30059ms
Starting structural reductions in LTL mode, iteration 1 : 473/493 places, 405/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31764 ms. Remains : 473/493 places, 405/425 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((p1||X((X(X(!p2)) U ((!p2&&X(X(!p2)))||X(X(G(!p2))))))))||p0)))'
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-03
Product exploration explored 100000 steps with 1449 reset in 255 ms.
Stack based approach found an accepted trace after 138 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-03 finished in 32284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(F(!p0)))&&F(p1))||G(F(!p0)))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 479 transition count 411
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 479 transition count 411
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 474 transition count 406
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 474 transition count 406
Applied a total of 38 rules in 26 ms. Remains 474 /493 variables (removed 19) and now considering 406/425 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3846886554835350904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9403634621398543659.kers'
[2026-05-24 12:10:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3846886554835350904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9403634621398543659.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 474 cols 1293 entries
Finished phase 1 with 303 SingleSign rule and 76 generalized
[2026-05-24 12:10:48] [INFO ] Computed 95 invariants in 7 ms
Computed 95 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9403634621398543659.kers
Total runtime 9 ms.
[2026-05-24 12:10:48] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-24 12:10:48] [INFO ] Invariant cache hit.
[2026-05-24 12:10:49] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-24 12:10:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/115 constraints. Problems are: Problem set: 8 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/135 constraints. Problems are: Problem set: 8 solved, 397 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/155 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/175 constraints. Problems are: Problem set: 14 solved, 391 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/880 variables, and 176 constraints, problems are : Problem set: 14 solved, 391 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 77/92 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 3/95 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 81/176 constraints. Problems are: Problem set: 14 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/196 constraints. Problems are: Problem set: 14 solved, 391 unsolved
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/216 constraints. Problems are: Problem set: 18 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/236 constraints. Problems are: Problem set: 18 solved, 387 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/256 constraints. Problems are: Problem set: 20 solved, 385 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 20/276 constraints. Problems are: Problem set: 20 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/880 variables, and 276 constraints, problems are : Problem set: 20 solved, 385 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/405 constraints, Known Traps: 181/181 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 20 solved, 385 unsolved
Search for dead transitions found 20 dead transitions in 60073ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/493 places, 386/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61483 ms. Remains : 474/493 places, 386/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(X(X(F(p0)))&&F(p1)))))'
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-04
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-04 finished in 61715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(p1)))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 479 transition count 411
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 479 transition count 411
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 473 transition count 405
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 473 transition count 405
Applied a total of 40 rules in 25 ms. Remains 473 /493 variables (removed 20) and now considering 405/425 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3835647757878561776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12026293782821066954.kers'
[2026-05-24 12:11:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3835647757878561776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12026293782821066954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 473 cols 1291 entries
Finished phase 1 with 302 SingleSign rule and 76 generalized
[2026-05-24 12:11:50] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12026293782821066954.kers
Total runtime 4 ms.
[2026-05-24 12:11:50] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-24 12:11:50] [INFO ] Invariant cache hit.
[2026-05-24 12:11:51] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 473/493 places, 405/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 473/493 places, 405/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(p1)))))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Computed a total of 126 stabilizing places and 119 stable transitions
Graph (complete) has 1059 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 126 stabilizing places and 119 stable transitions
Detected a total of 126/473 stabilizing places and 119/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (265 resets) in 216 ms. (184 steps per ms) remains 1/4 properties
BEST_FIRST walk for 31395 steps (31 resets) in 109 ms. (285 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Knowledge-based reduction took 523 ms.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Support contains 3 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 405/405 transitions.
Applied a total of 0 rules in 12 ms. Remains 473 /473 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2026-05-24 12:11:52] [INFO ] Invariant cache hit.
[2026-05-24 12:11:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 12:11:53] [INFO ] Invariant cache hit.
[2026-05-24 12:11:54] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1483 ms. Remains : 473/473 places, 405/405 transitions.
Computed a total of 126 stabilizing places and 119 stable transitions
Graph (complete) has 1059 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 126 stabilizing places and 119 stable transitions
Detected a total of 126/473 stabilizing places and 119/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (266 resets) in 199 ms. (200 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (42 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 64 ms. (615 steps per ms) remains 1/2 properties
[2026-05-24 12:11:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 326/396 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/458 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/464 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 399/863 variables, 464/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/876 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/878 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/878 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/878 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 878/878 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 326/396 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/458 variables, 15/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/464 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/863 variables, 464/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/863 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/863 variables, 7/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/863 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/876 variables, 7/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/876 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/878 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/878 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/878 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 878/878 variables, and 589 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2686ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Knowledge-based reduction took 3245 ms.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8898996969126914589
[2026-05-24 12:11:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8898996969126914589
Running compilation step : cd /tmp/ltsmin8898996969126914589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin8898996969126914589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8898996969126914589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased164457383782237940.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLCardinality-07 finished in 9224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(G(p0)) U p1)))) U (p0&&X(p2))))'
Support contains 5 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 480 transition count 412
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 480 transition count 412
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 476 transition count 408
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 476 transition count 408
Applied a total of 34 rules in 26 ms. Remains 476 /493 variables (removed 17) and now considering 408/425 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2215689252365736172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16140051826225484277.kers'
[2026-05-24 12:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2215689252365736172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16140051826225484277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 476 cols 1297 entries
Finished phase 1 with 305 SingleSign rule and 76 generalized
[2026-05-24 12:11:59] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16140051826225484277.kers
Total runtime 7 ms.
[2026-05-24 12:11:59] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-24 12:11:59] [INFO ] Invariant cache hit.
[2026-05-24 12:12:00] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2026-05-24 12:12:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/115 constraints. Problems are: Problem set: 14 solved, 393 unsolved
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/135 constraints. Problems are: Problem set: 19 solved, 388 unsolved
Problem TDEAD326 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 20/155 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 20/175 constraints. Problems are: Problem set: 20 solved, 387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/884 variables, and 175 constraints, problems are : Problem set: 20 solved, 387 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/476 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 15/15 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 77/92 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 3/95 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 80/175 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/195 constraints. Problems are: Problem set: 20 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 20/215 constraints. Problems are: Problem set: 20 solved, 387 unsolved
Problem TDEAD341 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 20/235 constraints. Problems are: Problem set: 21 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 20/255 constraints. Problems are: Problem set: 21 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 20/275 constraints. Problems are: Problem set: 21 solved, 386 unsolved
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 21 solved, 386 unsolved
Search for dead transitions found 21 dead transitions in 60163ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 476/493 places, 387/425 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 387
Applied a total of 1 rules in 6 ms. Remains 475 /476 variables (removed 1) and now considering 387/387 (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-1767345853530876939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17417416888305474568.kers'
[2026-05-24 12:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1767345853530876939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17417416888305474568.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 475 cols 1169 entries
Finished phase 1 with 305 SingleSign rule and 69 generalized
[2026-05-24 12:13:01] [INFO ] Computed 101 invariants in 2 ms
Computed 101 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17417416888305474568.kers
Total runtime 3 ms.
[2026-05-24 12:13:01] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-24 12:13:01] [INFO ] Invariant cache hit.
[2026-05-24 12:13:02] [INFO ] Implicit Places using invariants and state equation in 931 ms returned [151, 152]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1196 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 473/493 places, 387/425 transitions.
Applied a total of 0 rules in 13 ms. Remains 473 /473 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62943 ms. Remains : 473/493 places, 387/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(G(p0)) U p1)))) U (X(p2)&&p0)))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1005 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 127 stabilizing places and 120 stable transitions
Detected a total of 127/473 stabilizing places and 120/387 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 19 ms. Proved property starting from automaton with 6 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-08 finished in 63521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)&&p0)))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 479 transition count 411
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 479 transition count 411
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 474 transition count 406
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 474 transition count 406
Applied a total of 38 rules in 17 ms. Remains 474 /493 variables (removed 19) and now considering 406/425 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9153333068214426156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16258872004065537906.kers'
[2026-05-24 12:13:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9153333068214426156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16258872004065537906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 474 cols 1293 entries
Finished phase 1 with 303 SingleSign rule and 76 generalized
[2026-05-24 12:13:02] [INFO ] Computed 95 invariants in 3 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16258872004065537906.kers
Total runtime 4 ms.
[2026-05-24 12:13:03] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-24 12:13:03] [INFO ] Invariant cache hit.
[2026-05-24 12:13:04] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-24 12:13:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/115 constraints. Problems are: Problem set: 8 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/135 constraints. Problems are: Problem set: 8 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/155 constraints. Problems are: Problem set: 8 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/175 constraints. Problems are: Problem set: 8 solved, 397 unsolved
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 8 solved, 397 unsolved
Search for dead transitions found 8 dead transitions in 30164ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/493 places, 398/425 transitions.
Applied a total of 0 rules in 11 ms. Remains 474 /474 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31750 ms. Remains : 474/493 places, 398/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)&&p0)))'
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-10 finished in 31935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 477 transition count 409
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 477 transition count 409
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 471 transition count 403
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 471 transition count 403
Applied a total of 44 rules in 22 ms. Remains 471 /493 variables (removed 22) and now considering 403/425 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5545958000185001632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10551817967726306181.kers'
[2026-05-24 12:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5545958000185001632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10551817967726306181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 471 cols 1287 entries
Finished phase 1 with 300 SingleSign rule and 76 generalized
[2026-05-24 12:13:34] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10551817967726306181.kers
Total runtime 7 ms.
[2026-05-24 12:13:34] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 12:13:34] [INFO ] Invariant cache hit.
[2026-05-24 12:13:36] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2026-05-24 12:13:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 5 solved, 397 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 5 solved, 397 unsolved
Search for dead transitions found 5 dead transitions in 30173ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/493 places, 398/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 471 /471 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31567 ms. Remains : 471/493 places, 398/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLCardinality-11 finished in 31714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 425/425 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 478 transition count 410
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 478 transition count 410
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 472 transition count 404
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 472 transition count 404
Applied a total of 42 rules in 24 ms. Remains 472 /493 variables (removed 21) and now considering 404/425 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10869925066498199766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11740438894915740714.kers'
[2026-05-24 12:14:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10869925066498199766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11740438894915740714.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 472 cols 1289 entries
Finished phase 1 with 301 SingleSign rule and 76 generalized
[2026-05-24 12:14:06] [INFO ] Computed 95 invariants in 4 ms
Computed 95 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11740438894915740714.kers
Total runtime 5 ms.
[2026-05-24 12:14:06] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-24 12:14:06] [INFO ] Invariant cache hit.
[2026-05-24 12:14:08] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Running 403 sub problems to find dead transitions.
[2026-05-24 12:14:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 394 unsolved
Problem TDEAD312 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 11 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 11 solved, 392 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 15 solved, 388 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 15 solved, 388 unsolved
Search for dead transitions found 15 dead transitions in 30131ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/493 places, 389/425 transitions.
Applied a total of 0 rules in 8 ms. Remains 472 /472 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31754 ms. Remains : 472/493 places, 389/425 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))))'
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1026 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 18 ms. Proved property starting from automaton with 5 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA BusinessProcesses-PT-16-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLCardinality-13 finished in 32304 ms.
All properties solved by simple procedures.
Total runtime 402422 ms.
BK_STOP 1779624878759
--------------------
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-16"
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-16, 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-177946842000571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 '
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 ;