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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 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 157K 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-15-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779623125637

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 11:45:26] [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 11:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:45:26] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-24 11:45:26] [INFO ] Transformed 630 places.
[2026-05-24 11:45:26] [INFO ] Transformed 566 transitions.
[2026-05-24 11:45:26] [INFO ] Found NUPN structural information;
[2026-05-24 11:45:26] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Support contains 121 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 74 place count 552 transition count 491
Iterating global reduction 1 with 71 rules applied. Total rules applied 145 place count 552 transition count 491
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 177 place count 520 transition count 459
Iterating global reduction 1 with 32 rules applied. Total rules applied 209 place count 520 transition count 459
Applied a total of 209 rules in 135 ms. Remains 520 /626 variables (removed 106) and now considering 459/562 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15814269378694681043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5718711761532564641.kers'
[2026-05-24 11:45:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15814269378694681043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5718711761532564641.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 459 rows 520 cols 1449 entries
Finished phase 1 with 344 SingleSign rule and 77 generalized
[2026-05-24 11:45:27] [INFO ] Computed 99 invariants in 8 ms
Computed 99 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5718711761532564641.kers
Total runtime 10 ms.
[2026-05-24 11:45:27] [INFO ] Implicit Places using invariants in 519 ms returned []
[2026-05-24 11:45:27] [INFO ] Invariant cache hit.
[2026-05-24 11:45:28] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-05-24 11:45:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (OVERLAPS) 1/520 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 458 unsolved
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 30259ms
Starting structural reductions in LTL mode, iteration 1 : 520/626 places, 459/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32083 ms. Remains : 520/626 places, 459/562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Applied a total of 0 rules in 14 ms. Remains 520 /520 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2026-05-24 11:45:59] [INFO ] Invariant cache hit.
[2026-05-24 11:45:59] [INFO ] Implicit Places using invariants in 304 ms returned []
[2026-05-24 11:45:59] [INFO ] Invariant cache hit.
[2026-05-24 11:46:00] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1328 ms. Remains : 520/520 places, 459/459 transitions.
Support contains 121 out of 520 places after structural reductions.
[2026-05-24 11:46:02] [INFO ] Flatten gal took : 78 ms
[2026-05-24 11:46:02] [INFO ] Flatten gal took : 36 ms
[2026-05-24 11:46:02] [INFO ] Input system was already deterministic with 459 transitions.
RANDOM walk for 40000 steps (270 resets) in 2347 ms. (17 steps per ms) remains 47/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
[2026-05-24 11:46:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 338/420 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 37/457 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 5 (OVERLAPS) 57/514 variables, 19/99 constraints. Problems are: Problem set: 3 solved, 44 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 20/119 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/119 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 455/969 variables, 514/633 constraints. Problems are: Problem set: 7 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 969/979 variables, and 633 constraints, problems are : Problem set: 7 solved, 40 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 514/520 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 213/277 variables, 37/37 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 2/39 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/39 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 173/450 variables, 43/82 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 14/96 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/96 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 64/514 variables, 19/115 constraints. Problems are: Problem set: 7 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 4/119 constraints. Problems are: Problem set: 7 solved, 40 unsolved
SMT process timed out in 11086ms, After SMT, problems are : Problem set: 7 solved, 40 unsolved
Fused 40 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (complete) has 1146 edges and 520 vertex of which 519 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 519 transition count 408
Reduce places removed 50 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 55 rules applied. Total rules applied 106 place count 469 transition count 403
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 464 transition count 403
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 111 place count 464 transition count 323
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 286 place count 369 transition count 323
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 296 place count 359 transition count 313
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 307 place count 358 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 307 place count 358 transition count 312
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 309 place count 357 transition count 312
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 529 place count 247 transition count 202
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 530 place count 247 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 531 place count 247 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 532 place count 246 transition count 200
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 539 place count 246 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 540 place count 245 transition count 199
Applied a total of 540 rules in 127 ms. Remains 245 /520 variables (removed 275) and now considering 199/459 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 245/520 places, 199/459 transitions.
RANDOM walk for 40000 steps (1896 resets) in 746 ms. (53 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (34 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11243339961689166973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15197217303312364299.kers'
[2026-05-24 11:46:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11243339961689166973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15197217303312364299.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 199 rows 217 cols 788 entries
Finished phase 1 with 139 SingleSign rule and 23 generalized
[2026-05-24 11:46:15] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15197217303312364299.kers
Total runtime 2 ms.
[2026-05-24 11:46:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 93/152 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 14/166 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 33/199 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 12/211 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 199/410 variables, 211/278 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 13 (OVERLAPS) 34/444 variables, 34/313 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 16/329 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/444 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 329 constraints, problems are : Problem set: 3 solved, 33 unsolved in 2857 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 95/151 variables, 34/34 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 3/37 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 4/41 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 14/165 variables, 9/50 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/52 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 34/199 variables, 11/63 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 12/211 variables, 10/74 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 12/86 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 4/90 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 1/91 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 199/410 variables, 211/302 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 1/303 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 24/327 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 20/347 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 17/364 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 1/365 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/410 variables, 0/365 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 23 (OVERLAPS) 34/444 variables, 34/399 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/444 variables, 16/415 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 9/424 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/444 variables, 11/435 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/444 variables, 2/437 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/444 variables, 1/438 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/444 variables, 0/438 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 30 (OVERLAPS) 0/444 variables, 0/438 constraints. Problems are: Problem set: 3 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 438 constraints, problems are : Problem set: 3 solved, 33 unsolved in 37770 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/36 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40641ms problems are : Problem set: 3 solved, 33 unsolved
Fused 33 Parikh solutions to 31 different solutions.
Parikh walk visited 11 properties in 881 ms.
Support contains 40 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 199/199 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 245 transition count 193
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 239 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 238 transition count 192
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14 place count 238 transition count 183
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 225 transition count 183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 221 transition count 179
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 221 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 212 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 212 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 211 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 210 transition count 170
Applied a total of 63 rules in 40 ms. Remains 210 /245 variables (removed 35) and now considering 170/199 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 210/245 places, 170/199 transitions.
RANDOM walk for 40000 steps (1522 resets) in 350 ms. (113 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (36 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (36 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (34 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (34 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (32 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
Probabilistic random walk after 1000001 steps, saw 155524 distinct states, run finished after 2105 ms. (steps per millisecond=475 ) properties seen :21
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-950138935305195797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15279113527027591529.kers'
[2026-05-24 11:46:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-950138935305195797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15279113527027591529.kers]
Culling duplicate invariants (modulo rational): removing 43 columns.
Culled 43 columns in 0 ms.
// Phase 1: matrix 170 rows 167 cols 670 entries
Finished phase 1 with 122 SingleSign rule and 11 generalized
[2026-05-24 11:46:59] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15279113527027591529.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
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) 70/78 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/130 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/144 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 160/304 variables, 144/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 73/377 variables, 64/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 27/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/379 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/380 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/380 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 210/210 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) 70/78 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/130 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/144 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/304 variables, 144/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/377 variables, 64/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 27/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/379 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/380 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/380 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/380 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 11:46:59] [INFO ] Flatten gal took : 23 ms
[2026-05-24 11:46:59] [INFO ] Flatten gal took : 23 ms
[2026-05-24 11:46:59] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 96 out of 520 places (down from 98) after GAL structural reductions.
Computed a total of 221 stabilizing places and 193 stable transitions
Graph (complete) has 1146 edges and 520 vertex of which 519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (complete) has 1146 edges and 520 vertex of which 519 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 518 transition count 395
Reduce places removed 62 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 66 rules applied. Total rules applied 129 place count 456 transition count 391
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 452 transition count 391
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 133 place count 452 transition count 286
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 363 place count 327 transition count 286
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 389 place count 301 transition count 260
Ensure Unique test removed 2 places
Iterating global reduction 3 with 28 rules applied. Total rules applied 417 place count 299 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 417 place count 299 transition count 258
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 421 place count 297 transition count 258
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 649 place count 182 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 181 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 180 transition count 144
Applied a total of 651 rules in 88 ms. Remains 180 /520 variables (removed 340) and now considering 144/459 (removed 315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14839799415222109560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3804469707873867068.kers'
[2026-05-24 11:46:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14839799415222109560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3804469707873867068.kers]
Culling duplicate invariants (modulo rational): removing 49 columns.
Culled 49 columns in 0 ms.
// Phase 1: matrix 144 rows 131 cols 566 entries
Finished phase 1 with 87 SingleSign rule and 19 generalized
[2026-05-24 11:46:59] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3804469707873867068.kers
Total runtime 1 ms.
[2026-05-24 11:47:00] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3, 10, 36, 37, 38, 39, 44, 45, 46, 50, 51, 52, 53, 54, 55]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 169 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 162/520 places, 144/459 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 278 ms. Remains : 162/520 places, 144/459 transitions.
[2026-05-24 11:47:00] [INFO ] Flatten gal took : 19 ms
[2026-05-24 11:47:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:47:00] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-24 11:47:00] [INFO ] Flatten gal took : 7 ms
[2026-05-24 11:47:00] [INFO ] Flatten gal took : 7 ms
[2026-05-24 11:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18189318222329558567.gal : 3 ms
[2026-05-24 11:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15359508385727705093.ctl : 2 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/CTLFireability18189318222329558567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15359508385727705093.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,493224,0.273777,16100,2,3931,5,36004,6,0,792,40536,0


Converting to forward existential form...Done !
original formula: E((EF((((p119==1)&&(p357==1))&&(p603==1))) + (((p75==1)&&(p326==1))&&((p595==1)&&(p88==1)))) U EF((EF((p242==1)) + ((p303!=1)&&(p57==1)))...157
=> equivalent forward existential formula: ([(FwdU(FwdU(FwdU(Init,(E(TRUE U (((p119==1)&&(p357==1))&&(p603==1))) + (((p75==1)&&(p326==1))&&((p595==1)&&(p88...357
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t41, t43, t44, t47, t48, t49, t50, t51, t79, t80, t81, t82, t83, t92, t106, t107, t10...282
(forward)formula 0,1,2.65838,95880,1,0,409,396832,280,289,6025,420459,559
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 493 transition count 432
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 493 transition count 432
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 486 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 486 transition count 425
Applied a total of 68 rules in 32 ms. Remains 486 /520 variables (removed 34) and now considering 425/459 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4459858544322587158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4916864337972099001.kers'
[2026-05-24 11:47:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4459858544322587158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4916864337972099001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 486 cols 1381 entries
Finished phase 1 with 310 SingleSign rule and 77 generalized
[2026-05-24 11:47:02] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4916864337972099001.kers
Total runtime 3 ms.
[2026-05-24 11:47:03] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 11:47:03] [INFO ] Invariant cache hit.
[2026-05-24 11:47:04] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-24 11:47:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/911 variables, and 185 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 86/185 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD348 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/225 constraints. Problems are: Problem set: 11 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/245 constraints. Problems are: Problem set: 11 solved, 413 unsolved
Problem TDEAD376 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/265 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 20/285 constraints. Problems are: Problem set: 14 solved, 410 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 20/305 constraints. Problems are: Problem set: 14 solved, 410 unsolved
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 14 solved, 410 unsolved
Search for dead transitions found 14 dead transitions in 60140ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/520 places, 411/459 transitions.
Applied a total of 0 rules in 12 ms. Remains 486 /486 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62152 ms. Remains : 486/520 places, 411/459 transitions.
[2026-05-24 11:48:04] [INFO ] Flatten gal took : 14 ms
[2026-05-24 11:48:04] [INFO ] Flatten gal took : 13 ms
[2026-05-24 11:48:05] [INFO ] Input system was already deterministic with 411 transitions.
[2026-05-24 11:48:05] [INFO ] Flatten gal took : 13 ms
[2026-05-24 11:48:05] [INFO ] Flatten gal took : 12 ms
[2026-05-24 11:48:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2841712896072372144.gal : 7 ms
[2026-05-24 11:48:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14107291667933193015.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/CTLFireability2841712896072372144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14107291667933193015.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.
Detected timeout of ITS tools.
[2026-05-24 11:48:35] [INFO ] Flatten gal took : 11 ms
[2026-05-24 11:48:35] [INFO ] Applying decomposition
[2026-05-24 11:48:35] [INFO ] Flatten gal took : 11 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/graph9684443193662523943.txt' '-o' '/tmp/graph9684443193662523943.bin' '-w' '/tmp/graph9684443193662523943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9684443193662523943.bin' '-l' '-1' '-v' '-w' '/tmp/graph9684443193662523943.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:48:35] [INFO ] Decomposing Gal with order
[2026-05-24 11:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:48:35] [INFO ] Removed a total of 206 redundant transitions.
[2026-05-24 11:48:35] [INFO ] Flatten gal took : 212 ms
[2026-05-24 11:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 24 ms.
[2026-05-24 11:48:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6934976189132873806.gal : 8 ms
[2026-05-24 11:48:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9054024843314940523.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/CTLFireability6934976189132873806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9054024843314940523.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,4.68908e+25,0.857079,35732,3896,45,54325,517,1078,140440,58,1289,0


Converting to forward existential form...Done !
original formula: E((i10.u64.p199==1) U EX(EF(((EG((i19.u131.p479==1)) * (i12.i2.u125.p420==1)) * (i3.u56.p176==1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(EY(FwdU(Init,(i10.u64.p199==1))),TRUE) * (i3.u56.p176==1)) * (i12.i2.u125.p420==1)),(i19.u131.p479=...169
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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
(forward)formula 0,0,2.65608,89108,1,0,151342,541,4640,432956,210,1830,299748
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (trivial) has 258 edges and 520 vertex of which 6 / 520 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1140 edges and 515 vertex of which 514 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 513 transition count 380
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 442 transition count 380
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 144 place count 442 transition count 278
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 368 place count 320 transition count 278
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 395 place count 293 transition count 251
Ensure Unique test removed 2 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 424 place count 291 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 424 place count 291 transition count 249
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 428 place count 289 transition count 249
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 660 place count 172 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 661 place count 171 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 662 place count 170 transition count 133
Applied a total of 662 rules in 57 ms. Remains 170 /520 variables (removed 350) and now considering 133/459 (removed 326) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-134843575915133601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15937089351787678386.kers'
[2026-05-24 11:48:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-134843575915133601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15937089351787678386.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 43 columns.
Culled 43 columns in 0 ms.
// Phase 1: matrix 132 rows 127 cols 551 entries
Finished phase 1 with 83 SingleSign rule and 13 generalized
[2026-05-24 11:48:38] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15937089351787678386.kers
Total runtime 1 ms.
[2026-05-24 11:48:38] [INFO ] Implicit Places using invariants in 143 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 144 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 149/520 places, 133/459 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 206 ms. Remains : 149/520 places, 133/459 transitions.
[2026-05-24 11:48:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:48:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:48:38] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-24 11:48:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 11:48:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 11:48:38] [INFO ] Time to serialize gal into /tmp/CTLFireability18222906977810892539.gal : 2 ms
[2026-05-24 11:48:38] [INFO ] Time to serialize properties into /tmp/CTLFireability100821247968661680.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/CTLFireability18222906977810892539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability100821247968661680.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,18678,0.081112,7316,2,1655,5,10338,6,0,729,8320,0


Converting to forward existential form...Done !
original formula: EF(EG((p344==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p344==1))] != FALSE
Hit Full ! (commute/partial/dont) 131/0/2
(forward)formula 0,1,0.316513,17548,1,0,8,50795,19,2,4237,19304,8
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 494 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 494 transition count 433
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 490 transition count 429
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 490 transition count 429
Applied a total of 60 rules in 31 ms. Remains 490 /520 variables (removed 30) and now considering 429/459 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2064560900790062973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1917892989553312063.kers'
[2026-05-24 11:48:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2064560900790062973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1917892989553312063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 429 rows 490 cols 1389 entries
Finished phase 1 with 314 SingleSign rule and 77 generalized
[2026-05-24 11:48:38] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1917892989553312063.kers
Total runtime 3 ms.
[2026-05-24 11:48:39] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-24 11:48:39] [INFO ] Invariant cache hit.
[2026-05-24 11:48:41] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2026-05-24 11:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/159 constraints. Problems are: Problem set: 7 solved, 421 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 7 solved, 421 unsolved
Search for dead transitions found 7 dead transitions in 30129ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 490/520 places, 422/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32366 ms. Remains : 490/520 places, 422/459 transitions.
[2026-05-24 11:49:11] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:49:11] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:49:11] [INFO ] Input system was already deterministic with 422 transitions.
[2026-05-24 11:49:11] [INFO ] Flatten gal took : 8 ms
[2026-05-24 11:49:11] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:49:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12138732775750827741.gal : 2 ms
[2026-05-24 11:49:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8083063022727532904.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/CTLFireability12138732775750827741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8083063022727532904.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.
Detected timeout of ITS tools.
[2026-05-24 11:49:41] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:49:41] [INFO ] Applying decomposition
[2026-05-24 11:49:41] [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/graph12946339131850742932.txt' '-o' '/tmp/graph12946339131850742932.bin' '-w' '/tmp/graph12946339131850742932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12946339131850742932.bin' '-l' '-1' '-v' '-w' '/tmp/graph12946339131850742932.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:49:41] [INFO ] Decomposing Gal with order
[2026-05-24 11:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:49:41] [INFO ] Removed a total of 231 redundant transitions.
[2026-05-24 11:49:41] [INFO ] Flatten gal took : 22 ms
[2026-05-24 11:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2026-05-24 11:49:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9984821795918407079.gal : 5 ms
[2026-05-24 11:49:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6066924115806497717.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/CTLFireability9984821795918407079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6066924115806497717.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,4.9058e+25,2.31317,78880,6598,61,122514,874,1094,302615,64,2520,0


Converting to forward existential form...Done !
original formula: (AX(AX(EG((((i0.u75.p221==0)||(i8.i1.u130.p436==0))||((i18.u133.p595==0)||((i18.u133.p527==1)&&(i17.i2.u127.p425==1))))))) * (A((i0.u158....386
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(EG((((i0.u75.p221==0)||(i8.i1.u130.p436==0))||((i18.u133.p595==0)||((i18.u133.p527==1)&&(i17...1209
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t171, t175, t191, t278, t287, t403, t404, t406, t407, t415, i0.t183, i0.t179,...1379
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 493 transition count 432
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 493 transition count 432
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 486 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 486 transition count 425
Applied a total of 68 rules in 33 ms. Remains 486 /520 variables (removed 34) and now considering 425/459 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5918193108964265714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18018548254153551219.kers'
[2026-05-24 11:50:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5918193108964265714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18018548254153551219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 486 cols 1381 entries
Finished phase 1 with 310 SingleSign rule and 77 generalized
[2026-05-24 11:50:11] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18018548254153551219.kers
Total runtime 4 ms.
[2026-05-24 11:50:11] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 11:50:11] [INFO ] Invariant cache hit.
[2026-05-24 11:50:13] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-24 11:50:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD348 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 3 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 3 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 3 solved, 421 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 3 solved, 421 unsolved
Search for dead transitions found 3 dead transitions in 30174ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/520 places, 422/459 transitions.
Applied a total of 0 rules in 13 ms. Remains 486 /486 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31953 ms. Remains : 486/520 places, 422/459 transitions.
[2026-05-24 11:50:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:50:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 11:50:43] [INFO ] Input system was already deterministic with 422 transitions.
[2026-05-24 11:50:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 11:50:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 11:50:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16672299316132306787.gal : 2 ms
[2026-05-24 11:50:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7519375900080498175.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/CTLFireability16672299316132306787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7519375900080498175.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.
Detected timeout of ITS tools.
[2026-05-24 11:51:13] [INFO ] Flatten gal took : 21 ms
[2026-05-24 11:51:13] [INFO ] Applying decomposition
[2026-05-24 11:51:13] [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/graph10416154413780324285.txt' '-o' '/tmp/graph10416154413780324285.bin' '-w' '/tmp/graph10416154413780324285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10416154413780324285.bin' '-l' '-1' '-v' '-w' '/tmp/graph10416154413780324285.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:51:13] [INFO ] Decomposing Gal with order
[2026-05-24 11:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:51:13] [INFO ] Removed a total of 250 redundant transitions.
[2026-05-24 11:51:13] [INFO ] Flatten gal took : 23 ms
[2026-05-24 11:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-24 11:51:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13026118776875105006.gal : 13 ms
[2026-05-24 11:51:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4934034925142599900.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/CTLFireability13026118776875105006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4934034925142599900.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,4.67545e+25,1.47435,50904,5244,74,81613,688,1117,190426,72,2041,0


Converting to forward existential form...Done !
original formula: EX(((i18.i0.u30.p95==0) * !(E((!(EF((i2.i0.u53.p163==1))) + (i0.i0.u2.p5!=1)) U EG(E((i9.i1.u98.p293==1) U (i5.i0.u13.p31==1)))))))
=> equivalent forward existential formula: [((EY(Init) * (i18.i0.u30.p95==0)) * !(E((!(E(TRUE U (i2.i0.u53.p163==1))) + (i0.i0.u2.p5!=1)) U EG(E((i9.i1.u98...200
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t167, t171, t179, t187, t270, t274, t283, t402, t403, t404, t406, t407, t415,...1316
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
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
(forward)formula 0,1,19.5636,627596,1,0,1.19633e+06,701,7988,2.12836e+06,359,2041,2731772
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 493 transition count 432
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 493 transition count 432
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 487 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 487 transition count 426
Applied a total of 66 rules in 32 ms. Remains 487 /520 variables (removed 33) and now considering 426/459 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4451210317441079091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15672029026320189864.kers'
[2026-05-24 11:51:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4451210317441079091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15672029026320189864.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 426 rows 487 cols 1383 entries
Finished phase 1 with 311 SingleSign rule and 77 generalized
[2026-05-24 11:51:33] [INFO ] Computed 99 invariants in 9 ms
Computed 99 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15672029026320189864.kers
Total runtime 11 ms.
[2026-05-24 11:51:33] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-24 11:51:33] [INFO ] Invariant cache hit.
[2026-05-24 11:51:35] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2026-05-24 11:51:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/159 constraints. Problems are: Problem set: 3 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/179 constraints. Problems are: Problem set: 3 solved, 422 unsolved
SMT process timed out in 30048ms, After SMT, problems are : Problem set: 3 solved, 422 unsolved
Search for dead transitions found 3 dead transitions in 30048ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 487/520 places, 423/459 transitions.
Applied a total of 0 rules in 9 ms. Remains 487 /487 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31981 ms. Remains : 487/520 places, 423/459 transitions.
[2026-05-24 11:52:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:52:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:52:05] [INFO ] Input system was already deterministic with 423 transitions.
[2026-05-24 11:52:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:52:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 11:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2711355196855644562.gal : 2 ms
[2026-05-24 11:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2692481294076866227.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/CTLFireability2711355196855644562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2692481294076866227.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.
Detected timeout of ITS tools.
[2026-05-24 11:52:35] [INFO ] Flatten gal took : 10 ms
[2026-05-24 11:52:35] [INFO ] Applying decomposition
[2026-05-24 11:52:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12307228279146383214.txt' '-o' '/tmp/graph12307228279146383214.bin' '-w' '/tmp/graph12307228279146383214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12307228279146383214.bin' '-l' '-1' '-v' '-w' '/tmp/graph12307228279146383214.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:52:35] [INFO ] Decomposing Gal with order
[2026-05-24 11:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:52:35] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-24 11:52:35] [INFO ] Flatten gal took : 16 ms
[2026-05-24 11:52:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2026-05-24 11:52:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9498637427541342679.gal : 11 ms
[2026-05-24 11:52:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7023319004901313035.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/CTLFireability9498637427541342679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7023319004901313035.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,4.61415e+25,1.37788,57040,4861,60,90170,643,1130,321439,69,1737,0


Converting to forward existential form...Done !
original formula: EX(E(EG(EF((i17.u134.p467==1))) U (EX((i17.u131.p547==1)) * A((i8.i0.u69.p207==1) U (i9.u65.p195==1)))))
=> equivalent forward existential formula: [(((FwdU(EY(Init),EG(E(TRUE U (i17.u134.p467==1)))) * EX((i17.u131.p547==1))) * !(EG(!((i9.u65.p195==1))))) * !(...238
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t169, t189, t263, t271, t284, t403, t405, t407, t408, t416, i0.i0.u84.t164, i...1323
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (trivial) has 254 edges and 520 vertex of which 4 / 520 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1143 edges and 517 vertex of which 516 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 515 transition count 383
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 444 transition count 383
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 144 place count 444 transition count 282
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 366 place count 323 transition count 282
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 392 place count 297 transition count 256
Ensure Unique test removed 2 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 420 place count 295 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 420 place count 295 transition count 254
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 424 place count 293 transition count 254
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 656 place count 176 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 174 transition count 138
Applied a total of 658 rules in 57 ms. Remains 174 /520 variables (removed 346) and now considering 138/459 (removed 321) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5886161279442287812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7115053698015185909.kers'
[2026-05-24 11:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5886161279442287812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7115053698015185909.kers]
Normalized transition count is 137 out of 138 initially.
Culling duplicate invariants (modulo rational): removing 43 columns.
Culled 43 columns in 0 ms.
// Phase 1: matrix 137 rows 131 cols 563 entries
Finished phase 1 with 87 SingleSign rule and 13 generalized
[2026-05-24 11:53:05] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7115053698015185909.kers
Total runtime 1 ms.
[2026-05-24 11:53:06] [INFO ] Implicit Places using invariants in 163 ms returned [0, 1, 2, 3, 4, 8, 9, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 168 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 153/520 places, 138/459 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 230 ms. Remains : 153/520 places, 138/459 transitions.
[2026-05-24 11:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:53:06] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-24 11:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 11:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6221810521557217108.gal : 1 ms
[2026-05-24 11:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1838517210431194836.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/CTLFireability6221810521557217108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1838517210431194836.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,17250,0.088785,7604,2,1786,5,11344,6,0,750,8984,0


Converting to forward existential form...Done !
original formula: AG((E(EF((p139==1)) U (p454==1)) + AF(((p498==0) * EG((p279==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(E(TRUE U (p139==1)) U (p454==1)))),!(((p498==0) * EG((p279==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t31, t34, t35, t36, t37, t38, t71, t72, t73, t74, t75, t87, t91, t92, t108, t112, t113, t...266
(forward)formula 0,1,1.33055,52872,1,0,334,260655,276,186,5700,217218,425
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 495 transition count 434
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 495 transition count 434
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 489 transition count 428
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 489 transition count 428
Applied a total of 62 rules in 35 ms. Remains 489 /520 variables (removed 31) and now considering 428/459 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8481899860540784076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-326466195192584230.kers'
[2026-05-24 11:53:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8481899860540784076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-326466195192584230.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 489 cols 1387 entries
Finished phase 1 with 313 SingleSign rule and 77 generalized
[2026-05-24 11:53:07] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-326466195192584230.kers
Total runtime 3 ms.
[2026-05-24 11:53:07] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-24 11:53:07] [INFO ] Invariant cache hit.
[2026-05-24 11:53:09] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-05-24 11:53:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/489 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 20/139 constraints. Problems are: Problem set: 14 solved, 413 unsolved
Problem TDEAD357 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/159 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/179 constraints. Problems are: Problem set: 17 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/917 variables, and 185 constraints, problems are : Problem set: 17 solved, 410 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/489 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 15/15 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/15 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/489 variables, 81/96 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 3/99 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 86/185 constraints. Problems are: Problem set: 17 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 20/205 constraints. Problems are: Problem set: 17 solved, 410 unsolved
Problem TDEAD386 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/225 constraints. Problems are: Problem set: 18 solved, 409 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/245 constraints. Problems are: Problem set: 21 solved, 406 unsolved
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 20/265 constraints. Problems are: Problem set: 25 solved, 402 unsolved
Problem TDEAD355 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 20/285 constraints. Problems are: Problem set: 30 solved, 397 unsolved
SMT process timed out in 60126ms, After SMT, problems are : Problem set: 30 solved, 397 unsolved
Search for dead transitions found 30 dead transitions in 60128ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 489/520 places, 398/459 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 488 transition count 398
Applied a total of 1 rules in 11 ms. Remains 488 /489 variables (removed 1) and now considering 398/398 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13183636869984479165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14192355745548766123.kers'
[2026-05-24 11:54:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13183636869984479165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14192355745548766123.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 488 cols 1205 entries
Finished phase 1 with 314 SingleSign rule and 72 generalized
[2026-05-24 11:54:09] [INFO ] Computed 102 invariants in 3 ms
Computed 102 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14192355745548766123.kers
Total runtime 3 ms.
[2026-05-24 11:54:09] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 11:54:09] [INFO ] Invariant cache hit.
[2026-05-24 11:54:11] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 487/520 places, 398/459 transitions.
Applied a total of 0 rules in 10 ms. Remains 487 /487 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63766 ms. Remains : 487/520 places, 398/459 transitions.
[2026-05-24 11:54:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:54:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:54:11] [INFO ] Input system was already deterministic with 398 transitions.
[2026-05-24 11:54:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:54:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:54:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2860306621465670019.gal : 1 ms
[2026-05-24 11:54:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1127513422053538602.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/CTLFireability2860306621465670019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1127513422053538602.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.
Detected timeout of ITS tools.
[2026-05-24 11:54:41] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:54:41] [INFO ] Applying decomposition
[2026-05-24 11:54:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1275933929076218457.txt' '-o' '/tmp/graph1275933929076218457.bin' '-w' '/tmp/graph1275933929076218457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1275933929076218457.bin' '-l' '-1' '-v' '-w' '/tmp/graph1275933929076218457.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:54:41] [INFO ] Decomposing Gal with order
[2026-05-24 11:54:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:54:41] [INFO ] Removed a total of 135 redundant transitions.
[2026-05-24 11:54:41] [INFO ] Flatten gal took : 17 ms
[2026-05-24 11:54:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-24 11:54:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4859813970406120042.gal : 3 ms
[2026-05-24 11:54:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13359254031203829013.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/CTLFireability4859813970406120042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13359254031203829013.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,4.61664e+25,5.40665,153676,6787,33,211405,482,980,702214,55,1312,0


Converting to forward existential form...Done !
original formula: AG((((!(A((((i10.i1.u57.p168==1)&&(i13.u117.p387==1))&&(i20.u133.p453==1)) U (i0.i2.u84.p253==1))) + (i9.i1.u44.p100==0)) + (AF(((((i16.i...461
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * !((!(!((E(!((i0.i2.u84.p253==1)) U (!((((i10.i1.u57.p168==1)&&(i13.u117.p387==1))&&(i...709
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t171, t179, t265, t277, t286, t378, t379, t380, t382, t383, t391, i0.i0.u131.t69, i0....1331
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,14.272,368072,1,0,658539,482,7084,1.46246e+06,293,1312,1623973
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 496 transition count 435
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 496 transition count 435
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 489 transition count 428
Applied a total of 62 rules in 29 ms. Remains 489 /520 variables (removed 31) and now considering 428/459 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4223583017864676802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16748560574133738967.kers'
[2026-05-24 11:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4223583017864676802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16748560574133738967.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 428 rows 489 cols 1387 entries
Finished phase 1 with 313 SingleSign rule and 77 generalized
[2026-05-24 11:54:55] [INFO ] Computed 99 invariants in 9 ms
Computed 99 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16748560574133738967.kers
Total runtime 11 ms.
[2026-05-24 11:54:56] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-24 11:54:56] [INFO ] Invariant cache hit.
[2026-05-24 11:54:57] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-05-24 11:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/489 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/159 constraints. Problems are: Problem set: 4 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/179 constraints. Problems are: Problem set: 4 solved, 423 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 4 solved, 423 unsolved
Search for dead transitions found 4 dead transitions in 30110ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 489/520 places, 424/459 transitions.
Applied a total of 0 rules in 15 ms. Remains 489 /489 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31891 ms. Remains : 489/520 places, 424/459 transitions.
[2026-05-24 11:55:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:55:27] [INFO ] Flatten gal took : 14 ms
[2026-05-24 11:55:27] [INFO ] Input system was already deterministic with 424 transitions.
[2026-05-24 11:55:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:55:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:55:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17448764916823184932.gal : 2 ms
[2026-05-24 11:55:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6911132056162308339.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/CTLFireability17448764916823184932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6911132056162308339.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.
Detected timeout of ITS tools.
[2026-05-24 11:55:57] [INFO ] Flatten gal took : 8 ms
[2026-05-24 11:55:57] [INFO ] Applying decomposition
[2026-05-24 11:55:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15656796394987511252.txt' '-o' '/tmp/graph15656796394987511252.bin' '-w' '/tmp/graph15656796394987511252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15656796394987511252.bin' '-l' '-1' '-v' '-w' '/tmp/graph15656796394987511252.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:55:57] [INFO ] Decomposing Gal with order
[2026-05-24 11:55:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:55:57] [INFO ] Removed a total of 247 redundant transitions.
[2026-05-24 11:55:57] [INFO ] Flatten gal took : 20 ms
[2026-05-24 11:55:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-24 11:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18048916080154318335.gal : 4 ms
[2026-05-24 11:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12878853331043683534.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/CTLFireability18048916080154318335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12878853331043683534.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,4.8847e+25,1.13611,41920,4116,62,69031,756,1183,139736,68,2004,0


Converting to forward existential form...Done !
original formula: ((EF((AG(AX((i4.i1.u103.p313==1))) * E((((!((i15.i2.u167.p607==1)&&(i15.i1.u168.p610==1)))||(((i15.i2.u32.p125==1)&&(i15.i1.u113.p352==1)...498
=> equivalent forward existential formula: ([(EY(EY(FwdU((Init * !((E(TRUE U (!(E(TRUE U !(!(EX(!((i4.i1.u103.p313==1))))))) * E((((!((i15.i2.u167.p607==1)...1040
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t178, t264, t276, t404, t406, t408, t417, i0.u82.t168, i1.t182, i1.u72.t189, ...1404
(forward)formula 0,0,16.733,424892,1,0,667119,998,9015,1.6213e+06,336,3250,1422564
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 491 transition count 430
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 484 transition count 423
Applied a total of 72 rules in 30 ms. Remains 484 /520 variables (removed 36) and now considering 423/459 (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-11488338028874342592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12569717862098616022.kers'
[2026-05-24 11:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11488338028874342592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12569717862098616022.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 423 rows 484 cols 1377 entries
Finished phase 1 with 308 SingleSign rule and 77 generalized
[2026-05-24 11:56:14] [INFO ] Computed 99 invariants in 5 ms
Computed 99 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12569717862098616022.kers
Total runtime 7 ms.
[2026-05-24 11:56:14] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-24 11:56:14] [INFO ] Invariant cache hit.
[2026-05-24 11:56:16] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2026-05-24 11:56:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 5 solved, 417 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 15 solved, 407 unsolved
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 21 solved, 401 unsolved
Problem TDEAD378 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 22 solved, 400 unsolved
SMT process timed out in 30039ms, After SMT, problems are : Problem set: 22 solved, 400 unsolved
Search for dead transitions found 22 dead transitions in 30042ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/520 places, 401/459 transitions.
Applied a total of 0 rules in 10 ms. Remains 484 /484 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31767 ms. Remains : 484/520 places, 401/459 transitions.
[2026-05-24 11:56:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:56:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:56:46] [INFO ] Input system was already deterministic with 401 transitions.
[2026-05-24 11:56:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:56:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15936564908278777354.gal : 1 ms
[2026-05-24 11:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17968006861296352296.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/CTLFireability15936564908278777354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17968006861296352296.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.
Detected timeout of ITS tools.
[2026-05-24 11:57:16] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:57:16] [INFO ] Applying decomposition
[2026-05-24 11:57:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15332763564083837094.txt' '-o' '/tmp/graph15332763564083837094.bin' '-w' '/tmp/graph15332763564083837094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15332763564083837094.bin' '-l' '-1' '-v' '-w' '/tmp/graph15332763564083837094.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:57:16] [INFO ] Decomposing Gal with order
[2026-05-24 11:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:57:16] [INFO ] Removed a total of 162 redundant transitions.
[2026-05-24 11:57:16] [INFO ] Flatten gal took : 15 ms
[2026-05-24 11:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-24 11:57:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13185060805433772262.gal : 4 ms
[2026-05-24 11:57:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3910243170805255518.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/CTLFireability13185060805433772262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3910243170805255518.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,4.61016e+25,0.736102,33184,4448,53,55380,665,912,114006,71,1361,0


Converting to forward existential form...Done !
original formula: AX(EF((((i6.u38.p131==1)&&(i6.u108.p357==1))&&(i6.u137.p615==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i6.u38.p131==1)&&(i6.u108.p357==1))&&(i6.u137.p615==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t166, t170, t174, t186, t260, t272, t382, t383, t385, t386, t394, i0.t178, i0...1190
(forward)formula 0,1,6.00488,226332,1,0,473321,756,6542,763205,349,1739,1144603
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (trivial) has 248 edges and 520 vertex of which 6 / 520 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 1140 edges and 515 vertex of which 514 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 513 transition count 385
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 447 transition count 385
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 134 place count 447 transition count 286
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 351 place count 329 transition count 286
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 375 place count 305 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 400 place count 304 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 304 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 303 transition count 261
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 636 place count 185 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 184 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 183 transition count 144
Applied a total of 638 rules in 40 ms. Remains 183 /520 variables (removed 337) and now considering 144/459 (removed 315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10749722572706146386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11856705369929569485.kers'
[2026-05-24 11:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10749722572706146386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11856705369929569485.kers]
Normalized transition count is 143 out of 144 initially.
Culling duplicate invariants (modulo rational): removing 50 columns.
Culled 50 columns in 0 ms.
// Phase 1: matrix 143 rows 133 cols 554 entries
Finished phase 1 with 94 SingleSign rule and 13 generalized
[2026-05-24 11:57:22] [INFO ] Computed 76 invariants in 1 ms
Computed 76 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11856705369929569485.kers
Total runtime 1 ms.
[2026-05-24 11:57:22] [INFO ] Implicit Places using invariants in 163 ms returned [0, 4, 5, 6, 7, 11, 12, 36, 40, 41, 46, 47, 48, 55, 56, 57, 58, 59, 63, 135, 153]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 163 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 162/520 places, 144/459 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 209 ms. Remains : 162/520 places, 144/459 transitions.
[2026-05-24 11:57:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:57:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:57:22] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-24 11:57:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:57:22] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:57:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1627026777429237558.gal : 1 ms
[2026-05-24 11:57:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5547524385149164472.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/CTLFireability1627026777429237558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5547524385149164472.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,61740,0.090081,7728,2,1969,5,11378,6,0,791,8660,0


Converting to forward existential form...Done !
original formula: AF(E(E(((p323==1)||(!((p147==1)&&(p234==1)))) U (((p122==1)&&(p327==1))&&(p606==1))) U AG(!(((p30==1)||(p191==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(((p323==1)||(!((p147==1)&&(p234==1)))) U (((p122==1)&&(p327==1))&&(p606==1))) U !(E(TRUE U !(!(...192
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t11, t43, t48, t49, t50, t51, t52, t77, t78, t79, t80, t81, t84, t100, t101, t102, t1...283
(forward)formula 0,1,1.2024,54028,1,0,474,260113,286,273,5894,274201,603
FORMULA BusinessProcesses-PT-15-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 : 520/520 places, 459/459 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 494 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 494 transition count 433
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 489 transition count 428
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 489 transition count 428
Applied a total of 62 rules in 34 ms. Remains 489 /520 variables (removed 31) and now considering 428/459 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5228133140320099833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5127634639569332508.kers'
[2026-05-24 11:57:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5228133140320099833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5127634639569332508.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 428 rows 489 cols 1387 entries
Finished phase 1 with 313 SingleSign rule and 77 generalized
[2026-05-24 11:57:24] [INFO ] Computed 99 invariants in 7 ms
Computed 99 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5127634639569332508.kers
Total runtime 7 ms.
[2026-05-24 11:57:24] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-24 11:57:24] [INFO ] Invariant cache hit.
[2026-05-24 11:57:26] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-05-24 11:57:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/489 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
SMT process timed out in 30071ms, After SMT, problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 30074ms
Starting structural reductions in LTL mode, iteration 1 : 489/520 places, 428/459 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32297 ms. Remains : 489/520 places, 428/459 transitions.
[2026-05-24 11:57:56] [INFO ] Flatten gal took : 9 ms
[2026-05-24 11:57:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:57:56] [INFO ] Input system was already deterministic with 428 transitions.
[2026-05-24 11:57:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:57:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 11:57:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3988918327563387218.gal : 1 ms
[2026-05-24 11:57:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13740652555667574449.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/CTLFireability3988918327563387218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13740652555667574449.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.
Detected timeout of ITS tools.
[2026-05-24 11:58:26] [INFO ] Flatten gal took : 10 ms
[2026-05-24 11:58:26] [INFO ] Applying decomposition
[2026-05-24 11:58:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6262181796779629172.txt' '-o' '/tmp/graph6262181796779629172.bin' '-w' '/tmp/graph6262181796779629172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6262181796779629172.bin' '-l' '-1' '-v' '-w' '/tmp/graph6262181796779629172.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:58:26] [INFO ] Decomposing Gal with order
[2026-05-24 11:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:58:26] [INFO ] Removed a total of 264 redundant transitions.
[2026-05-24 11:58:26] [INFO ] Flatten gal took : 14 ms
[2026-05-24 11:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2026-05-24 11:58:26] [INFO ] Time to serialize gal into /tmp/CTLFireability178727318388157372.gal : 4 ms
[2026-05-24 11:58:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2002237783142723050.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/CTLFireability178727318388157372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2002237783142723050.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 -...261
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,4.66739e+25,5.66595,147492,10689,62,200496,693,1143,529269,76,1953,0


Converting to forward existential form...Done !
original formula: !(E(!(AF(((i18.u148.p553==1) + ((i18.u142.p526==1) * A((((i12.u68.p209==1)&&(i12.u125.p426==1))&&(i18.u148.p595==1)) U (i17.i1.u111.p360=...250
=> equivalent forward existential formula: [((FwdU(Init,!(!(EG(!(((i18.u148.p553==1) + ((i18.u142.p526==1) * !((E(!((i17.i1.u111.p360==1)) U (!((((i12.u68....390
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t170, t174, t183, t191, t273, t277, t409, t410, t412, t413, t421, i0.i0.u78.t...1361
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 491 transition count 430
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 484 transition count 423
Applied a total of 72 rules in 33 ms. Remains 484 /520 variables (removed 36) and now considering 423/459 (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-15181225432395183417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6631391876139660066.kers'
[2026-05-24 11:58:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15181225432395183417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6631391876139660066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 484 cols 1377 entries
Finished phase 1 with 308 SingleSign rule and 77 generalized
[2026-05-24 11:58:56] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6631391876139660066.kers
Total runtime 3 ms.
[2026-05-24 11:58:56] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-24 11:58:56] [INFO ] Invariant cache hit.
[2026-05-24 11:58:58] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2026-05-24 11:58:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 5 solved, 417 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 15 solved, 407 unsolved
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 21 solved, 401 unsolved
Problem TDEAD378 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 22 solved, 400 unsolved
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 22 solved, 400 unsolved
Search for dead transitions found 22 dead transitions in 30146ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/520 places, 401/459 transitions.
Applied a total of 0 rules in 12 ms. Remains 484 /484 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32076 ms. Remains : 484/520 places, 401/459 transitions.
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:59:28] [INFO ] Input system was already deterministic with 401 transitions.
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2802493153033839040.gal : 1 ms
[2026-05-24 11:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15092897717486127309.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/CTLFireability2802493153033839040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15092897717486127309.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.
Detected timeout of ITS tools.
[2026-05-24 11:59:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 11:59:58] [INFO ] Applying decomposition
[2026-05-24 11:59:58] [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/graph14666546398386997063.txt' '-o' '/tmp/graph14666546398386997063.bin' '-w' '/tmp/graph14666546398386997063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14666546398386997063.bin' '-l' '-1' '-v' '-w' '/tmp/graph14666546398386997063.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:59:58] [INFO ] Decomposing Gal with order
[2026-05-24 11:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:59:58] [INFO ] Removed a total of 162 redundant transitions.
[2026-05-24 11:59:58] [INFO ] Flatten gal took : 12 ms
[2026-05-24 11:59:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-24 11:59:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17488129118740934301.gal : 4 ms
[2026-05-24 11:59:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16077730665671089104.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/CTLFireability17488129118740934301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16077730665671089104.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,4.61016e+25,0.504401,24272,3372,56,40055,565,1044,58954,70,1305,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.508538,24272,1,0,40055,565,1481,58954,79,1305,1694
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Graph (trivial) has 258 edges and 520 vertex of which 6 / 520 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 1140 edges and 515 vertex of which 514 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 513 transition count 380
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 442 transition count 380
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 144 place count 442 transition count 279
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 365 place count 322 transition count 279
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 392 place count 295 transition count 252
Ensure Unique test removed 2 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 421 place count 293 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 421 place count 293 transition count 250
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 425 place count 291 transition count 250
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 661 place count 172 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 662 place count 171 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 663 place count 170 transition count 132
Applied a total of 663 rules in 31 ms. Remains 170 /520 variables (removed 350) and now considering 132/459 (removed 327) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10096784343387474524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4373346213447500301.kers'
[2026-05-24 11:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10096784343387474524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4373346213447500301.kers]
Normalized transition count is 131 out of 132 initially.
Culling duplicate invariants (modulo rational): removing 54 columns.
Culled 54 columns in 0 ms.
// Phase 1: matrix 131 rows 116 cols 504 entries
Finished phase 1 with 82 SingleSign rule and 13 generalized
[2026-05-24 11:59:59] [INFO ] Computed 75 invariants in 0 ms
Computed 75 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4373346213447500301.kers
Total runtime 1 ms.
[2026-05-24 11:59:59] [INFO ] Implicit Places using invariants in 143 ms returned [0, 1, 4, 5, 6, 10, 11, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54, 124]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 145 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/520 places, 132/459 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 178 ms. Remains : 148/520 places, 132/459 transitions.
[2026-05-24 11:59:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:59:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 11:59:59] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-24 11:59:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 11:59:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 11:59:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12058408063524045845.gal : 1 ms
[2026-05-24 11:59:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5716198989186490420.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/CTLFireability12058408063524045845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5716198989186490420.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,10914,0.072046,6928,2,1258,5,8952,6,0,724,7021,0


Converting to forward existential form...Done !
original formula: EF(AG((p42==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p42==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t29, t30, t31, t32, t33, t66, t67, t68, t69, t70, t84, t85, t86, t102, t106, t107, t108,...262
(forward)formula 0,1,0.33297,20460,1,0,174,66921,249,94,5316,39929,250
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 459/459 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 495 transition count 434
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 495 transition count 434
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 488 transition count 427
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 488 transition count 427
Applied a total of 64 rules in 32 ms. Remains 488 /520 variables (removed 32) and now considering 427/459 (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-11441804744897372081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16158514473246900773.kers'
[2026-05-24 12:00:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11441804744897372081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16158514473246900773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 427 rows 488 cols 1385 entries
Finished phase 1 with 312 SingleSign rule and 77 generalized
[2026-05-24 12:00:00] [INFO ] Computed 99 invariants in 4 ms
Computed 99 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16158514473246900773.kers
Total runtime 5 ms.
[2026-05-24 12:00:00] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-24 12:00:00] [INFO ] Invariant cache hit.
[2026-05-24 12:00:01] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2026-05-24 12:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 3 solved, 423 unsolved
SMT process timed out in 30057ms, After SMT, problems are : Problem set: 3 solved, 423 unsolved
Search for dead transitions found 3 dead transitions in 30059ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/520 places, 424/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31992 ms. Remains : 488/520 places, 424/459 transitions.
[2026-05-24 12:00:31] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:00:32] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:00:32] [INFO ] Input system was already deterministic with 424 transitions.
[2026-05-24 12:00:32] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:00:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:00:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5633817875942756049.gal : 1 ms
[2026-05-24 12:00:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2699574767140890072.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/CTLFireability5633817875942756049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2699574767140890072.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.
Detected timeout of ITS tools.
[2026-05-24 12:01:02] [INFO ] Flatten gal took : 10 ms
[2026-05-24 12:01:02] [INFO ] Applying decomposition
[2026-05-24 12:01:02] [INFO ] Flatten gal took : 10 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/graph11268586278040841940.txt' '-o' '/tmp/graph11268586278040841940.bin' '-w' '/tmp/graph11268586278040841940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11268586278040841940.bin' '-l' '-1' '-v' '-w' '/tmp/graph11268586278040841940.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:01:02] [INFO ] Decomposing Gal with order
[2026-05-24 12:01:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:01:02] [INFO ] Removed a total of 254 redundant transitions.
[2026-05-24 12:01:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:01:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-24 12:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4742094573146418564.gal : 3 ms
[2026-05-24 12:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10529449463194467332.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/CTLFireability4742094573146418564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10529449463194467332.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.
Detected timeout of ITS tools.
[2026-05-24 12:01:32] [INFO ] Flatten gal took : 11 ms
[2026-05-24 12:01:32] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:01:32] [INFO ] Applying decomposition
[2026-05-24 12:01:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12826582196098949732.txt' '-o' '/tmp/graph12826582196098949732.bin' '-w' '/tmp/graph12826582196098949732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12826582196098949732.bin' '-l' '-1' '-v' '-w' '/tmp/graph12826582196098949732.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:01:32] [INFO ] Decomposing Gal with order
[2026-05-24 12:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:01:32] [INFO ] Removed a total of 259 redundant transitions.
[2026-05-24 12:01:32] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-24 12:01:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10829866303339275317.gal : 4 ms
[2026-05-24 12:01:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8123075292914370522.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/CTLFireability10829866303339275317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8123075292914370522.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 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,5.35276e+25,6.45966,192772,11434,152,345513,2623,1223,586341,106,8489,0


Converting to forward existential form...Done !
original formula: (AX(AX(EG((((i16.i0.u78.p221==0)||(i6.i1.u142.p436==0))||((i17.u146.p595==0)||((i17.u161.p527==1)&&(i6.i2.u139.p425==1))))))) * (A((i0.i1...396
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(EG((((i16.i0.u78.p221==0)||(i6.i1.u142.p436==0))||((i17.u146.p595==0)||((i17.u161.p527==1)&&...1213
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t41, t197, t203, t215, t306, t316, t440, t441, t443, i0.i0.u89.t188, i0.i0.u145.t...1691
ITS-tools command line returned an error code 139
[2026-05-24 12:04:20] [INFO ] Applying decomposition
[2026-05-24 12:04:20] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:04:20] [INFO ] Decomposing Gal with order
[2026-05-24 12:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:04:20] [INFO ] Removed a total of 135 redundant transitions.
[2026-05-24 12:04:20] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 68 ms.
[2026-05-24 12:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1961592476774949504.gal : 6 ms
[2026-05-24 12:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9456672827586421443.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/CTLFireability1961592476774949504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9456672827586421443.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 4 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 12:29:44] [INFO ] Flatten gal took : 165 ms
[2026-05-24 12:29:45] [INFO ] Input system was already deterministic with 459 transitions.
[2026-05-24 12:29:45] [INFO ] Transformed 520 places.
[2026-05-24 12:29:45] [INFO ] Transformed 459 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 12:30:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16643228743937614239.gal : 7 ms
[2026-05-24 12:30:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16339450650925368098.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16643228743937614239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16339450650925368098.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-15"
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-15, 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-177946842000562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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