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.r066-tall-177946967700442.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 CO4-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:34 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 344K 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 CO4-PT-21-CTLFireability-2024-00
FORMULA_NAME CO4-PT-21-CTLFireability-2024-01
FORMULA_NAME CO4-PT-21-CTLFireability-2024-02
FORMULA_NAME CO4-PT-21-CTLFireability-2024-03
FORMULA_NAME CO4-PT-21-CTLFireability-2024-04
FORMULA_NAME CO4-PT-21-CTLFireability-2024-05
FORMULA_NAME CO4-PT-21-CTLFireability-2024-06
FORMULA_NAME CO4-PT-21-CTLFireability-2024-07
FORMULA_NAME CO4-PT-21-CTLFireability-2024-08
FORMULA_NAME CO4-PT-21-CTLFireability-2024-09
FORMULA_NAME CO4-PT-21-CTLFireability-2024-10
FORMULA_NAME CO4-PT-21-CTLFireability-2024-11
FORMULA_NAME CO4-PT-21-CTLFireability-2024-12
FORMULA_NAME CO4-PT-21-CTLFireability-2024-13
FORMULA_NAME CO4-PT-21-CTLFireability-2024-14
FORMULA_NAME CO4-PT-21-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779527531023

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 09:12:12] [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-23 09:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:12:12] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2026-05-23 09:12:12] [INFO ] Transformed 1400 places.
[2026-05-23 09:12:12] [INFO ] Transformed 1583 transitions.
[2026-05-23 09:12:12] [INFO ] Found NUPN structural information;
[2026-05-23 09:12:12] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 181 place count 917 transition count 1078
Iterating global reduction 1 with 153 rules applied. Total rules applied 334 place count 917 transition count 1078
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 468 place count 783 transition count 944
Iterating global reduction 1 with 134 rules applied. Total rules applied 602 place count 783 transition count 944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 605 place count 783 transition count 941
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 667 place count 721 transition count 879
Iterating global reduction 2 with 62 rules applied. Total rules applied 729 place count 721 transition count 879
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 769 place count 681 transition count 839
Iterating global reduction 2 with 40 rules applied. Total rules applied 809 place count 681 transition count 839
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 811 place count 681 transition count 837
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 833 place count 659 transition count 815
Iterating global reduction 3 with 22 rules applied. Total rules applied 855 place count 659 transition count 815
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 857 place count 659 transition count 813
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 864 place count 652 transition count 806
Iterating global reduction 4 with 7 rules applied. Total rules applied 871 place count 652 transition count 806
Applied a total of 871 rules in 393 ms. Remains 652 /1093 variables (removed 441) and now considering 806/1236 (removed 430) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3409315248286819720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1645918152385073071.kers'
[2026-05-23 09:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3409315248286819720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1645918152385073071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 806 rows 652 cols 1803 entries
Finished phase 1 with 647 SingleSign rule and 0 generalized
[2026-05-23 09:12:13] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1645918152385073071.kers
Total runtime 4 ms.
[2026-05-23 09:12:13] [INFO ] Implicit Places using invariants in 374 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 410 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/1093 places, 806/1236 transitions.
Applied a total of 0 rules in 16 ms. Remains 651 /651 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 831 ms. Remains : 651/1093 places, 806/1236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3032966628914813809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18316468786533572638.kers'
[2026-05-23 09:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3032966628914813809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18316468786533572638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 806 rows 651 cols 1801 entries
Finished phase 1 with 647 SingleSign rule and 0 generalized
[2026-05-23 09:12:13] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18316468786533572638.kers
Total runtime 7 ms.
[2026-05-23 09:12:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-23 09:12:13] [INFO ] Invariant cache hit.
[2026-05-23 09:12:13] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 805 sub problems to find dead transitions.
[2026-05-23 09:12:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/650 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/651 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/1457 variables, and 4 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/651 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/650 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 1 (OVERLAPS) 1/651 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 3 (OVERLAPS) 806/1457 variables, 651/655 constraints. Problems are: Problem set: 0 solved, 805 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1457 variables, 805/1460 constraints. Problems are: Problem set: 0 solved, 805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1457/1457 variables, and 1460 constraints, problems are : Problem set: 0 solved, 805 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 651/651 constraints, PredecessorRefiner: 805/805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 805 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in LTL mode , in 1 iterations and 60798 ms. Remains : 651/651 places, 806/806 transitions.
Support contains 58 out of 651 places after structural reductions.
[2026-05-23 09:13:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 09:13:14] [INFO ] Flatten gal took : 71 ms
[2026-05-23 09:13:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-21-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:13:14] [INFO ] Flatten gal took : 36 ms
[2026-05-23 09:13:14] [INFO ] Input system was already deterministic with 806 transitions.
Support contains 46 out of 651 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (65 resets) in 2343 ms. (17 steps per ms) remains 29/34 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (17 resets) in 30 ms. (129 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 51 ms. (76 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (15 resets) in 33 ms. (117 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (18 resets) in 72 ms. (54 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (15 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
[2026-05-23 09:13:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 152/182 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 507/689 variables, 207/237 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 11/700 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 18/718 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 481/1199 variables, 257/498 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1199 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 180/1379 variables, 105/603 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1379 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 63/1442 variables, 40/643 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1442 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 15 (OVERLAPS) 14/1456 variables, 11/654 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1456 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 17 (OVERLAPS) 1/1457 variables, 1/655 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1457 variables, 0/655 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/1457 variables, 0/655 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1457/1457 variables, and 655 constraints, problems are : Problem set: 2 solved, 20 unsolved in 3256 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 651/651 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 142/168 variables, 26/26 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 491/659 variables, 199/226 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 19/245 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 0/245 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 11/670 variables, 1/246 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 18/688 variables, 3/249 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 487/1175 variables, 258/507 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1175 variables, 0/507 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 194/1369 variables, 110/617 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1369 variables, 0/617 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 68/1437 variables, 43/660 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1437 variables, 0/660 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 19/1456 variables, 14/674 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1456/1457 variables, and 674 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 650/651 constraints, PredecessorRefiner: 20/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8273ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 641 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 999 edges and 649 vertex of which 633 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 310 rules applied. Total rules applied 312 place count 633 transition count 483
Reduce places removed 286 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 297 rules applied. Total rules applied 609 place count 347 transition count 472
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 621 place count 336 transition count 471
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 621 place count 336 transition count 420
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 723 place count 285 transition count 420
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 728 place count 280 transition count 415
Iterating global reduction 3 with 5 rules applied. Total rules applied 733 place count 280 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 733 place count 280 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 735 place count 279 transition count 414
Performed 93 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 921 place count 186 transition count 303
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 928 place count 186 transition count 296
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 936 place count 178 transition count 288
Iterating global reduction 4 with 8 rules applied. Total rules applied 944 place count 178 transition count 288
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 952 place count 174 transition count 284
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1028 place count 136 transition count 287
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1047 place count 136 transition count 268
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 1075 place count 108 transition count 212
Iterating global reduction 5 with 28 rules applied. Total rules applied 1103 place count 108 transition count 212
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1118 place count 108 transition count 197
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1123 place count 103 transition count 182
Iterating global reduction 6 with 5 rules applied. Total rules applied 1128 place count 103 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1130 place count 103 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1133 place count 103 transition count 177
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1142 place count 103 transition count 168
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1153 place count 94 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1155 place count 94 transition count 164
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1157 place count 94 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1158 place count 94 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1159 place count 93 transition count 162
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 9 with 6 rules applied. Total rules applied 1165 place count 90 transition count 159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1168 place count 87 transition count 159
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 11 with 4 rules applied. Total rules applied 1172 place count 85 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 1183 place count 85 transition count 146
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1188 place count 80 transition count 141
Iterating global reduction 11 with 5 rules applied. Total rules applied 1193 place count 80 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1197 place count 80 transition count 137
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1198 place count 79 transition count 136
Iterating global reduction 12 with 1 rules applied. Total rules applied 1199 place count 79 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1200 place count 79 transition count 135
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1204 place count 79 transition count 131
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1208 place count 75 transition count 131
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 1213 place count 75 transition count 131
Applied a total of 1213 rules in 130 ms. Remains 75 /651 variables (removed 576) and now considering 131/806 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 75/651 places, 131/806 transitions.
RANDOM walk for 40000 steps (2327 resets) in 216 ms. (184 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40004 steps (352 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2026-05-23 09:13:24] [INFO ] Flow matrix only has 122 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1531681079790127796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5089794375896870034.kers'
[2026-05-23 09:13:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1531681079790127796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5089794375896870034.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 75 cols 312 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 09:13:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5089794375896870034.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/37 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/60 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 76/136 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/194 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/197 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/37 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/60 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/136 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 58/194 variables, 35/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/197 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 131/131 transitions.
Graph (trivial) has 79 edges and 75 vertex of which 27 / 75 are part of one of the 4 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 123 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 50 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 47 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 47 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 42 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 42 transition count 75
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 34 transition count 67
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 34 transition count 67
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 34 transition count 62
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 55 place count 28 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 58 place count 28 transition count 53
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 62 place count 24 transition count 48
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 24 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 24 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 77 place count 24 transition count 37
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 79 place count 22 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 22 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 83 place count 22 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 85 place count 21 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 40 edges and 21 vertex of which 15 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 7 with 6 rules applied. Total rules applied 91 place count 15 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 97 place count 15 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 101 place count 15 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 15 edges and 10 vertex of which 7 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 10 rules applied. Total rules applied 111 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 115 place count 4 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 117 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 117 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 119 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 121 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 122 place count 2 transition count 2
Applied a total of 122 rules in 10 ms. Remains 2 /75 variables (removed 73) and now considering 2/131 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 2/75 places, 2/131 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2026-05-23 09:13:24] [INFO ] Flatten gal took : 27 ms
[2026-05-23 09:13:24] [INFO ] Flatten gal took : 38 ms
[2026-05-23 09:13:24] [INFO ] Input system was already deterministic with 806 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 1002 edges and 651 vertex of which 643 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 699 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 641 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 315 rules applied. Total rules applied 317 place count 640 transition count 478
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 316 rules applied. Total rules applied 633 place count 326 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 634 place count 325 transition count 476
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 634 place count 325 transition count 423
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 740 place count 272 transition count 423
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 745 place count 267 transition count 418
Iterating global reduction 3 with 5 rules applied. Total rules applied 750 place count 267 transition count 418
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 750 place count 267 transition count 416
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 754 place count 265 transition count 416
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 756 place count 263 transition count 414
Iterating global reduction 3 with 2 rules applied. Total rules applied 758 place count 263 transition count 414
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 836 place count 224 transition count 375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 842 place count 224 transition count 369
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 845 place count 222 transition count 368
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 853 place count 214 transition count 360
Iterating global reduction 5 with 8 rules applied. Total rules applied 861 place count 214 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 863 place count 213 transition count 359
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 864 place count 212 transition count 358
Iterating global reduction 5 with 1 rules applied. Total rules applied 865 place count 212 transition count 358
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 866 place count 211 transition count 356
Iterating global reduction 5 with 1 rules applied. Total rules applied 867 place count 211 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 868 place count 211 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 887 place count 211 transition count 336
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 898 place count 211 transition count 325
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 909 place count 200 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 909 place count 200 transition count 324
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 911 place count 199 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 913 place count 198 transition count 323
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 915 place count 198 transition count 323
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 917 place count 196 transition count 321
Applied a total of 917 rules in 100 ms. Remains 196 /651 variables (removed 455) and now considering 321/806 (removed 485) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12026002770968942016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13138833312365725975.kers'
[2026-05-23 09:13:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12026002770968942016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13138833312365725975.kers]
Normalized transition count is 320 out of 321 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 196 cols 779 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-23 09:13:24] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13138833312365725975.kers
Total runtime 4 ms.
[2026-05-23 09:13:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 09:13:24] [INFO ] Invariant cache hit.
[2026-05-23 09:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:13:24] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-23 09:13:24] [INFO ] Redundant transitions in 16 ms returned []
Running 308 sub problems to find dead transitions.
[2026-05-23 09:13:24] [INFO ] Invariant cache hit.
[2026-05-23 09:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/516 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 1/517 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 201 constraints, problems are : Problem set: 0 solved, 308 unsolved in 21386 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 320/516 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 308/508 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 1/517 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 509 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51478ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 51479ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/651 places, 321/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51806 ms. Remains : 196/651 places, 321/806 transitions.
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:14:16] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:14:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:14:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12381154579593110377.gal : 5 ms
[2026-05-23 09:14:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5129144520750894642.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12381154579593110377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5129144520750894642.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19253e+08,0.151209,9240,2,1002,5,23799,6,0,1091,15765,0


Converting to forward existential form...Done !
original formula: EF(EG((p757==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p757==1))] != FALSE
Hit Full ! (commute/partial/dont) 318/0/3
(forward)formula 0,1,0.603938,24480,1,0,8,122156,19,2,5194,27951,8
FORMULA CO4-PT-21-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 700 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 641 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 314 rules applied. Total rules applied 316 place count 640 transition count 479
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 315 rules applied. Total rules applied 631 place count 327 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 632 place count 326 transition count 477
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 632 place count 326 transition count 424
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 738 place count 273 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 743 place count 268 transition count 419
Iterating global reduction 3 with 5 rules applied. Total rules applied 748 place count 268 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 748 place count 268 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 752 place count 266 transition count 417
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 754 place count 264 transition count 415
Iterating global reduction 3 with 2 rules applied. Total rules applied 756 place count 264 transition count 415
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 834 place count 225 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 840 place count 225 transition count 370
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 843 place count 223 transition count 369
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 851 place count 215 transition count 361
Iterating global reduction 5 with 8 rules applied. Total rules applied 859 place count 215 transition count 361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 862 place count 213 transition count 359
Iterating global reduction 5 with 1 rules applied. Total rules applied 863 place count 213 transition count 359
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 864 place count 212 transition count 357
Iterating global reduction 5 with 1 rules applied. Total rules applied 865 place count 212 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 866 place count 212 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 885 place count 212 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 896 place count 212 transition count 326
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 907 place count 201 transition count 325
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 911 place count 199 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 913 place count 197 transition count 322
Applied a total of 913 rules in 73 ms. Remains 197 /651 variables (removed 454) and now considering 322/806 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5185804676628380680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7647614840906107918.kers'
[2026-05-23 09:14:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5185804676628380680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7647614840906107918.kers]
Normalized transition count is 321 out of 322 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 197 cols 781 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 09:14:16] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7647614840906107918.kers
Total runtime 1 ms.
[2026-05-23 09:14:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 09:14:17] [INFO ] Invariant cache hit.
[2026-05-23 09:14:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:14:17] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-23 09:14:17] [INFO ] Redundant transitions in 5 ms returned []
Running 309 sub problems to find dead transitions.
[2026-05-23 09:14:17] [INFO ] Invariant cache hit.
[2026-05-23 09:14:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/518 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/519 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 202 constraints, problems are : Problem set: 0 solved, 309 unsolved in 22299 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/518 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 309/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/519 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 511 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52362ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 52362ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/651 places, 322/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52635 ms. Remains : 197/651 places, 322/806 transitions.
[2026-05-23 09:15:09] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:15:09] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:15:09] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-23 09:15:09] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:09] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11063007698158088726.gal : 4 ms
[2026-05-23 09:15:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9542036832621844138.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/CTLFireability11063007698158088726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9542036832621844138.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21461e+08,0.136934,9352,2,1013,5,24073,6,0,1096,15980,0


Converting to forward existential form...Done !
original formula: AG(AF((p581==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p581==1)))] = FALSE
Hit Full ! (commute/partial/dont) 320/0/2
(forward)formula 0,0,0.596994,24668,1,0,8,123566,20,3,5216,30428,8
FORMULA CO4-PT-21-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 699 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 641 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 312 rules applied. Total rules applied 314 place count 640 transition count 481
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 313 rules applied. Total rules applied 627 place count 329 transition count 479
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 630 place count 328 transition count 477
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 632 place count 326 transition count 477
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 632 place count 326 transition count 424
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 738 place count 273 transition count 424
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 743 place count 268 transition count 419
Iterating global reduction 4 with 5 rules applied. Total rules applied 748 place count 268 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 748 place count 268 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 752 place count 266 transition count 417
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 754 place count 264 transition count 415
Iterating global reduction 4 with 2 rules applied. Total rules applied 756 place count 264 transition count 415
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 834 place count 225 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 840 place count 225 transition count 370
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 843 place count 223 transition count 369
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 851 place count 215 transition count 361
Iterating global reduction 6 with 8 rules applied. Total rules applied 859 place count 215 transition count 361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 213 transition count 359
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 213 transition count 359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 864 place count 212 transition count 357
Iterating global reduction 6 with 1 rules applied. Total rules applied 865 place count 212 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 866 place count 212 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 885 place count 212 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 896 place count 212 transition count 326
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 907 place count 201 transition count 325
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 911 place count 199 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 913 place count 197 transition count 322
Applied a total of 913 rules in 59 ms. Remains 197 /651 variables (removed 454) and now considering 322/806 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5450474790559902725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10127533392554835106.kers'
[2026-05-23 09:15:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5450474790559902725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10127533392554835106.kers]
Normalized transition count is 321 out of 322 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 197 cols 781 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 09:15:10] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10127533392554835106.kers
Total runtime 1 ms.
[2026-05-23 09:15:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 09:15:10] [INFO ] Invariant cache hit.
[2026-05-23 09:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:15:10] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2026-05-23 09:15:10] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 197/651 places, 322/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 303 ms. Remains : 197/651 places, 322/806 transitions.
[2026-05-23 09:15:10] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:15:10] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:10] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-23 09:15:10] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:15:10] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:15:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9095090008639695347.gal : 2 ms
[2026-05-23 09:15:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17472668539004430448.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9095090008639695347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17472668539004430448.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 32176 steps (2780 resets) in 185 ms. (172 steps per ms) remains 0/1 properties
FORMULA CO4-PT-21-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 : 651/651 places, 806/806 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 624 transition count 778
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 624 transition count 778
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 75 place count 603 transition count 757
Iterating global reduction 0 with 21 rules applied. Total rules applied 96 place count 603 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 603 transition count 756
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 594 transition count 747
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 594 transition count 747
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 119 place count 590 transition count 743
Iterating global reduction 1 with 4 rules applied. Total rules applied 123 place count 590 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 588 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 588 transition count 741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 587 transition count 740
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 587 transition count 740
Applied a total of 129 rules in 85 ms. Remains 587 /651 variables (removed 64) and now considering 740/806 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2766751769164091743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3045406661224407666.kers'
[2026-05-23 09:15:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2766751769164091743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3045406661224407666.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 740 rows 587 cols 1662 entries
Finished phase 1 with 583 SingleSign rule and 0 generalized
[2026-05-23 09:15:10] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3045406661224407666.kers
Total runtime 7 ms.
[2026-05-23 09:15:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 09:15:10] [INFO ] Invariant cache hit.
[2026-05-23 09:15:11] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2026-05-23 09:15:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 740/1327 variables, 587/591 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 591 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 739 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 740/1327 variables, 587/591 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1327 variables, 739/1330 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 1332 constraints, problems are : Problem set: 0 solved, 739 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 587/651 places, 740/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 587/651 places, 740/806 transitions.
[2026-05-23 09:16:11] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:16:11] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:16:11] [INFO ] Input system was already deterministic with 740 transitions.
[2026-05-23 09:16:11] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:16:11] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:16:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2164190546064485709.gal : 4 ms
[2026-05-23 09:16:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15912171047702284482.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/CTLFireability2164190546064485709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15912171047702284482.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,8.81844e+10,3.0214,93212,2,11351,5,275212,6,0,3086,483817,0


Converting to forward existential form...Done !
original formula: EG(((AF((p1074==0)) * EX((p879==0))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((p1074==0)))) * EX((p879==0))) * EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...540
Detected timeout of ITS tools.
[2026-05-23 09:16:41] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:16:41] [INFO ] Applying decomposition
[2026-05-23 09:16:41] [INFO ] Flatten gal took : 12 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/graph5166219258650212164.txt' '-o' '/tmp/graph5166219258650212164.bin' '-w' '/tmp/graph5166219258650212164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5166219258650212164.bin' '-l' '-1' '-v' '-w' '/tmp/graph5166219258650212164.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:16:41] [INFO ] Decomposing Gal with order
[2026-05-23 09:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:16:41] [INFO ] Removed a total of 223 redundant transitions.
[2026-05-23 09:16:41] [INFO ] Flatten gal took : 83 ms
[2026-05-23 09:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2026-05-23 09:16:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9223104021008368992.gal : 12 ms
[2026-05-23 09:16:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17558361145882516635.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/CTLFireability9223104021008368992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17558361145882516635.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,8.81844e+10,0.34369,16972,1020,99,23093,1052,1259,47813,97,3236,0


Converting to forward existential form...Done !
original formula: EG(((AF((i18.u170.p1074==0)) * EX((i14.u129.p879==0))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((i18.u170.p1074==0)))) * EX((i14.u129.p879==0))) * EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t59, t103, t189, t274, t286, t302, t347, t381, t401, t460, t501, t547, t556, t558, t627,...872
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 624 transition count 778
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 624 transition count 778
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 604 transition count 758
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 604 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 604 transition count 757
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 101 place count 598 transition count 751
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 598 transition count 751
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 594 transition count 747
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 594 transition count 747
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 592 transition count 745
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 592 transition count 745
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 591 transition count 744
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 591 transition count 744
Applied a total of 121 rules in 87 ms. Remains 591 /651 variables (removed 60) and now considering 744/806 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13185077330331221694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8713457894389075213.kers'
[2026-05-23 09:17:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13185077330331221694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8713457894389075213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 744 rows 591 cols 1672 entries
Finished phase 1 with 587 SingleSign rule and 0 generalized
[2026-05-23 09:17:11] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8713457894389075213.kers
Total runtime 4 ms.
[2026-05-23 09:17:12] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 09:17:12] [INFO ] Invariant cache hit.
[2026-05-23 09:17:12] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 743 sub problems to find dead transitions.
[2026-05-23 09:17:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/1335 variables, and 4 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/591 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1335 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1335 variables, 743/1338 constraints. Problems are: Problem set: 0 solved, 743 unsolved
SMT process timed out in 60242ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 591/651 places, 744/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 591/651 places, 744/806 transitions.
[2026-05-23 09:18:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:12] [INFO ] Input system was already deterministic with 744 transitions.
[2026-05-23 09:18:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability512837965956296287.gal : 3 ms
[2026-05-23 09:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16991225260379661554.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/CTLFireability512837965956296287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16991225260379661554.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.00932e+10,3.21549,100792,2,11622,5,300496,6,0,3106,529972,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:18:42] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:18:42] [INFO ] Applying decomposition
[2026-05-23 09:18:42] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17098609281514122025.txt' '-o' '/tmp/graph17098609281514122025.bin' '-w' '/tmp/graph17098609281514122025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17098609281514122025.bin' '-l' '-1' '-v' '-w' '/tmp/graph17098609281514122025.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:18:42] [INFO ] Decomposing Gal with order
[2026-05-23 09:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:18:42] [INFO ] Removed a total of 223 redundant transitions.
[2026-05-23 09:18:42] [INFO ] Flatten gal took : 24 ms
[2026-05-23 09:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-23 09:18:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8937537533812597364.gal : 6 ms
[2026-05-23 09:18:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12955107408656848458.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/CTLFireability8937537533812597364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12955107408656848458.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.00932e+10,0.617244,26316,1231,122,36766,2367,1238,115739,94,9893,0


Converting to forward existential form...Done !
original formula: A(AX(!(AX((i13.u137.p951==1)))) U ((EX((AX(FALSE) * !((EG((i17.u172.p1096==1)) * EX(((i18.u169.p1088==1)&&(i23.u220.p1387==1))))))) * (i2...195
=> equivalent forward existential formula: [((Init * !(EG(!(((EX((!(EX(!(FALSE))) * !((EG((i17.u172.p1096==1)) * EX(((i18.u169.p1088==1)&&(i23.u220.p1387==...586
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t169, t189, t245, t309, t395, t424, t462, t503, t549, t592, t620, t629, t656, t657...887
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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 697 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 641 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 312 rules applied. Total rules applied 314 place count 640 transition count 481
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 313 rules applied. Total rules applied 627 place count 329 transition count 479
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 629 place count 328 transition count 478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 630 place count 327 transition count 478
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 630 place count 327 transition count 425
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 736 place count 274 transition count 425
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 741 place count 269 transition count 420
Iterating global reduction 4 with 5 rules applied. Total rules applied 746 place count 269 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 746 place count 269 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 750 place count 267 transition count 418
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 752 place count 265 transition count 416
Iterating global reduction 4 with 2 rules applied. Total rules applied 754 place count 265 transition count 416
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 832 place count 226 transition count 377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 838 place count 226 transition count 371
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 841 place count 224 transition count 370
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 849 place count 216 transition count 362
Iterating global reduction 6 with 8 rules applied. Total rules applied 857 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 859 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 860 place count 214 transition count 360
Iterating global reduction 6 with 1 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 213 transition count 358
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 864 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 883 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 894 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 905 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 905 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 911 place count 198 transition count 323
Applied a total of 911 rules in 56 ms. Remains 198 /651 variables (removed 453) and now considering 323/806 (removed 483) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13755836244481694143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17828805975191083036.kers'
[2026-05-23 09:19:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13755836244481694143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17828805975191083036.kers]
Normalized transition count is 322 out of 323 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 198 cols 783 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-23 09:19:13] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17828805975191083036.kers
Total runtime 2 ms.
[2026-05-23 09:19:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-23 09:19:13] [INFO ] Invariant cache hit.
[2026-05-23 09:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:19:13] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2026-05-23 09:19:13] [INFO ] Redundant transitions in 2 ms returned []
Running 310 sub problems to find dead transitions.
[2026-05-23 09:19:13] [INFO ] Invariant cache hit.
[2026-05-23 09:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 22464 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52556ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 52556ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/651 places, 323/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52946 ms. Remains : 198/651 places, 323/806 transitions.
[2026-05-23 09:20:05] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:06] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-23 09:20:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3304183268234787126.gal : 2 ms
[2026-05-23 09:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3615246052700480829.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/CTLFireability3304183268234787126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3615246052700480829.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23172e+08,0.155912,9412,2,1022,5,24279,6,0,1101,16386,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(((p652==0)&&(p1032==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((p652==0)&&(p1032==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t33, t61, t76, t81, t97, t111, t116, t171, t191, t321, Intersection with reachable ...226
(forward)formula 0,1,6.50037,205132,1,0,589,1.15328e+06,672,311,6975,1.18596e+06,927
FORMULA CO4-PT-21-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 625 transition count 779
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 625 transition count 779
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 604 transition count 758
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 604 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 604 transition count 757
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 596 transition count 749
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 596 transition count 749
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 593 transition count 746
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 593 transition count 746
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 592 transition count 745
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 592 transition count 745
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 591 transition count 744
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 591 transition count 744
Applied a total of 121 rules in 88 ms. Remains 591 /651 variables (removed 60) and now considering 744/806 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8170290126714446967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-84761928965736629.kers'
[2026-05-23 09:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8170290126714446967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-84761928965736629.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 744 rows 591 cols 1670 entries
Finished phase 1 with 587 SingleSign rule and 0 generalized
[2026-05-23 09:20:12] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-84761928965736629.kers
Total runtime 8 ms.
[2026-05-23 09:20:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 09:20:12] [INFO ] Invariant cache hit.
[2026-05-23 09:20:13] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 743 sub problems to find dead transitions.
[2026-05-23 09:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/1335 variables, and 4 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/591 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 744/1335 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1335 variables, 743/1338 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 1340 constraints, problems are : Problem set: 0 solved, 743 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 591/651 places, 744/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 591/651 places, 744/806 transitions.
[2026-05-23 09:21:13] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:21:13] [INFO ] Flatten gal took : 27 ms
[2026-05-23 09:21:13] [INFO ] Input system was already deterministic with 744 transitions.
[2026-05-23 09:21:13] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:21:13] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:21:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7157931028599309473.gal : 2 ms
[2026-05-23 09:21:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18343988093201700998.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/CTLFireability7157931028599309473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18343988093201700998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.09441e+10,3.48365,94024,2,11414,5,279057,6,0,3106,487943,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:21:43] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:21:43] [INFO ] Applying decomposition
[2026-05-23 09:21:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph510551948569873492.txt' '-o' '/tmp/graph510551948569873492.bin' '-w' '/tmp/graph510551948569873492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph510551948569873492.bin' '-l' '-1' '-v' '-w' '/tmp/graph510551948569873492.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:21:43] [INFO ] Decomposing Gal with order
[2026-05-23 09:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:21:43] [INFO ] Removed a total of 222 redundant transitions.
[2026-05-23 09:21:43] [INFO ] Flatten gal took : 41 ms
[2026-05-23 09:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2026-05-23 09:21:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12056845146515709115.gal : 7 ms
[2026-05-23 09:21:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14731671129916257724.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/CTLFireability12056845146515709115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14731671129916257724.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.09441e+10,0.367603,17696,916,109,23338,2216,1354,51189,102,8324,0


Converting to forward existential form...Done !
original formula: A((i21.u221.p1359!=1) U E((AX((EG((i20.u202.p1232==1)) * (i11.u114.p808==1))) + (EG(((i1.i1.i2.u17.p186==1)||((i15.u169.p1067==1)&&(i21.u...262
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(EX(!((EG((i20.u202.p1232==1)) * (i11.u114.p808==1))))) + (EG(((i1.i1.i2.u17.p186==1)||((i1...831
Reverse transition relation is NOT exact ! Due to transitions t61, t106, t190, t307, t349, t395, t424, t503, t537, t549, t580, t629, t656, t657, i0.t301, i...938
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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 an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 700 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 641 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 314 rules applied. Total rules applied 316 place count 640 transition count 479
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 315 rules applied. Total rules applied 631 place count 327 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 632 place count 326 transition count 477
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 632 place count 326 transition count 424
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 738 place count 273 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 743 place count 268 transition count 419
Iterating global reduction 3 with 5 rules applied. Total rules applied 748 place count 268 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 748 place count 268 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 752 place count 266 transition count 417
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 754 place count 264 transition count 415
Iterating global reduction 3 with 2 rules applied. Total rules applied 756 place count 264 transition count 415
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 832 place count 226 transition count 377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 838 place count 226 transition count 371
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 841 place count 224 transition count 370
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 849 place count 216 transition count 362
Iterating global reduction 5 with 8 rules applied. Total rules applied 857 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 859 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 860 place count 214 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 861 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 862 place count 213 transition count 358
Iterating global reduction 5 with 1 rules applied. Total rules applied 863 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 864 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 883 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 894 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 905 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 905 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 907 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 909 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 911 place count 198 transition count 323
Applied a total of 911 rules in 113 ms. Remains 198 /651 variables (removed 453) and now considering 323/806 (removed 483) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14460054994623891021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1461497529963776627.kers'
[2026-05-23 09:22:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14460054994623891021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1461497529963776627.kers]
Normalized transition count is 322 out of 323 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 198 cols 783 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-23 09:22:13] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1461497529963776627.kers
Total runtime 2 ms.
[2026-05-23 09:22:14] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-23 09:22:14] [INFO ] Invariant cache hit.
[2026-05-23 09:22:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:22:14] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2026-05-23 09:22:14] [INFO ] Redundant transitions in 2 ms returned []
Running 310 sub problems to find dead transitions.
[2026-05-23 09:22:14] [INFO ] Invariant cache hit.
[2026-05-23 09:22:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 22142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52186ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 52186ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/651 places, 323/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52632 ms. Remains : 198/651 places, 323/806 transitions.
[2026-05-23 09:23:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:23:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:23:06] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-23 09:23:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:23:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13484881494464206982.gal : 1 ms
[2026-05-23 09:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14269021192350048894.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/CTLFireability13484881494464206982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14269021192350048894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22612e+08,0.164375,9376,2,1022,5,24173,6,0,1101,16102,0


Converting to forward existential form...Done !
original formula: EF(EG((p1206!=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p1206!=1))] != FALSE
Hit Full ! (commute/partial/dont) 321/0/2
(forward)formula 0,1,0.588327,24260,1,0,8,118975,19,3,5240,25866,8
FORMULA CO4-PT-21-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 623 transition count 777
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 623 transition count 777
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 78 place count 601 transition count 755
Iterating global reduction 0 with 22 rules applied. Total rules applied 100 place count 601 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 601 transition count 754
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 592 transition count 745
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 592 transition count 745
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 588 transition count 741
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 588 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 586 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 586 transition count 739
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 585 transition count 738
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 585 transition count 738
Applied a total of 133 rules in 74 ms. Remains 585 /651 variables (removed 66) and now considering 738/806 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12673997916276831684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6388757108088139908.kers'
[2026-05-23 09:23:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12673997916276831684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6388757108088139908.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 738 rows 585 cols 1658 entries
Finished phase 1 with 581 SingleSign rule and 0 generalized
[2026-05-23 09:23:07] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6388757108088139908.kers
Total runtime 16 ms.
[2026-05-23 09:23:07] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-23 09:23:07] [INFO ] Invariant cache hit.
[2026-05-23 09:23:07] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2026-05-23 09:23:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 589 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 737/1326 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1327 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 585/651 places, 738/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 585/651 places, 738/806 transitions.
[2026-05-23 09:24:07] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:24:07] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:24:07] [INFO ] Input system was already deterministic with 738 transitions.
[2026-05-23 09:24:07] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:24:07] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15449995084271199269.gal : 2 ms
[2026-05-23 09:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12835341843562633799.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/CTLFireability15449995084271199269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12835341843562633799.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,8.74105e+10,2.89655,91904,2,11277,5,270739,6,0,3076,475286,0


Converting to forward existential form...Done !
original formula: E(EX(((p1079==1)||(p1038==1))) U !(AG((p142!=1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX(((p1079==1)||(p1038==1)))),TRUE) * !((p142!=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...540
(forward)formula 0,1,29.7078,807324,1,0,927,2.92088e+06,1499,631,17401,3.31092e+06,1489
FORMULA CO4-PT-21-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Graph (trivial) has 670 edges and 651 vertex of which 3 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1000 edges and 649 vertex of which 644 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 643 transition count 498
Reduce places removed 297 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 302 rules applied. Total rules applied 603 place count 346 transition count 493
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 609 place count 341 transition count 492
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 609 place count 341 transition count 439
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 715 place count 288 transition count 439
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 720 place count 283 transition count 434
Iterating global reduction 3 with 5 rules applied. Total rules applied 725 place count 283 transition count 434
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 725 place count 283 transition count 433
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 727 place count 282 transition count 433
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 728 place count 281 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 281 transition count 432
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 807 place count 242 transition count 393
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 813 place count 242 transition count 387
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 816 place count 240 transition count 386
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 823 place count 233 transition count 379
Iterating global reduction 5 with 7 rules applied. Total rules applied 830 place count 233 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 832 place count 232 transition count 378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 833 place count 231 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 834 place count 231 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 835 place count 230 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 836 place count 230 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 837 place count 230 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 855 place count 230 transition count 356
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 866 place count 230 transition count 345
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 877 place count 219 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 877 place count 219 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 879 place count 218 transition count 344
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 886 place count 218 transition count 344
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 888 place count 216 transition count 342
Applied a total of 888 rules in 62 ms. Remains 216 /651 variables (removed 435) and now considering 342/806 (removed 464) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9682600738360152982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10055041644357035142.kers'
[2026-05-23 09:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9682600738360152982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10055041644357035142.kers]
Normalized transition count is 341 out of 342 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 216 cols 828 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 09:24:37] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10055041644357035142.kers
Total runtime 17 ms.
[2026-05-23 09:24:37] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-23 09:24:37] [INFO ] Invariant cache hit.
[2026-05-23 09:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:24:38] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2026-05-23 09:24:38] [INFO ] Redundant transitions in 1 ms returned []
Running 329 sub problems to find dead transitions.
[2026-05-23 09:24:38] [INFO ] Invariant cache hit.
[2026-05-23 09:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 341/556 variables, 215/219 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 1/557 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (OVERLAPS) 1/558 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 221 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 341/556 variables, 215/219 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 259/478 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 1/557 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 70/549 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/558 variables, and 549 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in SI_CTL mode, iteration 1 : 216/651 places, 342/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60735 ms. Remains : 216/651 places, 342/806 transitions.
[2026-05-23 09:25:38] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:25:38] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:25:38] [INFO ] Input system was already deterministic with 342 transitions.
[2026-05-23 09:25:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:25:38] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3046091193285564598.gal : 1 ms
[2026-05-23 09:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11594288554553704205.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/CTLFireability3046091193285564598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11594288554553704205.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,2.43745e+08,0.214652,13044,2,1423,5,34962,6,0,1192,38629,0


Converting to forward existential form...Done !
original formula: AG((EF((p696==1)) + (((p1269==0) * (((AF((p1393==0)) * EF((p183==0))) * ((p377==0)||(p1140==0))) + ((!(A((p325==1) U (p1129==1))) * ((p36...244
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(E(TRUE U (p696==1)))) * !((p1269==0)))] = FALSE * (([FwdG(((FwdU(Init,TRUE) * !(E(TRUE ...911
Reverse transition relation is NOT exact ! Due to transitions t7, t18, t30, t59, t70, t71, t78, t83, t101, t118, t122, t183, t334, Intersection with reach...231
(forward)formula 0,0,2.55821,92328,1,0,419,512093,706,230,7202,307381,694
FORMULA CO4-PT-21-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 806/806 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 625 transition count 779
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 625 transition count 779
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 604 transition count 758
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 604 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 604 transition count 757
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 596 transition count 749
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 596 transition count 749
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 593 transition count 746
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 593 transition count 746
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 592 transition count 745
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 592 transition count 745
Applied a total of 119 rules in 66 ms. Remains 592 /651 variables (removed 59) and now considering 745/806 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1717117734947320332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17930053597404134434.kers'
[2026-05-23 09:25:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1717117734947320332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17930053597404134434.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 745 rows 592 cols 1672 entries
Finished phase 1 with 588 SingleSign rule and 0 generalized
[2026-05-23 09:25:41] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17930053597404134434.kers
Total runtime 8 ms.
[2026-05-23 09:25:41] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-23 09:25:41] [INFO ] Invariant cache hit.
[2026-05-23 09:25:41] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 744 sub problems to find dead transitions.
[2026-05-23 09:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 745/1337 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 596 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 745/1337 variables, 592/596 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 744/1340 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 1342 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 592/651 places, 745/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 592/651 places, 745/806 transitions.
[2026-05-23 09:26:41] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:26:41] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:26:41] [INFO ] Input system was already deterministic with 745 transitions.
[2026-05-23 09:26:41] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:26:41] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability66292552671717803.gal : 3 ms
[2026-05-23 09:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1507582289845235355.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/CTLFireability66292552671717803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1507582289845235355.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.1334e+10,3.16184,100776,2,11849,5,298861,6,0,3111,533009,0


Converting to forward existential form...Done !
original formula: A(AX(EX((p708==1))) U A(!(AF((p645==1))) U ((p148==1) * !(EX(((p879==1)||((p1101==1)&&(p1387==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((p148==1) * !(EX(((p879==1)||((p1101==1)&&(p1387==1))))))) U (!(!(!(EG(!((p645==1))))))...817
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:27:11] [INFO ] Applying decomposition
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16518432886404811622.txt' '-o' '/tmp/graph16518432886404811622.bin' '-w' '/tmp/graph16518432886404811622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16518432886404811622.bin' '-l' '-1' '-v' '-w' '/tmp/graph16518432886404811622.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:27:11] [INFO ] Decomposing Gal with order
[2026-05-23 09:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:27:11] [INFO ] Removed a total of 220 redundant transitions.
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 36 ms
[2026-05-23 09:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 17 ms.
[2026-05-23 09:27:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10226032805609525237.gal : 21 ms
[2026-05-23 09:27:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7528000270029165818.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/CTLFireability10226032805609525237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7528000270029165818.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.1334e+10,0.386596,17608,925,111,23032,2324,1279,50565,94,9054,0


Converting to forward existential form...Done !
original formula: A(AX(EX((i10.u91.p708==1))) U A(!(AF((i9.u84.p645==1))) U ((i4.i0.i0.u13.p148==1) * !(EX(((i13.u132.p879==1)||((i21.i0.i3.u182.p1101==1)&...182
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((i4.i0.i0.u13.p148==1) * !(EX(((i13.u132.p879==1)||((i21.i0.i3.u182.p1101==1)&&(i22.u22...1260
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t273, t285, t307, t346, t380, t403, t404, t424, t462, t503, t549, t580, t592, t620...880
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
[2026-05-23 09:27:42] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:27:42] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:27:42] [INFO ] Applying decomposition
[2026-05-23 09:27:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11151765248738525757.txt' '-o' '/tmp/graph11151765248738525757.bin' '-w' '/tmp/graph11151765248738525757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11151765248738525757.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151765248738525757.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:27:42] [INFO ] Decomposing Gal with order
[2026-05-23 09:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:27:42] [INFO ] Removed a total of 241 redundant transitions.
[2026-05-23 09:27:42] [INFO ] Flatten gal took : 38 ms
[2026-05-23 09:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-23 09:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2471712605648148143.gal : 6 ms
[2026-05-23 09:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5523896326680129855.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/CTLFireability2471712605648148143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5523896326680129855.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
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.30245e+11,0.649081,28128,1390,104,40375,2426,1382,121155,95,9497,0


Converting to forward existential form...Done !
original formula: EG(((AF((i19.u204.p1074==0)) * EX((i15.u157.p879==0))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((i19.u204.p1074==0)))) * EX((i15.u157.p879==0))) * EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t71, t116, t187, t209, t268, t300, t334, t379, t429, t462, t473, t546, t584, t639, t667, t676...929
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,429.354,2531048,1,0,2.60362e+06,9470,2961,2.19268e+07,196,49330,1145989
FORMULA CO4-PT-21-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(AX(!(AX((i15.u173.p951==1)))) U ((EX((AX(FALSE) * !((EG((i14.u209.p1096==1)) * EX(((i20.u208.p1088==1)&&(i24.u261.p1387==1))))))) * (i1...195
=> equivalent forward existential formula: [((Init * !(EG(!(((EX((!(EX(!(FALSE))) * !((EG((i14.u209.p1096==1)) * EX(((i20.u208.p1088==1)&&(i24.u261.p1387==...586
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 1,0,760.556,3507624,1,0,2.9847e+06,9872,2989,3.69636e+07,199,64812,288794
FORMULA CO4-PT-21-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((i24.u262.p1359!=1) U E((AX((EG((i16.u242.p1232==1)) * (i11.i1.i1.u140.p808==1))) + (EG(((i5.u18.p186==1)||((i19.u202.p1067==1)&&(i24.u...256
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(EX(!((EG((i16.u242.p1232==1)) * (i11.i1.i1.u140.p808==1))))) + (EG(((i5.u18.p186==1)||((i1...813
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 2,1,1332.77,4762592,1,0,4.4731e+06,11489,2957,4.57393e+07,198,77664,336398
FORMULA CO4-PT-21-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-23 09:52:51] [INFO ] Applying decomposition
[2026-05-23 09:52:51] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:52:51] [INFO ] Decomposing Gal with order
[2026-05-23 09:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:52:51] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-23 09:52:51] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 3 ms.
[2026-05-23 09:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11402253597200017791.gal : 3 ms
[2026-05-23 09:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14972890647788023616.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/CTLFireability11402253597200017791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14972890647788023616.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.30245e+11,0.91516,33516,218,2516,3296,81944,232,7497,1747,269280,0


Converting to forward existential form...Done !
original formula: A(AX(EX((i0.i0.i0.i0.i0.u8.p708==1))) U A(!(AF((i0.i0.i0.i0.i0.u8.p645==1))) U ((i0.i0.i0.i0.i0.u7.p148==1) * !(EX(((i0.i0.i1.u11.p879==1...208
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((i0.i0.i0.i0.i0.u7.p148==1) * !(EX(((i0.i0.i1.u11.p879==1)||((i0.i0.i1.u11.p1101==1)&&(...1348
Reverse transition relation is NOT exact ! Due to transitions i0.t704, i0.t693, i0.t43, i0.u13.t41, i0.u13.t48, i0.u13.t57, i0.u13.t60, i0.u13.t61, i0.u13....1361
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-21"
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 CO4-PT-21, 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 r066-tall-177946967700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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