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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 17:51 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 59K 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-02-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779609990149

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 08:06:31] [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:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:06:31] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-24 08:06:31] [INFO ] Transformed 262 places.
[2026-05-24 08:06:31] [INFO ] Transformed 219 transitions.
[2026-05-24 08:06:31] [INFO ] Found NUPN structural information;
[2026-05-24 08:06:31] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 22 place count 223 transition count 188
Iterating global reduction 1 with 16 rules applied. Total rules applied 38 place count 223 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 221 transition count 186
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 221 transition count 186
Applied a total of 42 rules in 45 ms. Remains 221 /245 variables (removed 24) and now considering 186/204 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8984655995653817149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9049574236596817354.kers'
[2026-05-24 08:06:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8984655995653817149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9049574236596817354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 221 cols 506 entries
Finished phase 1 with 171 SingleSign rule and 13 generalized
[2026-05-24 08:06:31] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9049574236596817354.kers
Total runtime 2 ms.
[2026-05-24 08:06:31] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-24 08:06:31] [INFO ] Invariant cache hit.
[2026-05-24 08:06:32] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-24 08:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 186/407 variables, 221/298 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 304 constraints, problems are : Problem set: 0 solved, 185 unsolved in 18242 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 186/407 variables, 221/314 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 185/499 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 511 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48322ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 48333ms
Starting structural reductions in LTL mode, iteration 1 : 221/245 places, 186/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49012 ms. Remains : 221/245 places, 186/204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 221 /221 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-24 08:07:20] [INFO ] Invariant cache hit.
[2026-05-24 08:07:20] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:07:20] [INFO ] Invariant cache hit.
[2026-05-24 08:07:20] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 221/221 places, 186/186 transitions.
Support contains 87 out of 221 places after structural reductions.
[2026-05-24 08:07:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 08:07:21] [INFO ] Flatten gal took : 35 ms
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 08:07:21] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:07:21] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 80 out of 221 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (536 resets) in 1589 ms. (25 steps per ms) remains 22/60 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (9 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
[2026-05-24 08:07:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 115/153 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/177 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 11/188 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 159/347 variables, 188/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 50/397 variables, 24/249 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 11 (OVERLAPS) 10/407 variables, 9/258 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 9/267 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 267 constraints, problems are : Problem set: 2 solved, 20 unsolved in 2201 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 97/126 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 46/172 variables, 12/32 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/38 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 13/185 variables, 5/43 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 154/339 variables, 185/229 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 11/240 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/241 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 54/393 variables, 23/264 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 9/273 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 2/275 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/393 variables, 6/281 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/393 variables, 1/282 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/393 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 19 (OVERLAPS) 14/407 variables, 13/295 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 1/296 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 0/407 variables, 1/297 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 0/297 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 297 constraints, problems are : Problem set: 3 solved, 19 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 20/22 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7214ms problems are : Problem set: 3 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 186/186 transitions.
Graph (trivial) has 93 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 412 edges and 216 vertex of which 212 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 212 transition count 147
Reduce places removed 27 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 185 transition count 142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 180 transition count 142
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 66 place count 180 transition count 115
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 122 place count 151 transition count 115
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 135 place count 138 transition count 102
Iterating global reduction 3 with 13 rules applied. Total rules applied 148 place count 138 transition count 102
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 232 place count 95 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 95 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 94 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 94 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 93 transition count 59
Applied a total of 236 rules in 50 ms. Remains 93 /221 variables (removed 128) and now considering 59/186 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 93/221 places, 59/186 transitions.
RANDOM walk for 9852 steps (275 resets) in 109 ms. (89 steps per ms) remains 0/19 properties
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2026-05-24 08:07:29] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:07:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 08:07:29] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:07:29] [INFO ] Input system was already deterministic with 186 transitions.
Computed a total of 214 stabilizing places and 177 stable transitions
Graph (complete) has 419 edges and 221 vertex of which 217 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 188 transition count 153
Applied a total of 66 rules in 17 ms. Remains 188 /221 variables (removed 33) and now considering 153/186 (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-1395713687971291406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14745749992259157505.kers'
[2026-05-24 08:07:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1395713687971291406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14745749992259157505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 188 cols 439 entries
Finished phase 1 with 138 SingleSign rule and 13 generalized
[2026-05-24 08:07:29] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14745749992259157505.kers
Total runtime 1 ms.
[2026-05-24 08:07:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 08:07:29] [INFO ] Invariant cache hit.
[2026-05-24 08:07:29] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-24 08:07:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 265 constraints, problems are : Problem set: 0 solved, 152 unsolved in 15221 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 432 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45250ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 45251ms
Starting structural reductions in LTL mode, iteration 1 : 188/221 places, 153/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45535 ms. Remains : 188/221 places, 153/186 transitions.
[2026-05-24 08:08:14] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:08:14] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-24 08:08:14] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:08:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11637430829793145311.gal : 3 ms
[2026-05-24 08:08:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2715298538322983726.ctl : 4 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/CTLFireability11637430829793145311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2715298538322983726.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.46025e+12,0.287079,15932,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: AX(EF(AG((p54==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !((p54==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
(forward)formula 0,0,6.16301,222024,1,0,325,696376,328,155,5255,520571,317
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Graph (trivial) has 122 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 413 edges and 216 vertex of which 212 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 211 transition count 135
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 171 transition count 135
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 82 place count 171 transition count 97
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 166 place count 125 transition count 97
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 105 transition count 77
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 105 transition count 77
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 294 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 58 transition count 33
Applied a total of 296 rules in 32 ms. Remains 58 /221 variables (removed 163) and now considering 33/186 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16170796267738393540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10114511127872219616.kers'
[2026-05-24 08:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16170796267738393540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10114511127872219616.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 32 rows 37 cols 95 entries
Finished phase 1 with 29 SingleSign rule and 3 generalized
[2026-05-24 08:08:21] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10114511127872219616.kers
Total runtime 2 ms.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 08:08:21] [INFO ] Invariant cache hit.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [0, 1, 4, 5, 7, 9, 12, 13, 14, 15, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 123 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/221 places, 33/186 transitions.
Graph (complete) has 64 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 31 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 23 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 23 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 22 place count 20 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 19 transition count 21
Applied a total of 24 rules in 4 ms. Remains 19 /33 variables (removed 14) and now considering 21/33 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5934143659094138626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17131579297567981635.kers'
[2026-05-24 08:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5934143659094138626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17131579297567981635.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 48 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-24 08:08:21] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17131579297567981635.kers
Total runtime 0 ms.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 08:08:21] [INFO ] Invariant cache hit.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/221 places, 21/186 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 218 ms. Remains : 19/221 places, 21/186 transitions.
[2026-05-24 08:08:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:08:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:08:21] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-24 08:08:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:08:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:08:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17154261549892506251.gal : 1 ms
[2026-05-24 08:08:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9873578264362953708.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/ReachabilityCardinality17154261549892506251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9873578264362953708.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 ...329
Loading property file /tmp/ReachabilityCardinality9873578264362953708.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
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 :6 after 18
Reachability property BusinessProcesses-PT-02-CTLFireability-2024-01 is true.
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
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,50,0.011861,4064,2,81,10,402,6,0,97,277,0
Total reachable state count : 50

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-02-CTLFireability-2024-01 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-02-CTLFireability-2024-01,1,0.012172,4272,2,20,10,402,7,0,100,277,0
RANDOM walk for 40000 steps (15884 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (5570 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69 steps, run visited all 1 properties in 4 ms. (steps per millisecond=17 )
Probabilistic random walk after 69 steps, saw 42 distinct states, run finished after 11 ms. (steps per millisecond=6 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 201 transition count 166
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 192 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 192 transition count 157
Applied a total of 58 rules in 11 ms. Remains 192 /221 variables (removed 29) and now considering 157/186 (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-18163170232089662622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8355701291537093846.kers'
[2026-05-24 08:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18163170232089662622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8355701291537093846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 192 cols 447 entries
Finished phase 1 with 142 SingleSign rule and 13 generalized
[2026-05-24 08:08:21] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8355701291537093846.kers
Total runtime 1 ms.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 08:08:21] [INFO ] Invariant cache hit.
[2026-05-24 08:08:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-24 08:08:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/349 variables, 192/248 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 251 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9890 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/349 variables, 192/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 156/407 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 423 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39912ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 39915ms
Starting structural reductions in LTL mode, iteration 1 : 192/221 places, 157/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40198 ms. Remains : 192/221 places, 157/186 transitions.
[2026-05-24 08:09:01] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:09:01] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:09:01] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-24 08:09:01] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:09:01] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:09:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2214601843095699344.gal : 2 ms
[2026-05-24 08:09:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6566079992789961192.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/CTLFireability2214601843095699344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6566079992789961192.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.46872e+12,0.283612,16384,2,13389,5,41901,6,0,925,38351,0


Converting to forward existential form...Done !
original formula: EX(AG((!(A(AG((((p55==1)&&(p193==1))&&(p255==1))) U A((p240==1) U (p237==1)))) * EG(AG((p29==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(!((E(!(!((E(!((p237==1)) U (!((p240==1)) * !((p237==1)))) + EG(!((p237==1)))))) U (...417
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t21, t26, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t66, t69, t72, t74, t77,...345
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 08:09:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:09:31] [INFO ] Applying decomposition
[2026-05-24 08:09:31] [INFO ] Flatten gal took : 6 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/graph9060819033982103304.txt' '-o' '/tmp/graph9060819033982103304.bin' '-w' '/tmp/graph9060819033982103304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9060819033982103304.bin' '-l' '-1' '-v' '-w' '/tmp/graph9060819033982103304.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:09:31] [INFO ] Decomposing Gal with order
[2026-05-24 08:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:09:31] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-24 08:09:31] [INFO ] Flatten gal took : 154 ms
[2026-05-24 08:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 08:09:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7392262817968173826.gal : 5 ms
[2026-05-24 08:09:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2756687319719483942.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/CTLFireability7392262817968173826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2756687319719483942.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 -...262
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.46872e+12,0.117926,9112,1100,45,10159,702,438,13157,53,1618,0


Converting to forward existential form...Done !
original formula: EX(AG((!(A(AG((((i1.u19.p55==1)&&(i9.i1.u52.p193==1))&&(i17.u54.p255==1))) U A((i1.u61.p240==1) U (i17.u60.p237==1)))) * EG(AG((i4.u9.p29...164
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(!((E(!(!((E(!((i17.u60.p237==1)) U (!((i1.u61.p240==1)) * !((i17.u60.p237==1)))) + ...541
Reverse transition relation is NOT exact ! Due to transitions t94, t98, t104, t110, t116, i0.i0.u25.t85, i0.i0.u27.t81, i0.i1.u29.t77, i1.u19.t97, i1.u21.t...572
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
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
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 an SCC at level 4
Fast SCC detection found a local 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,0,20.617,485328,1,0,870037,1989,2986,1.10335e+06,314,11664,849074
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Graph (trivial) has 122 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 413 edges and 216 vertex of which 212 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 211 transition count 136
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 172 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 170 transition count 134
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 84 place count 170 transition count 97
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 166 place count 125 transition count 97
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 186 place count 105 transition count 77
Iterating global reduction 3 with 20 rules applied. Total rules applied 206 place count 105 transition count 77
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 292 place count 61 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 60 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 59 transition count 34
Applied a total of 294 rules in 53 ms. Remains 59 /221 variables (removed 162) and now considering 34/186 (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-8867118081681878609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7626617916442802618.kers'
[2026-05-24 08:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8867118081681878609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7626617916442802618.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 33 rows 40 cols 104 entries
Finished phase 1 with 30 SingleSign rule and 3 generalized
[2026-05-24 08:09:52] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7626617916442802618.kers
Total runtime 0 ms.
[2026-05-24 08:09:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 08:09:52] [INFO ] Invariant cache hit.
[2026-05-24 08:09:53] [INFO ] Implicit Places using invariants and state equation in 347 ms returned [0, 1, 2, 4, 6, 8, 11, 12, 13, 14, 15, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 463 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/221 places, 34/186 transitions.
Graph (complete) has 78 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 30
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 33 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 30 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 29 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 29 transition count 27
Applied a total of 15 rules in 4 ms. Remains 29 /38 variables (removed 9) and now considering 27/34 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6561164367774077878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16576327167570015004.kers'
[2026-05-24 08:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6561164367774077878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16576327167570015004.kers]
Normalized transition count is 26 out of 27 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 26 rows 29 cols 72 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-05-24 08:09:53] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16576327167570015004.kers
Total runtime 6 ms.
[2026-05-24 08:09:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 08:09:53] [INFO ] Invariant cache hit.
[2026-05-24 08:09:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/221 places, 27/186 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 606 ms. Remains : 29/221 places, 27/186 transitions.
[2026-05-24 08:09:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:09:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:09:53] [INFO ] Input system was already deterministic with 27 transitions.
[2026-05-24 08:09:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:09:53] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:09:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8620590833373341037.gal : 1 ms
[2026-05-24 08:09:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3828233711491640788.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/CTLFireability8620590833373341037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3828233711491640788.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,232,0.008699,4072,2,167,5,736,6,0,141,714,0


Converting to forward existential form...Done !
original formula: EF(AG(E((p32==1) U (p141==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p32==1) U (p141==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t13, t22, t23, t24, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,0,0.026123,4996,1,0,68,6019,78,37,853,5188,79
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 188 transition count 153
Applied a total of 66 rules in 7 ms. Remains 188 /221 variables (removed 33) and now considering 153/186 (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-10178832752085546509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-259099439298422515.kers'
[2026-05-24 08:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10178832752085546509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-259099439298422515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 188 cols 439 entries
Finished phase 1 with 138 SingleSign rule and 13 generalized
[2026-05-24 08:09:53] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-259099439298422515.kers
Total runtime 1 ms.
[2026-05-24 08:09:53] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 08:09:53] [INFO ] Invariant cache hit.
[2026-05-24 08:09:53] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-24 08:09:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 265 constraints, problems are : Problem set: 0 solved, 152 unsolved in 15958 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 432 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46031ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 46032ms
Starting structural reductions in LTL mode, iteration 1 : 188/221 places, 153/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46352 ms. Remains : 188/221 places, 153/186 transitions.
[2026-05-24 08:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:10:39] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:10:39] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-24 08:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:10:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3518356028135116669.gal : 1 ms
[2026-05-24 08:10:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17640542299927945500.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/CTLFireability3518356028135116669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17640542299927945500.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.46025e+12,0.278435,16024,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: E(!((EX(AF((p102==1))) * E(!((((p50==1)&&(p53==1))||(p136==1))) U !(((p74==1)&&(p37==1)))))) U ((!(((p100==1)&&(p194==1))&&(p255==1)))&&(...164
=> equivalent forward existential formula: [(FwdU(Init,!((EX(!(EG(!((p102==1))))) * E(!((((p50==1)&&(p53==1))||(p136==1))) U !(((p74==1)&&(p37==1))))))) * ...216
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
Detected timeout of ITS tools.
[2026-05-24 08:11:09] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:11:09] [INFO ] Applying decomposition
[2026-05-24 08:11:09] [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/graph753399653928615335.txt' '-o' '/tmp/graph753399653928615335.bin' '-w' '/tmp/graph753399653928615335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph753399653928615335.bin' '-l' '-1' '-v' '-w' '/tmp/graph753399653928615335.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:11:09] [INFO ] Decomposing Gal with order
[2026-05-24 08:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:11:09] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-24 08:11:09] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-24 08:11:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6403614438499822543.gal : 3 ms
[2026-05-24 08:11:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9533620208148150405.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/CTLFireability6403614438499822543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9533620208148150405.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 -...262
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.46025e+12,0.095231,7468,1068,38,6892,309,375,8001,46,689,0


Converting to forward existential form...Done !
original formula: E(!((EX(AF((i0.u33.p102==1))) * E(!((((i7.u18.p50==1)&&(i7.u19.p53==1))||(i12.u42.p136==1))) U !(((i15.u24.p74==1)&&(i5.u13.p37==1)))))) ...238
=> equivalent forward existential formula: [(FwdU(Init,!((EX(!(EG(!((i0.u33.p102==1))))) * E(!((((i7.u18.p50==1)&&(i7.u19.p53==1))||(i12.u42.p136==1))) U !...290
Reverse transition relation is NOT exact ! Due to transitions t92, t96, t102, t112, i0.u52.t31, i0.u53.t28, i1.u28.t79, i1.u51.t34, i2.u22.t91, i3.t108, i3...537
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
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
(forward)formula 0,0,6.27416,156536,1,0,247439,1487,2654,834743,234,9869,351230
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 188 transition count 153
Applied a total of 66 rules in 7 ms. Remains 188 /221 variables (removed 33) and now considering 153/186 (removed 33) transitions.
[2026-05-24 08:11:16] [INFO ] Invariant cache hit.
[2026-05-24 08:11:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 08:11:16] [INFO ] Invariant cache hit.
[2026-05-24 08:11:16] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 188/221 places, 153/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 188/221 places, 153/186 transitions.
[2026-05-24 08:11:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:11:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:11:16] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-24 08:11:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:11:16] [INFO ] Flatten gal took : 20 ms
[2026-05-24 08:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5353099633564943495.gal : 1 ms
[2026-05-24 08:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17785634184275153822.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/CTLFireability5353099633564943495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17785634184275153822.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.46025e+12,0.321655,16052,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: EF((AX((p176==1)) * A((((p55==1)&&(p193==1))&&(p255==1)) U (p96==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX(!((p176==1))))) * !(EG(!((p96==1))))) * !(E(!((p96==1)) U (!((((p55==1)&&(p193==1))&&...194
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
Detected timeout of ITS tools.
[2026-05-24 08:11:46] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:11:46] [INFO ] Applying decomposition
[2026-05-24 08:11:46] [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/graph4282555110068611216.txt' '-o' '/tmp/graph4282555110068611216.bin' '-w' '/tmp/graph4282555110068611216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4282555110068611216.bin' '-l' '-1' '-v' '-w' '/tmp/graph4282555110068611216.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:11:46] [INFO ] Decomposing Gal with order
[2026-05-24 08:11:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:11:46] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-24 08:11:46] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:11:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:11:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13405788825201474802.gal : 2 ms
[2026-05-24 08:11:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2007591763909596443.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/CTLFireability13405788825201474802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2007591763909596443.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,1.46025e+12,0.064134,6708,987,38,5507,309,411,5513,49,658,0


Converting to forward existential form...Done !
original formula: EF((AX((i11.u49.p176==1)) * A((((i7.u19.p55==1)&&(i8.u52.p193==1))&&(i17.u54.p255==1)) U (i10.i0.u30.p96==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX(!((i11.u49.p176==1))))) * !(EG(!((i10.i0.u30.p96==1))))) * !(E(!((i10.i0.u30.p96==1))...257
Reverse transition relation is NOT exact ! Due to transitions t96, t108, t112, i0.u25.t83, i1.u27.t79, i1.u48.t40, i2.u21.t91, i2.u23.t87, i3.u7.t115, i3.u...549
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
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an 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
(forward)formula 0,0,4.41483,127204,1,0,227602,1503,2640,620736,246,10350,286026
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 203 transition count 168
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 203 transition count 168
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 193 transition count 158
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 193 transition count 158
Applied a total of 56 rules in 13 ms. Remains 193 /221 variables (removed 28) and now considering 158/186 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7317545641340868069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1404429215928883164.kers'
[2026-05-24 08:11:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7317545641340868069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1404429215928883164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 193 cols 449 entries
Finished phase 1 with 143 SingleSign rule and 13 generalized
[2026-05-24 08:11:51] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1404429215928883164.kers
Total runtime 1 ms.
[2026-05-24 08:11:51] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 08:11:51] [INFO ] Invariant cache hit.
[2026-05-24 08:11:51] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2026-05-24 08:11:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/351 variables, 193/249 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 260 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10534 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 158/351 variables, 193/262 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 157/419 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 425 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40577ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 40577ms
Starting structural reductions in LTL mode, iteration 1 : 193/221 places, 158/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40923 ms. Remains : 193/221 places, 158/186 transitions.
[2026-05-24 08:12:32] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:12:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:12:32] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-24 08:12:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:12:32] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:12:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6391973904355483461.gal : 1 ms
[2026-05-24 08:12:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13619563726682099521.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/CTLFireability6391973904355483461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13619563726682099521.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.46872e+12,0.30198,16660,2,13360,5,42136,6,0,930,40062,0


Converting to forward existential form...Done !
original formula: (AF((AF((((p199==1)||(p185==1))||(p44==1))) * EX(EX(AF((p213==1)))))) + E(!((EG(A((p111==1) U (p68==1))) * E(EG((p211==1)) U (EG((((p55==...250
=> equivalent forward existential formula: [FwdG((Init * !(E(!((EG(!((E(!((p68==1)) U (!((p111==1)) * !((p68==1)))) + EG(!((p68==1)))))) * E(EG((p211==1)) ...355
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t19, t20, t23, t28, t32, t35, t39, t40, t42, t45, t48, t51, t54, t57, t60, t69, t72, ...355
Detected timeout of ITS tools.
[2026-05-24 08:13:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:13:02] [INFO ] Applying decomposition
[2026-05-24 08:13:02] [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/graph3346309031164443233.txt' '-o' '/tmp/graph3346309031164443233.bin' '-w' '/tmp/graph3346309031164443233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3346309031164443233.bin' '-l' '-1' '-v' '-w' '/tmp/graph3346309031164443233.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:13:02] [INFO ] Decomposing Gal with order
[2026-05-24 08:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:13:02] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-24 08:13:02] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 08:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5738322005144906948.gal : 2 ms
[2026-05-24 08:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16804980824077499702.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/CTLFireability5738322005144906948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16804980824077499702.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,1.46872e+12,0.130141,8352,1155,53,8415,500,447,10927,53,1407,0


Converting to forward existential form...Done !
original formula: (AF((AF((((i16.u55.p199==1)||(i15.i1.u51.p185==1))||(i6.i1.u15.p44==1))) * EX(EX(AF((i14.u58.p213==1)))))) + E(!((EG(A((i13.u38.p111==1) ...374
=> equivalent forward existential formula: [FwdG((Init * !(E(!((EG(!((E(!((i8.u23.p68==1)) U (!((i13.u38.p111==1)) * !((i8.u23.p68==1)))) + EG(!((i8.u23.p6...493
Reverse transition relation is NOT exact ! Due to transitions t97, t101, t107, t113, i0.u53.t35, i0.u54.t32, i1.u28.t84, i2.u20.t100, i3.t117, i3.u6.t123, ...606
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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
(forward)formula 0,1,7.59968,247844,1,0,415720,1578,2830,833318,271,8079,514704
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Graph (trivial) has 121 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 413 edges and 216 vertex of which 212 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 211 transition count 136
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 172 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 171 transition count 135
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 82 place count 171 transition count 98
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 163 place count 127 transition count 98
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 183 place count 107 transition count 78
Iterating global reduction 3 with 20 rules applied. Total rules applied 203 place count 107 transition count 78
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 291 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 60 transition count 34
Applied a total of 293 rules in 29 ms. Remains 60 /221 variables (removed 161) and now considering 34/186 (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-4085982507691919607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-368308634388538690.kers'
[2026-05-24 08:13:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4085982507691919607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-368308634388538690.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 33 rows 39 cols 99 entries
Finished phase 1 with 30 SingleSign rule and 3 generalized
[2026-05-24 08:13:09] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-368308634388538690.kers
Total runtime 0 ms.
[2026-05-24 08:13:10] [INFO ] Implicit Places using invariants in 50 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/221 places, 34/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 103 ms. Remains : 59/221 places, 34/186 transitions.
[2026-05-24 08:13:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:13:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:13:10] [INFO ] Input system was already deterministic with 34 transitions.
[2026-05-24 08:13:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:13:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:13:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15775259670653601325.gal : 0 ms
[2026-05-24 08:13:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5853456517696637444.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/ReachabilityCardinality15775259670653601325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5853456517696637444.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 ...329
Loading property file /tmp/ReachabilityCardinality5853456517696637444.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 25
Reachability property BusinessProcesses-PT-02-CTLFireability-2024-09 is true.
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,82,0.027552,4428,2,386,11,1284,6,0,269,820,0
Total reachable state count : 82

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-02-CTLFireability-2024-09 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-02-CTLFireability-2024-09,1,0.028114,4672,2,60,11,1284,7,0,275,820,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 40000 steps (13779 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (6335 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 107 steps, run visited all 1 properties in 4 ms. (steps per millisecond=26 )
Probabilistic random walk after 107 steps, saw 63 distinct states, run finished after 4 ms. (steps per millisecond=26 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 201 transition count 166
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 201 transition count 166
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 191 transition count 156
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 191 transition count 156
Applied a total of 60 rules in 5 ms. Remains 191 /221 variables (removed 30) and now considering 156/186 (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-7818412982951234628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2843263063882637930.kers'
[2026-05-24 08:13:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7818412982951234628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2843263063882637930.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 191 cols 445 entries
Finished phase 1 with 141 SingleSign rule and 13 generalized
[2026-05-24 08:13:10] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2843263063882637930.kers
Total runtime 1 ms.
[2026-05-24 08:13:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 08:13:10] [INFO ] Invariant cache hit.
[2026-05-24 08:13:10] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-05-24 08:13:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/347 variables, 191/259 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 268 constraints, problems are : Problem set: 0 solved, 155 unsolved in 11467 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 156/347 variables, 191/275 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 155/430 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 442 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41493ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 41495ms
Starting structural reductions in LTL mode, iteration 1 : 191/221 places, 156/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41860 ms. Remains : 191/221 places, 156/186 transitions.
[2026-05-24 08:13:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:13:52] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:13:52] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-24 08:13:52] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:13:52] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12126873856916015430.gal : 1 ms
[2026-05-24 08:13:52] [INFO ] Time to serialize properties into /tmp/CTLFireability609437643447343639.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/CTLFireability12126873856916015430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability609437643447343639.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.46461e+12,0.30242,16424,2,13148,5,41493,6,0,920,39505,0


Converting to forward existential form...Done !
original formula: (EX((p9==0)) * AG(EF((((A((p115==1) U (p180==1)) + (p222==1)) * (p102==0)) * ((p67==1)||(p141==1))))))
=> equivalent forward existential formula: ([(Init * !(EX((p9==0))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (((!((E(!((p180==1)) U (!((p115==1)) * !((p1...249
Reverse transition relation is NOT exact ! Due to transitions t2, t16, t21, t26, t30, t33, t36, t40, t41, t43, t46, t49, t52, t55, t58, t67, t70, t73, t75,...344
Detected timeout of ITS tools.
[2026-05-24 08:14:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:14:22] [INFO ] Applying decomposition
[2026-05-24 08:14:22] [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/graph1797736014763121867.txt' '-o' '/tmp/graph1797736014763121867.bin' '-w' '/tmp/graph1797736014763121867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1797736014763121867.bin' '-l' '-1' '-v' '-w' '/tmp/graph1797736014763121867.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:14:22] [INFO ] Decomposing Gal with order
[2026-05-24 08:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:14:22] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 08:14:22] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:14:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2851730221549741883.gal : 1 ms
[2026-05-24 08:14:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12156731010248869281.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/CTLFireability2851730221549741883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12156731010248869281.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,1.46461e+12,0.086841,7992,1250,43,7927,331,432,8682,52,794,0


Converting to forward existential form...Done !
original formula: (EX((i8.u4.p9==0)) * AG(EF((((A((i12.u31.p115==1) U (i15.u49.p180==1)) + (i16.u59.p222==1)) * (i13.u33.p102==0)) * ((u22.p67==1)||(i14.u4...170
=> equivalent forward existential formula: ([(Init * !(EX((i8.u4.p9==0))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (((!((E(!((i15.u49.p180==1)) U (!((i12...315
Reverse transition relation is NOT exact ! Due to transitions t99, t105, t111, i0.u53.t30, i1.u48.t43, i2.u21.t94, i2.u23.t90, i3.t115, i3.u6.t121, i3.u8.t...579
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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
(forward)formula 0,0,3.53477,132400,1,0,258587,1342,2727,491077,252,7957,370201
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Graph (trivial) has 118 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 413 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 213 transition count 139
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 174 transition count 138
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 80 place count 174 transition count 104
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 155 place count 133 transition count 104
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 175 place count 113 transition count 84
Iterating global reduction 3 with 20 rules applied. Total rules applied 195 place count 113 transition count 84
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 287 place count 66 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 65 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 64 transition count 38
Applied a total of 289 rules in 15 ms. Remains 64 /221 variables (removed 157) and now considering 38/186 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11374123865501121360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12142569014076536308.kers'
[2026-05-24 08:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11374123865501121360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12142569014076536308.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 37 rows 43 cols 105 entries
Finished phase 1 with 34 SingleSign rule and 3 generalized
[2026-05-24 08:14:25] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12142569014076536308.kers
Total runtime 2 ms.
[2026-05-24 08:14:25] [INFO ] Implicit Places using invariants in 53 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/221 places, 38/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 70 ms. Remains : 63/221 places, 38/186 transitions.
[2026-05-24 08:14:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:14:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:14:25] [INFO ] Input system was already deterministic with 38 transitions.
[2026-05-24 08:14:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:14:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7839185367307471586.gal : 0 ms
[2026-05-24 08:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17155719377646621232.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/CTLFireability7839185367307471586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17155719377646621232.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,1365,0.025476,4780,2,815,5,3079,6,0,286,3093,0


Converting to forward existential form...Done !
original formula: AG(A(((A((p121!=1) U EG((p157==1))) * (p50==1)) * (p53==1)) U EF((p85==1))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U (p85==1)))) * !(((!((E(!(EG((p157==1))) U (!((p121!=1)) * !(EG((p157==1)))))...297
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t18, t21, t36, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,0,0.134383,10324,1,0,79,31341,102,47,1750,24376,95
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 206 transition count 171
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 206 transition count 171
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 199 transition count 164
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 199 transition count 164
Applied a total of 44 rules in 13 ms. Remains 199 /221 variables (removed 22) and now considering 164/186 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3230925105631238822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12797119340318762836.kers'
[2026-05-24 08:14:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3230925105631238822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12797119340318762836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 199 cols 461 entries
Finished phase 1 with 149 SingleSign rule and 13 generalized
[2026-05-24 08:14:26] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12797119340318762836.kers
Total runtime 4 ms.
[2026-05-24 08:14:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 08:14:26] [INFO ] Invariant cache hit.
[2026-05-24 08:14:26] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-05-24 08:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 164/363 variables, 199/271 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 13 (OVERLAPS) 0/363 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 278 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18266 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 164/363 variables, 199/276 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 163/439 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 5/444 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 454 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 48291ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 48292ms
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 164/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48593 ms. Remains : 199/221 places, 164/186 transitions.
[2026-05-24 08:15:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:15:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:15:14] [INFO ] Input system was already deterministic with 164 transitions.
[2026-05-24 08:15:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:15:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:15:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14663504161244647275.gal : 1 ms
[2026-05-24 08:15:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12593875487253300694.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/CTLFireability14663504161244647275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12593875487253300694.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,1.56365e+12,0.316258,17116,2,13971,5,43519,6,0,960,39133,0


Converting to forward existential form...Done !
original formula: (EG(A(AX(AG((p170==1))) U ((A((p1==1) U (p241==1)) * EX((p6==1))) + ((EF((p127==1)) * ((p4==1)||(p186==1))) * EF((p46==1)))))) + E(E(((p2...245
=> equivalent forward existential formula: ([FwdG(Init,!((E(!(((!((E(!((p241==1)) U (!((p1==1)) * !((p241==1)))) + EG(!((p241==1))))) * EX((p6==1))) + ((E(...735
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t13, t19, t23, t25, t28, t33, t37, t40, t43, t46, t49, t53, t54, t56, t59, t62, t65, ...372
Detected timeout of ITS tools.
[2026-05-24 08:15:44] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:15:44] [INFO ] Applying decomposition
[2026-05-24 08:15:44] [INFO ] Flatten gal took : 2 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/graph13668673357148166620.txt' '-o' '/tmp/graph13668673357148166620.bin' '-w' '/tmp/graph13668673357148166620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13668673357148166620.bin' '-l' '-1' '-v' '-w' '/tmp/graph13668673357148166620.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:15:44] [INFO ] Decomposing Gal with order
[2026-05-24 08:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:15:44] [INFO ] Removed a total of 35 redundant transitions.
[2026-05-24 08:15:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 08:15:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15520201671576970554.gal : 1 ms
[2026-05-24 08:15:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6183145136431185071.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/CTLFireability15520201671576970554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6183145136431185071.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,1.56365e+12,0.124358,9824,1470,41,11697,301,484,17939,49,899,0


Converting to forward existential form...Done !
original formula: (EG(A(AX(AG((i13.u48.p170==1))) U ((A((i9.i1.u0.p1==1) U (i15.i1.u68.p241==1)) * EX((i0.u2.p6==1))) + ((EF((i8.i1.u39.p127==1)) * ((i9.i1...390
=> equivalent forward existential formula: ([FwdG(Init,!((E(!(((!((E(!((i15.i1.u68.p241==1)) U (!((i9.i1.u0.p1==1)) * !((i15.i1.u68.p241==1)))) + EG(!((i15...1066
Reverse transition relation is NOT exact ! Due to transitions t103, t107, t113, t119, i0.u24.t98, i0.u26.t94, i1.u20.t106, i1.u22.t102, i3.t123, i3.u6.t129...666
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 188 transition count 153
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 188 transition count 153
Applied a total of 66 rules in 6 ms. Remains 188 /221 variables (removed 33) and now considering 153/186 (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-13454611218373550839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13571534672403886709.kers'
[2026-05-24 08:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13454611218373550839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13571534672403886709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 188 cols 439 entries
Finished phase 1 with 138 SingleSign rule and 13 generalized
[2026-05-24 08:16:14] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13571534672403886709.kers
Total runtime 1 ms.
[2026-05-24 08:16:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 08:16:14] [INFO ] Invariant cache hit.
[2026-05-24 08:16:15] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-24 08:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 265 constraints, problems are : Problem set: 0 solved, 152 unsolved in 15193 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 432 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45216ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 45216ms
Starting structural reductions in LTL mode, iteration 1 : 188/221 places, 153/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45525 ms. Remains : 188/221 places, 153/186 transitions.
[2026-05-24 08:17:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:00] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-24 08:17:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14885948555469001434.gal : 1 ms
[2026-05-24 08:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14140776985569903156.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/CTLFireability14885948555469001434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14140776985569903156.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,1.46025e+12,0.297165,16016,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: AG((EF(EX((p141==1))) + E((p92==1) U ((AG((p136==1)) * EF((((p90==1)&&(p174==1))&&(p251==1)))) * ((p51==1)&&(p92==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E((p92==1) U ((!(E(TRUE U !((p136==1)))) * E(TRUE U (((p90==1)&&(p174==1))&&(p251==1)))) ...220
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
(forward)formula 0,0,7.47755,262432,1,0,377,858083,335,182,5235,722135,386
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 186/186 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 201 transition count 166
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 201 transition count 166
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 191 transition count 156
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 191 transition count 156
Applied a total of 60 rules in 6 ms. Remains 191 /221 variables (removed 30) and now considering 156/186 (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-14245863621346380078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7905348420270748308.kers'
[2026-05-24 08:17:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14245863621346380078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7905348420270748308.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 191 cols 445 entries
Finished phase 1 with 141 SingleSign rule and 13 generalized
[2026-05-24 08:17:07] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7905348420270748308.kers
Total runtime 1 ms.
[2026-05-24 08:17:07] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:17:07] [INFO ] Invariant cache hit.
[2026-05-24 08:17:08] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-05-24 08:17:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 156/347 variables, 191/262 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/347 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 265 constraints, problems are : Problem set: 0 solved, 155 unsolved in 13288 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/347 variables, 191/265 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 155/420 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 3/431 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 432 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43310ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 43310ms
Starting structural reductions in LTL mode, iteration 1 : 191/221 places, 156/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43579 ms. Remains : 191/221 places, 156/186 transitions.
[2026-05-24 08:17:51] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:51] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:51] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-24 08:17:51] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:51] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10332601249996488660.gal : 1 ms
[2026-05-24 08:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6727117020096305299.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/CTLFireability10332601249996488660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6727117020096305299.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.46888e+12,0.27756,16164,2,13161,5,40991,6,0,920,37231,0


Converting to forward existential form...Done !
original formula: E((((p26==1)&&(p134==1))&&(p218==1)) U E(((p108!=1)||(p151==1)) U ((E((p241==1) U (p78!=1)) * EX((((p18==1)&&(p129==1))&&(p212==1)))) * A...181
=> equivalent forward existential formula: [(((FwdU(FwdU(Init,(((p26==1)&&(p134==1))&&(p218==1))),((p108!=1)||(p151==1))) * (E((p241==1) U (p78!=1)) * EX((...278
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t18, t22, t27, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t67, t70, t73, t75, ...343
Detected timeout of ITS tools.
[2026-05-24 08:18:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:18:21] [INFO ] Applying decomposition
[2026-05-24 08:18:21] [INFO ] Flatten gal took : 2 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/graph8760983450722188688.txt' '-o' '/tmp/graph8760983450722188688.bin' '-w' '/tmp/graph8760983450722188688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8760983450722188688.bin' '-l' '-1' '-v' '-w' '/tmp/graph8760983450722188688.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:18:21] [INFO ] Decomposing Gal with order
[2026-05-24 08:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:18:21] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-24 08:18:21] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17885880720529599808.gal : 2 ms
[2026-05-24 08:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14409598547144992824.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/CTLFireability17885880720529599808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14409598547144992824.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.46888e+12,0.078926,7340,1089,44,6638,428,415,6912,45,1209,0


Converting to forward existential form...Done !
original formula: E((((i4.u9.p26==1)&&(i10.u41.p134==1))&&(i4.u58.p218==1)) U E(((i16.u37.p108!=1)||(i16.u45.p151==1)) U ((E((i17.u63.p241==1) U (u25.p78!=...265
=> equivalent forward existential formula: [(((FwdU(FwdU(Init,(((i4.u9.p26==1)&&(i10.u41.p134==1))&&(i4.u58.p218==1))),((i16.u37.p108!=1)||(i16.u45.p151==1...378
Reverse transition relation is NOT exact ! Due to transitions t95, t99, t105, t115, i0.u20.t98, i0.u24.t90, i1.u22.t94, i2.t111, i2.u6.t121, i2.u10.t114, i...571
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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,0,3.69372,140220,1,0,277605,1479,2933,494625,249,9022,405823
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-24 08:18:25] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:18:25] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:18:25] [INFO ] Applying decomposition
[2026-05-24 08:18:25] [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/graph13289598436478176548.txt' '-o' '/tmp/graph13289598436478176548.bin' '-w' '/tmp/graph13289598436478176548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13289598436478176548.bin' '-l' '-1' '-v' '-w' '/tmp/graph13289598436478176548.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:18:25] [INFO ] Decomposing Gal with order
[2026-05-24 08:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:18:25] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-24 08:18:25] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 08:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16393963369703149732.gal : 2 ms
[2026-05-24 08:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2572294226802645717.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/CTLFireability16393963369703149732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2572294226802645717.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,2.00972e+12,0.188294,11276,2172,60,14819,402,533,21123,58,1011,0


Converting to forward existential form...Done !
original formula: (EG(A(AX(AG((i13.i0.u51.p170==1))) U ((A((i0.i0.u0.p1==1) U (i15.u77.p241==1)) * EX((i1.u2.p6==1))) + ((EF((i11.i1.u41.p127==1)) * ((i0.i...369
=> equivalent forward existential formula: ([FwdG(Init,!((E(!(((!((E(!((i15.u77.p241==1)) U (!((i0.i0.u0.p1==1)) * !((i15.u77.p241==1)))) + EG(!((i15.u77.p...1021
Reverse transition relation is NOT exact ! Due to transitions t125, t131, t137, t143, i0.i0.u29.t108, i0.i1.u31.t104, i1.u25.t116, i1.u27.t112, i2.t121, i2...839
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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,0,36.5278,716684,1,0,1.1831e+06,2536,3407,2.2416e+06,306,22794,1597222
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 750839 ms.

BK_STOP 1779610742157

--------------------
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-02"
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-02, 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-177946842000458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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