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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.4K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 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 85K 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779612286216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 08:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:44:47] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-24 08:44:47] [INFO ] Transformed 376 places.
[2026-05-24 08:44:47] [INFO ] Transformed 297 transitions.
[2026-05-24 08:44:47] [INFO ] Found NUPN structural information;
[2026-05-24 08:44:47] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Support contains 56 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 336 transition count 259
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 336 transition count 259
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 92 place count 320 transition count 243
Iterating global reduction 1 with 16 rules applied. Total rules applied 108 place count 320 transition count 243
Applied a total of 108 rules in 76 ms. Remains 320 /375 variables (removed 55) and now considering 243/296 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9953919175976554944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11248134277709685862.kers'
[2026-05-24 08:44:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9953919175976554944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11248134277709685862.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 320 cols 720 entries
Finished phase 1 with 204 SingleSign rule and 37 generalized
[2026-05-24 08:44:47] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11248134277709685862.kers
Total runtime 3 ms.
[2026-05-24 08:44:48] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 08:44:48] [INFO ] Invariant cache hit.
[2026-05-24 08:44:48] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 08:44:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/563 variables, and 187 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 108/187 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/563 variables, 320/510 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 242/752 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 12/764 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 767 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 126/126 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 320/375 places, 243/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60965 ms. Remains : 320/375 places, 243/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2026-05-24 08:45:48] [INFO ] Invariant cache hit.
[2026-05-24 08:45:48] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-24 08:45:48] [INFO ] Invariant cache hit.
[2026-05-24 08:45:49] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 320/320 places, 243/243 transitions.
Support contains 56 out of 320 places after structural reductions.
[2026-05-24 08:45:49] [INFO ] Flatten gal took : 40 ms
[2026-05-24 08:45:49] [INFO ] Flatten gal took : 18 ms
[2026-05-24 08:45:49] [INFO ] Input system was already deterministic with 243 transitions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (400 resets) in 2241 ms. (17 steps per ms) remains 6/35 properties
BEST_FIRST walk for 40004 steps (52 resets) in 151 ms. (263 steps per ms) remains 5/6 properties
BEST_FIRST walk for 37719 steps (65 resets) in 106 ms. (352 steps per ms) remains 0/5 properties
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 313 stabilizing places and 234 stable transitions
Graph (complete) has 631 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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)))&&((p1||X(!p2)) U (G((p1||X(!p2)))||(!p3&&(p1||X(!p2))))))))'
Support contains 8 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 310 transition count 233
Applied a total of 20 rules in 26 ms. Remains 310 /320 variables (removed 10) and now considering 233/243 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16797127779586268315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16515827461813669053.kers'
[2026-05-24 08:45:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16797127779586268315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16515827461813669053.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 310 cols 700 entries
Finished phase 1 with 194 SingleSign rule and 37 generalized
[2026-05-24 08:45:50] [INFO ] Computed 79 invariants in 4 ms
Computed 79 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16515827461813669053.kers
Total runtime 5 ms.
[2026-05-24 08:45:51] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 08:45:51] [INFO ] Invariant cache hit.
[2026-05-24 08:45:51] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-24 08:45:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 16/135 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 233/543 variables, 310/456 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 459 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/459 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/691 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 11/702 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 4/706 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 706 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 310/320 places, 233/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60639 ms. Remains : 310/320 places, 233/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&((p1||X(!p2)) U (G((p1||X(!p2)))||(!p3&&(p1||X(!p2))))))))'
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), p2, (NOT p0), (AND (NOT p1) p2), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 310 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 7818 steps (82 resets) in 21 ms. (355 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 351 ms.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 310 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 8 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2026-05-24 08:46:52] [INFO ] Invariant cache hit.
[2026-05-24 08:46:53] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 08:46:53] [INFO ] Invariant cache hit.
[2026-05-24 08:46:53] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 310/310 places, 233/233 transitions.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 42 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 7503 steps (77 resets) in 25 ms. (288 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 389 ms.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 100 ms.
Spot run failed in 74 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/ltsmin5926549310763249136
[2026-05-24 08:46:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5926549310763249136
Running compilation step : cd /tmp/ltsmin5926549310763249136;'/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 481 ms.
Running link step : cd /tmp/ltsmin5926549310763249136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5926549310763249136;'/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/stateBased12661482981465179587.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-00 finished in 64312 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&&(G(p1) U p2)))&&F(p1)))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 309 transition count 232
Applied a total of 22 rules in 17 ms. Remains 309 /320 variables (removed 11) and now considering 232/243 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7063356762929394387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13944923505251082265.kers'
[2026-05-24 08:46:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7063356762929394387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13944923505251082265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 309 cols 698 entries
Finished phase 1 with 193 SingleSign rule and 37 generalized
[2026-05-24 08:46:55] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13944923505251082265.kers
Total runtime 1 ms.
[2026-05-24 08:46:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-24 08:46:55] [INFO ] Invariant cache hit.
[2026-05-24 08:46:55] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:46:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/541 variables, and 156 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 231/702 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 707 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 309/320 places, 232/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 309/320 places, 232/243 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&&(G(p1) U p2)))&&F(p1)))'
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (NOT p1), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-01 finished in 60929 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)) U ((X(X(p0))&&(!p1 U (p2||G(!p1))))||X(X(G(p0))))))'
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 310 transition count 233
Applied a total of 20 rules in 14 ms. Remains 310 /320 variables (removed 10) and now considering 233/243 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17737078496153432252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18390033349294711903.kers'
[2026-05-24 08:47:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17737078496153432252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18390033349294711903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 310 cols 700 entries
Finished phase 1 with 194 SingleSign rule and 37 generalized
[2026-05-24 08:47:56] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18390033349294711903.kers
Total runtime 2 ms.
[2026-05-24 08:47:56] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 08:47:56] [INFO ] Invariant cache hit.
[2026-05-24 08:47:56] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-24 08:47:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 14/143 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 233/543 variables, 310/463 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 471 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 82/161 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 233/543 variables, 310/488 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 232/720 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 724 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 310/320 places, 233/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60837 ms. Remains : 310/320 places, 233/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (X(X(G(p0)))||(X(X(p0))&&(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) (NOT p2) p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 22 factoid took 17 ms. Proved property starting from automaton with 8 states, 20 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 61427 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||G(p1)))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 140 edges and 320 vertex of which 6 / 320 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 625 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 313 transition count 203
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 281 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 66 place count 281 transition count 138
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 206 place count 206 transition count 138
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 215 place count 197 transition count 129
Iterating global reduction 2 with 9 rules applied. Total rules applied 224 place count 197 transition count 129
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 392 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 108 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 107 transition count 48
Applied a total of 394 rules in 57 ms. Remains 107 /320 variables (removed 213) and now considering 48/243 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14768695863194600220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4331707048127209588.kers'
[2026-05-24 08:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14768695863194600220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4331707048127209588.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 47 rows 70 cols 162 entries
Finished phase 1 with 44 SingleSign rule and 3 generalized
[2026-05-24 08:48:57] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4331707048127209588.kers
Total runtime 0 ms.
[2026-05-24 08:48:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 08:48:57] [INFO ] Invariant cache hit.
[2026-05-24 08:48:57] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 34, 35, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 197 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/320 places, 48/243 transitions.
Graph (complete) has 139 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 60 transition count 37
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 50 transition count 37
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 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 37 transition count 30
Applied a total of 41 rules in 6 ms. Remains 37 /68 variables (removed 31) and now considering 30/48 (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-16689169616222944300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15684920873973167443.kers'
[2026-05-24 08:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16689169616222944300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15684920873973167443.kers]
Normalized transition count is 29 out of 30 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 37 cols 76 entries
Finished phase 1 with 25 SingleSign rule and 4 generalized
[2026-05-24 08:48:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15684920873973167443.kers
Total runtime 0 ms.
[2026-05-24 08:48:57] [INFO ] Implicit Places using invariants in 35 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/320 places, 30/243 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 35 transition count 29
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 29/30 (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-1356220551087368124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9983101946077470396.kers'
[2026-05-24 08:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1356220551087368124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9983101946077470396.kers]
Normalized transition count is 28 out of 29 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 28 rows 35 cols 72 entries
Finished phase 1 with 26 SingleSign rule and 2 generalized
[2026-05-24 08:48:57] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9983101946077470396.kers
Total runtime 0 ms.
[2026-05-24 08:48:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 08:48:57] [INFO ] Invariant cache hit.
[2026-05-24 08:48:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/320 places, 29/243 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 371 ms. Remains : 35/320 places, 29/243 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||G(p1)))))'
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (complete) has 631 edges and 320 vertex of which 319 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 318 transition count 210
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 287 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 285 transition count 208
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 67 place count 285 transition count 142
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 209 place count 209 transition count 142
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 218 place count 200 transition count 133
Iterating global reduction 3 with 9 rules applied. Total rules applied 227 place count 200 transition count 133
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 397 place count 111 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 111 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 110 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 400 place count 109 transition count 50
Applied a total of 400 rules in 34 ms. Remains 109 /320 variables (removed 211) and now considering 50/243 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15903917583191683501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13356013067430511972.kers'
[2026-05-24 08:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15903917583191683501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13356013067430511972.kers]
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 50 rows 74 cols 193 entries
Finished phase 1 with 46 SingleSign rule and 3 generalized
[2026-05-24 08:48:58] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13356013067430511972.kers
Total runtime 1 ms.
[2026-05-24 08:48:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 08:48:58] [INFO ] Invariant cache hit.
[2026-05-24 08:48:58] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 198 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/320 places, 50/243 transitions.
Graph (complete) has 154 edges and 73 vertex of which 65 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 65 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 58 transition count 42
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 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 40 place count 42 transition count 33
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 42 place count 41 transition count 32
Applied a total of 42 rules in 5 ms. Remains 41 /73 variables (removed 32) and now considering 32/50 (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-2502786132685326233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4635794496539901288.kers'
[2026-05-24 08:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2502786132685326233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4635794496539901288.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 41 cols 127 entries
Finished phase 1 with 29 SingleSign rule and 2 generalized
[2026-05-24 08:48:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4635794496539901288.kers
Total runtime 0 ms.
[2026-05-24 08:48:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 08:48:58] [INFO ] Invariant cache hit.
[2026-05-24 08:48:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/320 places, 32/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 41/320 places, 32/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 11405 reset in 134 ms.
Stack based approach found an accepted trace after 26 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-04 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U p1))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 312 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 312 transition count 235
Applied a total of 16 rules in 19 ms. Remains 312 /320 variables (removed 8) and now considering 235/243 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9464486018677008828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14384806476665729621.kers'
[2026-05-24 08:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9464486018677008828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14384806476665729621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 312 cols 704 entries
Finished phase 1 with 196 SingleSign rule and 37 generalized
[2026-05-24 08:48:58] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14384806476665729621.kers
Total runtime 3 ms.
[2026-05-24 08:48:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-24 08:48:58] [INFO ] Invariant cache hit.
[2026-05-24 08:48:59] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 08:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 235/547 variables, 312/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 479 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 235/547 variables, 312/482 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 234/716 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 7/723 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 723 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 98/98 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 312/320 places, 235/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 312/320 places, 235/243 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(G(p0)) U p1))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-05
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-05 finished in 60903 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((F(p0)||X(G(p1)))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 309 transition count 232
Applied a total of 22 rules in 12 ms. Remains 309 /320 variables (removed 11) and now considering 232/243 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14468205371104907039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7480731208550266597.kers'
[2026-05-24 08:49:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14468205371104907039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7480731208550266597.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 309 cols 698 entries
Finished phase 1 with 193 SingleSign rule and 37 generalized
[2026-05-24 08:49:59] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7480731208550266597.kers
Total runtime 1 ms.
[2026-05-24 08:49:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 08:49:59] [INFO ] Invariant cache hit.
[2026-05-24 08:50:00] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/541 variables, and 156 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 231/702 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 707 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 309/320 places, 232/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 309/320 places, 232/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 10 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 15 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-06 finished in 61095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X(p0)))) U (p1||G(!p2))))'
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 11 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15942307905910548697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17592732894936838863.kers'
[2026-05-24 08:51:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15942307905910548697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17592732894936838863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:51:00] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17592732894936838863.kers
Total runtime 1 ms.
[2026-05-24 08:51:00] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-24 08:51:00] [INFO ] Invariant cache hit.
[2026-05-24 08:51:01] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 08:51:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 12/140 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/470 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 483 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 93/172 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/493 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 233/726 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 3/729 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 737 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 114/114 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60955 ms. Remains : 311/320 places, 234/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X(p0)))) U (G(!p1)||p2)))'
Stuttering acceptance computed with spot in 281 ms :[(AND p1 (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), true, (AND p1 (NOT p0)), p1]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-07 finished in 61273 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 10 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 11 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12894096699280953611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10540966816835531671.kers'
[2026-05-24 08:52:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12894096699280953611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10540966816835531671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:52:01] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10540966816835531671.kers
Total runtime 2 ms.
[2026-05-24 08:52:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 08:52:01] [INFO ] Invariant cache hit.
[2026-05-24 08:52:02] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 311/320 places, 234/243 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 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-10 finished in 789 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(((p0 U X(p1))||(!p0 U p2)))&&F(p3)))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 309 transition count 232
Applied a total of 22 rules in 19 ms. Remains 309 /320 variables (removed 11) and now considering 232/243 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14374990581301483861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2642415502763959546.kers'
[2026-05-24 08:52:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14374990581301483861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2642415502763959546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 309 cols 698 entries
Finished phase 1 with 193 SingleSign rule and 37 generalized
[2026-05-24 08:52:02] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2642415502763959546.kers
Total runtime 3 ms.
[2026-05-24 08:52:02] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-24 08:52:02] [INFO ] Invariant cache hit.
[2026-05-24 08:52:03] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/541 variables, and 156 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 77/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 231/702 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 5/707 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 707 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 309/320 places, 232/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 309/320 places, 232/243 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(((p0 U X(p1))||(!p0 U p2)))&&F(p3)))))'
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 61219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 142 edges and 320 vertex of which 6 / 320 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 625 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 313 transition count 202
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 68 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 208 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 197 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 197 transition count 129
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 396 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 105 transition count 46
Applied a total of 398 rules in 28 ms. Remains 105 /320 variables (removed 215) and now considering 46/243 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4936324577567977032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4971920819190099202.kers'
[2026-05-24 08:53:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4936324577567977032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4971920819190099202.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 45 rows 68 cols 158 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-24 08:53:03] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4971920819190099202.kers
Total runtime 2 ms.
[2026-05-24 08:53:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 08:53:03] [INFO ] Invariant cache hit.
[2026-05-24 08:53:04] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 74, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 198 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/320 places, 46/243 transitions.
Graph (complete) has 138 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
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 46 place count 32 transition count 26
Applied a total of 46 rules in 3 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (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-17399852300324926253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17482137201951957664.kers'
[2026-05-24 08:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17399852300324926253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17482137201951957664.kers]
Normalized transition count is 25 out of 26 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 25 rows 32 cols 64 entries
Finished phase 1 with 23 SingleSign rule and 2 generalized
[2026-05-24 08:53:04] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17482137201951957664.kers
Total runtime 0 ms.
[2026-05-24 08:53:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 08:53:04] [INFO ] Invariant cache hit.
[2026-05-24 08:53:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/320 places, 26/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 32/320 places, 26/243 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 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 409 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((p0||G(F((G(p1)||(p1&&F(p2))))))))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 311 transition count 234
Applied a total of 18 rules in 16 ms. Remains 311 /320 variables (removed 9) and now considering 234/243 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8164339386786113780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8157136312235256836.kers'
[2026-05-24 08:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8164339386786113780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8157136312235256836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 311 cols 702 entries
Finished phase 1 with 195 SingleSign rule and 37 generalized
[2026-05-24 08:53:04] [INFO ] Computed 79 invariants in 4 ms
Computed 79 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8157136312235256836.kers
Total runtime 5 ms.
[2026-05-24 08:53:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-24 08:53:04] [INFO ] Invariant cache hit.
[2026-05-24 08:53:04] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 08:53:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 234/545 variables, 311/456 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 234/545 variables, 311/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 233/711 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 715 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 311/320 places, 234/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60713 ms. Remains : 311/320 places, 234/243 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((p0||G(F((G(p1)||(p1&&F(p2))))))))))'
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (418 resets) in 124 ms. (320 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (78 resets) in 195 ms. (204 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (79 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
[2026-05-24 08:54:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 171/246 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/299 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 222/521 variables, 299/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 17/538 variables, 8/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/545 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/545 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Int declared 75/545 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 10/50 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/311 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1059 ms.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-24 08:54:06] [INFO ] Invariant cache hit.
[2026-05-24 08:54:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 08:54:06] [INFO ] Invariant cache hit.
[2026-05-24 08:54:07] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 311/311 places, 234/234 transitions.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (408 resets) in 124 ms. (320 steps per ms) remains 1/3 properties
BEST_FIRST walk for 34831 steps (59 resets) in 55 ms. (621 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 527 ms.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Product exploration explored 100000 steps with 25000 reset in 101 ms.
Spot run failed in 54 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/ltsmin5497920093588810971
[2026-05-24 08:54:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5497920093588810971
Running compilation step : cd /tmp/ltsmin5497920093588810971;'/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 364 ms.
Running link step : cd /tmp/ltsmin5497920093588810971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5497920093588810971;'/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/stateBased8320124493742500822.hoa' '--buchi-type=spotba'
LTSmin run took 31 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-13 finished in 64948 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((X(X((X(p1)&&p0)))||F(p2))))))'
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 310 transition count 233
Applied a total of 20 rules in 18 ms. Remains 310 /320 variables (removed 10) and now considering 233/243 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2526187808126187794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5930126992873387769.kers'
[2026-05-24 08:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2526187808126187794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5930126992873387769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 310 cols 700 entries
Finished phase 1 with 194 SingleSign rule and 37 generalized
[2026-05-24 08:54:09] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5930126992873387769.kers
Total runtime 4 ms.
[2026-05-24 08:54:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 08:54:09] [INFO ] Invariant cache hit.
[2026-05-24 08:54:09] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-24 08:54:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 14/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/543 variables, and 166 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 87/166 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 233/543 variables, 310/493 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 232/725 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 6/731 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 731 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 310/320 places, 233/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 310/320 places, 233/243 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((X(X((X(p1)&&p0)))||F(p2))))))'
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 61060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 243/243 transitions.
Graph (trivial) has 139 edges and 320 vertex of which 6 / 320 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 625 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 313 transition count 203
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 281 transition count 203
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 66 place count 281 transition count 140
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 201 place count 209 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 210 place count 200 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 219 place count 200 transition count 131
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 389 place count 111 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 110 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 109 transition count 49
Applied a total of 391 rules in 28 ms. Remains 109 /320 variables (removed 211) and now considering 49/243 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2677841300389883498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18091528189522442742.kers'
[2026-05-24 08:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2677841300389883498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18091528189522442742.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 48 rows 80 cols 182 entries
Finished phase 1 with 45 SingleSign rule and 3 generalized
[2026-05-24 08:55:10] [INFO ] Computed 61 invariants in 0 ms
Computed 61 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18091528189522442742.kers
Total runtime 1 ms.
[2026-05-24 08:55:10] [INFO ] Implicit Places using invariants in 67 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/320 places, 49/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 108/320 places, 49/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 162 ms.
All properties solved by simple procedures.
Total runtime 623007 ms.

BK_STOP 1779612910411

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;