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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 17:49 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.7K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 63K 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-03-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779610334188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 08:12:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:12:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:12:15] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-24 08:12:15] [INFO ] Transformed 274 places.
[2026-05-24 08:12:15] [INFO ] Transformed 237 transitions.
[2026-05-24 08:12:15] [INFO ] Found NUPN structural information;
[2026-05-24 08:12:15] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 244 transition count 209
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 244 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 244 transition count 208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 237 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 237 transition count 201
Applied a total of 71 rules in 63 ms. Remains 237 /273 variables (removed 36) and now considering 201/236 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16579718394536330264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16540923795369713392.kers'
[2026-05-24 08:12:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16579718394536330264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16540923795369713392.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 237 cols 558 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-24 08:12:15] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16540923795369713392.kers
Total runtime 2 ms.
[2026-05-24 08:12:15] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-24 08:12:15] [INFO ] Invariant cache hit.
[2026-05-24 08:12:16] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-24 08:12:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 201/438 variables, 237/331 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 6/357 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 360 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 79/120 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 201/438 variables, 237/386 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 200/586 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 7/593 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 611 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 133/133 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 237/273 places, 201/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60795 ms. Remains : 237/273 places, 201/236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2026-05-24 08:13:16] [INFO ] Invariant cache hit.
[2026-05-24 08:13:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 08:13:16] [INFO ] Invariant cache hit.
[2026-05-24 08:13:16] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 237/237 places, 201/201 transitions.
Support contains 112 out of 237 places after structural reductions.
[2026-05-24 08:13:16] [INFO ] Flatten gal took : 35 ms
[2026-05-24 08:13:16] [INFO ] Flatten gal took : 14 ms
[2026-05-24 08:13:17] [INFO ] Input system was already deterministic with 201 transitions.
Support contains 111 out of 237 places (down from 112) after GAL structural reductions.
RANDOM walk for 40000 steps (476 resets) in 1941 ms. (20 steps per ms) remains 9/76 properties
BEST_FIRST walk for 40003 steps (89 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (91 resets) in 121 ms. (327 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (85 resets) in 283 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (86 resets) in 110 ms. (360 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (111 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (96 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 89 ms. (444 steps per ms) remains 4/5 properties
[2026-05-24 08:13:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 200/213 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 177/390 variables, 213/254 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 5 (OVERLAPS) 39/429 variables, 16/270 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 7 (OVERLAPS) 9/438 variables, 8/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 278 constraints, problems are : Problem set: 3 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 187/212 variables, 39/41 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 3/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/387 variables, 212/256 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/257 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/257 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Int declared 424/438 variables, and 272 constraints, problems are : Problem set: 4 solved, 0 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 227/237 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 552ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2026-05-24 08:13:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 08:13:18] [INFO ] Flatten gal took : 12 ms
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 08:13:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:13:18] [INFO ] Input system was already deterministic with 201 transitions.
Support contains 87 out of 237 places (down from 97) after GAL structural reductions.
Computed a total of 230 stabilizing places and 192 stable transitions
Graph (complete) has 480 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 177
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 177
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 208 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 208 transition count 172
Applied a total of 58 rules in 14 ms. Remains 208 /237 variables (removed 29) and now considering 172/201 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14781060204119250132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10614098333442039441.kers'
[2026-05-24 08:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14781060204119250132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10614098333442039441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 208 cols 500 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-24 08:13:18] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10614098333442039441.kers
Total runtime 4 ms.
[2026-05-24 08:13:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 08:13:18] [INFO ] Invariant cache hit.
[2026-05-24 08:13:18] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2026-05-24 08:13:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 172/380 variables, 208/279 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 288 constraints, problems are : Problem set: 0 solved, 171 unsolved in 18550 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/380 variables, 208/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 171/463 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 12/491 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 492 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48609ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 48610ms
Starting structural reductions in LTL mode, iteration 1 : 208/237 places, 172/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48949 ms. Remains : 208/237 places, 172/201 transitions.
[2026-05-24 08:14:07] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:14:07] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:14:07] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-24 08:14:07] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:14:07] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:14:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13467765665951979512.gal : 10 ms
[2026-05-24 08:14:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8932425065469390704.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13467765665951979512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8932425065469390704.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.64734e+12,0.465566,22664,2,12057,5,53778,6,0,1004,91457,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p38==1) * AF((p92==0)))) + AX(EF((((p35==1)&&(p145==1))&&(p226==1))))) + ((((p48==1)&&(p165==1))&&((p237==1)&&(p211==0))) * (((...252
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(((p38==1) * !(EG(!((p92==0)))))))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(E(...559
Reverse transition relation is NOT exact ! Due to transitions t11, t13, t15, t18, t23, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t61, t62, t64, t67...420
(forward)formula 0,1,10.4526,328772,1,0,663,1.20626e+06,374,308,5983,1.26546e+06,724
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 177
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 206 transition count 170
Applied a total of 62 rules in 17 ms. Remains 206 /237 variables (removed 31) and now considering 170/201 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15816155122233756805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1834314908194930583.kers'
[2026-05-24 08:14:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15816155122233756805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1834314908194930583.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 206 cols 496 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-24 08:14:18] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1834314908194930583.kers
Total runtime 1 ms.
[2026-05-24 08:14:18] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 08:14:18] [INFO ] Invariant cache hit.
[2026-05-24 08:14:19] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-24 08:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/376 variables, 206/274 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 290 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/376 variables, 206/296 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 169/465 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 15/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 502 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 206/237 places, 170/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60870 ms. Remains : 206/237 places, 170/201 transitions.
[2026-05-24 08:15:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:15:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:15:19] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-24 08:15:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:15:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:15:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16400560066954629423.gal : 3 ms
[2026-05-24 08:15:19] [INFO ] Time to serialize properties into /tmp/CTLFireability523618743454408682.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16400560066954629423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability523618743454408682.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.45981e+12,0.44785,21140,2,11419,5,50582,6,0,994,81891,0


Converting to forward existential form...Done !
original formula: A((AX((p21!=1)) + (p256!=1)) U !(EF(((p3==1) * (AG((p151==1)) + A((p157==1) U (p215==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U ((p3==1) * (!(E(TRUE U !((p151==1)))) + !((E(!((p215==1)) U (!((p157==1)) * !((p215=...511
Reverse transition relation is NOT exact ! Due to transitions t6, t15, t16, t20, t27, t30, t33, t36, t39, t42, t45, t48, t51, t55, t56, t58, t61, t64, t67,...412
Detected timeout of ITS tools.
[2026-05-24 08:15:49] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:15:49] [INFO ] Applying decomposition
[2026-05-24 08:15:49] [INFO ] Flatten gal took : 7 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/graph8675667100496915094.txt' '-o' '/tmp/graph8675667100496915094.bin' '-w' '/tmp/graph8675667100496915094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8675667100496915094.bin' '-l' '-1' '-v' '-w' '/tmp/graph8675667100496915094.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:15:49] [INFO ] Decomposing Gal with order
[2026-05-24 08:15:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:15:49] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 08:15:49] [INFO ] Flatten gal took : 59 ms
[2026-05-24 08:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-24 08:15:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13495147764681597452.gal : 4 ms
[2026-05-24 08:15:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10299673546869896800.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13495147764681597452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10299673546869896800.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.45981e+12,0.105914,8568,1251,31,8251,463,434,12115,48,1196,0


Converting to forward existential form...Done !
original formula: A((AX((i4.u8.p21!=1)) + (i17.u59.p256!=1)) U !(EF(((i9.i0.u1.p3==1) * (AG((i16.i1.u48.p151==1)) + A((i12.u51.p157==1) U (i4.u61.p215==1))...160
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U ((i9.i0.u1.p3==1) * (!(E(TRUE U !((i16.i1.u48.p151==1)))) + !((E(!((i4.u61.p215==1))...672
Reverse transition relation is NOT exact ! Due to transitions t83, t103, t115, t120, t160, t162, i0.u57.t30, i0.u58.t27, i1.t99, i1.u17.t106, i1.u19.t102, ...720
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,5.93325,189376,1,0,360836,463,2749,576868,222,1196,442709
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 176
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 204 transition count 168
Applied a total of 66 rules in 10 ms. Remains 204 /237 variables (removed 33) and now considering 168/201 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14899915941969593647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9508822702225446694.kers'
[2026-05-24 08:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14899915941969593647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9508822702225446694.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 204 cols 492 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 08:15:55] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9508822702225446694.kers
Total runtime 1 ms.
[2026-05-24 08:15:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 08:15:55] [INFO ] Invariant cache hit.
[2026-05-24 08:15:55] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-24 08:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/270 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 284 constraints, problems are : Problem set: 0 solved, 167 unsolved in 19717 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/282 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/449 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SMT process timed out in 49758ms, After SMT, problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 49760ms
Starting structural reductions in LTL mode, iteration 1 : 204/237 places, 168/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50108 ms. Remains : 204/237 places, 168/201 transitions.
[2026-05-24 08:16:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:16:45] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:16:45] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-24 08:16:45] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:16:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:16:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6355637562855259798.gal : 2 ms
[2026-05-24 08:16:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7986950719382532210.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6355637562855259798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7986950719382532210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05379e+13,0.57228,24444,2,11828,5,57535,6,0,984,101935,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG((p26==1)) + (p148==1)) + (EX((p84==1)) * (p200==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !((p26==1)))) + (p148==1)) + (EX((p84==1)) * (p200==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t54, t55, t57, t60, t63, t66, t69, t71...403
Detected timeout of ITS tools.
[2026-05-24 08:17:15] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:17:15] [INFO ] Applying decomposition
[2026-05-24 08:17:15] [INFO ] Flatten gal took : 15 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/graph4946737175334568901.txt' '-o' '/tmp/graph4946737175334568901.bin' '-w' '/tmp/graph4946737175334568901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4946737175334568901.bin' '-l' '-1' '-v' '-w' '/tmp/graph4946737175334568901.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:17:15] [INFO ] Decomposing Gal with order
[2026-05-24 08:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:17:15] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 08:17:15] [INFO ] Flatten gal took : 26 ms
[2026-05-24 08:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 08:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15750042778280695742.gal : 12 ms
[2026-05-24 08:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15024204375602022986.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15750042778280695742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15024204375602022986.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05379e+13,0.147973,9748,2002,26,10319,291,451,17404,39,690,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG((u9.p26==1)) + (i18.i1.u48.p148==1)) + (EX((i11.i0.u26.p84==1)) * (i20.u59.p200==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !((u9.p26==1)))) + (i18.i1.u48.p148==1)) + (EX((i11.i0.u26.p84==1)) * (i20.u59....177
Reverse transition relation is NOT exact ! Due to transitions t82, t102, t114, t158, t160, t164, i0.u22.t93, i0.u52.t41, i1.t98, i1.u18.t101, i1.u20.t97, i...700
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,6.60434,232420,1,0,486819,291,2930,758068,180,690,826302
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Graph (complete) has 480 edges and 237 vertex of which 236 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 235 transition count 170
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 206 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 204 transition count 168
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 63 place count 204 transition count 126
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 155 place count 154 transition count 126
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 178 place count 131 transition count 103
Iterating global reduction 3 with 23 rules applied. Total rules applied 201 place count 131 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 201 place count 131 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 206 place count 128 transition count 101
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 101 rules applied. Total rules applied 307 place count 77 transition count 51
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 308 place count 77 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 309 place count 76 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 75 transition count 49
Applied a total of 310 rules in 45 ms. Remains 75 /237 variables (removed 162) and now considering 49/201 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6010732714908695230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11587874312139109370.kers'
[2026-05-24 08:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6010732714908695230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11587874312139109370.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 49 rows 62 cols 182 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 08:17:22] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11587874312139109370.kers
Total runtime 16 ms.
[2026-05-24 08:17:22] [INFO ] Implicit Places using invariants in 122 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 74/237 places, 49/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 181 ms. Remains : 74/237 places, 49/201 transitions.
[2026-05-24 08:17:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:17:22] [INFO ] Flatten gal took : 20 ms
[2026-05-24 08:17:22] [INFO ] Input system was already deterministic with 49 transitions.
[2026-05-24 08:17:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:17:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:17:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10410335989576470744.gal : 5 ms
[2026-05-24 08:17:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8017581690641609427.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10410335989576470744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8017581690641609427.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1736,0.03398,5304,2,1095,5,4432,6,0,344,5109,0


Converting to forward existential form...Done !
original formula: AG((EF(AG(((p171==0)&&(((p88==0)||(p139==0))||(p273==0))))) + (!(E((p45==1) U (((p55==1)&&(p175==1))&&(p243==1)))) * (EF((p74==0)) + ((p1...202
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p171==0)&&(((p88==0)||(p139==0))||(p273==0))))))))),(p45==1...395
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t7, t19, t22, t24, t25, t27, t28, t31, t34, t48, Intersection with reachable at each...217
(forward)formula 0,1,0.209829,13140,1,0,122,35756,128,59,2211,28762,131
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 176
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 204 transition count 168
Applied a total of 66 rules in 9 ms. Remains 204 /237 variables (removed 33) and now considering 168/201 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3463612581095353410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11164028439160938071.kers'
[2026-05-24 08:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3463612581095353410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11164028439160938071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 204 cols 492 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 08:17:22] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11164028439160938071.kers
Total runtime 2 ms.
[2026-05-24 08:17:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 08:17:23] [INFO ] Invariant cache hit.
[2026-05-24 08:17:23] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 204/237 places, 168/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 204/237 places, 168/201 transitions.
[2026-05-24 08:17:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:17:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:17:23] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-24 08:17:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:17:23] [INFO ] Flatten gal took : 19 ms
[2026-05-24 08:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4674599851184947508.gal : 1 ms
[2026-05-24 08:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3222534845497609570.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4674599851184947508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3222534845497609570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53832e+12,0.498436,24000,2,14031,5,59069,6,0,984,96724,0


Converting to forward existential form...Done !
original formula: AG(A(!(AF(AX((p128==1)))) U !(((EG((p61==1)) + AG((p127==1))) + EX(AG((p122==1)))))))
=> equivalent forward existential formula: ((([FwdG((FwdU(FwdU(Init,TRUE),!(!(((EG((p61==1)) + !(E(TRUE U !((p127==1))))) + EX(!(E(TRUE U !((p122==1)))))))...713
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t65, t66, t68, t70, t73...415
(forward)formula 0,0,14.3764,424028,1,0,605,1.80238e+06,371,268,5876,1.87945e+06,636
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 177
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 207 transition count 171
Applied a total of 60 rules in 7 ms. Remains 207 /237 variables (removed 30) and now considering 171/201 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18010501845151059071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7088995141310310450.kers'
[2026-05-24 08:17:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18010501845151059071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7088995141310310450.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 207 cols 498 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-24 08:17:38] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7088995141310310450.kers
Total runtime 1 ms.
[2026-05-24 08:17:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 08:17:38] [INFO ] Invariant cache hit.
[2026-05-24 08:17:38] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-24 08:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 171/378 variables, 207/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 16/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 299 constraints, problems are : Problem set: 0 solved, 170 unsolved in 26503 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 50/91 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/378 variables, 207/301 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 170/471 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 20/491 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 8/502 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 505 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 56535ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 56535ms
Starting structural reductions in LTL mode, iteration 1 : 207/237 places, 171/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56921 ms. Remains : 207/237 places, 171/201 transitions.
[2026-05-24 08:18:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:18:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:18:34] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 08:18:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:18:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:18:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4491840113123122629.gal : 1 ms
[2026-05-24 08:18:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5481758175982580885.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4491840113123122629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5481758175982580885.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.39551e+12,0.409099,21064,2,11585,5,50297,6,0,999,81196,0


Converting to forward existential form...Done !
original formula: (EG((EF((((p57==1)&&(p189==1))&&(p273==1))) * ((AX((((p101==1)&&(p140==1))&&(p273==1))) + (p118==1)) + ((p96==0)||(p87==1))))) + E(EX(!(E...183
=> equivalent forward existential formula: ([FwdG(Init,(E(TRUE U (((p57==1)&&(p189==1))&&(p273==1))) * ((!(EX(!((((p101==1)&&(p140==1))&&(p273==1))))) + (p...259
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t19, t22, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t71,...414
(forward)formula 0,1,9.20563,270592,1,0,683,997173,373,378,5964,1.10775e+06,579
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 176
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 206 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 206 transition count 170
Applied a total of 62 rules in 16 ms. Remains 206 /237 variables (removed 31) and now considering 170/201 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12209314797669862579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13964724539466969269.kers'
[2026-05-24 08:18:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12209314797669862579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13964724539466969269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 206 cols 496 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-24 08:18:44] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13964724539466969269.kers
Total runtime 1 ms.
[2026-05-24 08:18:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 08:18:44] [INFO ] Invariant cache hit.
[2026-05-24 08:18:44] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-24 08:18:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/376 variables, 206/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 283 constraints, problems are : Problem set: 0 solved, 169 unsolved in 19188 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 33/74 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/376 variables, 206/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 12/472 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 7/483 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 486 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 49228ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 49229ms
Starting structural reductions in LTL mode, iteration 1 : 206/237 places, 170/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49640 ms. Remains : 206/237 places, 170/201 transitions.
[2026-05-24 08:19:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:19:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:19:33] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-24 08:19:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:19:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:19:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16461383200543717940.gal : 1 ms
[2026-05-24 08:19:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6431468193429993092.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16461383200543717940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6431468193429993092.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.68107e+12,0.453021,22404,2,11914,5,53803,6,0,994,88437,0


Converting to forward existential form...Done !
original formula: AG(EX(!(E(AG((p216==1)) U AF((p211==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(!(E(TRUE U !((p216==1)))) U !(EG(!((p211==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t22, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t71, t73...410
Detected timeout of ITS tools.
[2026-05-24 08:20:04] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:20:04] [INFO ] Applying decomposition
[2026-05-24 08:20:04] [INFO ] Flatten gal took : 4 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/graph2275995320279455405.txt' '-o' '/tmp/graph2275995320279455405.bin' '-w' '/tmp/graph2275995320279455405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2275995320279455405.bin' '-l' '-1' '-v' '-w' '/tmp/graph2275995320279455405.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:20:04] [INFO ] Decomposing Gal with order
[2026-05-24 08:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:20:04] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 08:20:04] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17307907359768221545.gal : 1 ms
[2026-05-24 08:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3592826384029927165.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17307907359768221545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3592826384029927165.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.68107e+12,0.217555,12024,1925,24,12549,333,412,27654,35,693,0


Converting to forward existential form...Done !
original formula: AG(EX(!(E(AG((i20.u61.p216==1)) U AF((i20.u59.p211==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(!(E(TRUE U !((i20.u61.p216==1)))) U !(EG(!((i20.u59.p211==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t80, t104, t116, t160, t162, t163, t166, i0.u55.t32, i0.u56.t29, i1.t84, i1.u25.t91, i1.u27.t...684
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,20.4149,562708,1,0,1.00557e+06,333,2831,1.87337e+06,182,895,1242339
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 217 transition count 181
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 217 transition count 181
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 210 transition count 174
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 210 transition count 174
Applied a total of 54 rules in 8 ms. Remains 210 /237 variables (removed 27) and now considering 174/201 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18291462087691057447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15666963905926032696.kers'
[2026-05-24 08:20:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18291462087691057447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15666963905926032696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 210 cols 504 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-24 08:20:24] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15666963905926032696.kers
Total runtime 2 ms.
[2026-05-24 08:20:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 08:20:24] [INFO ] Invariant cache hit.
[2026-05-24 08:20:25] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2026-05-24 08:20:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 174/384 variables, 210/303 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 15/318 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 320 constraints, problems are : Problem set: 0 solved, 173 unsolved in 25362 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 67/108 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/384 variables, 210/323 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 173/496 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 534 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 55388ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 55389ms
Starting structural reductions in LTL mode, iteration 1 : 210/237 places, 174/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55723 ms. Remains : 210/237 places, 174/201 transitions.
[2026-05-24 08:21:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:21:20] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:21:20] [INFO ] Input system was already deterministic with 174 transitions.
[2026-05-24 08:21:20] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:21:20] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:21:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9997684065706225824.gal : 1 ms
[2026-05-24 08:21:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13599853237694733280.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9997684065706225824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599853237694733280.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0621e+13,0.609751,26796,2,12060,5,61143,6,0,1014,116830,0


Converting to forward existential form...Done !
original formula: (A((p128!=1) U (p0==1)) * (EG(EF(((p89==1)&&(p191==0)))) + E(!((EX((((p43==1)&&(p169==1))&&(p273==1))) + A((p138==1) U (p24==1)))) U ((E(...355
=> equivalent forward existential formula: ([FwdG((Init * !((E(!((p0==1)) U (!((p128!=1)) * !((p0==1)))) + EG(!((p0==1)))))),E(TRUE U ((p89==1)&&(p191==0))...1247
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t21, t29, t33, t34, t36, t39, t42, t45, t48, t51, t54, t57, t60, t64, t65, t67, t71,...425
Detected timeout of ITS tools.
[2026-05-24 08:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:21:50] [INFO ] Applying decomposition
[2026-05-24 08:21:50] [INFO ] Flatten gal took : 3 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/graph4614605176793856875.txt' '-o' '/tmp/graph4614605176793856875.bin' '-w' '/tmp/graph4614605176793856875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4614605176793856875.bin' '-l' '-1' '-v' '-w' '/tmp/graph4614605176793856875.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:21:50] [INFO ] Decomposing Gal with order
[2026-05-24 08:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:21:50] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 08:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:21:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14324766750931314925.gal : 1 ms
[2026-05-24 08:21:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12375552782511681458.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14324766750931314925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12375552782511681458.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0621e+13,0.102474,8164,1189,25,7249,238,447,12555,38,545,0


Converting to forward existential form...Done !
original formula: (A((i15.u45.p128!=1) U (i10.i1.u0.p0==1)) * (EG(EF(((i0.u30.p89==1)&&(i16.i0.u58.p191==0)))) + E(!((EX((((i5.u16.p43==1)&&(i8.u54.p169==1...543
=> equivalent forward existential formula: ([FwdG((Init * !((E(!((i10.i1.u0.p0==1)) U (!((i15.u45.p128!=1)) * !((i10.i1.u0.p0==1)))) + EG(!((i10.i1.u0.p0==...1817
Reverse transition relation is NOT exact ! Due to transitions t87, t103, t107, t111, t119, t164, t166, t167, i0.t83, i0.u28.t90, i0.u30.t86, i1.u18.t110, i...728
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,7.08529,218396,1,0,448158,296,2959,669219,193,685,610317
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 175
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 204 transition count 168
Applied a total of 66 rules in 7 ms. Remains 204 /237 variables (removed 33) and now considering 168/201 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4843419700988766358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3273700391365262855.kers'
[2026-05-24 08:21:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4843419700988766358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3273700391365262855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 204 cols 492 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 08:21:57] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3273700391365262855.kers
Total runtime 10 ms.
[2026-05-24 08:21:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-24 08:21:57] [INFO ] Invariant cache hit.
[2026-05-24 08:21:58] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-24 08:21:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 14/282 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 287 constraints, problems are : Problem set: 0 solved, 167 unsolved in 22498 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 41/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/286 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/453 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 9/462 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 7/469 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 7/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 52524ms, After SMT, problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 52525ms
Starting structural reductions in LTL mode, iteration 1 : 204/237 places, 168/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52870 ms. Remains : 204/237 places, 168/201 transitions.
[2026-05-24 08:22:50] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:22:50] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:22:50] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-24 08:22:50] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:22:50] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3362865099715737153.gal : 1 ms
[2026-05-24 08:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5913466190170244880.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3362865099715737153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5913466190170244880.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.46948e+12,0.449464,21140,2,11272,5,50774,6,0,984,82964,0


Converting to forward existential form...Done !
original formula: EF(EX(!(E(AF((p229==1)) U (p49!=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!(EG(!((p229==1)))) U (p49!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t20, t27, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t60, t63, t66, t69, t71, t74...404
Detected timeout of ITS tools.
[2026-05-24 08:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:23:20] [INFO ] Applying decomposition
[2026-05-24 08:23:20] [INFO ] Flatten gal took : 5 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/graph16959408549557105103.txt' '-o' '/tmp/graph16959408549557105103.bin' '-w' '/tmp/graph16959408549557105103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16959408549557105103.bin' '-l' '-1' '-v' '-w' '/tmp/graph16959408549557105103.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:23:20] [INFO ] Decomposing Gal with order
[2026-05-24 08:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:23:20] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 08:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2026-05-24 08:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14040286495551720664.gal : 2 ms
[2026-05-24 08:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5604770895947917371.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14040286495551720664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5604770895947917371.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.46948e+12,0.166682,9200,1606,23,8553,438,426,15580,35,938,0


Converting to forward existential form...Done !
original formula: EF(EX(!(E(AF((i12.i1.u60.p229==1)) U (i2.u15.p49!=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!(EG(!((i12.i1.u60.p229==1)))) U (i2.u15.p49!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t82, t102, t114, t158, t161, t164, i0.u20.t97, i0.u24.t89, i1.t98, i1.u16.t105, i1.u18.t101, ...684
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,20.9419,564116,1,0,899359,438,2716,1.74587e+06,181,964,1111417
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 176
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 204 transition count 168
Applied a total of 66 rules in 10 ms. Remains 204 /237 variables (removed 33) and now considering 168/201 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2316615529807526019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18018596722635344714.kers'
[2026-05-24 08:23:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2316615529807526019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18018596722635344714.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 204 cols 492 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 08:23:41] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18018596722635344714.kers
Total runtime 1 ms.
[2026-05-24 08:23:41] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 08:23:41] [INFO ] Invariant cache hit.
[2026-05-24 08:23:42] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 204/237 places, 168/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 204/237 places, 168/201 transitions.
[2026-05-24 08:23:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:23:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:23:42] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-24 08:23:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:23:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:23:42] [INFO ] Time to serialize gal into /tmp/CTLFireability11132852524269862385.gal : 1 ms
[2026-05-24 08:23:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15376050366893803403.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11132852524269862385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15376050366893803403.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50162e+12,0.372089,21948,2,11576,5,51696,6,0,984,87373,0


Converting to forward existential form...Done !
original formula: (EX(EX(A((p81==1) U (p238==1)))) + EF((((p143==1)||(p121==1))||(p63==1))))
=> equivalent forward existential formula: ([((EY(EY(Init)) * !(EG(!((p238==1))))) * !(E(!((p238==1)) U (!((p81==1)) * !((p238==1))))))] != FALSE + [(FwdU(...214
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t56, t57, t59, t62, t65, t68, t71, t72...409
Detected timeout of ITS tools.
[2026-05-24 08:24:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:24:12] [INFO ] Applying decomposition
[2026-05-24 08:24:12] [INFO ] Flatten gal took : 5 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/graph17631616449299163320.txt' '-o' '/tmp/graph17631616449299163320.bin' '-w' '/tmp/graph17631616449299163320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17631616449299163320.bin' '-l' '-1' '-v' '-w' '/tmp/graph17631616449299163320.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:24:12] [INFO ] Decomposing Gal with order
[2026-05-24 08:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:24:12] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-24 08:24:12] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-24 08:24:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18189444870150587216.gal : 3 ms
[2026-05-24 08:24:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17811905228167237927.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18189444870150587216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17811905228167237927.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50162e+12,0.079509,7444,1018,26,6566,347,423,8490,38,787,0


Converting to forward existential form...Done !
original formula: (EX(EX(A((u25.p81==1) U (i6.i0.u64.p238==1)))) + EF((((i16.i1.u47.p143==1)||(i15.u40.p121==1))||(i3.u19.p63==1))))
=> equivalent forward existential formula: ([((EY(EY(Init)) * !(EG(!((i6.i0.u64.p238==1))))) * !(E(!((i6.i0.u64.p238==1)) U (!((u25.p81==1)) * !((i6.i0.u64...274
Reverse transition relation is NOT exact ! Due to transitions t78, t106, t114, t158, t160, t161, t164, i0.u56.t28, i0.u57.t25, i1.t82, i1.u24.t89, i1.u26.t...698
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,3.28778,117840,1,0,220770,347,2727,357643,192,787,290888
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Graph (trivial) has 135 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 473 edges and 231 vertex of which 230 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 229 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 192 transition count 155
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 76 place count 192 transition count 114
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 168 place count 141 transition count 114
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 193 place count 116 transition count 89
Iterating global reduction 2 with 25 rules applied. Total rules applied 218 place count 116 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 218 place count 116 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 223 place count 113 transition count 87
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 324 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 325 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 60 transition count 36
Applied a total of 326 rules in 39 ms. Remains 60 /237 variables (removed 177) and now considering 36/201 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13207779393329759376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3729486271962729472.kers'
[2026-05-24 08:24:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13207779393329759376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3729486271962729472.kers]
Normalized transition count is 35 out of 36 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 35 rows 33 cols 100 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-24 08:24:15] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3729486271962729472.kers
Total runtime 1 ms.
[2026-05-24 08:24:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 08:24:15] [INFO ] Invariant cache hit.
[2026-05-24 08:24:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 142 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/237 places, 36/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 32 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 25 transition count 29
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 22 transition count 26
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 22 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 22 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 19 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 19 transition count 22
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 29 place count 18 transition count 21
Applied a total of 29 rules in 4 ms. Remains 18 /32 variables (removed 14) and now considering 21/36 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-155937088156729504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7328744824121492539.kers'
[2026-05-24 08:24:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-155937088156729504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7328744824121492539.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 18 cols 44 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 08:24:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7328744824121492539.kers
Total runtime 0 ms.
[2026-05-24 08:24:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 08:24:15] [INFO ] Invariant cache hit.
[2026-05-24 08:24:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/237 places, 21/201 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 238 ms. Remains : 18/237 places, 21/201 transitions.
[2026-05-24 08:24:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:24:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:24:15] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-24 08:24:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:24:15] [INFO ] Flatten gal took : 0 ms
[2026-05-24 08:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4493797705852511561.gal : 0 ms
[2026-05-24 08:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3494522374953381124.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4493797705852511561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3494522374953381124.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 9488 steps (3036 resets) in 45 ms. (206 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality3494522374953381124.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 14
Reachability property BusinessProcesses-PT-03-CTLFireability-2024-11 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37,0.015518,4280,2,45,10,318,6,0,93,201,0
Total reachable state count : 37

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-03-CTLFireability-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-03-CTLFireability-2024-11,1,0.015783,4280,2,19,10,318,7,0,96,201,0
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 210 transition count 174
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 210 transition count 174
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 203 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 203 transition count 167
Applied a total of 68 rules in 7 ms. Remains 203 /237 variables (removed 34) and now considering 167/201 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7880313818084671545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3400816225540295196.kers'
[2026-05-24 08:24:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7880313818084671545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3400816225540295196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 203 cols 490 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 08:24:15] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3400816225540295196.kers
Total runtime 1 ms.
[2026-05-24 08:24:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:24:15] [INFO ] Invariant cache hit.
[2026-05-24 08:24:16] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-24 08:24:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/370 variables, 203/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 16/282 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/370 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 284 constraints, problems are : Problem set: 0 solved, 166 unsolved in 21495 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/283 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/449 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 10/471 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 166 unsolved
SMT process timed out in 51519ms, After SMT, problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 51520ms
Starting structural reductions in LTL mode, iteration 1 : 203/237 places, 167/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51839 ms. Remains : 203/237 places, 167/201 transitions.
[2026-05-24 08:25:07] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:25:07] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:25:07] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-24 08:25:07] [INFO ] Flatten gal took : 30 ms
[2026-05-24 08:25:07] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16456054615179564621.gal : 1 ms
[2026-05-24 08:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability211552509044917333.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16456054615179564621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability211552509044917333.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.39069e+12,0.428909,20616,2,11178,5,49370,6,0,979,79523,0


Converting to forward existential form...Done !
original formula: ((AG(AF((p63==0))) + E((p106==1) U (p116==1))) + AX((p215==1)))
=> equivalent forward existential formula: [(EY((Init * !((!(E(TRUE U !(!(EG(!((p63==0))))))) + E((p106==1) U (p116==1)))))) * !((p215==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t15, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70...403
(forward)formula 0,1,6.63754,208416,1,0,571,767671,367,260,5648,700214,615
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 175
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 203 transition count 167
Applied a total of 68 rules in 14 ms. Remains 203 /237 variables (removed 34) and now considering 167/201 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11322166717321220916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9368283243572374061.kers'
[2026-05-24 08:25:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11322166717321220916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9368283243572374061.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 203 cols 490 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 08:25:14] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9368283243572374061.kers
Total runtime 1 ms.
[2026-05-24 08:25:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 08:25:14] [INFO ] Invariant cache hit.
[2026-05-24 08:25:14] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 203/237 places, 167/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 203/237 places, 167/201 transitions.
[2026-05-24 08:25:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:25:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:25:14] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-24 08:25:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:25:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:25:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7224068671506252764.gal : 1 ms
[2026-05-24 08:25:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8667649740824358013.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7224068671506252764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8667649740824358013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38894e+12,0.453252,20788,2,11137,5,49954,6,0,979,81178,0


Converting to forward existential form...Done !
original formula: ((AG(((p77==0) + AF((p246==1)))) + AX((p1==0))) + AX(!(E((((p25==1)&&(p120==1))&&(p218==1)) U (p104!=1)))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !((!(E(TRUE U !(((p77==0) + !(EG(!((p246==1)))))))) + !(EX(!((p1==0)))))))),(((p25==1)&&(p120=...194
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73,...403
Detected timeout of ITS tools.
[2026-05-24 08:25:44] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:25:44] [INFO ] Applying decomposition
[2026-05-24 08:25:45] [INFO ] Flatten gal took : 3 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/graph9254615892175553054.txt' '-o' '/tmp/graph9254615892175553054.bin' '-w' '/tmp/graph9254615892175553054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9254615892175553054.bin' '-l' '-1' '-v' '-w' '/tmp/graph9254615892175553054.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:25:45] [INFO ] Decomposing Gal with order
[2026-05-24 08:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:25:45] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-24 08:25:45] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 08:25:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14888456165931620583.gal : 2 ms
[2026-05-24 08:25:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10318290796367395021.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14888456165931620583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10318290796367395021.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38894e+12,0.20441,9488,1598,33,10363,388,396,14623,42,867,0


Converting to forward existential form...Done !
original formula: ((AG(((i9.u25.p77==0) + AF((i18.u57.p246==1)))) + AX((i0.u0.p1==0))) + AX(!(E((((u10.p25==1)&&(i11.i1.u41.p120==1))&&(i4.u60.p218==1)) U ...175
=> equivalent forward existential formula: [(FwdU(EY((Init * !((!(E(TRUE U !(((i9.u25.p77==0) + !(EG(!((i18.u57.p246==1)))))))) + !(EX(!((i0.u0.p1==0))))))...244
Reverse transition relation is NOT exact ! Due to transitions t81, t97, t105, t113, t157, t160, t163, i0.u54.t32, i0.u55.t29, i0.u56.t26, i1.t77, i1.u23.t9...670
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,10.8853,336260,1,0,637727,422,2801,934863,209,1076,956696
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 201/201 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 175
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 203 transition count 167
Applied a total of 68 rules in 7 ms. Remains 203 /237 variables (removed 34) and now considering 167/201 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16034162782275377748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6229246665133163013.kers'
[2026-05-24 08:25:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16034162782275377748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6229246665133163013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 203 cols 490 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 08:25:56] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6229246665133163013.kers
Total runtime 1 ms.
[2026-05-24 08:25:56] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-24 08:25:56] [INFO ] Invariant cache hit.
[2026-05-24 08:25:56] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 203/237 places, 167/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 203/237 places, 167/201 transitions.
[2026-05-24 08:25:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:25:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:25:56] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-24 08:25:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:25:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:25:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16679861911595177479.gal : 1 ms
[2026-05-24 08:25:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15954583880017753769.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16679861911595177479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15954583880017753769.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.39054e+12,0.405992,20744,2,11097,5,49826,6,0,979,80542,0


Converting to forward existential form...Done !
original formula: E(A(A(EF((p260==1)) U (((p76==1)&&(p184==1))&&(p273==1))) U EF(!(EX((p177==1))))) U EX(EG((p117==1))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,!((E(!(E(TRUE U !(EX((p177==1))))) U (!(!((E(!((((p76==1)&&(p184==1))&&(p273==1))) U (!(E(TRU...354
Reverse transition relation is NOT exact ! Due to transitions t5, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73,...403
Hit Full ! (commute/partial/dont) 165/0/2
(forward)formula 0,1,6.22378,208256,1,0,380,733033,374,177,6305,735206,362
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2026-05-24 08:26:02] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:26:02] [INFO ] Flatten gal took : 3 ms
Total runtime 827548 ms.

BK_STOP 1779611163071

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-03"
export BK_EXAMINATION="CTLFireability"
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-03, examination is CTLFireability"
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-177946842000466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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