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.r098-tall-177955695500354.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 DiscoveryGPU-PT-13b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K 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 DiscoveryGPU-PT-13b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779602701242

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 06:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 06:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:05:02] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-24 06:05:02] [INFO ] Transformed 380 places.
[2026-05-24 06:05:02] [INFO ] Transformed 404 transitions.
[2026-05-24 06:05:02] [INFO ] Found NUPN structural information;
[2026-05-24 06:05:02] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 98 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 70 place count 310 transition count 360
Iterating global reduction 1 with 44 rules applied. Total rules applied 114 place count 310 transition count 360
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 306 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 306 transition count 356
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 304 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 304 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 302 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 302 transition count 352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 301 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 301 transition count 350
Applied a total of 132 rules in 99 ms. Remains 301 /380 variables (removed 79) and now considering 350/404 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5365810262098569187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5199083730184274566.kers'
[2026-05-24 06:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5365810262098569187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5199083730184274566.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 301 cols 929 entries
Finished phase 1 with 299 SingleSign rule and 0 generalized
[2026-05-24 06:05:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5199083730184274566.kers
Total runtime 2 ms.
[2026-05-24 06:05:03] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-24 06:05:03] [INFO ] Invariant cache hit.
[2026-05-24 06:05:03] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2026-05-24 06:05:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 350/651 variables, 301/303 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/651 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 6/329 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 329 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 350/651 variables, 301/329 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 349/678 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 678 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 301/380 places, 350/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 301/380 places, 350/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2026-05-24 06:06:03] [INFO ] Invariant cache hit.
[2026-05-24 06:06:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 06:06:03] [INFO ] Invariant cache hit.
[2026-05-24 06:06:03] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 301/301 places, 350/350 transitions.
Support contains 98 out of 301 places after structural reductions.
[2026-05-24 06:06:03] [INFO ] Flatten gal took : 50 ms
[2026-05-24 06:06:03] [INFO ] Flatten gal took : 21 ms
[2026-05-24 06:06:03] [INFO ] Input system was already deterministic with 350 transitions.
Support contains 97 out of 301 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (94 resets) in 1643 ms. (24 steps per ms) remains 2/75 properties
BEST_FIRST walk for 40004 steps (11 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2026-05-24 06:06:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 131/148 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 416/564 variables, 209/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/643 variables, 67/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 9 (OVERLAPS) 8/651 variables, 8/303 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/651 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 303 constraints, problems are : Problem set: 1 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/15 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/143 variables, 15/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/557 variables, 206/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/641 variables, 70/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/651 variables, 10/304 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 1/305 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/651 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 305 constraints, problems are : Problem set: 1 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 06:06:05] [INFO ] Flatten gal took : 16 ms
[2026-05-24 06:06:05] [INFO ] Flatten gal took : 16 ms
[2026-05-24 06:06:05] [INFO ] Input system was already deterministic with 350 transitions.
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 578 edges and 301 vertex of which 290 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 277 transition count 325
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 277 transition count 325
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 268 transition count 316
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 268 transition count 316
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 260 transition count 308
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 260 transition count 308
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 252 transition count 298
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 252 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 247 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 247 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 243 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 243 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 241 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 241 transition count 284
Applied a total of 120 rules in 27 ms. Remains 241 /301 variables (removed 60) and now considering 284/350 (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-17856824704894225329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14918322799742931618.kers'
[2026-05-24 06:06:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17856824704894225329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14918322799742931618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 241 cols 766 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-24 06:06:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14918322799742931618.kers
Total runtime 1 ms.
[2026-05-24 06:06:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:06:05] [INFO ] Invariant cache hit.
[2026-05-24 06:06:05] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-24 06:06:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/525 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 13/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 256 constraints, problems are : Problem set: 0 solved, 283 unsolved in 20332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/525 variables, 241/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 283/539 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 539 constraints, problems are : Problem set: 0 solved, 283 unsolved in 27010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47389ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 47390ms
Starting structural reductions in LTL mode, iteration 1 : 241/301 places, 284/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47615 ms. Remains : 241/301 places, 284/350 transitions.
[2026-05-24 06:06:53] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:06:53] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:06:53] [INFO ] Input system was already deterministic with 284 transitions.
[2026-05-24 06:06:53] [INFO ] Flatten gal took : 19 ms
[2026-05-24 06:06:53] [INFO ] Flatten gal took : 10 ms
[2026-05-24 06:06:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16269818879334617798.gal : 6 ms
[2026-05-24 06:06:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18170272646663021667.ctl : 10 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/CTLFireability16269818879334617798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18170272646663021667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:07:23] [INFO ] Flatten gal took : 10 ms
[2026-05-24 06:07:23] [INFO ] Applying decomposition
[2026-05-24 06:07:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2952236549990204507.txt' '-o' '/tmp/graph2952236549990204507.bin' '-w' '/tmp/graph2952236549990204507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2952236549990204507.bin' '-l' '-1' '-v' '-w' '/tmp/graph2952236549990204507.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:07:23] [INFO ] Decomposing Gal with order
[2026-05-24 06:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:07:23] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-24 06:07:23] [INFO ] Flatten gal took : 65 ms
[2026-05-24 06:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2026-05-24 06:07:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4757682029198933009.gal : 6 ms
[2026-05-24 06:07:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18294088244048729972.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/CTLFireability4757682029198933009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18294088244048729972.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 291 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 290 transition count 287
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 238 transition count 287
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 105 place count 238 transition count 250
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 179 place count 201 transition count 250
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 191 place count 189 transition count 237
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 189 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 203 place count 189 transition count 236
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 188 transition count 236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 214 place count 179 transition count 227
Iterating global reduction 2 with 9 rules applied. Total rules applied 223 place count 179 transition count 227
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 231 place count 171 transition count 214
Iterating global reduction 2 with 8 rules applied. Total rules applied 239 place count 171 transition count 214
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 163 transition count 203
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 163 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 258 place count 160 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 261 place count 160 transition count 200
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 311 place count 135 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 134 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 134 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 314 place count 133 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 315 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 316 place count 132 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 317 place count 132 transition count 171
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 132 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 130 transition count 169
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 154 edges and 128 vertex of which 124 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 133 edges and 124 vertex of which 48 / 124 are part of one of the 24 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 44 rules applied. Total rules applied 365 place count 100 transition count 124
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 3 with 66 rules applied. Total rules applied 431 place count 60 transition count 98
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 433 place count 59 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 434 place count 58 transition count 97
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 445 place count 47 transition count 75
Iterating global reduction 6 with 11 rules applied. Total rules applied 456 place count 47 transition count 75
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 467 place count 36 transition count 53
Iterating global reduction 6 with 11 rules applied. Total rules applied 478 place count 36 transition count 53
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 487 place count 27 transition count 35
Iterating global reduction 6 with 9 rules applied. Total rules applied 496 place count 27 transition count 35
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 505 place count 18 transition count 26
Iterating global reduction 6 with 9 rules applied. Total rules applied 514 place count 18 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 515 place count 18 transition count 25
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 517 place count 17 transition count 24
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 521 place count 13 transition count 20
Applied a total of 521 rules in 107 ms. Remains 13 /301 variables (removed 288) and now considering 20/350 (removed 330) transitions.
[2026-05-24 06:07:53] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14046358320933197908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11635612867038494832.kers'
[2026-05-24 06:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14046358320933197908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11635612867038494832.kers]
Normalized transition count is 15 out of 16 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 13 cols 27 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 06:07:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11635612867038494832.kers
Total runtime 0 ms.
[2026-05-24 06:07:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 06:07:53] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2026-05-24 06:07:53] [INFO ] Invariant cache hit.
[2026-05-24 06:07:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-24 06:07:53] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-24 06:07:53] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2026-05-24 06:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/28 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 113 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 112 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 229ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/301 places, 20/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 393 ms. Remains : 13/301 places, 20/350 transitions.
[2026-05-24 06:07:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:07:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:07:53] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-24 06:07:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:07:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:07:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7059211935627421620.gal : 0 ms
[2026-05-24 06:07:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17674153009573094331.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/CTLFireability7059211935627421620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17674153009573094331.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,6864,0.003936,3856,2,35,5,308,6,0,64,252,0


Converting to forward existential form...Done !
original formula: A(!(((p68==1) * AG((p35!=1)))) U (p99==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p99==1))))) * !(E(!((p99==1)) U (!(!(((p68==1) * !(E(TRUE U !((p35!=1))))))) * !((p99==1))))))...165
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t18, t19, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,0,0.033864,5372,1,0,260,8006,66,141,370,12041,286
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 290 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 289 transition count 286
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 237 transition count 286
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 105 place count 237 transition count 251
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 175 place count 202 transition count 251
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 188 place count 189 transition count 237
Iterating global reduction 2 with 13 rules applied. Total rules applied 201 place count 189 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 201 place count 189 transition count 236
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 188 transition count 236
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 213 place count 178 transition count 226
Iterating global reduction 2 with 10 rules applied. Total rules applied 223 place count 178 transition count 226
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 232 place count 169 transition count 212
Iterating global reduction 2 with 9 rules applied. Total rules applied 241 place count 169 transition count 212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 250 place count 160 transition count 199
Iterating global reduction 2 with 9 rules applied. Total rules applied 259 place count 160 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 263 place count 156 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 267 place count 156 transition count 195
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 315 place count 132 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 316 place count 131 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 317 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 130 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 130 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 129 transition count 167
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 129 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 127 transition count 165
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 339 place count 126 transition count 152
Reduce places removed 13 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 3 with 15 rules applied. Total rules applied 354 place count 113 transition count 150
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 356 place count 112 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 111 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 357 place count 111 transition count 148
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 359 place count 110 transition count 148
Applied a total of 359 rules in 56 ms. Remains 110 /301 variables (removed 191) and now considering 148/350 (removed 202) transitions.
[2026-05-24 06:07:54] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17990986582994088623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9083890646722507959.kers'
[2026-05-24 06:07:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17990986582994088623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9083890646722507959.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 109 cols 344 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 06:07:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9083890646722507959.kers
Total runtime 1 ms.
[2026-05-24 06:07:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 06:07:54] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2026-05-24 06:07:54] [INFO ] Invariant cache hit.
[2026-05-24 06:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 06:07:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-24 06:07:54] [INFO ] Redundant transitions in 3 ms returned []
Running 147 sub problems to find dead transitions.
[2026-05-24 06:07:54] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2026-05-24 06:07:54] [INFO ] Invariant cache hit.
[2026-05-24 06:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 147/257 variables, 110/111 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/257 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 112 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 147/257 variables, 110/111 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 147/259 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/257 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 259 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9568ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9569ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/301 places, 148/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9769 ms. Remains : 110/301 places, 148/350 transitions.
[2026-05-24 06:08:03] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:08:03] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:08:03] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-24 06:08:03] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:08:03] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:08:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16677491712914488340.gal : 1 ms
[2026-05-24 06:08:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1101017197972077446.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/CTLFireability16677491712914488340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1101017197972077446.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.6814e+13,7.84952,207024,2,67959,5,1.36433e+06,6,0,565,772300,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 291 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 290 transition count 293
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 244 transition count 290
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 241 transition count 290
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 99 place count 241 transition count 252
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 175 place count 203 transition count 252
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 188 place count 190 transition count 238
Iterating global reduction 3 with 13 rules applied. Total rules applied 201 place count 190 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 211 place count 180 transition count 228
Iterating global reduction 3 with 10 rules applied. Total rules applied 221 place count 180 transition count 228
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 230 place count 171 transition count 214
Iterating global reduction 3 with 9 rules applied. Total rules applied 239 place count 171 transition count 214
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 248 place count 162 transition count 201
Iterating global reduction 3 with 9 rules applied. Total rules applied 257 place count 162 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 261 place count 158 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 158 transition count 197
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 313 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 133 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 132 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 132 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 131 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 131 transition count 169
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 322 place count 131 transition count 169
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 129 transition count 167
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 184 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 122 edges and 127 vertex of which 46 / 127 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 13 rules applied. Total rules applied 337 place count 104 transition count 156
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 36 rules applied. Total rules applied 373 place count 94 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 376 place count 91 transition count 130
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 376 place count 91 transition count 120
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 396 place count 81 transition count 120
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 406 place count 71 transition count 100
Iterating global reduction 6 with 10 rules applied. Total rules applied 416 place count 71 transition count 100
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 424 place count 63 transition count 84
Iterating global reduction 6 with 8 rules applied. Total rules applied 432 place count 63 transition count 84
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 439 place count 56 transition count 77
Iterating global reduction 6 with 7 rules applied. Total rules applied 446 place count 56 transition count 77
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 452 place count 50 transition count 65
Iterating global reduction 6 with 6 rules applied. Total rules applied 458 place count 50 transition count 65
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 464 place count 44 transition count 59
Iterating global reduction 6 with 6 rules applied. Total rules applied 470 place count 44 transition count 59
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 477 place count 37 transition count 52
Applied a total of 477 rules in 54 ms. Remains 37 /301 variables (removed 264) and now considering 52/350 (removed 298) transitions.
[2026-05-24 06:09:04] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2777550006656404042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12820817921652770176.kers'
[2026-05-24 06:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2777550006656404042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12820817921652770176.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 36 cols 86 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-24 06:09:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12820817921652770176.kers
Total runtime 0 ms.
[2026-05-24 06:09:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 06:09:04] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2026-05-24 06:09:04] [INFO ] Invariant cache hit.
[2026-05-24 06:09:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-24 06:09:04] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-24 06:09:04] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2026-05-24 06:09:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 43/73 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 7/80 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/81 variables, and 38 constraints, problems are : Problem set: 0 solved, 37 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 43/73 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 7/80 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/81 variables, and 75 constraints, problems are : Problem set: 0 solved, 37 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1046ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1046ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/301 places, 52/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1175 ms. Remains : 37/301 places, 52/350 transitions.
[2026-05-24 06:09:05] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:09:05] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:09:05] [INFO ] Input system was already deterministic with 52 transitions.
[2026-05-24 06:09:05] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:09:05] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16267517567864271272.gal : 1 ms
[2026-05-24 06:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3470625067670217882.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/CTLFireability16267517567864271272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3470625067670217882.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,4.0364e+08,0.150447,9580,2,2664,5,29968,6,0,181,35226,0


Converting to forward existential form...Done !
original formula: AF((AG((((p240==0)&&(p305==0))&&(p221==0))) * ((A((p329==1) U (p221==1)) + (p140==0)) + ((!(E((p139==1) U (p123==1))) * (p358==1)) * (p37...164
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((p240==0)&&(p305==0))&&(p221==0))))) * ((!((E(!((p221==1)) U (!((p329==1)) * !((p22...268
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t10, t16, t18, t19, t23, t26, t38, t43, t46, t47, t48, t49, t50, Intersection wi...237
(forward)formula 0,0,12.0685,325584,1,0,1046,1.68716e+06,141,611,1152,2.62557e+06,1142
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 271 transition count 319
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 271 transition count 319
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 259 transition count 307
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 259 transition count 307
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 249 transition count 297
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 249 transition count 297
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 240 transition count 284
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 240 transition count 284
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 231 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 231 transition count 270
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 222 transition count 261
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 222 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 163 place count 217 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 168 place count 217 transition count 256
Applied a total of 168 rules in 41 ms. Remains 217 /301 variables (removed 84) and now considering 256/350 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13011759912382028007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-727238097205844814.kers'
[2026-05-24 06:09:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13011759912382028007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-727238097205844814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 217 cols 692 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 06:09:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-727238097205844814.kers
Total runtime 2 ms.
[2026-05-24 06:09:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 06:09:17] [INFO ] Invariant cache hit.
[2026-05-24 06:09:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 06:09:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/473 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 13/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 232 constraints, problems are : Problem set: 0 solved, 255 unsolved in 16839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/473 variables, 217/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 255/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 487 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39013ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 39014ms
Starting structural reductions in LTL mode, iteration 1 : 217/301 places, 256/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39260 ms. Remains : 217/301 places, 256/350 transitions.
[2026-05-24 06:09:56] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:09:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:09:56] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 06:09:56] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:09:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:09:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15860320300383988027.gal : 1 ms
[2026-05-24 06:09:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13037570615216074075.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/CTLFireability15860320300383988027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13037570615216074075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:10:26] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:10:26] [INFO ] Applying decomposition
[2026-05-24 06:10:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4413383211558309142.txt' '-o' '/tmp/graph4413383211558309142.bin' '-w' '/tmp/graph4413383211558309142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4413383211558309142.bin' '-l' '-1' '-v' '-w' '/tmp/graph4413383211558309142.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:10:26] [INFO ] Decomposing Gal with order
[2026-05-24 06:10:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:10:26] [INFO ] Removed a total of 103 redundant transitions.
[2026-05-24 06:10:26] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:10:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-24 06:10:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10838348169961221790.gal : 2 ms
[2026-05-24 06:10:26] [INFO ] Time to serialize properties into /tmp/CTLFireability392709170905273049.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/CTLFireability10838348169961221790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability392709170905273049.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 290 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 289 transition count 284
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 235 transition count 284
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 109 place count 235 transition count 249
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 179 place count 200 transition count 249
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 192 place count 187 transition count 235
Iterating global reduction 2 with 13 rules applied. Total rules applied 205 place count 187 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 205 place count 187 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 186 transition count 234
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 217 place count 176 transition count 224
Iterating global reduction 2 with 10 rules applied. Total rules applied 227 place count 176 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 236 place count 167 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 245 place count 167 transition count 210
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 158 transition count 197
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 158 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 267 place count 154 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 154 transition count 193
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 317 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 130 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 130 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 322 place count 128 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 128 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 126 transition count 164
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 15 rules applied. Total rules applied 340 place count 125 transition count 150
Reduce places removed 14 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 3 with 16 rules applied. Total rules applied 356 place count 111 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 110 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 357 place count 110 transition count 147
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 359 place count 109 transition count 147
Applied a total of 359 rules in 51 ms. Remains 109 /301 variables (removed 192) and now considering 147/350 (removed 203) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17501416720329830510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17824305610289866088.kers'
[2026-05-24 06:10:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17501416720329830510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17824305610289866088.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 108 cols 345 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-24 06:10:56] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17824305610289866088.kers
Total runtime 0 ms.
[2026-05-24 06:10:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 06:10:56] [INFO ] Invariant cache hit.
[2026-05-24 06:10:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2026-05-24 06:10:57] [INFO ] Redundant transitions in 3 ms returned []
Running 146 sub problems to find dead transitions.
[2026-05-24 06:10:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/256 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 110 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/256 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 146/256 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 256 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9076ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 9076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/301 places, 147/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9252 ms. Remains : 109/301 places, 147/350 transitions.
[2026-05-24 06:11:06] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:11:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:11:06] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-24 06:11:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:11:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:11:06] [INFO ] Time to serialize gal into /tmp/CTLFireability264820271053907778.gal : 1 ms
[2026-05-24 06:11:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13931663519921234401.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/CTLFireability264820271053907778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13931663519921234401.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.52024e+13,6.54921,188268,2,60734,5,1.21741e+06,6,0,560,658580,0


Converting to forward existential form...Done !
original formula: EF(((EF((p243==0)) * (p323==1)) * (p371==1)))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (p371==1)) * (p323==1)),TRUE) * (p243==0))] != FALSE
(forward)formula 0,1,13.5309,263136,1,0,12,1.84695e+06,11,3,1054,766851,5
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 274 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 274 transition count 322
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 262 transition count 310
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 262 transition count 310
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 88 place count 252 transition count 300
Iterating global reduction 0 with 10 rules applied. Total rules applied 98 place count 252 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 243 transition count 287
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 243 transition count 287
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 125 place count 234 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 134 place count 234 transition count 273
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 142 place count 226 transition count 265
Iterating global reduction 0 with 8 rules applied. Total rules applied 150 place count 226 transition count 265
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 154 place count 222 transition count 261
Iterating global reduction 0 with 4 rules applied. Total rules applied 158 place count 222 transition count 261
Applied a total of 158 rules in 32 ms. Remains 222 /301 variables (removed 79) and now considering 261/350 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4975495942742367573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12236293388005629988.kers'
[2026-05-24 06:11:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4975495942742367573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12236293388005629988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 222 cols 703 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-24 06:11:19] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12236293388005629988.kers
Total runtime 1 ms.
[2026-05-24 06:11:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:11:19] [INFO ] Invariant cache hit.
[2026-05-24 06:11:20] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-24 06:11:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/483 variables, 222/224 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 13/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/483 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 237 constraints, problems are : Problem set: 0 solved, 260 unsolved in 17225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/483 variables, 222/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 260/497 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/483 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 497 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41830ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 41835ms
Starting structural reductions in LTL mode, iteration 1 : 222/301 places, 261/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42068 ms. Remains : 222/301 places, 261/350 transitions.
[2026-05-24 06:12:01] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:12:01] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:12:01] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-24 06:12:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:12:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8408510731590198124.gal : 1 ms
[2026-05-24 06:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9494539760282639018.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/CTLFireability8408510731590198124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9494539760282639018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:12:31] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:12:31] [INFO ] Applying decomposition
[2026-05-24 06:12:31] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8723585554584181998.txt' '-o' '/tmp/graph8723585554584181998.bin' '-w' '/tmp/graph8723585554584181998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8723585554584181998.bin' '-l' '-1' '-v' '-w' '/tmp/graph8723585554584181998.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:12:32] [INFO ] Decomposing Gal with order
[2026-05-24 06:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:12:32] [INFO ] Removed a total of 103 redundant transitions.
[2026-05-24 06:12:32] [INFO ] Flatten gal took : 13 ms
[2026-05-24 06:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-24 06:12:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18044022706903770244.gal : 2 ms
[2026-05-24 06:12:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13005785131059696235.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/CTLFireability18044022706903770244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13005785131059696235.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 271 transition count 319
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 271 transition count 319
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 259 transition count 307
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 259 transition count 307
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 249 transition count 297
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 249 transition count 297
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 240 transition count 285
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 240 transition count 285
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 231 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 231 transition count 270
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 148 place count 223 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 156 place count 223 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 161 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 166 place count 218 transition count 257
Applied a total of 166 rules in 21 ms. Remains 218 /301 variables (removed 83) and now considering 257/350 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14553916742610305514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2519261519970771937.kers'
[2026-05-24 06:13:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14553916742610305514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2519261519970771937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 218 cols 697 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-24 06:13:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2519261519970771937.kers
Total runtime 1 ms.
[2026-05-24 06:13:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 06:13:02] [INFO ] Invariant cache hit.
[2026-05-24 06:13:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 06:13:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/475 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 233 constraints, problems are : Problem set: 0 solved, 256 unsolved in 16787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/475 variables, 218/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 256/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/475 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 489 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40594ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 40594ms
Starting structural reductions in LTL mode, iteration 1 : 218/301 places, 257/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40810 ms. Remains : 218/301 places, 257/350 transitions.
[2026-05-24 06:13:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:13:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:13:42] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-24 06:13:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:13:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:13:42] [INFO ] Time to serialize gal into /tmp/CTLFireability497383708080306269.gal : 1 ms
[2026-05-24 06:13:42] [INFO ] Time to serialize properties into /tmp/CTLFireability986838254770499382.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/CTLFireability497383708080306269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability986838254770499382.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.
Detected timeout of ITS tools.
[2026-05-24 06:14:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:14:13] [INFO ] Applying decomposition
[2026-05-24 06:14:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3258894831736478026.txt' '-o' '/tmp/graph3258894831736478026.bin' '-w' '/tmp/graph3258894831736478026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3258894831736478026.bin' '-l' '-1' '-v' '-w' '/tmp/graph3258894831736478026.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:14:13] [INFO ] Decomposing Gal with order
[2026-05-24 06:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:14:13] [INFO ] Removed a total of 105 redundant transitions.
[2026-05-24 06:14:13] [INFO ] Flatten gal took : 24 ms
[2026-05-24 06:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 3 ms.
[2026-05-24 06:14:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13108575453729737084.gal : 2 ms
[2026-05-24 06:14:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6949432268086577760.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/CTLFireability13108575453729737084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6949432268086577760.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 291 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 290 transition count 285
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 236 transition count 285
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 109 place count 236 transition count 248
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 183 place count 199 transition count 248
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 196 place count 186 transition count 234
Iterating global reduction 2 with 13 rules applied. Total rules applied 209 place count 186 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 209 place count 186 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 185 transition count 233
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 221 place count 175 transition count 223
Iterating global reduction 2 with 10 rules applied. Total rules applied 231 place count 175 transition count 223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 240 place count 166 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 249 place count 166 transition count 209
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 258 place count 157 transition count 196
Iterating global reduction 2 with 9 rules applied. Total rules applied 267 place count 157 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 271 place count 153 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 275 place count 153 transition count 192
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 323 place count 129 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 324 place count 128 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 325 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 326 place count 127 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 328 place count 126 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 329 place count 126 transition count 164
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 330 place count 126 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 332 place count 124 transition count 162
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 148 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 130 edges and 118 vertex of which 52 / 118 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 42 rules applied. Total rules applied 374 place count 92 transition count 119
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 438 place count 54 transition count 93
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 450 place count 42 transition count 69
Iterating global reduction 4 with 12 rules applied. Total rules applied 462 place count 42 transition count 69
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 473 place count 31 transition count 47
Iterating global reduction 4 with 11 rules applied. Total rules applied 484 place count 31 transition count 47
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 495 place count 20 transition count 25
Iterating global reduction 4 with 11 rules applied. Total rules applied 506 place count 20 transition count 25
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 517 place count 9 transition count 14
Iterating global reduction 4 with 11 rules applied. Total rules applied 528 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 529 place count 9 transition count 13
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 530 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 531 place count 8 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 533 place count 6 transition count 10
Applied a total of 533 rules in 31 ms. Remains 6 /301 variables (removed 295) and now considering 10/350 (removed 340) transitions.
[2026-05-24 06:14:43] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14340182428005906854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6922843653838770908.kers'
[2026-05-24 06:14:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14340182428005906854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6922843653838770908.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 12 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 06:14:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6922843653838770908.kers
Total runtime 0 ms.
[2026-05-24 06:14:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 06:14:43] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:14:43] [INFO ] Invariant cache hit.
[2026-05-24 06:14:43] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 06:14:43] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 06:14:43] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/301 places, 10/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 6/301 places, 10/350 transitions.
[2026-05-24 06:14:43] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:14:43] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:14:43] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 06:14:43] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:14:43] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:14:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14657225077018339941.gal : 0 ms
[2026-05-24 06:14:43] [INFO ] Time to serialize properties into /tmp/CTLFireability452851843837704264.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/CTLFireability14657225077018339941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability452851843837704264.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,468,0.003706,3872,2,23,5,403,6,0,30,531,0


