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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 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.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 161K 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-17-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779625057877

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 12:17:38] [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 12:17:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:17:39] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-24 12:17:39] [INFO ] Transformed 650 places.
[2026-05-24 12:17:39] [INFO ] Transformed 580 transitions.
[2026-05-24 12:17:39] [INFO ] Found NUPN structural information;
[2026-05-24 12:17:39] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 193 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 125 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 76 place count 570 transition count 503
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 570 transition count 503
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 178 place count 541 transition count 474
Iterating global reduction 1 with 29 rules applied. Total rules applied 207 place count 541 transition count 474
Applied a total of 207 rules in 131 ms. Remains 541 /646 variables (removed 105) and now considering 474/576 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16913596506358233284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7347348670357850806.kers'
[2026-05-24 12:17:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16913596506358233284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7347348670357850806.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 541 cols 1494 entries
Finished phase 1 with 357 SingleSign rule and 79 generalized
[2026-05-24 12:17:39] [INFO ] Computed 105 invariants in 3 ms
Computed 105 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7347348670357850806.kers
Total runtime 5 ms.
[2026-05-24 12:17:39] [INFO ] Implicit Places using invariants in 540 ms returned []
[2026-05-24 12:17:39] [INFO ] Invariant cache hit.
[2026-05-24 12:17:40] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2026-05-24 12:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/1015 variables, and 165 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/541 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 60/165 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 60168ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 541/646 places, 474/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61930 ms. Remains : 541/646 places, 474/576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Applied a total of 0 rules in 15 ms. Remains 541 /541 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2026-05-24 12:18:41] [INFO ] Invariant cache hit.
[2026-05-24 12:18:41] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 12:18:41] [INFO ] Invariant cache hit.
[2026-05-24 12:18:42] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1198 ms. Remains : 541/541 places, 474/474 transitions.
Support contains 125 out of 541 places after structural reductions.
[2026-05-24 12:18:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 12:18:42] [INFO ] Flatten gal took : 62 ms
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 12:18:42] [INFO ] Flatten gal took : 29 ms
[2026-05-24 12:18:42] [INFO ] Input system was already deterministic with 474 transitions.
Support contains 114 out of 541 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (260 resets) in 1794 ms. (22 steps per ms) remains 34/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
[2026-05-24 12:18:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 248/304 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 153/457 variables, 39/83 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 5 (OVERLAPS) 74/531 variables, 20/103 constraints. Problems are: Problem set: 3 solved, 31 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/123 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 4/535 variables, 2/125 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/125 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 470/1005 variables, 535/660 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1005 variables, 0/660 constraints. Problems are: Problem set: 4 solved, 30 unsolved
SMT process timed out in 5025ms, After SMT, problems are : Problem set: 4 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (complete) has 1195 edges and 541 vertex of which 540 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 540 transition count 421
Reduce places removed 52 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 57 rules applied. Total rules applied 110 place count 488 transition count 416
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 483 transition count 416
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 115 place count 483 transition count 312
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 340 place count 362 transition count 312
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 359 place count 343 transition count 293
Ensure Unique test removed 1 places
Iterating global reduction 3 with 20 rules applied. Total rules applied 379 place count 342 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 379 place count 342 transition count 292
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 381 place count 341 transition count 292
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 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 615 place count 222 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 222 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 618 place count 221 transition count 180
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 625 place count 221 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 626 place count 220 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 627 place count 219 transition count 179
Applied a total of 627 rules in 104 ms. Remains 219 /541 variables (removed 322) and now considering 179/474 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 219/541 places, 179/474 transitions.
RANDOM walk for 40000 steps (2600 resets) in 812 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (52 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (52 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (49 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (50 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (52 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (51 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (49 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (52 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (48 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (49 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 624976 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :23 out of 30
Probabilistic random walk after 624976 steps, saw 111317 distinct states, run finished after 3007 ms. (steps per millisecond=207 ) properties seen :23
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4804556256170223217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16995182308896165617.kers'
[2026-05-24 12:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4804556256170223217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16995182308896165617.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 179 rows 183 cols 755 entries
Finished phase 1 with 124 SingleSign rule and 13 generalized
[2026-05-24 12:18:52] [INFO ] Computed 82 invariants in 1 ms
Computed 82 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16995182308896165617.kers
Total runtime 1 ms.
[2026-05-24 12:18:52] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/94 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 54/148 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 4/40 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/172 variables, 22/62 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/176 variables, 2/64 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/180 variables, 4/68 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 178/358 variables, 180/248 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 5/253 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/358 variables, 0/253 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 40/398 variables, 39/292 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 18/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/398 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/398 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 310 constraints, problems are : Problem set: 3 solved, 4 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 219/219 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/41 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 48/89 variables, 17/24 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/25 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 56/145 variables, 11/36 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 3/39 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/40 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/40 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/169 variables, 22/62 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/62 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/173 variables, 2/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 0/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/177 variables, 4/68 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 1/69 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 0/69 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 177/354 variables, 177/246 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 5/251 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 1/252 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/354 variables, 1/253 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/354 variables, 0/253 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/398 variables, 42/295 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/398 variables, 19/314 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/398 variables, 1/315 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/398 variables, 0/315 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/398 variables, 0/315 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 315 constraints, problems are : Problem set: 6 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 219/219 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 970ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Graph (trivial) has 34 edges and 219 vertex of which 2 / 219 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 218 transition count 171
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 212 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 13 place count 212 transition count 160
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 38 place count 198 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 193 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 193 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 78 place count 178 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 178 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 176 transition count 138
Applied a total of 82 rules in 29 ms. Remains 176 /219 variables (removed 43) and now considering 138/179 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 176/219 places, 138/179 transitions.
RANDOM walk for 40000 steps (1021 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13641 steps (98 resets) in 32 ms. (413 steps per ms) remains 0/1 properties
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 23 ms
[2026-05-24 12:18:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 23 ms
[2026-05-24 12:18:53] [INFO ] Input system was already deterministic with 474 transitions.
Support contains 82 out of 541 places (down from 85) after GAL structural reductions.
Computed a total of 224 stabilizing places and 196 stable transitions
Graph (complete) has 1195 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 266 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1189 edges and 536 vertex of which 535 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 534 transition count 398
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 466 transition count 398
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 138 place count 466 transition count 289
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 376 place count 337 transition count 289
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 403 place count 310 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 431 place count 309 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 431 place count 309 transition count 261
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 433 place count 308 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 687 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 177 transition count 135
Applied a total of 689 rules in 56 ms. Remains 177 /541 variables (removed 364) and now considering 135/474 (removed 339) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17419543540078515735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18126579522899536990.kers'
[2026-05-24 12:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17419543540078515735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18126579522899536990.kers]
Normalized transition count is 134 out of 135 initially.
Culling duplicate invariants (modulo rational): removing 56 columns.
Culled 56 columns in 0 ms.
// Phase 1: matrix 134 rows 121 cols 513 entries
Finished phase 1 with 85 SingleSign rule and 13 generalized
[2026-05-24 12:18:53] [INFO ] Computed 79 invariants in 3 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18126579522899536990.kers
Total runtime 3 ms.
[2026-05-24 12:18:53] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55]
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 : 156/541 places, 135/474 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 156/541 places, 135/474 transitions.
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:18:53] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 2523 steps (515 resets) in 55 ms. (45 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:18:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:18:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14416385843125611765.gal : 3 ms
[2026-05-24 12:18:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4987675010677148792.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14416385843125611765.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4987675010677148792.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 263 edges and 541 vertex of which 6 / 541 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 1189 edges and 536 vertex of which 535 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 534 transition count 401
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 469 transition count 399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 467 transition count 399
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 136 place count 467 transition count 289
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 375 place count 338 transition count 289
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 403 place count 310 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 432 place count 309 transition count 261
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 678 place count 184 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 679 place count 183 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 680 place count 182 transition count 139
Applied a total of 680 rules in 51 ms. Remains 182 /541 variables (removed 359) and now considering 139/474 (removed 335) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9779291139178138877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9750448855920683649.kers'
[2026-05-24 12:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9779291139178138877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9750448855920683649.kers]
Normalized transition count is 138 out of 139 initially.
Culling duplicate invariants (modulo rational): removing 38 columns.
Culled 38 columns in 0 ms.
// Phase 1: matrix 138 rows 144 cols 625 entries
Finished phase 1 with 89 SingleSign rule and 13 generalized
[2026-05-24 12:18:53] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9750448855920683649.kers
Total runtime 1 ms.
[2026-05-24 12:18:54] [INFO ] Implicit Places using invariants in 156 ms returned [35, 36, 37, 38, 45, 46, 49, 54, 55, 56, 57, 58, 59, 60, 149]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 157 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 167/541 places, 139/474 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 167/541 places, 139/474 transitions.
[2026-05-24 12:18:54] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:18:54] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:18:54] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-24 12:18:54] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:18:54] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1367871906276538717.gal : 3 ms
[2026-05-24 12:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17823287139812147964.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/CTLFireability1367871906276538717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17823287139812147964.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,18438,0.098585,7580,2,2024,5,11226,6,0,806,8377,0


Converting to forward existential form...Done !
original formula: EF((AG(((p288==1)||((p76==1)&&(p23==1)))) + (p190==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p288==1)||((p76==1)&&(p23==1)))))))] != FALSE + [(FwdU(Init,TRUE) * (p190==1...168
Reverse transition relation is NOT exact ! Due to transitions t26, t32, t33, t34, t35, t36, t70, t71, t72, t73, t74, t76, t86, t91, t92, t93, t109, t113, t...272
(forward)formula 0,1,0.673494,32188,1,0,186,103290,264,97,6015,64015,255
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-01 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 : 541/541 places, 474/474 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 513 transition count 446
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 513 transition count 446
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 504 transition count 437
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 504 transition count 437
Applied a total of 74 rules in 38 ms. Remains 504 /541 variables (removed 37) and now considering 437/474 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4114687741397840227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4969591218670223110.kers'
[2026-05-24 12:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4114687741397840227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4969591218670223110.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 437 rows 504 cols 1420 entries
Finished phase 1 with 320 SingleSign rule and 79 generalized
[2026-05-24 12:18:54] [INFO ] Computed 105 invariants in 7 ms
Computed 105 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4969591218670223110.kers
Total runtime 9 ms.
[2026-05-24 12:18:55] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-24 12:18:55] [INFO ] Invariant cache hit.
[2026-05-24 12:18:56] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-24 12:18:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/941 variables, and 168 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/188 constraints. Problems are: Problem set: 9 solved, 427 unsolved
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/208 constraints. Problems are: Problem set: 19 solved, 417 unsolved
Problem TDEAD360 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/228 constraints. Problems are: Problem set: 20 solved, 416 unsolved
Problem TDEAD388 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/248 constraints. Problems are: Problem set: 21 solved, 415 unsolved
Problem TDEAD398 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/268 constraints. Problems are: Problem set: 22 solved, 414 unsolved
SMT process timed out in 60198ms, After SMT, problems are : Problem set: 22 solved, 414 unsolved
Search for dead transitions found 22 dead transitions in 60201ms
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 : 504/541 places, 415/474 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62319 ms. Remains : 504/541 places, 415/474 transitions.
[2026-05-24 12:19:57] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:19:57] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:19:57] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-24 12:19:57] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:19:57] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:19:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2387832604423558314.gal : 6 ms
[2026-05-24 12:19:57] [INFO ] Time to serialize properties into /tmp/CTLFireability418797584881076022.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/CTLFireability2387832604423558314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability418797584881076022.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 12:20:27] [INFO ] Flatten gal took : 12 ms
[2026-05-24 12:20:27] [INFO ] Applying decomposition
[2026-05-24 12:20:27] [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/graph9840788785916680709.txt' '-o' '/tmp/graph9840788785916680709.bin' '-w' '/tmp/graph9840788785916680709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9840788785916680709.bin' '-l' '-1' '-v' '-w' '/tmp/graph9840788785916680709.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:20:27] [INFO ] Decomposing Gal with order
[2026-05-24 12:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:20:27] [INFO ] Removed a total of 163 redundant transitions.
[2026-05-24 12:20:27] [INFO ] Flatten gal took : 194 ms
[2026-05-24 12:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 34 ms.
[2026-05-24 12:20:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7347161247249336856.gal : 22 ms
[2026-05-24 12:20:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13923580057051589531.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/CTLFireability7347161247249336856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13923580057051589531.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97853e+26,2.55785,85924,6091,49,148294,709,1119,461069,66,1746,0


Converting to forward existential form...Done !
original formula: !(A(!(EX((((i10.u79.p232==1)&&(i12.i1.u130.p431==1))&&(i10.u161.p593==1)))) U (A(AF((i4.u142.p502==1)) U (EF((i6.i1.u112.p347==1)) + A(((...270
=> equivalent forward existential formula: (([(((FwdU(((FwdU(Init,!((!((E(!((E(TRUE U (i6.i1.u112.p347==1)) + !((E(!((i13.i2.u125.p412==1)) U (!((((i16.u64...3033
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t174, t182, t194, t272, t280, t284, t396, t397, t399, t408, i0.i0.u136.t69, i0.i1.u84...1399
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found 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 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 : 541/541 places, 474/474 transitions.
Graph (trivial) has 266 edges and 541 vertex of which 6 / 541 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 1189 edges and 536 vertex of which 535 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 534 transition count 398
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 466 transition count 398
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 138 place count 466 transition count 290
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 373 place count 339 transition count 290
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 401 place count 311 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 430 place count 310 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 430 place count 310 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 432 place count 309 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 686 place count 180 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 687 place count 179 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 688 place count 178 transition count 135
Applied a total of 688 rules in 52 ms. Remains 178 /541 variables (removed 363) and now considering 135/474 (removed 339) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9340094264069015457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17468510160202230158.kers'
[2026-05-24 12:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9340094264069015457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17468510160202230158.kers]
Normalized transition count is 134 out of 135 initially.
Culling duplicate invariants (modulo rational): removing 56 columns.
Culled 56 columns in 0 ms.
// Phase 1: matrix 134 rows 122 cols 515 entries
Finished phase 1 with 85 SingleSign rule and 13 generalized
[2026-05-24 12:20:58] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17468510160202230158.kers
Total runtime 2 ms.
[2026-05-24 12:20:58] [INFO ] Implicit Places using invariants in 174 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 56, 57, 58, 150]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 178 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/541 places, 135/474 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 238 ms. Remains : 156/541 places, 135/474 transitions.
[2026-05-24 12:20:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:20:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:20:58] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-24 12:20:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:20:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:20:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15563979106463192149.gal : 1 ms
[2026-05-24 12:20:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13346731522514486929.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/CTLFireability15563979106463192149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13346731522514486929.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,13278,0.08451,7376,2,1889,5,11239,6,0,759,8507,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p233==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p233==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t29, t30, t31, t32, t33, t67, t68, t69, t70, t71, t87, t88, t89, t105, t109, t110, t111,...262
(forward)formula 0,1,0.584388,30640,1,0,179,104405,255,97,5589,63741,256
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 511 transition count 444
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 511 transition count 444
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 502 transition count 435
Applied a total of 78 rules in 32 ms. Remains 502 /541 variables (removed 39) and now considering 435/474 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3637732470407973300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8966431594908990063.kers'
[2026-05-24 12:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3637732470407973300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8966431594908990063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 502 cols 1416 entries
Finished phase 1 with 318 SingleSign rule and 79 generalized
[2026-05-24 12:20:58] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8966431594908990063.kers
Total runtime 4 ms.
[2026-05-24 12:20:59] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-24 12:20:59] [INFO ] Invariant cache hit.
[2026-05-24 12:21:00] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-24 12:21:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 15 solved, 419 unsolved
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 27 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 27 solved, 407 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 27 solved, 407 unsolved
Search for dead transitions found 27 dead transitions in 30131ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/541 places, 408/474 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32124 ms. Remains : 502/541 places, 408/474 transitions.
[2026-05-24 12:21:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:21:31] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:21:31] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-24 12:21:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:21:31] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:21:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17505501469336684592.gal : 2 ms
[2026-05-24 12:21:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13803121963644020687.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/CTLFireability17505501469336684592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13803121963644020687.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 12:22:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:22:01] [INFO ] Applying decomposition
[2026-05-24 12:22:01] [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/graph8998792896369668662.txt' '-o' '/tmp/graph8998792896369668662.bin' '-w' '/tmp/graph8998792896369668662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8998792896369668662.bin' '-l' '-1' '-v' '-w' '/tmp/graph8998792896369668662.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:22:01] [INFO ] Decomposing Gal with order
[2026-05-24 12:22:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:22:01] [INFO ] Removed a total of 144 redundant transitions.
[2026-05-24 12:22:01] [INFO ] Flatten gal took : 19 ms
[2026-05-24 12:22:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-24 12:22:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3643189605239394071.gal : 5 ms
[2026-05-24 12:22:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11421652983448848051.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/CTLFireability3643189605239394071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11421652983448848051.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95452e+26,0.846656,32544,5455,50,48262,504,1105,98541,63,1088,0


Converting to forward existential form...Done !
original formula: AG(EF(((i7.i3.u157.p577==0) + AX((i12.i2.u119.p382==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i7.i3.u157.p577==0) + !(EX(!((i12.i2.u119.p382==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t172, t176, t192, t270, t291, t388, t389, t390, t392, t393, t401, i0.t184, i0.t180, i...1367
(forward)formula 0,1,7.41277,251252,1,0,484013,566,6973,815266,290,1636,1302899
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 266 edges and 541 vertex of which 6 / 541 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 1189 edges and 536 vertex of which 535 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 534 transition count 398
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 466 transition count 398
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 138 place count 466 transition count 289
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 376 place count 337 transition count 289
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 403 place count 310 transition count 262
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 431 place count 309 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 431 place count 309 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 433 place count 308 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 687 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 177 transition count 135
Applied a total of 689 rules in 63 ms. Remains 177 /541 variables (removed 364) and now considering 135/474 (removed 339) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15623333217384087703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-122740506125888007.kers'
[2026-05-24 12:22:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15623333217384087703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-122740506125888007.kers]
Normalized transition count is 134 out of 135 initially.
Culling duplicate invariants (modulo rational): removing 56 columns.
Culled 56 columns in 0 ms.
// Phase 1: matrix 134 rows 121 cols 513 entries
Finished phase 1 with 85 SingleSign rule and 13 generalized
[2026-05-24 12:22:08] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-122740506125888007.kers
Total runtime 1 ms.
[2026-05-24 12:22:08] [INFO ] Implicit Places using invariants in 146 ms returned [0, 1, 2, 3, 4, 8, 9, 34, 35, 36, 37, 44, 45, 46, 51, 52, 53, 54, 55, 56, 57]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 147 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/541 places, 135/474 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 156/541 places, 135/474 transitions.
[2026-05-24 12:22:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:22:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:22:08] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-24 12:22:08] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:22:08] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:22:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15276859691691598452.gal : 5 ms
[2026-05-24 12:22:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12643798038659428367.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15276859691691598452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12643798038659428367.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12643798038659428367.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 30
RANDOM walk for 40000 steps (8334 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 450
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :852 after 1026
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1026 after 2356
BEST_FIRST walk for 40003 steps (2470 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 535 steps, run visited all 1 properties in 4 ms. (steps per millisecond=133 )
Probabilistic random walk after 535 steps, saw 246 distinct states, run finished after 8 ms. (steps per millisecond=66 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 512 transition count 445
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 512 transition count 445
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 504 transition count 437
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 504 transition count 437
Applied a total of 74 rules in 37 ms. Remains 504 /541 variables (removed 37) and now considering 437/474 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15175938347439562915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15695401100012038401.kers'
[2026-05-24 12:22:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15175938347439562915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15695401100012038401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 504 cols 1420 entries
Finished phase 1 with 320 SingleSign rule and 79 generalized
[2026-05-24 12:22:09] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15695401100012038401.kers
Total runtime 3 ms.
[2026-05-24 12:22:09] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-24 12:22:09] [INFO ] Invariant cache hit.
[2026-05-24 12:22:11] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-24 12:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 9 solved, 427 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/145 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/165 constraints. Problems are: Problem set: 21 solved, 415 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/941 variables, and 178 constraints, problems are : Problem set: 21 solved, 415 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 17/17 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/17 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 83/100 constraints. Problems are: Problem set: 21 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 5/105 constraints. Problems are: Problem set: 21 solved, 415 unsolved
Problem TDEAD377 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 73/178 constraints. Problems are: Problem set: 23 solved, 413 unsolved
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/198 constraints. Problems are: Problem set: 28 solved, 408 unsolved
Problem TDEAD361 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/218 constraints. Problems are: Problem set: 29 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/238 constraints. Problems are: Problem set: 29 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/258 constraints. Problems are: Problem set: 29 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/278 constraints. Problems are: Problem set: 29 solved, 407 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 20/298 constraints. Problems are: Problem set: 29 solved, 407 unsolved
SMT process timed out in 60116ms, After SMT, problems are : Problem set: 29 solved, 407 unsolved
Search for dead transitions found 29 dead transitions in 60119ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 504/541 places, 408/474 transitions.
Applied a total of 0 rules in 15 ms. Remains 504 /504 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62234 ms. Remains : 504/541 places, 408/474 transitions.
[2026-05-24 12:23:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:23:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:23:11] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-24 12:23:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:23:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14902310486308934307.gal : 2 ms
[2026-05-24 12:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6271269732915540474.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/CTLFireability14902310486308934307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6271269732915540474.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 12:23:41] [INFO ] Flatten gal took : 11 ms
[2026-05-24 12:23:41] [INFO ] Applying decomposition
[2026-05-24 12:23: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/graph7502024339672625438.txt' '-o' '/tmp/graph7502024339672625438.bin' '-w' '/tmp/graph7502024339672625438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7502024339672625438.bin' '-l' '-1' '-v' '-w' '/tmp/graph7502024339672625438.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:23:41] [INFO ] Decomposing Gal with order
[2026-05-24 12:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:23:41] [INFO ] Removed a total of 135 redundant transitions.
[2026-05-24 12:23:41] [INFO ] Flatten gal took : 19 ms
[2026-05-24 12:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 12:23:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17462061210920725687.gal : 5 ms
[2026-05-24 12:23:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8209997341042461473.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/CTLFireability17462061210920725687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8209997341042461473.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96819e+26,1.34482,44792,5514,59,75539,1259,1019,158900,62,2791,0


Converting to forward existential form...Done !
original formula: AG(!(A(((EX((i6.u15.p35==1)) + EF((i9.i0.u55.p160==1))) + AF((((i5.u14.p29==1)&&(i18.u106.p305==1))&&(i19.u139.p611==1)))) U (i20.i0.u34....166
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((i20.i0.u34.p101==1))))) * !(E(!((i20.i0.u34.p101==1)) U (!(((EX((i6.u15.p35==1)) + ...298
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t171, t183, t191, t271, t388, t389, t390, t392, t393, i0.i0.u86.t174, i0.i0.u90.t166...1308
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 510 transition count 443
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 510 transition count 443
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 501 transition count 434
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 501 transition count 434
Applied a total of 80 rules in 29 ms. Remains 501 /541 variables (removed 40) and now considering 434/474 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5188274956400838476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16055119625979885131.kers'
[2026-05-24 12:24:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5188274956400838476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16055119625979885131.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 434 rows 501 cols 1414 entries
Finished phase 1 with 317 SingleSign rule and 79 generalized
[2026-05-24 12:24:11] [INFO ] Computed 105 invariants in 9 ms
Computed 105 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16055119625979885131.kers
Total runtime 12 ms.
[2026-05-24 12:24:12] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-24 12:24:12] [INFO ] Invariant cache hit.
[2026-05-24 12:24:13] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2026-05-24 12:24:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 3 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 3 solved, 430 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 3 solved, 430 unsolved
Search for dead transitions found 3 dead transitions in 30173ms
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 : 501/541 places, 431/474 transitions.
Applied a total of 0 rules in 19 ms. Remains 501 /501 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32129 ms. Remains : 501/541 places, 431/474 transitions.
[2026-05-24 12:24:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:24:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:24:43] [INFO ] Input system was already deterministic with 431 transitions.
[2026-05-24 12:24:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:24:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:24:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5363586546735545141.gal : 2 ms
[2026-05-24 12:24:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12744044905594888881.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/CTLFireability5363586546735545141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12744044905594888881.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 12:25:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:25:13] [INFO ] Applying decomposition
[2026-05-24 12:25:13] [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/graph7936983179883339796.txt' '-o' '/tmp/graph7936983179883339796.bin' '-w' '/tmp/graph7936983179883339796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7936983179883339796.bin' '-l' '-1' '-v' '-w' '/tmp/graph7936983179883339796.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:25:13] [INFO ] Decomposing Gal with order
[2026-05-24 12:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:25:13] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-24 12:25:13] [INFO ] Flatten gal took : 17 ms
[2026-05-24 12:25:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2026-05-24 12:25:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5489758561094701565.gal : 4 ms
[2026-05-24 12:25:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15331761331016478413.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/CTLFireability5489758561094701565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15331761331016478413.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95422e+26,6.69517,151496,9490,59,226412,630,1113,430440,62,1454,0


Converting to forward existential form...Done !
original formula: AX(AG((i15.i2.u96.p287!=1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((i15.i2.u96.p287!=1)))] = FALSE
(forward)formula 0,0,11.9269,160800,1,0,240332,630,2639,452279,100,1454,626364
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 267 edges and 541 vertex of which 6 / 541 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 1189 edges and 536 vertex of which 535 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 534 transition count 398
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 466 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 465 transition count 397
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 140 place count 465 transition count 289
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 375 place count 338 transition count 289
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 403 place count 310 transition count 261
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 432 place count 309 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 432 place count 309 transition count 260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 434 place count 308 transition count 260
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 688 place count 179 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 689 place count 178 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 177 transition count 134
Applied a total of 690 rules in 35 ms. Remains 177 /541 variables (removed 364) and now considering 134/474 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10134963622734167620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-478996449237106221.kers'
[2026-05-24 12:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10134963622734167620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-478996449237106221.kers]
Normalized transition count is 133 out of 134 initially.
Culling duplicate invariants (modulo rational): removing 56 columns.
Culled 56 columns in 0 ms.
// Phase 1: matrix 133 rows 121 cols 513 entries
Finished phase 1 with 82 SingleSign rule and 15 generalized
[2026-05-24 12:25:26] [INFO ] Computed 80 invariants in 0 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-478996449237106221.kers
Total runtime 1 ms.
[2026-05-24 12:25:26] [INFO ] Implicit Places using invariants in 151 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 42, 43, 46, 51, 52, 53, 54, 55, 56, 57, 144]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 164 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 155/541 places, 134/474 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 203 ms. Remains : 155/541 places, 134/474 transitions.
[2026-05-24 12:25:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:25:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:25:26] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-24 12:25:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:25:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:25:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9880103010355466003.gal : 0 ms
[2026-05-24 12:25:26] [INFO ] Time to serialize properties into /tmp/CTLFireability18191536970600987480.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/CTLFireability9880103010355466003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18191536970600987480.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,13470,0.085384,7344,2,1834,5,11224,6,0,754,8433,0


Converting to forward existential form...Done !
original formula: AG(EF((p190==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p190==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t29, t30, t31, t32, t66, t67, t68, t69, t70, t86, t87, t88, t104, t108, t109, t110,...262
(forward)formula 0,1,0.570099,28788,1,0,170,95992,252,89,5541,57298,241
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 511 transition count 444
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 511 transition count 444
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 502 transition count 435
Applied a total of 78 rules in 33 ms. Remains 502 /541 variables (removed 39) and now considering 435/474 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17755893966645952558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-419331274087278916.kers'
[2026-05-24 12:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17755893966645952558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-419331274087278916.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 435 rows 502 cols 1416 entries
Finished phase 1 with 318 SingleSign rule and 79 generalized
[2026-05-24 12:25:26] [INFO ] Computed 105 invariants in 7 ms
Computed 105 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-419331274087278916.kers
Total runtime 9 ms.
[2026-05-24 12:25:27] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-24 12:25:27] [INFO ] Invariant cache hit.
[2026-05-24 12:25:28] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-24 12:25:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 16 solved, 418 unsolved
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 22 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 22 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/937 variables, and 179 constraints, problems are : Problem set: 22 solved, 412 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 22 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 22 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 22 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 22 solved, 412 unsolved
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 74/179 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/199 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/219 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/239 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/259 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/279 constraints. Problems are: Problem set: 31 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 20/299 constraints. Problems are: Problem set: 31 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/937 variables, and 317 constraints, problems are : Problem set: 31 solved, 403 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 212/212 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 31 solved, 403 unsolved
Search for dead transitions found 31 dead transitions in 60076ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/541 places, 404/474 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61774 ms. Remains : 502/541 places, 404/474 transitions.
[2026-05-24 12:26:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:26:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:26:28] [INFO ] Input system was already deterministic with 404 transitions.
[2026-05-24 12:26:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:26:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:26:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12459072398590141782.gal : 2 ms
[2026-05-24 12:26:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12873583549438774175.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/CTLFireability12459072398590141782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12873583549438774175.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 12:26:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:26:58] [INFO ] Applying decomposition
[2026-05-24 12:26:58] [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/graph10506787499986916489.txt' '-o' '/tmp/graph10506787499986916489.bin' '-w' '/tmp/graph10506787499986916489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10506787499986916489.bin' '-l' '-1' '-v' '-w' '/tmp/graph10506787499986916489.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:26:58] [INFO ] Decomposing Gal with order
[2026-05-24 12:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:26:58] [INFO ] Removed a total of 129 redundant transitions.
[2026-05-24 12:26:58] [INFO ] Flatten gal took : 28 ms
[2026-05-24 12:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2026-05-24 12:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1453886048089836501.gal : 5 ms
[2026-05-24 12:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16478555939815026954.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/CTLFireability1453886048089836501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16478555939815026954.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95504e+26,0.88626,29472,4130,43,48321,618,1064,108710,56,1384,0


Converting to forward existential form...Done !
original formula: EF((AX((((i17.i1.u40.p125==1)&&(i17.i1.u112.p351==1))&&(i17.i1.u146.p625==1))) + ((EF(AG((i16.u135.p533==1))) * (i17.i1.u43.p131==1)) * (...203
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((((i17.i1.u40.p125==1)&&(i17.i1.u112.p351==1))&&(i17.i1.u146.p625==1))))))] != FALSE...311
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t172, t180, t278, t385, t386, t388, t389, t397, i0.i0.u133.t72, i0.i0.u134.t69, ...1371
(forward)formula 0,1,4.50782,166108,1,0,311455,618,5823,732331,236,1384,788539
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 512 transition count 445
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 512 transition count 445
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 503 transition count 436
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 503 transition count 436
Applied a total of 76 rules in 34 ms. Remains 503 /541 variables (removed 38) and now considering 436/474 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11121196309623842604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12972037362911684374.kers'
[2026-05-24 12:27:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11121196309623842604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12972037362911684374.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 436 rows 503 cols 1418 entries
Finished phase 1 with 319 SingleSign rule and 79 generalized
[2026-05-24 12:27:03] [INFO ] Computed 105 invariants in 9 ms
Computed 105 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12972037362911684374.kers
Total runtime 10 ms.
[2026-05-24 12:27:03] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-24 12:27:03] [INFO ] Invariant cache hit.
[2026-05-24 12:27:05] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2026-05-24 12:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Problem TDEAD358 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 10 solved, 425 unsolved
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 10 solved, 425 unsolved
Search for dead transitions found 10 dead transitions in 30134ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/541 places, 426/474 transitions.
Applied a total of 0 rules in 13 ms. Remains 503 /503 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32238 ms. Remains : 503/541 places, 426/474 transitions.
[2026-05-24 12:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:27:35] [INFO ] Input system was already deterministic with 426 transitions.
[2026-05-24 12:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:27:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13472969748970354601.gal : 2 ms
[2026-05-24 12:27:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5079853979670927138.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/CTLFireability13472969748970354601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5079853979670927138.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 12:28:05] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:28:05] [INFO ] Applying decomposition
[2026-05-24 12:28:05] [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/graph1800137400942317224.txt' '-o' '/tmp/graph1800137400942317224.bin' '-w' '/tmp/graph1800137400942317224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1800137400942317224.bin' '-l' '-1' '-v' '-w' '/tmp/graph1800137400942317224.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:28:05] [INFO ] Decomposing Gal with order
[2026-05-24 12:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:28:05] [INFO ] Removed a total of 219 redundant transitions.
[2026-05-24 12:28:05] [INFO ] Flatten gal took : 26 ms
[2026-05-24 12:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-24 12:28:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15422113624220207064.gal : 4 ms
[2026-05-24 12:28:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10748041425765595737.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/CTLFireability15422113624220207064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10748041425765595737.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95707e+26,1.4016,51424,4486,51,85259,709,1137,207836,54,1975,0


Converting to forward existential form...Done !
original formula: (A(E(((i11.i0.u25.p75==1)&&(i14.u136.p474==1)) U ((E((i14.u134.p600!=1) U AF((((i1.i2.u82.p246==1)&&(i1.i2.u131.p451==1))&&(i1.i0.u160.p6...362
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((!(!((E(!((i5.i0.u12.p28!=1)) U (!(!((E(!((i5.i1.u102.p303==1)) U (!((i12.i0.u20.p52==1)...1144
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t173, t185, t271, t283, t406, t408, t410, t411, t419, i0.i0.u87.t168, i0.i0.u...1368
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 513 transition count 446
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 513 transition count 446
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 504 transition count 437
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 504 transition count 437
Applied a total of 74 rules in 28 ms. Remains 504 /541 variables (removed 37) and now considering 437/474 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1080638954113578228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3600346261736616080.kers'
[2026-05-24 12:28:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1080638954113578228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3600346261736616080.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 504 cols 1420 entries
Finished phase 1 with 320 SingleSign rule and 79 generalized
[2026-05-24 12:28:35] [INFO ] Computed 105 invariants in 7 ms
Computed 105 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3600346261736616080.kers
Total runtime 8 ms.
[2026-05-24 12:28:36] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-24 12:28:36] [INFO ] Invariant cache hit.
[2026-05-24 12:28:38] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-24 12:28:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 436 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Starting structural reductions in LTL mode, iteration 1 : 504/541 places, 437/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32259 ms. Remains : 504/541 places, 437/474 transitions.
[2026-05-24 12:29:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:29:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:29:08] [INFO ] Input system was already deterministic with 437 transitions.
[2026-05-24 12:29:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:29:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:29:08] [INFO ] Time to serialize gal into /tmp/CTLFireability213438671521562820.gal : 2 ms
[2026-05-24 12:29:08] [INFO ] Time to serialize properties into /tmp/CTLFireability18094852426392412646.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/CTLFireability213438671521562820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18094852426392412646.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:29:38] [INFO ] Flatten gal took : 11 ms
[2026-05-24 12:29:38] [INFO ] Applying decomposition
[2026-05-24 12:29:38] [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/graph5824992321330625252.txt' '-o' '/tmp/graph5824992321330625252.bin' '-w' '/tmp/graph5824992321330625252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5824992321330625252.bin' '-l' '-1' '-v' '-w' '/tmp/graph5824992321330625252.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:29:38] [INFO ] Decomposing Gal with order
[2026-05-24 12:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:29:38] [INFO ] Removed a total of 268 redundant transitions.
[2026-05-24 12:29:38] [INFO ] Flatten gal took : 21 ms
[2026-05-24 12:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-24 12:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3346961344113415116.gal : 5 ms
[2026-05-24 12:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2244910699266860216.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/CTLFireability3346961344113415116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2244910699266860216.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99708e+26,1.31615,46696,4752,64,80667,727,1106,176591,60,2052,0


Converting to forward existential form...Done !
original formula: AF(E(AX(!(E((i8.u133.p438==1) U (i15.u138.p508==1)))) U (((EG((i15.u138.p592==1)) + AF((i6.i1.u126.p403==1))) + (!(EF((i13.i0.u116.p353==...255
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EX(!(!(E((i8.u133.p438==1) U (i15.u138.p508==1)))))) U (((EG((i15.u138.p592==1)) + !(EG(!((i6.i...318
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t174, t182, t194, t272, t284, t418, t421, t422, t430, i0.t178, i0.u81.t185, i...1372
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (complete) has 1195 edges and 541 vertex of which 540 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 539 transition count 418
Reduce places removed 54 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 58 rules applied. Total rules applied 113 place count 485 transition count 414
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 481 transition count 414
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 117 place count 481 transition count 296
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 373 place count 343 transition count 296
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 397 place count 319 transition count 272
Ensure Unique test removed 1 places
Iterating global reduction 3 with 25 rules applied. Total rules applied 422 place count 318 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 422 place count 318 transition count 271
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 317 transition count 271
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 664 place count 195 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 665 place count 194 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 193 transition count 152
Applied a total of 666 rules in 47 ms. Remains 193 /541 variables (removed 348) and now considering 152/474 (removed 322) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4311847435039762542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4371253305183536249.kers'
[2026-05-24 12:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4311847435039762542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4371253305183536249.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 152 rows 178 cols 739 entries
Finished phase 1 with 71 SingleSign rule and 43 generalized
[2026-05-24 12:30:08] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4371253305183536249.kers
Total runtime 1 ms.
[2026-05-24 12:30:08] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-24 12:30:08] [INFO ] Invariant cache hit.
[2026-05-24 12:30:09] [INFO ] Implicit Places using invariants and state equation in 524 ms returned [102, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 730 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 178/541 places, 152/474 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 178 transition count 146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 172 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 164 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 162 transition count 140
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 162 transition count 140
Applied a total of 29 rules in 12 ms. Remains 162 /178 variables (removed 16) and now considering 140/152 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12144704708124860329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7312573162555664302.kers'
[2026-05-24 12:30:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12144704708124860329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7312573162555664302.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 140 rows 157 cols 690 entries
Finished phase 1 with 75 SingleSign rule and 27 generalized
[2026-05-24 12:30:09] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7312573162555664302.kers
Total runtime 1 ms.
[2026-05-24 12:30:09] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 12:30:09] [INFO ] Invariant cache hit.
[2026-05-24 12:30:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-24 12:30:10] [INFO ] Implicit Places using invariants and state equation in 632 ms returned [13, 14, 15, 38, 39, 40, 41, 42, 44, 46, 48, 49, 50, 51, 52]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 755 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 147/541 places, 140/474 transitions.
Graph (complete) has 488 edges and 147 vertex of which 138 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 130 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 130 transition count 104
Applied a total of 17 rules in 6 ms. Remains 130 /147 variables (removed 17) and now considering 104/140 (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-12894547529262151347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14187711394809399789.kers'
[2026-05-24 12:30:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12894547529262151347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14187711394809399789.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 104 rows 129 cols 439 entries
Finished phase 1 with 86 SingleSign rule and 4 generalized
[2026-05-24 12:30:10] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14187711394809399789.kers
Total runtime 1 ms.
[2026-05-24 12:30:10] [INFO ] Implicit Places using invariants in 159 ms returned [13, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 128/541 places, 104/474 transitions.
Applied a total of 0 rules in 16 ms. Remains 128 /128 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 1733 ms. Remains : 128/541 places, 104/474 transitions.
[2026-05-24 12:30:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:30:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:30:10] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 12:30:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:30:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability175345953938485201.gal : 1 ms
[2026-05-24 12:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4086945797348039764.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/CTLFireability175345953938485201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4086945797348039764.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 -...282
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,441446,0.211891,12200,2,5026,5,27955,6,0,611,33080,0


Converting to forward existential form...Done !
original formula: EF(((E(AG((p550==1)) U E((((p389==1)||(p378==1))||(((p235==1)&&(p445==1))&&(p611==1))) U EF((p38==1)))) + (((p49==1)&&(p435==1))&&(p611==...231
=> equivalent forward existential formula: (([(FwdU(FwdU(FwdU(FwdU(Init,TRUE),!(E(TRUE U !((p550==1))))),(((p389==1)||(p378==1))||(((p235==1)&&(p445==1))&&...372
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t9, t19, t20, t25, t26, t28, t29, t32, t33, t34, t41, t42, t43, t44, t47, t48, t49, t...298
Hit Full ! (commute/partial/dont) 57/0/47
(forward)formula 0,1,1.55165,63640,1,0,214,254159,239,93,4367,192216,226
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 516 transition count 449
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 516 transition count 449
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 510 transition count 443
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 510 transition count 443
Applied a total of 62 rules in 71 ms. Remains 510 /541 variables (removed 31) and now considering 443/474 (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-6714771996906421789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1609284286772823648.kers'
[2026-05-24 12:30:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6714771996906421789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1609284286772823648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 443 rows 510 cols 1432 entries
Finished phase 1 with 326 SingleSign rule and 79 generalized
[2026-05-24 12:30:11] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1609284286772823648.kers
Total runtime 14 ms.
[2026-05-24 12:30:12] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-24 12:30:12] [INFO ] Invariant cache hit.
[2026-05-24 12:30:13] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2026-05-24 12:30:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/510 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 442 unsolved
SMT process timed out in 30068ms, After SMT, problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 30070ms
Starting structural reductions in LTL mode, iteration 1 : 510/541 places, 443/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32141 ms. Remains : 510/541 places, 443/474 transitions.
[2026-05-24 12:30:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:30:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:30:44] [INFO ] Input system was already deterministic with 443 transitions.
[2026-05-24 12:30:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:30:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:30:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3523613403982483896.gal : 2 ms
[2026-05-24 12:30:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16794025684842233878.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/CTLFireability3523613403982483896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16794025684842233878.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 12:31:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:31:14] [INFO ] Applying decomposition
[2026-05-24 12:31:14] [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/graph14564582498104988025.txt' '-o' '/tmp/graph14564582498104988025.bin' '-w' '/tmp/graph14564582498104988025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14564582498104988025.bin' '-l' '-1' '-v' '-w' '/tmp/graph14564582498104988025.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:31:14] [INFO ] Decomposing Gal with order
[2026-05-24 12:31:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:31:14] [INFO ] Removed a total of 269 redundant transitions.
[2026-05-24 12:31:14] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 12:31:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10220702950920095949.gal : 4 ms
[2026-05-24 12:31:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3347210579992382745.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/CTLFireability10220702950920095949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3347210579992382745.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.113e+26,5.80166,142964,13839,54,231298,442,1189,508159,60,1277,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 12:31:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:31:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:31:44] [INFO ] Applying decomposition
[2026-05-24 12:31:44] [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/graph12019485432689565404.txt' '-o' '/tmp/graph12019485432689565404.bin' '-w' '/tmp/graph12019485432689565404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12019485432689565404.bin' '-l' '-1' '-v' '-w' '/tmp/graph12019485432689565404.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:31:44] [INFO ] Decomposing Gal with order
[2026-05-24 12:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:31:44] [INFO ] Removed a total of 256 redundant transitions.
[2026-05-24 12:31:44] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 12:31:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3710098087896357227.gal : 4 ms
[2026-05-24 12:31:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2099009945326656906.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/CTLFireability3710098087896357227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2099009945326656906.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29959e+26,9.735,236424,12357,142,346951,1408,1127,1.18819e+06,102,4549,0


Converting to forward existential form...Done !
original formula: !(A(!(EX((((i5.u79.p232==1)&&(i1.u136.p431==1))&&(i5.u174.p593==1)))) U (A(AF((i1.u150.p502==1)) U (EF((i8.u113.p347==1)) + A((((i7.i0.i0...268
=> equivalent forward existential formula: (([(((FwdU(((FwdU(Init,!((!((E(!((E(TRUE U (i8.u113.p347==1)) + !((E(!((i7.i1.i2.u131.p412==1)) U (!((((i7.i0.i0...3131
Reverse transition relation is NOT exact ! Due to transitions t7, t88, t203, t215, t304, t318, i0.u26.t303, i0.u47.t275, i0.u28.t299, i1.t314, i1.u19.t320,...1581
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-24 12:37:09] [INFO ] Applying decomposition
[2026-05-24 12:37:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:37:09] [INFO ] Decomposing Gal with order
[2026-05-24 12:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:37:09] [INFO ] Removed a total of 128 redundant transitions.
[2026-05-24 12:37:09] [INFO ] Flatten gal took : 16 ms
[2026-05-24 12:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 92 ms.
[2026-05-24 12:37:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1408901505822188198.gal : 6 ms
[2026-05-24 12:37:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2875358222989127438.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/CTLFireability1408901505822188198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2875358222989127438.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 5 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:02:07] [INFO ] Flatten gal took : 149 ms
[2026-05-24 13:02:08] [INFO ] Input system was already deterministic with 474 transitions.
[2026-05-24 13:02:08] [INFO ] Transformed 541 places.
[2026-05-24 13:02:08] [INFO ] Transformed 474 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 13:02:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10655948619778938648.gal : 11 ms
[2026-05-24 13:02:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12082113454782386050.ctl : 5 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/CTLFireability10655948619778938648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12082113454782386050.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 5 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-17"
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-17, 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-177946842000578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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