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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.1K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 141K 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-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779619180031

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 10:39:41] [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 10:39:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:39:41] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-24 10:39:41] [INFO ] Transformed 567 places.
[2026-05-24 10:39:41] [INFO ] Transformed 508 transitions.
[2026-05-24 10:39:41] [INFO ] Found NUPN structural information;
[2026-05-24 10:39:41] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 76 place count 484 transition count 429
Iterating global reduction 1 with 72 rules applied. Total rules applied 148 place count 484 transition count 429
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 184 place count 448 transition count 393
Iterating global reduction 1 with 36 rules applied. Total rules applied 220 place count 448 transition count 393
Applied a total of 220 rules in 107 ms. Remains 448 /560 variables (removed 112) and now considering 393/501 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12023707733287100982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4986291143790066256.kers'
[2026-05-24 10:39:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12023707733287100982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4986291143790066256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 448 cols 1278 entries
Finished phase 1 with 289 SingleSign rule and 68 generalized
[2026-05-24 10:39:41] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4986291143790066256.kers
Total runtime 3 ms.
[2026-05-24 10:39:42] [INFO ] Implicit Places using invariants in 456 ms returned []
[2026-05-24 10:39:42] [INFO ] Invariant cache hit.
[2026-05-24 10:39:43] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2026-05-24 10:39:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/171 constraints. Problems are: Problem set: 8 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/841 variables, and 185 constraints, problems are : Problem set: 8 solved, 384 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 94/94 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 16/16 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 69/85 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 6/91 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 94/185 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/205 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/225 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/245 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/265 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 20/285 constraints. Problems are: Problem set: 8 solved, 384 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 20/305 constraints. Problems are: Problem set: 8 solved, 384 unsolved
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 20/325 constraints. Problems are: Problem set: 11 solved, 381 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 20/345 constraints. Problems are: Problem set: 11 solved, 381 unsolved
SMT process timed out in 60257ms, After SMT, problems are : Problem set: 11 solved, 381 unsolved
Search for dead transitions found 11 dead transitions in 60286ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/560 places, 382/501 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62925 ms. Remains : 448/560 places, 382/501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 382/382 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7530962205940995830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3401792561182448243.kers'
[2026-05-24 10:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7530962205940995830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3401792561182448243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 382 rows 448 cols 1212 entries
Finished phase 1 with 289 SingleSign rule and 68 generalized
[2026-05-24 10:40:44] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3401792561182448243.kers
Total runtime 2 ms.
[2026-05-24 10:40:44] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-24 10:40:44] [INFO ] Invariant cache hit.
[2026-05-24 10:40:46] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-24 10:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD328 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/171 constraints. Problems are: Problem set: 6 solved, 375 unsolved
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 20/191 constraints. Problems are: Problem set: 9 solved, 372 unsolved
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 9 solved, 372 unsolved
Search for dead transitions found 9 dead transitions in 30104ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/448 places, 373/382 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31817 ms. Remains : 448/448 places, 373/382 transitions.
Support contains 35 out of 448 places after structural reductions.
[2026-05-24 10:41:16] [INFO ] Flatten gal took : 56 ms
[2026-05-24 10:41:16] [INFO ] Flatten gal took : 26 ms
[2026-05-24 10:41:16] [INFO ] Input system was already deterministic with 373 transitions.
Support contains 34 out of 448 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (302 resets) in 1797 ms. (22 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40004 steps (54 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (39 resets) in 196 ms. (203 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (55 resets) in 225 ms. (177 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (57 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (54 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (55 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (40 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (59 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (54 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (55 resets) in 81 ms. (487 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4832416612643078000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8786197288149927467.kers'
[2026-05-24 10:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4832416612643078000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8786197288149927467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 448 cols 1158 entries
Finished phase 1 with 289 SingleSign rule and 67 generalized
[2026-05-24 10:41:17] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8786197288149927467.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 134/151 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 212/363 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 72/435 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/439 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 367/806 variables, 439/543 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/806 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/806 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/806 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 13/819 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/819 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 2/821 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/821 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/821 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 561 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 134/151 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 212/363 variables, 52/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 72/435 variables, 21/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 4/439 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 367/806 variables, 439/557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/806 variables, 9/566 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 20/586 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 10039ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 373/373 transitions.
Graph (complete) has 966 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 447 transition count 327
Reduce places removed 45 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 402 transition count 324
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 399 transition count 324
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 97 place count 399 transition count 233
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 295 place count 292 transition count 233
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 302 place count 285 transition count 226
Iterating global reduction 3 with 7 rules applied. Total rules applied 309 place count 285 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 309 place count 285 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 284 transition count 225
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 525 place count 175 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 526 place count 175 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 527 place count 175 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 528 place count 174 transition count 118
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 538 place count 174 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 173 transition count 117
Applied a total of 539 rules in 121 ms. Remains 173 /448 variables (removed 275) and now considering 117/373 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 173/448 places, 117/373 transitions.
RANDOM walk for 40000 steps (2870 resets) in 848 ms. (47 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (953 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (846 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (602 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (962 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (957 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (940 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (602 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1256 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (924 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (927 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (938 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (974 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 672 steps, run visited all 12 properties in 16 ms. (steps per millisecond=42 )
Probabilistic random walk after 672 steps, saw 331 distinct states, run finished after 19 ms. (steps per millisecond=35 ) properties seen :12
FORMULA BusinessProcesses-PT-11-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 433 stabilizing places and 358 stable transitions
Graph (complete) has 966 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 365
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 439 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 439 transition count 364
Applied a total of 18 rules in 48 ms. Remains 439 /448 variables (removed 9) and now considering 364/373 (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-4970596724952513660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8943052444733034954.kers'
[2026-05-24 10:41:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4970596724952513660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8943052444733034954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 439 cols 1140 entries
Finished phase 1 with 280 SingleSign rule and 67 generalized
[2026-05-24 10:41:29] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8943052444733034954.kers
Total runtime 3 ms.
[2026-05-24 10:41:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 10:41:29] [INFO ] Invariant cache hit.
[2026-05-24 10:41:30] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1442 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/448 places, 364/373 transitions.
Applied a total of 0 rules in 12 ms. Remains 438 /438 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1503 ms. Remains : 438/448 places, 364/373 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(G(p0))||p1)))'
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-01
Product exploration explored 100000 steps with 752 reset in 240 ms.
Product exploration explored 100000 steps with 760 reset in 206 ms.
Computed a total of 423 stabilizing places and 349 stable transitions
Graph (complete) has 948 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 423 stabilizing places and 349 stable transitions
Detected a total of 423/438 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (298 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2129 steps, run visited all 1 properties in 14 ms. (steps per millisecond=152 )
Probabilistic random walk after 2129 steps, saw 1828 distinct states, run finished after 14 ms. (steps per millisecond=152 ) properties seen :1
Knowledge based reduction with 4 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 296 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 438 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 364/364 transitions.
Graph (complete) has 948 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 436 transition count 318
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 392 transition count 316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 390 transition count 316
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 93 place count 390 transition count 221
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 301 place count 277 transition count 221
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 537 place count 157 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 538 place count 157 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 156 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 540 place count 155 transition count 103
Applied a total of 540 rules in 43 ms. Remains 155 /438 variables (removed 283) and now considering 103/364 (removed 261) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9240556268256854206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9411808688794596547.kers'
[2026-05-24 10:41:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9240556268256854206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9411808688794596547.kers]
Culling duplicate invariants (modulo rational): removing 46 columns.
Culled 46 columns in 0 ms.
// Phase 1: matrix 103 rows 109 cols 404 entries
Finished phase 1 with 65 SingleSign rule and 22 generalized
[2026-05-24 10:41:31] [INFO ] Computed 68 invariants in 1 ms
Computed 68 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9411808688794596547.kers
Total runtime 2 ms.
[2026-05-24 10:41:31] [INFO ] Implicit Places using invariants in 134 ms returned [0, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 135 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/438 places, 103/364 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 138/438 places, 103/364 transitions.
Computed a total of 127 stabilizing places and 94 stable transitions
Computed a total of 127 stabilizing places and 94 stable transitions
Detected a total of 127/138 stabilizing places and 94/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 41 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5186 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1722 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 280 steps, run visited all 1 properties in 4 ms. (steps per millisecond=70 )
Probabilistic random walk after 280 steps, saw 143 distinct states, run finished after 4 ms. (steps per millisecond=70 ) properties seen :1
Knowledge based reduction with 4 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Knowledge-based reduction took 200 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13045 reset in 138 ms.
Product exploration explored 100000 steps with 13106 reset in 154 ms.
Built C files in :
/tmp/ltsmin4106142700859073068
[2026-05-24 10:41:32] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2026-05-24 10:41:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:41:32] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2026-05-24 10:41:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:41:32] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2026-05-24 10:41:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:41:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4106142700859073068
Running compilation step : cd /tmp/ltsmin4106142700859073068;'/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 332 ms.
Running link step : cd /tmp/ltsmin4106142700859073068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4106142700859073068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5948040814026233219.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-11-LTLFireability-01 finished in 3899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((((p0 U p1)&&F(p2)) U X(p1)))&&X(p1)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 364
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 438 transition count 363
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 438 transition count 363
Applied a total of 20 rules in 19 ms. Remains 438 /448 variables (removed 10) and now considering 363/373 (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-13232596151446259832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1435327139919446160.kers'
[2026-05-24 10:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13232596151446259832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1435327139919446160.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 363 rows 438 cols 1138 entries
Finished phase 1 with 279 SingleSign rule and 67 generalized
[2026-05-24 10:41:32] [INFO ] Computed 92 invariants in 7 ms
Computed 92 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1435327139919446160.kers
Total runtime 8 ms.
[2026-05-24 10:41:33] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-24 10:41:33] [INFO ] Invariant cache hit.
[2026-05-24 10:41:34] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/448 places, 363/373 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1301 ms. Remains : 437/448 places, 363/373 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((((p0 U p1)&&F(p2)) U X(p1)))&&X(p1)))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 1667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X(X(X((p1 U p2))))))))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 447 transition count 322
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 397 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 395 transition count 320
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 104 place count 395 transition count 227
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 308 place count 284 transition count 227
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 316 place count 276 transition count 219
Iterating global reduction 3 with 8 rules applied. Total rules applied 324 place count 276 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 324 place count 276 transition count 218
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 275 transition count 218
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 550 place count 161 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 161 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 553 place count 160 transition count 111
Applied a total of 553 rules in 44 ms. Remains 160 /448 variables (removed 288) and now considering 111/373 (removed 262) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8891050391978187877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13846346187086878509.kers'
[2026-05-24 10:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8891050391978187877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13846346187086878509.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 159 cols 631 entries
Finished phase 1 with 49 SingleSign rule and 41 generalized
[2026-05-24 10:41:34] [INFO ] Computed 70 invariants in 0 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13846346187086878509.kers
Total runtime 1 ms.
[2026-05-24 10:41:34] [INFO ] Implicit Places using invariants in 117 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 118 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/448 places, 111/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 142/448 places, 111/373 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X(X(X((p1 U p2))))))))'
Stuttering acceptance computed with spot in 982 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-03
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-03 finished in 1219 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(G(p0))&&F(p1))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Graph (trivial) has 206 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 960 edges and 443 vertex of which 442 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 441 transition count 316
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 392 transition count 316
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 100 place count 392 transition count 222
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 306 place count 280 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 314 place count 272 transition count 214
Iterating global reduction 2 with 8 rules applied. Total rules applied 322 place count 272 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 322 place count 272 transition count 213
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 324 place count 271 transition count 213
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 544 place count 159 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 158 transition count 109
Applied a total of 546 rules in 40 ms. Remains 158 /448 variables (removed 290) and now considering 109/373 (removed 264) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14974917126805120605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13183615957464041660.kers'
[2026-05-24 10:41:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14974917126805120605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13183615957464041660.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 108 rows 157 cols 622 entries
Finished phase 1 with 47 SingleSign rule and 41 generalized
[2026-05-24 10:41:35] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13183615957464041660.kers
Total runtime 2 ms.
[2026-05-24 10:41:35] [INFO ] Implicit Places using invariants in 110 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 111 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/448 places, 109/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 140/448 places, 109/373 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 293 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(X(p0))&&F(p1)) U (p0&&X(X(p0))&&F(p1)))))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 441 transition count 366
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 441 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 440 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 440 transition count 365
Applied a total of 16 rules in 21 ms. Remains 440 /448 variables (removed 8) and now considering 365/373 (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-7002549487892018973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15028533874576607805.kers'
[2026-05-24 10:41:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7002549487892018973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15028533874576607805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 440 cols 1142 entries
Finished phase 1 with 281 SingleSign rule and 67 generalized
[2026-05-24 10:41:36] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15028533874576607805.kers
Total runtime 3 ms.
[2026-05-24 10:41:36] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-24 10:41:36] [INFO ] Invariant cache hit.
[2026-05-24 10:41:37] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1308 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 439/448 places, 365/373 transitions.
Applied a total of 0 rules in 11 ms. Remains 439 /439 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1341 ms. Remains : 439/448 places, 365/373 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(X(p0))&&F(p1)) U (p0&&X(X(p0))&&F(p1)))))))'
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-05
Product exploration explored 100000 steps with 752 reset in 165 ms.
Product exploration explored 100000 steps with 753 reset in 185 ms.
Computed a total of 424 stabilizing places and 350 stable transitions
Graph (complete) has 949 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 424 stabilizing places and 350 stable transitions
Detected a total of 424/439 stabilizing places and 350/365 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (299 resets) in 217 ms. (183 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (54 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-161507270282894637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13984199039364676167.kers'
[2026-05-24 10:41:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-161507270282894637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13984199039364676167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 439 cols 1140 entries
Finished phase 1 with 282 SingleSign rule and 66 generalized
[2026-05-24 10:41:38] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13984199039364676167.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 304/324 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/401 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/430 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 359/789 variables, 430/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/802 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/804 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/804 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 304/324 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/401 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/430 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 359/789 variables, 430/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/789 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/789 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/789 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/802 variables, 7/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/802 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/804 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/804 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/804 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3642 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4570ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 198 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Knowledge-based reduction took 5145 ms.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 365/365 transitions.
Applied a total of 0 rules in 13 ms. Remains 439 /439 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2026-05-24 10:41:43] [INFO ] Invariant cache hit.
[2026-05-24 10:41:43] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 10:41:43] [INFO ] Invariant cache hit.
[2026-05-24 10:41:44] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-24 10:41:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Problem TDEAD342 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/131 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/151 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/171 constraints. Problems are: Problem set: 1 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/191 constraints. Problems are: Problem set: 1 solved, 363 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 1 solved, 363 unsolved
Search for dead transitions found 1 dead transitions in 30128ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 439/439 places, 364/365 transitions.
Applied a total of 0 rules in 8 ms. Remains 439 /439 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31612 ms. Remains : 439/439 places, 364/365 transitions.
Computed a total of 424 stabilizing places and 349 stable transitions
Graph (complete) has 947 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 424 stabilizing places and 349 stable transitions
Detected a total of 424/439 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (301 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (55 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1867 steps, run visited all 3 properties in 35 ms. (steps per millisecond=53 )
Probabilistic random walk after 1867 steps, saw 1644 distinct states, run finished after 36 ms. (steps per millisecond=51 ) properties seen :3
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Knowledge-based reduction took 646 ms.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Product exploration explored 100000 steps with 752 reset in 178 ms.
Product exploration explored 100000 steps with 750 reset in 177 ms.
Spot run failed in 80 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/ltsmin2500513535311271081
[2026-05-24 10:42:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2500513535311271081
Running compilation step : cd /tmp/ltsmin2500513535311271081;'/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 540 ms.
Running link step : cd /tmp/ltsmin2500513535311271081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2500513535311271081;'/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/stateBased18258850790188288737.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-11-LTLFireability-05 finished in 41165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((!(X(F(p0)) U p1)&&p0)||X(p2)))&&F(p3)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 365
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 439 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 439 transition count 364
Applied a total of 18 rules in 22 ms. Remains 439 /448 variables (removed 9) and now considering 364/373 (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-8196950684208233714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-714243915648952382.kers'
[2026-05-24 10:42:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8196950684208233714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-714243915648952382.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 364 rows 439 cols 1140 entries
Finished phase 1 with 280 SingleSign rule and 67 generalized
[2026-05-24 10:42:17] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-714243915648952382.kers
Total runtime 9 ms.
[2026-05-24 10:42:17] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-24 10:42:17] [INFO ] Invariant cache hit.
[2026-05-24 10:42:18] [INFO ] Implicit Places using invariants and state equation in 992 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1234 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/448 places, 364/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 438 /438 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1266 ms. Remains : 438/448 places, 364/373 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((!(X(F(p0)) U p1)&&p0)||X(p2)))&&F(p3)))'
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 1642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 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 960 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 441 transition count 316
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 392 transition count 316
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 100 place count 392 transition count 223
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 304 place count 281 transition count 223
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 274 transition count 216
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 274 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 318 place count 274 transition count 215
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 320 place count 273 transition count 215
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 546 place count 158 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 157 transition count 108
Applied a total of 548 rules in 41 ms. Remains 157 /448 variables (removed 291) and now considering 108/373 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13875765149574380953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10829087432037873305.kers'
[2026-05-24 10:42:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13875765149574380953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10829087432037873305.kers]
Normalized transition count is 107 out of 108 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 107 rows 156 cols 627 entries
Finished phase 1 with 46 SingleSign rule and 41 generalized
[2026-05-24 10:42:18] [INFO ] Computed 70 invariants in 2 ms
Computed 70 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10829087432037873305.kers
Total runtime 3 ms.
[2026-05-24 10:42:19] [INFO ] Implicit Places using invariants in 124 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 126 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/448 places, 108/373 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 139/448 places, 108/373 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 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 232 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) U X((F(G(p1))&&(F(p2)||G(p3))))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 364
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 438 transition count 363
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 438 transition count 363
Applied a total of 20 rules in 27 ms. Remains 438 /448 variables (removed 10) and now considering 363/373 (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-12765522014232932121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5289784369049324794.kers'
[2026-05-24 10:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12765522014232932121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5289784369049324794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 438 cols 1138 entries
Finished phase 1 with 279 SingleSign rule and 67 generalized
[2026-05-24 10:42:19] [INFO ] Computed 92 invariants in 7 ms
Computed 92 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5289784369049324794.kers
Total runtime 8 ms.
[2026-05-24 10:42:19] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-24 10:42:19] [INFO ] Invariant cache hit.
[2026-05-24 10:42:20] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1321 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/448 places, 363/373 transitions.
Applied a total of 0 rules in 11 ms. Remains 437 /437 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1360 ms. Remains : 437/448 places, 363/373 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) U X((F(G(p1))&&(F(p2)||G(p3))))))'
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 1881 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 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Graph (trivial) has 207 edges and 448 vertex of which 6 / 448 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 960 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 441 transition count 315
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 391 transition count 315
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 391 transition count 221
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 308 place count 279 transition count 221
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 271 transition count 213
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 271 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 324 place count 271 transition count 212
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 270 transition count 212
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 546 place count 158 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 157 transition count 108
Applied a total of 548 rules in 35 ms. Remains 157 /448 variables (removed 291) and now considering 108/373 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-735377191151347480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13896988103661313540.kers'
[2026-05-24 10:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-735377191151347480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13896988103661313540.kers]
Normalized transition count is 107 out of 108 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 107 rows 156 cols 620 entries
Finished phase 1 with 46 SingleSign rule and 41 generalized
[2026-05-24 10:42:21] [INFO ] Computed 70 invariants in 3 ms
Computed 70 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13896988103661313540.kers
Total runtime 4 ms.
[2026-05-24 10:42:21] [INFO ] Implicit Places using invariants in 115 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 116 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/448 places, 108/373 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 139/448 places, 108/373 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-13 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||F(p2))))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 441 transition count 366
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 441 transition count 366
Applied a total of 14 rules in 12 ms. Remains 441 /448 variables (removed 7) and now considering 366/373 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16385724066317400734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10548094777369509729.kers'
[2026-05-24 10:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16385724066317400734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10548094777369509729.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 366 rows 441 cols 1144 entries
Finished phase 1 with 282 SingleSign rule and 67 generalized
[2026-05-24 10:42:21] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10548094777369509729.kers
Total runtime 9 ms.
[2026-05-24 10:42:21] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-24 10:42:21] [INFO ] Invariant cache hit.
[2026-05-24 10:42:22] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1457 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/448 places, 366/373 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1482 ms. Remains : 440/448 places, 366/373 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||X(p1)||F(p2))))'
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 829 reset in 181 ms.
Stack based approach found an accepted trace after 1213 steps with 10 reset with depth 7 and stack size 7 in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-14 finished in 1872 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(X(p0))&&G(p1))||X(X(G(p0)))))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 373/373 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 440 transition count 365
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 439 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 439 transition count 364
Applied a total of 18 rules in 23 ms. Remains 439 /448 variables (removed 9) and now considering 364/373 (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-1166395166718562856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11834341933053376817.kers'
[2026-05-24 10:42:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1166395166718562856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11834341933053376817.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 364 rows 439 cols 1140 entries
Finished phase 1 with 280 SingleSign rule and 67 generalized
[2026-05-24 10:42:23] [INFO ] Computed 92 invariants in 6 ms
Computed 92 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11834341933053376817.kers
Total runtime 8 ms.
[2026-05-24 10:42:23] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-24 10:42:23] [INFO ] Invariant cache hit.
[2026-05-24 10:42:24] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1581 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/448 places, 364/373 transitions.
Applied a total of 0 rules in 19 ms. Remains 438 /438 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1623 ms. Remains : 438/448 places, 364/373 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(X(G(p0)))||(X(X(p0))&&G(p1))))))'
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-15
Product exploration explored 100000 steps with 19969 reset in 130 ms.
Product exploration explored 100000 steps with 19960 reset in 228 ms.
Computed a total of 423 stabilizing places and 349 stable transitions
Graph (complete) has 948 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 423 stabilizing places and 349 stable transitions
Detected a total of 423/438 stabilizing places and 349/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 15 factoid took 82 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (300 resets) in 229 ms. (173 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (55 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11154955878759535017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7209642105145347383.kers'
[2026-05-24 10:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11154955878759535017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7209642105145347383.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 438 cols 1138 entries
Finished phase 1 with 281 SingleSign rule and 66 generalized
[2026-05-24 10:42:25] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7209642105145347383.kers
Total runtime 6 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 240/370 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 6 (OVERLAPS) 55/425 variables, 18/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/429 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 2/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 358/787 variables, 429/533 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/787 variables, 5/538 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/787 variables, 3/541 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/787 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 13/800 variables, 7/548 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/800 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/802 variables, 2/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/802 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/802 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 550 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/130 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/370 variables, 66/71 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 10/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 55/425 variables, 18/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 6/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/429 variables, 2/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 2/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SMT process timed out in 7967ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 364/364 transitions.
Graph (trivial) has 197 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 941 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 432 transition count 312
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 388 transition count 312
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 90 place count 388 transition count 217
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 298 place count 275 transition count 217
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 528 place count 158 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 530 place count 157 transition count 108
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 533 place count 157 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 536 place count 154 transition count 105
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 541 place count 154 transition count 105
Applied a total of 541 rules in 30 ms. Remains 154 /438 variables (removed 284) and now considering 105/364 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 154/438 places, 105/364 transitions.
RANDOM walk for 4397 steps (247 resets) in 34 ms. (125 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 152 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 8765 ms.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 364/364 transitions.
Applied a total of 0 rules in 10 ms. Remains 438 /438 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2026-05-24 10:42:34] [INFO ] Invariant cache hit.
[2026-05-24 10:42:34] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 10:42:34] [INFO ] Invariant cache hit.
[2026-05-24 10:42:36] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-24 10:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/802 variables, and 204 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 113/113 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 113/204 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Problem TDEAD341 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/244 constraints. Problems are: Problem set: 1 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/264 constraints. Problems are: Problem set: 1 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/284 constraints. Problems are: Problem set: 1 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 20/304 constraints. Problems are: Problem set: 1 solved, 362 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/324 constraints. Problems are: Problem set: 1 solved, 362 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 20/344 constraints. Problems are: Problem set: 1 solved, 362 unsolved
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 1 solved, 362 unsolved
Search for dead transitions found 1 dead transitions in 60123ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 438/438 places, 363/364 transitions.
Applied a total of 0 rules in 8 ms. Remains 438 /438 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61723 ms. Remains : 438/438 places, 363/364 transitions.
Computed a total of 423 stabilizing places and 348 stable transitions
Graph (complete) has 946 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 423 stabilizing places and 348 stable transitions
Detected a total of 423/438 stabilizing places and 348/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (298 resets) in 102 ms. (388 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (55 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2808353571146936828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11929664230468654001.kers'
[2026-05-24 10:43:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2808353571146936828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11929664230468654001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 438 cols 1132 entries
Finished phase 1 with 281 SingleSign rule and 66 generalized
[2026-05-24 10:43:36] [INFO ] Computed 91 invariants in 3 ms
Computed 91 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11929664230468654001.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/164 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/404 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/429 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 357/786 variables, 429/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/786 variables, 5/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/786 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/799 variables, 7/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/799 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/801 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/801 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/801 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 801/801 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 149/164 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/404 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 37/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 25/429 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 357/786 variables, 429/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/786 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/786 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/786 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/786 variables, 9/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/786 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/786 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/799 variables, 7/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/799 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/801 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/801 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/801 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 801/801 variables, and 611 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4217 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 9069ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 363/363 transitions.
Graph (trivial) has 198 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 939 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 432 transition count 311
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 388 transition count 311
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 90 place count 388 transition count 216
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 298 place count 275 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 299 place count 274 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 274 transition count 215
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 530 place count 157 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 532 place count 156 transition count 106
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 535 place count 156 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 153 transition count 103
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 543 place count 153 transition count 103
Applied a total of 543 rules in 25 ms. Remains 153 /438 variables (removed 285) and now considering 103/363 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 153/438 places, 103/363 transitions.
RANDOM walk for 4535 steps (253 resets) in 23 ms. (188 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 9705 ms.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 19997 reset in 110 ms.
Product exploration explored 100000 steps with 20048 reset in 127 ms.
Spot run failed in 44 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/ltsmin9276846281349510421
[2026-05-24 10:43:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9276846281349510421
Running compilation step : cd /tmp/ltsmin9276846281349510421;'/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 532 ms.
Running link step : cd /tmp/ltsmin9276846281349510421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9276846281349510421;'/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/stateBased10217087315962804011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 363/363 transitions.
Applied a total of 0 rules in 4 ms. Remains 438 /438 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2026-05-24 10:44:02] [INFO ] Invariant cache hit.
[2026-05-24 10:44:02] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 10:44:02] [INFO ] Invariant cache hit.
[2026-05-24 10:44:03] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/438 places, 363/363 transitions.
Applied a total of 0 rules in 10 ms. Remains 437 /437 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1521 ms. Remains : 437/438 places, 363/363 transitions.
Built C files in :
/tmp/ltsmin18192254774477673670
[2026-05-24 10:44:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18192254774477673670
Running compilation step : cd /tmp/ltsmin18192254774477673670;'/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 535 ms.
Running link step : cd /tmp/ltsmin18192254774477673670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18192254774477673670;'/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/stateBased11743234339372081857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 10:44:18] [INFO ] Flatten gal took : 27 ms
[2026-05-24 10:44:18] [INFO ] Flatten gal took : 18 ms
[2026-05-24 10:44:18] [INFO ] Time to serialize gal into /tmp/LTL4607112201808418540.gal : 5 ms
[2026-05-24 10:44:18] [INFO ] Time to serialize properties into /tmp/LTL4558058879432025440.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4607112201808418540.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2265879160746871756.hoa' '-atoms' '/tmp/LTL4558058879432025440.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4558058879432025440.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2265879160746871756.hoa
Detected timeout of ITS tools.
[2026-05-24 10:44:33] [INFO ] Flatten gal took : 20 ms
[2026-05-24 10:44:33] [INFO ] Flatten gal took : 14 ms
[2026-05-24 10:44:33] [INFO ] Time to serialize gal into /tmp/LTL16751481085868737041.gal : 12 ms
[2026-05-24 10:44:33] [INFO ] Time to serialize properties into /tmp/LTL10776445789419933033.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16751481085868737041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10776445789419933033.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(p67!=1)")))U((X(X(G("(p67!=1)"))))||((X(X("(p67!=1)")))&&(G("(p505!=1)")))))))
Formula 0 simplified : X(XX!"(p67!=1)" R (XXF!"(p67!=1)" & (XX!"(p67!=1)" | F!"(p505!=1)")))
Detected timeout of ITS tools.
[2026-05-24 10:44:48] [INFO ] Flatten gal took : 19 ms
[2026-05-24 10:44:48] [INFO ] Applying decomposition
[2026-05-24 10:44:48] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4133204522702069911.txt' '-o' '/tmp/graph4133204522702069911.bin' '-w' '/tmp/graph4133204522702069911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4133204522702069911.bin' '-l' '-1' '-v' '-w' '/tmp/graph4133204522702069911.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:44:49] [INFO ] Decomposing Gal with order
[2026-05-24 10:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:44:49] [INFO ] Removed a total of 161 redundant transitions.
[2026-05-24 10:44:49] [INFO ] Flatten gal took : 106 ms
[2026-05-24 10:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2026-05-24 10:44:49] [INFO ] Time to serialize gal into /tmp/LTL6693365297222789979.gal : 8 ms
[2026-05-24 10:44:49] [INFO ] Time to serialize properties into /tmp/LTL5283810584595235598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6693365297222789979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5283810584595235598.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i14.u31.p67!=1)")))U((X(X(G("(i14.u31.p67!=1)"))))||((X(X("(i14.u31.p67!=1)")))&&(G("(i18.u139.p505!=1)")))))))
Formula 0 simplified : X(XX!"(i14.u31.p67!=1)" R (XXF!"(i14.u31.p67!=1)" & (XX!"(i14.u31.p67!=1)" | F!"(i18.u139.p505!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t7, t8, t157, t167, t179, t183, t187, t203, t207, t223, t231, t250, t258, t364, t...1115
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-11-LTLFireability-15 finished in 161784 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(X(p0))&&G(p1))||X(X(G(p0)))))))'
Spot run failed in 38 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 10:45:05] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3840624002170967966
[2026-05-24 10:45:05] [INFO ] Applying decomposition
[2026-05-24 10:45:05] [INFO ] Flatten gal took : 11 ms
[2026-05-24 10:45:05] [INFO ] Computing symmetric may disable matrix : 373 transitions.
[2026-05-24 10:45:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:45:05] [INFO ] Computing symmetric may enable matrix : 373 transitions.
[2026-05-24 10:45:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph65892641511542299.txt' '-o' '/tmp/graph65892641511542299.bin' '-w' '/tmp/graph65892641511542299.weights'
[2026-05-24 10:45:05] [INFO ] Computing Do-Not-Accords matrix : 373 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph65892641511542299.bin' '-l' '-1' '-v' '-w' '/tmp/graph65892641511542299.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:45:05] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:45:05] [INFO ] Decomposing Gal with order
[2026-05-24 10:45:05] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3840624002170967966
Running compilation step : cd /tmp/ltsmin3840624002170967966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-24 10:45:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:45:05] [INFO ] Removed a total of 159 redundant transitions.
[2026-05-24 10:45:05] [INFO ] Flatten gal took : 51 ms
[2026-05-24 10:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 26 ms.
[2026-05-24 10:45:05] [INFO ] Time to serialize gal into /tmp/LTLFireability1647681940335481707.gal : 6 ms
[2026-05-24 10:45:05] [INFO ] Time to serialize properties into /tmp/LTLFireability3555765828590232649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1647681940335481707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3555765828590232649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i14.i3.u21.p67!=1)")))U(((X(X("(i14.i3.u21.p67!=1)")))&&(G("(i13.u125.p505!=1)")))||(X(X(G("(i14.i3.u21.p67!=1)"))))))))
Formula 0 simplified : X(XX!"(i14.i3.u21.p67!=1)" R (XXF!"(i14.i3.u21.p67!=1)" & (XX!"(i14.i3.u21.p67!=1)" | F!"(i13.u125.p505!=1)")))
Compilation finished in 782 ms.
Running link step : cd /tmp/ltsmin3840624002170967966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3840624002170967966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t10, t161, t167, t183, t195, t203, t215, t227, t231, t250, t258, t365, t368, i0.t...1316
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
[2026-05-24 11:06:52] [INFO ] Applying decomposition
[2026-05-24 11:06:52] [INFO ] Flatten gal took : 27 ms
[2026-05-24 11:06:52] [INFO ] Decomposing Gal with order
[2026-05-24 11:06:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:06:52] [INFO ] Removed a total of 76 redundant transitions.
[2026-05-24 11:06:52] [INFO ] Flatten gal took : 38 ms
[2026-05-24 11:06:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2026-05-24 11:06:53] [INFO ] Time to serialize gal into /tmp/LTLFireability9959826017892019659.gal : 8 ms
[2026-05-24 11:06:53] [INFO ] Time to serialize properties into /tmp/LTLFireability11734065883732834584.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9959826017892019659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11734065883732834584.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u186.p67!=1)")))U(((X(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....332
Formula 0 simplified : X(XX!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u186.p67!=1)" R (XXF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....313
Detected timeout of ITS tools.
[2026-05-24 11:29:05] [INFO ] Flatten gal took : 23223 ms
[2026-05-24 11:29:06] [INFO ] Input system was already deterministic with 373 transitions.
[2026-05-24 11:29:06] [INFO ] Transformed 448 places.
[2026-05-24 11:29:06] [INFO ] Transformed 373 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 11:29:36] [INFO ] Time to serialize gal into /tmp/LTLFireability4316399447489880224.gal : 4 ms
[2026-05-24 11:29:36] [INFO ] Time to serialize properties into /tmp/LTLFireability7014954036411686875.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4316399447489880224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7014954036411686875.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(X("(p67!=1)")))U(((X(X("(p67!=1)")))&&(G("(p505!=1)")))||(X(X(G("(p67!=1)"))))))))
Formula 0 simplified : X(XX!"(p67!=1)" R (XXF!"(p67!=1)" & (XX!"(p67!=1)" | F!"(p505!=1)")))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
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-11, 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-177946842000532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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