Converting to forward existential form...Done !
original formula: EG((p85==0))
=> equivalent forward existential formula: [FwdG(Init,(p85==0))] != FALSE
Hit Full ! (commute/partial/dont) 8/0/2
(forward)formula 0,1,0.006311,4144,1,0,8,538,19,4,160,695,8
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 274 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 274 transition count 322
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 261 transition count 309
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 261 transition count 309
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 251 transition count 299
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 251 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 244 transition count 289
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 244 transition count 289
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 238 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 238 transition count 280
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 132 place count 232 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 138 place count 232 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 229 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 229 transition count 271
Applied a total of 144 rules in 19 ms. Remains 229 /301 variables (removed 72) and now considering 271/350 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2726986394301936218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10082446257721761793.kers'
[2026-05-24 06:14:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2726986394301936218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10082446257721761793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 229 cols 729 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-24 06:14:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10082446257721761793.kers
Total runtime 1 ms.
[2026-05-24 06:14:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 06:14:43] [INFO ] Invariant cache hit.
[2026-05-24 06:14:43] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-24 06:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/500 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 244 constraints, problems are : Problem set: 0 solved, 270 unsolved in 18066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/500 variables, 229/244 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 270/514 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 514 constraints, problems are : Problem set: 0 solved, 270 unsolved in 26755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44849ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 44849ms
Starting structural reductions in LTL mode, iteration 1 : 229/301 places, 271/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45049 ms. Remains : 229/301 places, 271/350 transitions.
[2026-05-24 06:15:28] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:15:28] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:15:28] [INFO ] Input system was already deterministic with 271 transitions.
[2026-05-24 06:15:28] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:15:28] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:15:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17741292376486047011.gal : 1 ms
[2026-05-24 06:15:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6882141786109618560.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/CTLFireability17741292376486047011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6882141786109618560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:15:58] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:15:58] [INFO ] Applying decomposition
[2026-05-24 06:15:58] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8759843342743110829.txt' '-o' '/tmp/graph8759843342743110829.bin' '-w' '/tmp/graph8759843342743110829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8759843342743110829.bin' '-l' '-1' '-v' '-w' '/tmp/graph8759843342743110829.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:15:58] [INFO ] Decomposing Gal with order
[2026-05-24 06:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:15:58] [INFO ] Removed a total of 105 redundant transitions.
[2026-05-24 06:15:58] [INFO ] Flatten gal took : 21 ms
[2026-05-24 06:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2026-05-24 06:15:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8446170102412464965.gal : 8 ms
[2026-05-24 06:15:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17430197267313360332.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/CTLFireability8446170102412464965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17430197267313360332.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 290 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 289 transition count 286
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 237 transition count 286
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 105 place count 237 transition count 248
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 181 place count 199 transition count 248
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 194 place count 186 transition count 234
Iterating global reduction 2 with 13 rules applied. Total rules applied 207 place count 186 transition count 234
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 217 place count 176 transition count 224
Iterating global reduction 2 with 10 rules applied. Total rules applied 227 place count 176 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 236 place count 167 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 245 place count 167 transition count 210
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 158 transition count 197
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 158 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 266 place count 155 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 269 place count 155 transition count 194
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 317 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 130 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 130 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 322 place count 128 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 128 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 126 transition count 164
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 182 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 131 edges and 124 vertex of which 52 / 124 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 341 place count 98 transition count 150
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 380 place count 85 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 380 place count 85 transition count 111
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 406 place count 72 transition count 111
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 417 place count 61 transition count 89
Iterating global reduction 4 with 11 rules applied. Total rules applied 428 place count 61 transition count 89
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 439 place count 50 transition count 67
Iterating global reduction 4 with 11 rules applied. Total rules applied 450 place count 50 transition count 67
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 461 place count 39 transition count 56
Iterating global reduction 4 with 11 rules applied. Total rules applied 472 place count 39 transition count 56
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 483 place count 28 transition count 34
Iterating global reduction 4 with 11 rules applied. Total rules applied 494 place count 28 transition count 34
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 505 place count 17 transition count 23
Iterating global reduction 4 with 11 rules applied. Total rules applied 516 place count 17 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 15 transition count 21
Applied a total of 518 rules in 39 ms. Remains 15 /301 variables (removed 286) and now considering 21/350 (removed 329) transitions.
[2026-05-24 06:16:28] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13152518936098970236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18015605695722487966.kers'
[2026-05-24 06:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13152518936098970236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18015605695722487966.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 14 cols 34 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 06:16:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18015605695722487966.kers
Total runtime 0 ms.
[2026-05-24 06:16:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 06:16:28] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2026-05-24 06:16:28] [INFO ] Invariant cache hit.
[2026-05-24 06:16:28] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-24 06:16:28] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 06:16:28] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2026-05-24 06:16:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/30 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 16 constraints, problems are : Problem set: 0 solved, 16 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/30 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/32 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 32 constraints, problems are : Problem set: 0 solved, 16 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 331ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/301 places, 21/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 431 ms. Remains : 15/301 places, 21/350 transitions.
[2026-05-24 06:16:29] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:16:29] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:16:29] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-24 06:16:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:16:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2005123791163151021.gal : 1 ms
[2026-05-24 06:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8302575950243056497.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/CTLFireability2005123791163151021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8302575950243056497.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,754936,0.009207,4176,2,132,5,2037,6,0,75,2003,0


Converting to forward existential form...Done !
original formula: EG(((p23==0)||(p378==0)))
=> equivalent forward existential formula: [FwdG(Init,((p23==0)||(p378==0)))] != FALSE
Hit Full ! (commute/partial/dont) 14/0/7
(forward)formula 0,1,0.040055,5328,1,0,9,8383,19,4,441,8615,8
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 273 transition count 321
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 273 transition count 321
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 262 transition count 310
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 262 transition count 310
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 253 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 253 transition count 301
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 248 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 248 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 243 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 243 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 238 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 238 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 235 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 235 transition count 278
Applied a total of 132 rules in 21 ms. Remains 235 /301 variables (removed 66) and now considering 278/350 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10052800810657229708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7747714245348076262.kers'
[2026-05-24 06:16:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10052800810657229708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7747714245348076262.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 278 rows 235 cols 750 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-24 06:16:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7747714245348076262.kers
Total runtime 2 ms.
[2026-05-24 06:16:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 06:16:29] [INFO ] Invariant cache hit.
[2026-05-24 06:16:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2026-05-24 06:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 278/513 variables, 235/237 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 0/513 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 250 constraints, problems are : Problem set: 0 solved, 277 unsolved in 19049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 278/513 variables, 235/250 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 277/527 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 527 constraints, problems are : Problem set: 0 solved, 277 unsolved in 28385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47461ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 47462ms
Starting structural reductions in LTL mode, iteration 1 : 235/301 places, 278/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47665 ms. Remains : 235/301 places, 278/350 transitions.
[2026-05-24 06:17:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:17:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:17:16] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-24 06:17:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:17:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:17:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14760572675862972173.gal : 1 ms
[2026-05-24 06:17:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10142951545522352996.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/CTLFireability14760572675862972173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10142951545522352996.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:17:46] [INFO ] Flatten gal took : 16 ms
[2026-05-24 06:17:46] [INFO ] Applying decomposition
[2026-05-24 06:17:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5945395579485781650.txt' '-o' '/tmp/graph5945395579485781650.bin' '-w' '/tmp/graph5945395579485781650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5945395579485781650.bin' '-l' '-1' '-v' '-w' '/tmp/graph5945395579485781650.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:17:46] [INFO ] Decomposing Gal with order
[2026-05-24 06:17:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:17:47] [INFO ] Removed a total of 108 redundant transitions.
[2026-05-24 06:17:47] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:17:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-24 06:17:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14335191780926687154.gal : 2 ms
[2026-05-24 06:17:47] [INFO ] Time to serialize properties into /tmp/CTLFireability502045034176062963.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/CTLFireability14335191780926687154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability502045034176062963.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 272 transition count 320
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 272 transition count 320
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 261 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 261 transition count 309
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 252 transition count 300
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 252 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 243 transition count 287
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 243 transition count 287
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 125 place count 234 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 134 place count 234 transition count 273
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 225 transition count 264
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 225 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 157 place count 220 transition count 259
Iterating global reduction 0 with 5 rules applied. Total rules applied 162 place count 220 transition count 259
Applied a total of 162 rules in 19 ms. Remains 220 /301 variables (removed 81) and now considering 259/350 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8684232749177465238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6541834738337723783.kers'
[2026-05-24 06:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8684232749177465238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6541834738337723783.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 220 cols 698 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-24 06:18:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6541834738337723783.kers
Total runtime 2 ms.
[2026-05-24 06:18:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 06:18:17] [INFO ] Invariant cache hit.
[2026-05-24 06:18:17] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-24 06:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/479 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 248 constraints, problems are : Problem set: 0 solved, 258 unsolved in 17783 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/479 variables, 220/248 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 258/506 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 506 constraints, problems are : Problem set: 0 solved, 258 unsolved in 23742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41552ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 41553ms
Starting structural reductions in LTL mode, iteration 1 : 220/301 places, 259/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41794 ms. Remains : 220/301 places, 259/350 transitions.
[2026-05-24 06:18:58] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:18:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:18:58] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-24 06:18:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:18:58] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:18:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14152745512042697866.gal : 1 ms
[2026-05-24 06:18:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4705656021705304237.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/CTLFireability14152745512042697866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4705656021705304237.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:19:28] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:19:28] [INFO ] Applying decomposition
[2026-05-24 06:19:28] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1531095787017952474.txt' '-o' '/tmp/graph1531095787017952474.bin' '-w' '/tmp/graph1531095787017952474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1531095787017952474.bin' '-l' '-1' '-v' '-w' '/tmp/graph1531095787017952474.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:19:29] [INFO ] Decomposing Gal with order
[2026-05-24 06:19:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:19:29] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-24 06:19:29] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:19:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2026-05-24 06:19:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3682251186964324724.gal : 1 ms
[2026-05-24 06:19:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15199786260736139025.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/CTLFireability3682251186964324724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15199786260736139025.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 291 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 290 transition count 290
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 241 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 240 transition count 289
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 101 place count 240 transition count 256
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 167 place count 207 transition count 256
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 177 place count 197 transition count 246
Iterating global reduction 3 with 10 rules applied. Total rules applied 187 place count 197 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 187 place count 197 transition count 245
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 189 place count 196 transition count 245
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 189 transition count 238
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 189 transition count 238
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 182 transition count 228
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 182 transition count 228
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 223 place count 176 transition count 219
Iterating global reduction 3 with 6 rules applied. Total rules applied 229 place count 176 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 173 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 173 transition count 216
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 151 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 280 place count 150 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 150 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 282 place count 149 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 149 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 284 place count 148 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 148 transition count 190
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 288 place count 148 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 290 place count 146 transition count 188
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 17 rules applied. Total rules applied 307 place count 145 transition count 172
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 20 rules applied. Total rules applied 327 place count 129 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 329 place count 127 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 329 place count 127 transition count 167
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 331 place count 126 transition count 167
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 333 place count 125 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 335 place count 125 transition count 164
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 337 place count 124 transition count 163
Applied a total of 337 rules in 49 ms. Remains 124 /301 variables (removed 177) and now considering 163/350 (removed 187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2652676387478356098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7566975559285622569.kers'
[2026-05-24 06:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2652676387478356098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7566975559285622569.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 163 rows 123 cols 380 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-24 06:19:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7566975559285622569.kers
Total runtime 1 ms.
[2026-05-24 06:19:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 06:19:59] [INFO ] Invariant cache hit.
[2026-05-24 06:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 06:19:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2026-05-24 06:19:59] [INFO ] Redundant transitions in 4 ms returned []
Running 161 sub problems to find dead transitions.
[2026-05-24 06:19:59] [INFO ] Invariant cache hit.
[2026-05-24 06:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 163/286 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/287 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 163/286 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/286 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14884ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14885ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/301 places, 163/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15121 ms. Remains : 124/301 places, 163/350 transitions.
[2026-05-24 06:20:14] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:20:14] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:20:14] [INFO ] Input system was already deterministic with 163 transitions.
[2026-05-24 06:20:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:20:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:20:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1996104396771323571.gal : 1 ms
[2026-05-24 06:20:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7489770179449069183.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/CTLFireability1996104396771323571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7489770179449069183.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,4.86914e+13,4.39773,139024,2,43257,5,747102,6,0,639,633536,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 271 transition count 319
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 271 transition count 319
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 259 transition count 307
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 259 transition count 307
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 249 transition count 297
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 249 transition count 297
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 240 transition count 285
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 240 transition count 285
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 231 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 231 transition count 270
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 222 transition count 261
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 222 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 216 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 216 transition count 255
Applied a total of 170 rules in 29 ms. Remains 216 /301 variables (removed 85) and now considering 255/350 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11941978497780340157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7216911602852995416.kers'
[2026-05-24 06:21:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11941978497780340157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7216911602852995416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 216 cols 691 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 06:21:14] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7216911602852995416.kers
Total runtime 6 ms.
[2026-05-24 06:21:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 06:21:14] [INFO ] Invariant cache hit.
[2026-05-24 06:21:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 06:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 255/471 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 13/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 231 constraints, problems are : Problem set: 0 solved, 254 unsolved in 16943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/471 variables, 216/231 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 254/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 485 constraints, problems are : Problem set: 0 solved, 254 unsolved in 24835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41833ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 41834ms
Starting structural reductions in LTL mode, iteration 1 : 216/301 places, 255/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42066 ms. Remains : 216/301 places, 255/350 transitions.
[2026-05-24 06:21:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:21:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:21:56] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 06:21:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:21:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:21:56] [INFO ] Time to serialize gal into /tmp/CTLFireability276892465892171097.gal : 1 ms
[2026-05-24 06:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8972940384296875185.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/CTLFireability276892465892171097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8972940384296875185.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:22:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:22:26] [INFO ] Applying decomposition
[2026-05-24 06:22:26] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10628094669466734147.txt' '-o' '/tmp/graph10628094669466734147.bin' '-w' '/tmp/graph10628094669466734147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10628094669466734147.bin' '-l' '-1' '-v' '-w' '/tmp/graph10628094669466734147.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:22:26] [INFO ] Decomposing Gal with order
[2026-05-24 06:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:22:26] [INFO ] Removed a total of 104 redundant transitions.
[2026-05-24 06:22:26] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2026-05-24 06:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17952539979824629244.gal : 2 ms
[2026-05-24 06:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12565263946957497834.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/CTLFireability17952539979824629244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12565263946957497834.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 350/350 transitions.
Graph (complete) has 578 edges and 301 vertex of which 291 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 290 transition count 288
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 239 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 237 transition count 286
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 107 place count 237 transition count 251
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 177 place count 202 transition count 251
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 190 place count 189 transition count 237
Iterating global reduction 3 with 13 rules applied. Total rules applied 203 place count 189 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 203 place count 189 transition count 236
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 205 place count 188 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 179 transition count 227
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 179 transition count 227
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 231 place count 171 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 171 transition count 214
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 163 transition count 203
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 163 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 258 place count 160 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 160 transition count 200
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 309 place count 136 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 135 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 135 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 134 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 314 place count 133 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 133 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 131 transition count 170
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 17 rules applied. Total rules applied 334 place count 130 transition count 154
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 20 rules applied. Total rules applied 354 place count 114 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 356 place count 112 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 place count 112 transition count 149
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 358 place count 111 transition count 149
Applied a total of 358 rules in 42 ms. Remains 111 /301 variables (removed 190) and now considering 149/350 (removed 201) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7543594254009888886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8332412297406094078.kers'
[2026-05-24 06:22:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7543594254009888886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8332412297406094078.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 149 rows 110 cols 349 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 06:22:56] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8332412297406094078.kers
Total runtime 2 ms.
[2026-05-24 06:22:57] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 06:22:57] [INFO ] Invariant cache hit.
[2026-05-24 06:22:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2026-05-24 06:22:57] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-24 06:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/260 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 0/260 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 112 constraints, problems are : Problem set: 0 solved, 148 unsolved in 3772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/260 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 148/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 260 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9211ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 9211ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/301 places, 149/350 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9602 ms. Remains : 111/301 places, 149/350 transitions.
[2026-05-24 06:23:06] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:23:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:23:06] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-24 06:23:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:23:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11471930257210597019.gal : 1 ms
[2026-05-24 06:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16601746001286307492.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/CTLFireability11471930257210597019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16601746001286307492.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.77284e+13,2.90837,95432,2,28962,5,614376,6,0,569,292458,0


Converting to forward existential form...Done !
original formula: AG(AF((((p261==0)||((p25==0)&&((p26==0)||(p371==0))))||(((p296==1)&&(p371==1))&&(p187==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p261==0)||((p25==0)&&((p26==0)||(p371==0))))||(((p296==1)&&(p371==1))&&(p187==1)))))]...163
Hit Full ! (commute/partial/dont) 74/8/75
Detected timeout of ITS tools.
[2026-05-24 06:23:36] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:23:36] [INFO ] Applying decomposition
[2026-05-24 06:23:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17375944323514822366.txt' '-o' '/tmp/graph17375944323514822366.bin' '-w' '/tmp/graph17375944323514822366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17375944323514822366.bin' '-l' '-1' '-v' '-w' '/tmp/graph17375944323514822366.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:23:36] [INFO ] Decomposing Gal with order
[2026-05-24 06:23:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:23:36] [INFO ] Removed a total of 76 redundant transitions.
[2026-05-24 06:23:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:23:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 1 ms.
[2026-05-24 06:23:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14154894699931983672.gal : 1 ms
[2026-05-24 06:23:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4788177207387792544.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/CTLFireability14154894699931983672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4788177207387792544.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:24:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:24:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:24:06] [INFO ] Applying decomposition
[2026-05-24 06:24:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8702396566396186308.txt' '-o' '/tmp/graph8702396566396186308.bin' '-w' '/tmp/graph8702396566396186308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8702396566396186308.bin' '-l' '-1' '-v' '-w' '/tmp/graph8702396566396186308.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:24:06] [INFO ] Decomposing Gal with order
[2026-05-24 06:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:24:06] [INFO ] Removed a total of 122 redundant transitions.
[2026-05-24 06:24:06] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 06:24:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8829733661198445767.gal : 2 ms
[2026-05-24 06:24:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13832831444121767756.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/CTLFireability8829733661198445767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13832831444121767756.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 11 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,7.25543e+18,482.642,6174836,30486,128,9.36778e+06,10014,687,5.72439e+07,65,114950,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 06:50:31] [INFO ] Applying decomposition
[2026-05-24 06:50:31] [INFO ] Flatten gal took : 162 ms
[2026-05-24 06:50:31] [INFO ] Decomposing Gal with order
[2026-05-24 06:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:50:32] [INFO ] Removed a total of 122 redundant transitions.
[2026-05-24 06:50:32] [INFO ] Flatten gal took : 129 ms
[2026-05-24 06:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 877 labels/synchronizations in 202 ms.
[2026-05-24 06:50:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4262788414956406173.gal : 18 ms
[2026-05-24 06:50:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2009640228521579015.ctl : 7 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/CTLFireability4262788414956406173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2009640228521579015.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 11 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,7.25543e+18,137.011,2582736,2128,2037,4.02122e+06,741464,446,1.30401e+07,255,5.17596e+06,0


Converting to forward existential form...Done !
original formula: (((EX((A(AG(((i0.u25.p347==1)&&(i1.u28.p378==1))) U !(((i0.i0.i0.i0.i0.u21.p250==1)&&(i1.u28.p378==1)))) * AF(((i0.i0.u24.p316==1)&&(i1.u...973
=> equivalent forward existential formula: ([(FwdU(((Init * !(EX(((i0.u25.p347==1)&&(i1.u28.p378==1))))) * !(EX((!((E(!(!(((i0.i0.i0.i0.i0.u21.p250==1)&&(i...1229
Reverse transition relation is NOT exact ! Due to transitions t229, t231, t321, t328, i0.t14, i0.u25.t21, i0.u25.t24, i0.u25.t26, i0.u25.t339, i0.i0.t31, i...2202
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-24 07:01:14] [INFO ] Flatten gal took : 39 ms
[2026-05-24 07:01:14] [INFO ] Input system was already deterministic with 350 transitions.
[2026-05-24 07:01:14] [INFO ] Transformed 301 places.
[2026-05-24 07:01:14] [INFO ] Transformed 350 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 07:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12204289534495171743.gal : 2 ms
[2026-05-24 07:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8442743492358171774.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12204289534495171743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8442743492358171774.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-13b"
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 DiscoveryGPU-PT-13b, 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 r098-tall-177955695500354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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