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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Mar 5 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 5 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 18:44 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.9K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 85K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779611290088

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 08:28:11] [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:28:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:28:11] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-24 08:28:11] [INFO ] Transformed 368 places.
[2026-05-24 08:28:11] [INFO ] Transformed 319 transitions.
[2026-05-24 08:28:11] [INFO ] Found NUPN structural information;
[2026-05-24 08:28:11] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Support contains 95 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 324 transition count 277
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 324 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 324 transition count 276
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 307 transition count 259
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 307 transition count 259
Applied a total of 119 rules in 79 ms. Remains 307 /367 variables (removed 60) and now considering 259/318 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13376763737372939996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13301127867971165412.kers'
[2026-05-24 08:28:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13376763737372939996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13301127867971165412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 307 cols 732 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-24 08:28:11] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13301127867971165412.kers
Total runtime 2 ms.
[2026-05-24 08:28:11] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-24 08:28:11] [INFO ] Invariant cache hit.
[2026-05-24 08:28:12] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-24 08:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 259/566 variables, 307/435 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 443 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 81/136 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 259/566 variables, 307/446 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 258/704 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 15/719 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 731 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 307/367 places, 259/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60963 ms. Remains : 307/367 places, 259/318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Applied a total of 0 rules in 9 ms. Remains 307 /307 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2026-05-24 08:29:12] [INFO ] Invariant cache hit.
[2026-05-24 08:29:12] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 08:29:12] [INFO ] Invariant cache hit.
[2026-05-24 08:29:12] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 307/307 places, 259/259 transitions.
Support contains 95 out of 307 places after structural reductions.
[2026-05-24 08:29:13] [INFO ] Flatten gal took : 42 ms
[2026-05-24 08:29:13] [INFO ] Flatten gal took : 19 ms
[2026-05-24 08:29:13] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 93 out of 307 places (down from 95) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (370 resets) in 1526 ms. (26 steps per ms) remains 17/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
[2026-05-24 08:29:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 139/166 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 122/288 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 247/535 variables, 288/356 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 11 (OVERLAPS) 29/564 variables, 18/382 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/382 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 13 (OVERLAPS) 2/566 variables, 1/383 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 5/388 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/388 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/388 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 388 constraints, problems are : Problem set: 3 solved, 14 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 93/112 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/23 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 174/286 variables, 39/62 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 13/75 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 245/531 variables, 286/361 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 11/372 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 2/374 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 3/377 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 33/564 variables, 20/397 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 3/400 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 4/404 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 12/416 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 1/417 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 2/419 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 0/419 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 2/566 variables, 1/420 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/566 variables, 2/422 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 423 constraints, problems are : Problem set: 3 solved, 14 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 14/17 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 9320ms problems are : Problem set: 3 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (complete) has 639 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 306 transition count 222
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 271 transition count 219
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 268 transition count 219
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 78 place count 268 transition count 167
Deduced a syphon composed of 52 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 115 rules applied. Total rules applied 193 place count 205 transition count 167
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 213 place count 185 transition count 147
Iterating global reduction 3 with 20 rules applied. Total rules applied 233 place count 185 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 233 place count 185 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 183 transition count 146
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 384 place count 109 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 109 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 108 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 107 transition count 70
Applied a total of 387 rules in 57 ms. Remains 107 /307 variables (removed 200) and now considering 70/259 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 107/307 places, 70/259 transitions.
RANDOM walk for 40000 steps (8 resets) in 826 ms. (48 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5955575459771351345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11815272332458506377.kers'
[2026-05-24 08:29:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5955575459771351345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11815272332458506377.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 70 rows 82 cols 237 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-24 08:29:23] [INFO ] Computed 43 invariants in 0 ms
Computed 43 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11815272332458506377.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/60 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/126 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 50/176 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/177 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/177 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/60 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/126 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 50/176 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/177 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/177 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-24 08:29:23] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:29:23] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:29:23] [INFO ] Input system was already deterministic with 259 transitions.
Computed a total of 301 stabilizing places and 251 stable transitions
Graph (complete) has 639 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (trivial) has 166 edges and 307 vertex of which 6 / 307 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 633 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 300 transition count 207
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 256 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 90 place count 256 transition count 156
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 113 rules applied. Total rules applied 203 place count 194 transition count 156
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 232 place count 165 transition count 127
Iterating global reduction 2 with 29 rules applied. Total rules applied 261 place count 165 transition count 127
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 261 place count 165 transition count 123
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 272 place count 158 transition count 123
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 406 place count 91 transition count 56
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 408 place count 90 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 89 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 410 place count 88 transition count 54
Applied a total of 410 rules in 36 ms. Remains 88 /307 variables (removed 219) and now considering 54/259 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8419491908125549907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14676808059413199000.kers'
[2026-05-24 08:29:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8419491908125549907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14676808059413199000.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 53 rows 62 cols 183 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-24 08:29:24] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14676808059413199000.kers
Total runtime 1 ms.
[2026-05-24 08:29:24] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 08:29:24] [INFO ] Invariant cache hit.
[2026-05-24 08:29:24] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [0, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 182 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/307 places, 54/259 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 3 place count 60 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 57 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 55 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 55 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 53 transition count 47
Applied a total of 14 rules in 6 ms. Remains 53 /60 variables (removed 7) and now considering 47/54 (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-6869397918280083457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10435970949944136240.kers'
[2026-05-24 08:29:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6869397918280083457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10435970949944136240.kers]
Normalized transition count is 46 out of 47 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 53 cols 152 entries
Finished phase 1 with 39 SingleSign rule and 2 generalized
[2026-05-24 08:29:24] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10435970949944136240.kers
Total runtime 0 ms.
[2026-05-24 08:29:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 08:29:24] [INFO ] Invariant cache hit.
[2026-05-24 08:29:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/307 places, 47/259 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 329 ms. Remains : 53/307 places, 47/259 transitions.
[2026-05-24 08:29:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:29:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:29:24] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-24 08:29:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:29:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2288954293357311144.gal : 1 ms
[2026-05-24 08:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1189502701601529114.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/CTLFireability2288954293357311144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1189502701601529114.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,246,0.02064,4228,2,292,5,1284,6,0,258,988,0


Converting to forward existential form...Done !
original formula: AF(E(AG(EF((((p56==1)&&(p194==1))&&(p310==1)))) U (AG((p148==1)) * EG(AG((((p22==1)&&(p159==1))&&(p280==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !(E(TRUE U (((p56==1)&&(p194==1))&&(p310==1)))))) U (!(E(TRUE U !((p148==1)))) * EG(!(...217
Reverse transition relation is NOT exact ! Due to transitions t2, t36, t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.062107,6300,1,0,81,9195,127,56,1703,7590,124
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 280 transition count 232
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 280 transition count 232
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 272 transition count 224
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 272 transition count 224
Applied a total of 70 rules in 22 ms. Remains 272 /307 variables (removed 35) and now considering 224/259 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7835539588552797304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11461012016080749459.kers'
[2026-05-24 08:29:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7835539588552797304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11461012016080749459.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 272 cols 662 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 08:29:24] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11461012016080749459.kers
Total runtime 1 ms.
[2026-05-24 08:29:24] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 08:29:24] [INFO ] Invariant cache hit.
[2026-05-24 08:29:25] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-24 08:29:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/496 variables, 272/357 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 9/366 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 368 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/376 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/599 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 19/618 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/624 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 272/307 places, 224/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60726 ms. Remains : 272/307 places, 224/259 transitions.
[2026-05-24 08:30:25] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:30:25] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:30:25] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-24 08:30:25] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:30:25] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8210420980100819898.gal : 3 ms
[2026-05-24 08:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2986765039345536989.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/CTLFireability8210420980100819898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2986765039345536989.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.4392e+17,4.23159,122820,2,53702,5,287822,6,0,1312,684002,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:30:55] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:30:55] [INFO ] Applying decomposition
[2026-05-24 08:30:55] [INFO ] Flatten gal took : 8 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/graph16004505013506782650.txt' '-o' '/tmp/graph16004505013506782650.bin' '-w' '/tmp/graph16004505013506782650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16004505013506782650.bin' '-l' '-1' '-v' '-w' '/tmp/graph16004505013506782650.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:30:55] [INFO ] Decomposing Gal with order
[2026-05-24 08:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:30:55] [INFO ] Removed a total of 67 redundant transitions.
[2026-05-24 08:30:55] [INFO ] Flatten gal took : 64 ms
[2026-05-24 08:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 08:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15486951222113960532.gal : 6 ms
[2026-05-24 08:30:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15503870555306118855.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/CTLFireability15486951222113960532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15503870555306118855.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.4392e+17,0.378326,17704,2542,38,22556,498,582,52952,43,1606,0


Converting to forward existential form...Done !
original formula: (EF(((AF((i1.i1.u29.p94==1)) * EF(((i17.u49.p148==0)&&(i0.i1.u77.p367==0)))) + (EG(((i0.i1.u76.p283==1) * EF((i0.i1.u76.p298==1)))) * (i0...303
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EG(!((i1.i1.u29.p94==1))))),TRUE) * ((i17.u49.p148==0)&&(i0.i1.u77.p367==0)))] != ...617
Reverse transition relation is NOT exact ! Due to transitions t154, t158, t163, t202, t204, t206, t215, i0.i0.u43.t99, i0.i1.u76.t11, i0.i1.u76.t18, i0.i1....945
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (trivial) has 172 edges and 307 vertex of which 6 / 307 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 633 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 300 transition count 204
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 253 transition count 204
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 96 place count 253 transition count 151
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 215 place count 187 transition count 151
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 243 place count 159 transition count 123
Iterating global reduction 2 with 28 rules applied. Total rules applied 271 place count 159 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 271 place count 159 transition count 119
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 282 place count 152 transition count 119
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 418 place count 84 transition count 51
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 420 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 81 transition count 49
Applied a total of 422 rules in 28 ms. Remains 81 /307 variables (removed 226) and now considering 49/259 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1747917755010379057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9206168888940555173.kers'
[2026-05-24 08:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1747917755010379057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9206168888940555173.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 0 ms.
// Phase 1: matrix 48 rows 49 cols 153 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 08:31:25] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9206168888940555173.kers
Total runtime 1 ms.
[2026-05-24 08:31:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 08:31:25] [INFO ] Invariant cache hit.
[2026-05-24 08:31:25] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 172 ms to find 33 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/307 places, 49/259 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 6 place count 48 transition count 43
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 42 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 39 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 39 transition count 40
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 39 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 38 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 37 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 37 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 26 place count 35 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 35 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 35 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 29 place count 34 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 30 place count 34 transition count 34
Applied a total of 30 rules in 14 ms. Remains 34 /48 variables (removed 14) and now considering 34/49 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8679004147497269254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13454557320885377834.kers'
[2026-05-24 08:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8679004147497269254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13454557320885377834.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 34 cols 94 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-24 08:31:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13454557320885377834.kers
Total runtime 1 ms.
[2026-05-24 08:31:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 08:31:25] [INFO ] Invariant cache hit.
[2026-05-24 08:31:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/307 places, 34/259 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 286 ms. Remains : 34/307 places, 34/259 transitions.
[2026-05-24 08:31:25] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:31:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:31:25] [INFO ] Input system was already deterministic with 34 transitions.
[2026-05-24 08:31:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:31:25] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:31:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1659111310650764215.gal : 1 ms
[2026-05-24 08:31:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14832898266169688131.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/CTLFireability1659111310650764215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14832898266169688131.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,116,0.008262,4160,2,150,5,756,6,0,168,771,0


Converting to forward existential form...Done !
original formula: AG(!(A(EF((p92==1)) U EF(EG((p153==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(E(TRUE U EG((p153==1))))))) * !(E(!(E(TRUE U EG((p153==1)))) U (!(E(TRUE U (p92==1))...198
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t21, t23, t24, t25, t29, t31, Intersection with reachable at each step enabled. (des...197
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.04005,5748,1,0,120,8651,101,86,1087,9016,158
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 278 transition count 230
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 278 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 269 transition count 221
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 269 transition count 221
Applied a total of 76 rules in 9 ms. Remains 269 /307 variables (removed 38) and now considering 221/259 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12460730451371471287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17788868854586494097.kers'
[2026-05-24 08:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12460730451371471287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17788868854586494097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:31:25] [INFO ] Computed 55 invariants in 0 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17788868854586494097.kers
Total runtime 1 ms.
[2026-05-24 08:31:25] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 08:31:25] [INFO ] Invariant cache hit.
[2026-05-24 08:31:26] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:31:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 359 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/490 variables, 269/372 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 220/592 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 11/603 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 5/608 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60050ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 269/307 places, 221/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60656 ms. Remains : 269/307 places, 221/259 transitions.
[2026-05-24 08:32:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:32:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:32:26] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 08:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:32:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6656887644513994345.gal : 2 ms
[2026-05-24 08:32:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9697842020927775280.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/CTLFireability6656887644513994345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9697842020927775280.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.45205e+17,3.69782,102720,2,45976,5,250533,6,0,1297,565502,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:32:56] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:32:56] [INFO ] Applying decomposition
[2026-05-24 08:32:56] [INFO ] Flatten gal took : 8 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/graph9389629479820142401.txt' '-o' '/tmp/graph9389629479820142401.bin' '-w' '/tmp/graph9389629479820142401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9389629479820142401.bin' '-l' '-1' '-v' '-w' '/tmp/graph9389629479820142401.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:32:56] [INFO ] Decomposing Gal with order
[2026-05-24 08:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:32:56] [INFO ] Removed a total of 73 redundant transitions.
[2026-05-24 08:32:56] [INFO ] Flatten gal took : 14 ms
[2026-05-24 08:32:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2026-05-24 08:32:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3723548628034320032.gal : 3 ms
[2026-05-24 08:32:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3088266633559181892.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/CTLFireability3723548628034320032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3088266633559181892.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.45205e+17,0.241239,13604,2540,26,17137,361,564,31409,35,753,0


Converting to forward existential form...Done !
original formula: EG(AG((EF((i19.u71.p139==1)) + EX((i11.u27.p84==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((E(TRUE U (i19.u71.p139==1)) + EX((i11.u27.p84==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t151, t155, t160, t199, t202, t203, t206, t212, i0.u42.t98, i1.i0.u36.t110, i1.i1.u73.t36, i1...859
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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,2.34148,99684,1,0,205631,361,3664,309551,182,753,530988
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-03 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 : 307/307 places, 259/259 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 281 transition count 233
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 281 transition count 233
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 272 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 272 transition count 224
Applied a total of 70 rules in 10 ms. Remains 272 /307 variables (removed 35) and now considering 224/259 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4713099214620396995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13463775440329371470.kers'
[2026-05-24 08:32:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4713099214620396995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13463775440329371470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 272 cols 662 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 08:32:59] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13463775440329371470.kers
Total runtime 4 ms.
[2026-05-24 08:32:59] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 08:32:59] [INFO ] Invariant cache hit.
[2026-05-24 08:32:59] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-24 08:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 367 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/591 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 19/610 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 60036ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 272/307 places, 224/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 272/307 places, 224/259 transitions.
[2026-05-24 08:33:59] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:33:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:33:59] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-24 08:33:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:33:59] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:33:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8712525918024526839.gal : 1 ms
[2026-05-24 08:33:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9058448430057655247.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/CTLFireability8712525918024526839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9058448430057655247.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.49372e+17,3.59222,103528,2,43841,5,245738,6,0,1312,562737,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:34:29] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:34:29] [INFO ] Applying decomposition
[2026-05-24 08:34:29] [INFO ] Flatten gal took : 8 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/graph11164828839268105603.txt' '-o' '/tmp/graph11164828839268105603.bin' '-w' '/tmp/graph11164828839268105603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11164828839268105603.bin' '-l' '-1' '-v' '-w' '/tmp/graph11164828839268105603.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:34:29] [INFO ] Decomposing Gal with order
[2026-05-24 08:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:34:29] [INFO ] Removed a total of 68 redundant transitions.
[2026-05-24 08:34:29] [INFO ] Flatten gal took : 22 ms
[2026-05-24 08:34:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-24 08:34:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15272257929422086972.gal : 4 ms
[2026-05-24 08:34:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8198877962400443115.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/CTLFireability15272257929422086972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8198877962400443115.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.49372e+17,0.18124,11204,1837,30,13155,488,597,22286,45,1225,0


Converting to forward existential form...Done !
original formula: AG((EX((u83.p307==0)) + (((EF((i1.u31.p102==1)) * EX((i12.i1.u67.p227==1))) * (AX((i12.i2.u69.p232==1)) * AF(EG((((i9.u29.p95==1)&&(i13.u...301
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !(EX((u83.p307==0)))) * !(E(TRUE U (i1.u31.p102==1))))] = FALSE * [((FwdU(Init,TRUE) * !...595
Reverse transition relation is NOT exact ! Due to transitions t154, t158, t163, t206, t215, u83.t14, u83.t15, i0.i0.t103, i0.i0.u36.t110, i0.i0.u38.t106, i...899
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,1.44407,62672,1,0,128755,488,3539,188885,200,1225,301991
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 286 transition count 238
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 286 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 280 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 280 transition count 232
Applied a total of 54 rules in 11 ms. Remains 280 /307 variables (removed 27) and now considering 232/259 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1305095355317254317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17514966530704102192.kers'
[2026-05-24 08:34:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1305095355317254317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17514966530704102192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 280 cols 678 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-24 08:34:31] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17514966530704102192.kers
Total runtime 3 ms.
[2026-05-24 08:34:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 08:34:31] [INFO ] Invariant cache hit.
[2026-05-24 08:34:32] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 08:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 232/512 variables, 280/370 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 385 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 232/512 variables, 280/401 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 231/632 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 13/645 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 653 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 280/307 places, 232/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60696 ms. Remains : 280/307 places, 232/259 transitions.
[2026-05-24 08:35:32] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:35:32] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:35:32] [INFO ] Input system was already deterministic with 232 transitions.
[2026-05-24 08:35:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:35:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:35:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18059642605479669435.gal : 2 ms
[2026-05-24 08:35:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1133209377680876029.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/CTLFireability18059642605479669435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1133209377680876029.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.48378e+17,3.643,98092,2,42882,5,238975,6,0,1352,530025,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:36:02] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:36:02] [INFO ] Applying decomposition
[2026-05-24 08:36: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/graph8091668430514245885.txt' '-o' '/tmp/graph8091668430514245885.bin' '-w' '/tmp/graph8091668430514245885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8091668430514245885.bin' '-l' '-1' '-v' '-w' '/tmp/graph8091668430514245885.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:36:02] [INFO ] Decomposing Gal with order
[2026-05-24 08:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:36:02] [INFO ] Removed a total of 70 redundant transitions.
[2026-05-24 08:36:02] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-24 08:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10834787040276877421.gal : 2 ms
[2026-05-24 08:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6710501345895983386.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/CTLFireability10834787040276877421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6710501345895983386.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.48378e+17,0.395818,18160,2243,23,23889,328,603,45469,39,862,0


Converting to forward existential form...Done !
original formula: (!(E(((i1.i1.u100.p367==1) * EX((i6.i1.u20.p52!=1))) U AX(EG((i12.i0.u27.p77==1))))) * AG(((((i18.u83.p288==0) * ((i16.i1.u59.p167==0) + ...335
=> equivalent forward existential formula: ([(FwdU(Init,((i1.i1.u100.p367==1) * EX((i6.i1.u20.p52!=1)))) * !(EX(!(EG((i12.i0.u27.p77==1))))))] = FALSE * ([...592
Reverse transition relation is NOT exact ! Due to transitions t107, t160, t210, t212, i0.i1.u42.t110, i0.i1.u44.t106, i1.i0.u46.t103, i1.i1.u80.t29, i1.i1....1000
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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,3.45171,115424,1,0,214151,328,4307,361474,191,904,481340
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 278 transition count 230
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 278 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 269 transition count 221
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 269 transition count 221
Applied a total of 76 rules in 9 ms. Remains 269 /307 variables (removed 38) and now considering 221/259 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17586176041270926748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13667180571065750105.kers'
[2026-05-24 08:36:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17586176041270926748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13667180571065750105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:36:05] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13667180571065750105.kers
Total runtime 5 ms.
[2026-05-24 08:36:05] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 08:36:05] [INFO ] Invariant cache hit.
[2026-05-24 08:36:06] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:36:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/490 variables, 269/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 377 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 49/104 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/380 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 220/600 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 12/612 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 14/626 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60048ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 269/307 places, 221/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 269/307 places, 221/259 transitions.
[2026-05-24 08:37:06] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:37:06] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:37:06] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 08:37:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:37:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1983427350501558029.gal : 1 ms
[2026-05-24 08:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15910529430526248904.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/CTLFireability1983427350501558029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15910529430526248904.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.41961e+17,3.783,111372,2,43258,5,266115,6,0,1297,597508,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:37:36] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:37:36] [INFO ] Applying decomposition
[2026-05-24 08:37:36] [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/graph18300210244752842819.txt' '-o' '/tmp/graph18300210244752842819.bin' '-w' '/tmp/graph18300210244752842819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18300210244752842819.bin' '-l' '-1' '-v' '-w' '/tmp/graph18300210244752842819.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:37:36] [INFO ] Decomposing Gal with order
[2026-05-24 08:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:37:36] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:37:36] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 08:37:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15795866040511334002.gal : 2 ms
[2026-05-24 08:37:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9262226607509837309.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/CTLFireability15795866040511334002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9262226607509837309.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.41961e+17,0.258441,14224,2096,29,16832,330,537,40327,43,710,0


Converting to forward existential form...Done !
original formula: EG(E(EX(!(AF((i19.i1.u72.p260==1)))) U (i4.u81.p307==1)))
=> equivalent forward existential formula: [FwdG(Init,E(EX(!(!(EG(!((i19.i1.u72.p260==1)))))) U (i4.u81.p307==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t101, t151, t160, t199, t201, t202, t203, t212, i0.u39.t104, i0.u58.t77, i1.u35.t112, i1.u37....850
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 277 transition count 229
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 277 transition count 229
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 267 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 267 transition count 219
Applied a total of 80 rules in 16 ms. Remains 267 /307 variables (removed 40) and now considering 219/259 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2655875333674718946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16979475169998146543.kers'
[2026-05-24 08:38:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2655875333674718946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16979475169998146543.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 267 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 08:38:06] [INFO ] Computed 55 invariants in 2 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16979475169998146543.kers
Total runtime 3 ms.
[2026-05-24 08:38:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-24 08:38:06] [INFO ] Invariant cache hit.
[2026-05-24 08:38:07] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 08:38:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 358 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/586 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 19/625 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 632 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 267/307 places, 219/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 267/307 places, 219/259 transitions.
[2026-05-24 08:39:07] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:39:07] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:39:07] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-24 08:39:07] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:39:07] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:39:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5079805805965133084.gal : 1 ms
[2026-05-24 08:39:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12227477846463432728.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/CTLFireability5079805805965133084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12227477846463432728.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.41012e+17,3.02739,95044,2,39435,5,233790,6,0,1287,522191,0


Converting to forward existential form...Done !
original formula: EF((((AG((((p68==1)&&(p219==1))&&(p320==1))) * AX((p23==1))) * ((p68==1)&&(p219==1))) * (p320==1)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p320==1)) * ((p68==1)&&(p219==1))) * !(E(TRUE U !((((p68==1)&&(p219==1))&&(p320==1))))))...187
Reverse transition relation is NOT exact ! Due to transitions t23, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t60, t63, t66, t69, t72, t75, t78, t81...460
Detected timeout of ITS tools.
[2026-05-24 08:39:37] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:39:37] [INFO ] Applying decomposition
[2026-05-24 08:39:37] [INFO ] Flatten gal took : 9 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/graph16391078852778204091.txt' '-o' '/tmp/graph16391078852778204091.bin' '-w' '/tmp/graph16391078852778204091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16391078852778204091.bin' '-l' '-1' '-v' '-w' '/tmp/graph16391078852778204091.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:39:37] [INFO ] Decomposing Gal with order
[2026-05-24 08:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:39:37] [INFO ] Removed a total of 70 redundant transitions.
[2026-05-24 08:39:37] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-24 08:39:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11453528274414688765.gal : 3 ms
[2026-05-24 08:39:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13364075834575185540.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/CTLFireability11453528274414688765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13364075834575185540.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.41012e+17,0.171603,10960,1788,28,12096,341,556,21137,38,758,0


Converting to forward existential form...Done !
original formula: EF((((AG((((i17.i0.u20.p68==1)&&(i17.i1.u65.p219==1))&&(i17.i0.u83.p320==1))) * AX((i4.i1.u9.p23==1))) * ((i17.i0.u20.p68==1)&&(i17.i1.u6...192
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (i17.i0.u83.p320==1)) * ((i17.i0.u20.p68==1)&&(i17.i1.u65.p219==1))) * !(E(TRUE U !((((i1...262
Reverse transition relation is NOT exact ! Due to transitions t149, t153, t197, t199, t200, t201, t204, t210, i0.t99, i0.u36.t106, i0.u38.t102, i1.u28.t122...848
(forward)formula 0,0,1.1757,58560,1,0,111083,341,3434,169914,167,758,272482
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (complete) has 639 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 305 transition count 216
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 264 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 262 transition count 214
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 87 place count 262 transition count 159
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 209 place count 195 transition count 159
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 237 place count 167 transition count 131
Iterating global reduction 3 with 28 rules applied. Total rules applied 265 place count 167 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 265 place count 167 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 161 transition count 127
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 407 place count 95 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 408 place count 95 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 94 transition count 59
Applied a total of 409 rules in 41 ms. Remains 94 /307 variables (removed 213) and now considering 59/259 (removed 200) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2934491860008294055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8473565534014746068.kers'
[2026-05-24 08:39:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2934491860008294055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8473565534014746068.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 59 rows 91 cols 286 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 08:39:38] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8473565534014746068.kers
Total runtime 2 ms.
[2026-05-24 08:39:38] [INFO ] Implicit Places using invariants in 76 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 93/307 places, 59/259 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 121 ms. Remains : 93/307 places, 59/259 transitions.
[2026-05-24 08:39:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:39:38] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:39:38] [INFO ] Input system was already deterministic with 59 transitions.
[2026-05-24 08:39:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:39:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16164402643064381539.gal : 1 ms
[2026-05-24 08:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14393059318150768069.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/CTLFireability16164402643064381539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14393059318150768069.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,1100,0.044285,5964,2,1280,5,6019,6,0,430,7180,0


Converting to forward existential form...Done !
original formula: E((p246==1) U EF((EG(A((p63==1) U (((p81==1)&&(p239==1))&&(p331==1)))) + E(E((((p127==1)&&(p193==1))&&(p367==1)) U (p153==1)) U AF((p207=...163
=> equivalent forward existential formula: ([FwdG(FwdU(FwdU(Init,(p246==1)),TRUE),!((E(!((((p81==1)&&(p239==1))&&(p331==1))) U (!((p63==1)) * !((((p81==1)&...365
Hit Full ! (commute/partial/dont) 57/0/2
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t18, t22, t29, t31, t38, t39, t40, Intersection with reachable at each step enab...207
(forward)formula 0,1,0.631081,27796,1,0,294,97830,172,164,3037,113804,359
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 278 transition count 230
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 278 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 269 transition count 221
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 269 transition count 221
Applied a total of 76 rules in 17 ms. Remains 269 /307 variables (removed 38) and now considering 221/259 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15404422510794386322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14440014000260511981.kers'
[2026-05-24 08:39:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15404422510794386322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14440014000260511981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:39:39] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14440014000260511981.kers
Total runtime 14 ms.
[2026-05-24 08:39:39] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 08:39:39] [INFO ] Invariant cache hit.
[2026-05-24 08:39:40] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:39:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/352 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 7/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 362 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 37/92 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/372 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/592 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/609 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 17/626 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60046ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 269/307 places, 221/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60826 ms. Remains : 269/307 places, 221/259 transitions.
[2026-05-24 08:40:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:40:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:40:40] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 08:40:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:40:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17816947946700979279.gal : 1 ms
[2026-05-24 08:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8341306343882025641.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/CTLFireability17816947946700979279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8341306343882025641.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.45787e+17,3.61695,98500,2,42035,5,241448,6,0,1297,539954,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:41:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:41:10] [INFO ] Applying decomposition
[2026-05-24 08:41:10] [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/graph15594066097417396735.txt' '-o' '/tmp/graph15594066097417396735.bin' '-w' '/tmp/graph15594066097417396735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15594066097417396735.bin' '-l' '-1' '-v' '-w' '/tmp/graph15594066097417396735.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:41:10] [INFO ] Decomposing Gal with order
[2026-05-24 08:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:41:10] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:41:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 08:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3724912381611283906.gal : 2 ms
[2026-05-24 08:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6129684177854458268.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/CTLFireability3724912381611283906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6129684177854458268.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.45787e+17,0.258809,12912,1912,30,16217,352,568,27619,43,818,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(EF(((i8.i0.u25.p80==1)||(i17.i1.u57.p182==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(E(TRUE U ((i8.i0.u25.p80==1)||(i17.i1.u57.p182==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t151, t160, t199, t202, t203, t206, i0.u72.t36, i0.u73.t33, i1.u27.t127, i1.u33.t115, i2.u23....888
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,11.4686,273452,1,0,481270,352,3931,777751,212,818,611571
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (trivial) has 172 edges and 307 vertex of which 6 / 307 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 633 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 300 transition count 204
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 253 transition count 204
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 96 place count 253 transition count 150
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 217 place count 186 transition count 150
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 245 place count 158 transition count 122
Iterating global reduction 2 with 28 rules applied. Total rules applied 273 place count 158 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 273 place count 158 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 284 place count 151 transition count 118
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 418 place count 84 transition count 51
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 420 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 81 transition count 49
Applied a total of 422 rules in 32 ms. Remains 81 /307 variables (removed 226) and now considering 49/259 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14845246395925638603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11915913230098956322.kers'
[2026-05-24 08:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14845246395925638603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11915913230098956322.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 176 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 08:41:22] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11915913230098956322.kers
Total runtime 0 ms.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 08:41:22] [INFO ] Invariant cache hit.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 197 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/307 places, 49/259 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 53 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 45 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 40 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 40 transition count 36
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 2 with 3 rules applied. Total rules applied 29 place count 40 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 37 transition count 33
Applied a total of 32 rules in 4 ms. Remains 37 /53 variables (removed 16) and now considering 33/49 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17125433776385480300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5062533752367546861.kers'
[2026-05-24 08:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17125433776385480300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5062533752367546861.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 32 rows 32 cols 95 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-24 08:41:22] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5062533752367546861.kers
Total runtime 0 ms.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 08:41:22] [INFO ] Invariant cache hit.
[2026-05-24 08:41:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [3, 7, 9, 10, 11]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 89 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 32/307 places, 33/259 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 31 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 32
Applied a total of 2 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 32/33 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5293278452410030636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9370581625332302012.kers'
[2026-05-24 08:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5293278452410030636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9370581625332302012.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 31 rows 28 cols 81 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-24 08:41:22] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9370581625332302012.kers
Total runtime 1 ms.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 08:41:22] [INFO ] Invariant cache hit.
[2026-05-24 08:41:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 31/307 places, 32/259 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 396 ms. Remains : 31/307 places, 32/259 transitions.
[2026-05-24 08:41:22] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:41:22] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:41:22] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-24 08:41:22] [INFO ] Flatten gal took : 0 ms
[2026-05-24 08:41:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:41:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12931469517043951200.gal : 0 ms
[2026-05-24 08:41:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3259337600236880306.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/CTLFireability12931469517043951200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3259337600236880306.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,54,0.007498,4036,2,93,5,523,6,0,147,430,0


Converting to forward existential form...Done !
original formula: EF(((p277==1) * AG((p11==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p277==1)) * !(E(TRUE U !((p11==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,1,0.016329,4632,1,0,47,1834,86,33,887,1439,74
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 280 transition count 232
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 280 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 271 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 271 transition count 223
Applied a total of 72 rules in 9 ms. Remains 271 /307 variables (removed 36) and now considering 223/259 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15274196217557172364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7794300302429866552.kers'
[2026-05-24 08:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15274196217557172364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7794300302429866552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 271 cols 660 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-24 08:41:22] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7794300302429866552.kers
Total runtime 2 ms.
[2026-05-24 08:41:22] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 08:41:22] [INFO ] Invariant cache hit.
[2026-05-24 08:41:23] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-24 08:41:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 223/494 variables, 271/358 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 363 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/494 variables, 271/362 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 222/584 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 20/604 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 13/617 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 618 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 271/307 places, 223/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 271/307 places, 223/259 transitions.
[2026-05-24 08:42:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:42:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:42:23] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-24 08:42:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:42:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:42:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3830842143459805657.gal : 1 ms
[2026-05-24 08:42:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13385606657969724779.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/CTLFireability3830842143459805657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13385606657969724779.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.44762e+17,3.37172,101420,2,40982,5,245739,6,0,1307,561174,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:42:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:42:53] [INFO ] Applying decomposition
[2026-05-24 08:42:53] [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/graph6745324771716267287.txt' '-o' '/tmp/graph6745324771716267287.bin' '-w' '/tmp/graph6745324771716267287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6745324771716267287.bin' '-l' '-1' '-v' '-w' '/tmp/graph6745324771716267287.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:42:53] [INFO ] Decomposing Gal with order
[2026-05-24 08:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:42:53] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:42:53] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-24 08:42:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9414447191306750186.gal : 3 ms
[2026-05-24 08:42:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7860608798646920833.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/CTLFireability9414447191306750186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7860608798646920833.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.44762e+17,1.71241,60056,4785,28,84671,433,598,202336,41,1044,0


Converting to forward existential form...Done !
original formula: E(!((AX((i18.i1.u84.p303==1)) + (i0.u33.p104==1))) U EG((((!(EG(((i10.u75.p256==1)||(i4.i0.u23.p71==1)))) * (i19.i0.u14.p38==1)) * (AG((i...272
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((!(EX(!((i18.i1.u84.p303==1)))) + (i0.u33.p104==1)))),(((!(EG(((i10.u75.p256==1)||(i4.i0.u23.p...346
Reverse transition relation is NOT exact ! Due to transitions t152, t156, t201, t203, t204, t205, t208, i0.t102, i0.u33.t117, i0.u35.t113, i0.u39.t105, i1....909
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (trivial) has 170 edges and 307 vertex of which 6 / 307 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 633 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 300 transition count 204
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 253 transition count 204
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 96 place count 253 transition count 151
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 214 place count 188 transition count 151
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 241 place count 161 transition count 124
Iterating global reduction 2 with 27 rules applied. Total rules applied 268 place count 161 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 161 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 274 place count 157 transition count 122
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 416 place count 86 transition count 51
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 418 place count 85 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 419 place count 84 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 420 place count 83 transition count 49
Applied a total of 420 rules in 22 ms. Remains 83 /307 variables (removed 224) and now considering 49/259 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18441194533224949484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-90978259118927620.kers'
[2026-05-24 08:43:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18441194533224949484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-90978259118927620.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 48 rows 46 cols 149 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 08:43:23] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-90978259118927620.kers
Total runtime 2 ms.
[2026-05-24 08:43:23] [INFO ] Implicit Places using invariants in 133 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/307 places, 49/259 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 160 ms. Remains : 82/307 places, 49/259 transitions.
[2026-05-24 08:43:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:43:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:43:23] [INFO ] Input system was already deterministic with 49 transitions.
[2026-05-24 08:43:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:43:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13905132741208389226.gal : 1 ms
[2026-05-24 08:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3542550474308184568.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/CTLFireability13905132741208389226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3542550474308184568.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,67,0.022487,4592,2,288,5,1921,6,0,377,1804,0


Converting to forward existential form...Done !
original formula: (!(A(EG((p317==1)) U (p31==1))) * EF((p69==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((p31==1)) U (!(EG((p317==1))) * !((p31==1)))) + EG(!((p31==1))))))),TRUE) * (p69==1))] !...162
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t48, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.074002,6920,1,0,72,9508,127,65,2481,8098,145
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 278 transition count 230
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 278 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 269 transition count 221
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 269 transition count 221
Applied a total of 76 rules in 15 ms. Remains 269 /307 variables (removed 38) and now considering 221/259 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14182272183321007337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7463813485104436276.kers'
[2026-05-24 08:43:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14182272183321007337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7463813485104436276.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:43:23] [INFO ] Computed 55 invariants in 2 ms
Computed 55 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7463813485104436276.kers
Total runtime 3 ms.
[2026-05-24 08:43:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-24 08:43:23] [INFO ] Invariant cache hit.
[2026-05-24 08:43:24] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:43:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/490 variables, 269/352 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 363 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/591 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 13/604 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 16/620 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 60056ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 269/307 places, 221/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 269/307 places, 221/259 transitions.
[2026-05-24 08:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:44:24] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 08:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:44:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12685297474959841112.gal : 1 ms
[2026-05-24 08:44:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17674457645944317717.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/CTLFireability12685297474959841112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17674457645944317717.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.41012e+17,3.19841,95244,2,39733,5,234467,6,0,1297,523099,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:44:54] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:44:54] [INFO ] Applying decomposition
[2026-05-24 08:44:54] [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/graph13937991561946568540.txt' '-o' '/tmp/graph13937991561946568540.bin' '-w' '/tmp/graph13937991561946568540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13937991561946568540.bin' '-l' '-1' '-v' '-w' '/tmp/graph13937991561946568540.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:44:54] [INFO ] Decomposing Gal with order
[2026-05-24 08:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:44:54] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:44:54] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-24 08:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14855171149489540128.gal : 2 ms
[2026-05-24 08:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2115711829373396756.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/CTLFireability14855171149489540128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2115711829373396756.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.41012e+17,0.143329,10008,1652,27,11192,408,524,19260,38,1009,0


Converting to forward existential form...Done !
original formula: EF(AG(((i12.i2.u75.p367==1) + ((AX((((i3.u26.p81==0)||(i13.u68.p234==0))||(i3.u86.p331==0))) * EX((i8.i1.u49.p146==0))) * EG((i18.u79.p28...165
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i12.i2.u75.p367==1) + ((!(EX(!((((i3.u26.p81==0)||(i13.u68.p234==0))||(i3.u86...235
Reverse transition relation is NOT exact ! Due to transitions t151, t160, t199, t201, t202, t203, t206, i0.u71.t41, i0.u72.t38, i0.u73.t35, i0.u74.t32, i1....857
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,20.2797,479068,1,0,789137,408,3582,1.66744e+06,184,1009,889378
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Graph (trivial) has 166 edges and 307 vertex of which 6 / 307 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 633 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 300 transition count 207
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 256 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 90 place count 256 transition count 156
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 204 place count 193 transition count 156
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 230 place count 167 transition count 130
Iterating global reduction 2 with 26 rules applied. Total rules applied 256 place count 167 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 256 place count 167 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 161 transition count 126
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 404 place count 92 transition count 57
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 406 place count 91 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 90 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 89 transition count 55
Applied a total of 408 rules in 20 ms. Remains 89 /307 variables (removed 218) and now considering 55/259 (removed 204) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1683642703614241338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7673962962311461585.kers'
[2026-05-24 08:45:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1683642703614241338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7673962962311461585.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 54 rows 73 cols 220 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 08:45:14] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7673962962311461585.kers
Total runtime 1 ms.
[2026-05-24 08:45:15] [INFO ] Implicit Places using invariants in 67 ms returned [71, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/307 places, 55/259 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 92 ms. Remains : 87/307 places, 55/259 transitions.
[2026-05-24 08:45:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:45:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:45:15] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-24 08:45:15] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:45:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15393486647830542380.gal : 1 ms
[2026-05-24 08:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3862980287994314076.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/CTLFireability15393486647830542380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3862980287994314076.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,207,0.026949,4792,2,618,5,2942,6,0,402,2345,0


Converting to forward existential form...Done !
original formula: EF((!(E((p23==1) U EF((p63==1)))) * (AF(((p136==0)&&(p297==0))) + (p235==1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E((p23==1) U E(TRUE U (p63==1))))) * !(EG(!(((p136==0)&&(p297==0))))))] != FALSE + [((Fw...231
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t46, t54, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,1,0.123459,9444,1,0,93,19022,142,69,2738,12484,156
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 259/259 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 282 transition count 234
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 282 transition count 234
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 275 transition count 227
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 275 transition count 227
Applied a total of 64 rules in 16 ms. Remains 275 /307 variables (removed 32) and now considering 227/259 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10695880859329224497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3338691465733053512.kers'
[2026-05-24 08:45:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10695880859329224497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3338691465733053512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 275 cols 668 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-24 08:45:15] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3338691465733053512.kers
Total runtime 2 ms.
[2026-05-24 08:45:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 08:45:15] [INFO ] Invariant cache hit.
[2026-05-24 08:45:15] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-24 08:45:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 227/502 variables, 275/354 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 366 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 227/502 variables, 275/378 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 226/604 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 15/619 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 60041ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 227/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 275/307 places, 227/259 transitions.
[2026-05-24 08:46:15] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:46:15] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:46:15] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-24 08:46:15] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:46:15] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:46:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10736109352274098123.gal : 1 ms
[2026-05-24 08:46:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4556804002226337858.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/CTLFireability10736109352274098123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4556804002226337858.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.46313e+17,3.17052,97072,2,41444,5,240432,6,0,1327,524236,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 08:46:45] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:46:45] [INFO ] Applying decomposition
[2026-05-24 08:46:45] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1956437177598948415.txt' '-o' '/tmp/graph1956437177598948415.bin' '-w' '/tmp/graph1956437177598948415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1956437177598948415.bin' '-l' '-1' '-v' '-w' '/tmp/graph1956437177598948415.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:46:45] [INFO ] Decomposing Gal with order
[2026-05-24 08:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:46:45] [INFO ] Removed a total of 70 redundant transitions.
[2026-05-24 08:46:45] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-24 08:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4944606746498240969.gal : 3 ms
[2026-05-24 08:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13252605291847172021.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/CTLFireability4944606746498240969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13252605291847172021.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.46313e+17,0.201831,12264,2094,27,14802,374,568,26618,40,847,0


Converting to forward existential form...Done !
original formula: AX((!(E(!(AX((((i5.i0.u11.p30==1)&&(i5.i1.u54.p169==1))&&(i5.i0.u78.p286==1)))) U ((E((i17.u82.p303==1) U (i18.u80.p293==1)) * AX((((i1.i...433
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!(!(EX(!((((i5.i0.u11.p30==1)&&(i5.i1.u54.p169==1))&&(i5.i0.u78.p286==1))))))) * !((((i1.i0.u...701
Reverse transition relation is NOT exact ! Due to transitions t107, t157, t166, t205, t207, t209, t212, i0.u42.t103, i0.u72.t40, i0.u73.t37, i1.i1.u38.t110...908
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2026-05-24 08:47:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:47:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:47:16] [INFO ] Applying decomposition
[2026-05-24 08:47:16] [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/graph12001611511782019656.txt' '-o' '/tmp/graph12001611511782019656.bin' '-w' '/tmp/graph12001611511782019656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12001611511782019656.bin' '-l' '-1' '-v' '-w' '/tmp/graph12001611511782019656.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:47:16] [INFO ] Decomposing Gal with order
[2026-05-24 08:47:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:47:16] [INFO ] Removed a total of 62 redundant transitions.
[2026-05-24 08:47:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:47:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 08:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5801957512968683952.gal : 2 ms
[2026-05-24 08:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability28598118657762408.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/CTLFireability5801957512968683952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability28598118657762408.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 -...260
No direction supplied, using forward translation only.
Parsed 4 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.76761e+17,0.204258,11788,1976,55,14179,443,679,24575,61,1365,0


Converting to forward existential form...Done !
original formula: (EF(((AF((i2.i1.u33.p94==1)) * EF(((i11.u53.p148==0)&&(i18.i1.u112.p367==0)))) + (EG(((i18.i1.u91.p283==1) * EF((i18.i1.u95.p298==1)))) *...307
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EG(!((i2.i1.u33.p94==1))))),TRUE) * ((i11.u53.p148==0)&&(i18.i1.u112.p367==0)))] !...625
Reverse transition relation is NOT exact ! Due to transitions t128, t186, t198, i0.u81.t64, i0.u82.t61, i0.u83.t58, i0.u86.t51, i1.u37.t143, i1.u41.t135, i...1264
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 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
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,17.9314,449484,1,0,684257,559,5051,1.57765e+06,307,1878,779616
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(E(EX(!(AF((i17.u84.p260==1)))) U (i20.u99.p307==1)))
=> equivalent forward existential formula: [FwdG(Init,E(EX(!(!(EG(!((i17.u84.p260==1)))))) U (i20.u99.p307==1)))] != FALSE
(forward)formula 1,1,44.1315,1045708,1,0,1.80391e+06,586,5167,3.24488e+06,309,1972,1877953
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!((AX((i18.i1.u98.p303==1)) + (i1.u37.p104==1))) U EG((((!(EG(((i17.u84.p256==1)||(i16.u25.p71==1)))) * (i4.u14.p38==1)) * (AG((i16.u74...267
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((!(EX(!((i18.i1.u98.p303==1)))) + (i1.u37.p104==1)))),(((!(EG(((i17.u84.p256==1)||(i16.u25.p71...341
(forward)formula 2,0,58.1143,1306512,1,0,2.33858e+06,587,5240,3.93522e+06,312,1989,2575279
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((!(E(!(AX((((i13.i0.u11.p30==1)&&(i13.i3.u60.p169==1))&&(i13.i0.u92.p286==1)))) U ((E((i18.i1.u98.p303==1) U (i19.u94.p293==1)) * AX((...447
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!(!(EX(!((((i13.i0.u11.p30==1)&&(i13.i3.u60.p169==1))&&(i13.i0.u92.p286==1))))))) * !((((i9.i...725
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 3,1,78.7632,1691584,1,0,2.98493e+06,589,5559,5.1346e+06,324,1992,3314938
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1223856 ms.

BK_STOP 1779612515108

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

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