fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r018-smll-177946788100273
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for BART-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2225.243 817187.00 965756.00 2409.00 TFFFFFTTTTTFTTFT normal

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.r018-smll-177946788100273.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 BART-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 92M
-rw-r--r-- 1 mcc users 3.5M Mar 5 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 13M Mar 5 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Mar 5 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.3M Mar 5 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.9M Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Mar 15 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Mar 15 07:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0M Mar 5 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15M Mar 5 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M Mar 5 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Mar 5 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 673K Mar 15 07:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.4M Mar 15 07:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 12M 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 BART-PT-050-CTLCardinality-2024-00
FORMULA_NAME BART-PT-050-CTLCardinality-2024-01
FORMULA_NAME BART-PT-050-CTLCardinality-2024-02
FORMULA_NAME BART-PT-050-CTLCardinality-2024-03
FORMULA_NAME BART-PT-050-CTLCardinality-2024-04
FORMULA_NAME BART-PT-050-CTLCardinality-2024-05
FORMULA_NAME BART-PT-050-CTLCardinality-2024-06
FORMULA_NAME BART-PT-050-CTLCardinality-2024-07
FORMULA_NAME BART-PT-050-CTLCardinality-2024-08
FORMULA_NAME BART-PT-050-CTLCardinality-2024-09
FORMULA_NAME BART-PT-050-CTLCardinality-2024-10
FORMULA_NAME BART-PT-050-CTLCardinality-2024-11
FORMULA_NAME BART-PT-050-CTLCardinality-2024-12
FORMULA_NAME BART-PT-050-CTLCardinality-2024-13
FORMULA_NAME BART-PT-050-CTLCardinality-2024-14
FORMULA_NAME BART-PT-050-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779558205723

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 17:43:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:43:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:43:29] [INFO ] Load time of PNML (sax parser for PT used): 1265 ms
[2026-05-23 17:43:29] [INFO ] Transformed 6810 places.
[2026-05-23 17:43:29] [INFO ] Transformed 10100 transitions.
[2026-05-23 17:43:29] [INFO ] Found NUPN structural information;
[2026-05-23 17:43:29] [INFO ] Parsed PT model containing 6810 places and 10100 transitions and 81000 arcs in 1634 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 438 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-050-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1579 places :
Symmetric choice reduction at 0 with 1579 rule applications. Total rules 1579 place count 5021 transition count 8521
Iterating global reduction 0 with 1579 rules applied. Total rules applied 3158 place count 5021 transition count 8521
Discarding 1321 places :
Symmetric choice reduction at 0 with 1321 rule applications. Total rules 4479 place count 3700 transition count 7200
Iterating global reduction 0 with 1321 rules applied. Total rules applied 5800 place count 3700 transition count 7200
Discarding 196 places :
Symmetric choice reduction at 0 with 196 rule applications. Total rules 5996 place count 3504 transition count 7004
Iterating global reduction 0 with 196 rules applied. Total rules applied 6192 place count 3504 transition count 7004
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 6339 place count 3357 transition count 6857
Iterating global reduction 0 with 147 rules applied. Total rules applied 6486 place count 3357 transition count 6857
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 6632 place count 3211 transition count 6711
Iterating global reduction 0 with 146 rules applied. Total rules applied 6778 place count 3211 transition count 6711
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 6923 place count 3066 transition count 6566
Iterating global reduction 0 with 145 rules applied. Total rules applied 7068 place count 3066 transition count 6566
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 7211 place count 2923 transition count 6423
Iterating global reduction 0 with 143 rules applied. Total rules applied 7354 place count 2923 transition count 6423
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 7497 place count 2780 transition count 6280
Iterating global reduction 0 with 143 rules applied. Total rules applied 7640 place count 2780 transition count 6280
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 7733 place count 2687 transition count 6187
Iterating global reduction 0 with 93 rules applied. Total rules applied 7826 place count 2687 transition count 6187
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 7918 place count 2595 transition count 6095
Iterating global reduction 0 with 92 rules applied. Total rules applied 8010 place count 2595 transition count 6095
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 8053 place count 2552 transition count 6052
Iterating global reduction 0 with 43 rules applied. Total rules applied 8096 place count 2552 transition count 6052
Applied a total of 8096 rules in 6131 ms. Remains 2552 /6600 variables (removed 4048) and now considering 6052/10100 (removed 4048) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17816838312964825420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14700949184076669154.kers'
[2026-05-23 17:43:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17816838312964825420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14700949184076669154.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 6052 rows 2552 cols 12104 entries
Finished phase 1 with 2502 SingleSign rule and 0 generalized
[2026-05-23 17:43:36] [INFO ] Computed 50 invariants in 22 ms
Computed 50 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-14700949184076669154.kers
Total runtime 29 ms.
[2026-05-23 17:43:37] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2026-05-23 17:43:37] [INFO ] Invariant cache hit.
[2026-05-23 17:43:40] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 3896 ms to find 0 implicit places.
Running 4252 sub problems to find dead transitions.
[2026-05-23 17:43:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2502/8604 variables, and 0 constraints, problems are : Problem set: 0 solved, 4252 unsolved in 30189 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2552 constraints, PredecessorRefiner: 4252/4252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2502/8604 variables, and 0 constraints, problems are : Problem set: 0 solved, 4252 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2552 constraints, PredecessorRefiner: 0/4252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63274ms problems are : Problem set: 0 solved, 4252 unsolved
Search for dead transitions found 0 dead transitions in 63359ms
Starting structural reductions in LTL mode, iteration 1 : 2552/6600 places, 6052/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73863 ms. Remains : 2552/6600 places, 6052/10100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Applied a total of 0 rules in 182 ms. Remains 2552 /2552 variables (removed 0) and now considering 6052/6052 (removed 0) transitions.
[2026-05-23 17:44:44] [INFO ] Invariant cache hit.
[2026-05-23 17:44:44] [INFO ] Implicit Places using invariants in 523 ms returned []
[2026-05-23 17:44:44] [INFO ] Invariant cache hit.
[2026-05-23 17:44:47] [INFO ] Implicit Places using invariants and state equation in 3019 ms returned []
Implicit Place search using SMT with State Equation took 3545 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3732 ms. Remains : 2552/2552 places, 6052/6052 transitions.
Support contains 40 out of 2552 places after structural reductions.
[2026-05-23 17:44:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 17:44:48] [INFO ] Flatten gal took : 339 ms
[2026-05-23 17:44:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-050-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 17:44:48] [INFO ] Flatten gal took : 184 ms
[2026-05-23 17:44:49] [INFO ] Input system was already deterministic with 6052 transitions.
Support contains 39 out of 2552 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3175 ms. (12 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2026-05-23 17:44:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 412/421 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 981/1402 variables, 421/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/1402 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1402/8604 variables, and 429 constraints, problems are : Problem set: 0 solved, 3 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/50 constraints, State Equation: 421/2552 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 412/421 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 981/1402 variables, 421/429 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 2/431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1402 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1402 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1402/8604 variables, and 431 constraints, problems are : Problem set: 1 solved, 2 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 8/50 constraints, State Equation: 421/2552 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1807ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 13 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BART-PT-050-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 17:44:52] [INFO ] Flatten gal took : 108 ms
[2026-05-23 17:44:52] [INFO ] Flatten gal took : 114 ms
[2026-05-23 17:44:52] [INFO ] Input system was already deterministic with 6052 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2519 transition count 6019
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 2501 transition count 6001
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 2501 transition count 6001
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 2492 transition count 5992
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 2492 transition count 5992
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 2484 transition count 5984
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 2469 transition count 5969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 2462 transition count 5962
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 2456 transition count 5956
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 2453 transition count 5953
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 2453 transition count 5953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 2451 transition count 5951
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 2451 transition count 5951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 2450 transition count 5950
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 2450 transition count 5950
Applied a total of 204 rules in 2928 ms. Remains 2450 /2552 variables (removed 102) and now considering 5950/6052 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2847688494214976775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4112531263415753282.kers'
[2026-05-23 17:44:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2847688494214976775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4112531263415753282.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 5950 rows 2450 cols 11900 entries
Finished phase 1 with 2400 SingleSign rule and 0 generalized
[2026-05-23 17:44:55] [INFO ] Computed 50 invariants in 41 ms
Computed 50 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-4112531263415753282.kers
Total runtime 60 ms.
[2026-05-23 17:44:56] [INFO ] Implicit Places using invariants in 708 ms returned []
[2026-05-23 17:44:56] [INFO ] Invariant cache hit.
[2026-05-23 17:44:59] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
Running 4150 sub problems to find dead transitions.
[2026-05-23 17:44:59] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4150/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4150 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62195ms problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 62212ms
Starting structural reductions in LTL mode, iteration 1 : 2450/2552 places, 5950/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68722 ms. Remains : 2450/2552 places, 5950/6052 transitions.
[2026-05-23 17:46:01] [INFO ] Flatten gal took : 88 ms
[2026-05-23 17:46:01] [INFO ] Flatten gal took : 94 ms
[2026-05-23 17:46:01] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 17:46:02] [INFO ] Flatten gal took : 86 ms
[2026-05-23 17:46:02] [INFO ] Flatten gal took : 89 ms
[2026-05-23 17:46:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15218614639781628436.gal : 106 ms
[2026-05-23 17:46:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6493070504310374564.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15218614639781628436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6493070504310374564.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,3.23448e+84,14.6447,88384,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:46:32] [INFO ] Flatten gal took : 77 ms
[2026-05-23 17:46:32] [INFO ] Applying decomposition
[2026-05-23 17:46:32] [INFO ] Flatten gal took : 86 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/graph11867097706572568513.txt' '-o' '/tmp/graph11867097706572568513.bin' '-w' '/tmp/graph11867097706572568513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11867097706572568513.bin' '-l' '-1' '-v' '-w' '/tmp/graph11867097706572568513.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:46:33] [INFO ] Decomposing Gal with order
[2026-05-23 17:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:46:34] [INFO ] Removed a total of 1894 redundant transitions.
[2026-05-23 17:46:34] [INFO ] Flatten gal took : 448 ms
[2026-05-23 17:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1077 labels/synchronizations in 67 ms.
[2026-05-23 17:46:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality4599610179432942556.gal : 58 ms
[2026-05-23 17:46:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality14900220386605044558.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/CTLCardinality4599610179432942556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14900220386605044558.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23448e+84,2.01181,31300,194,27,1177,745,710,723,162,1177,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.08148,31300,1,0,1283,750,2006,723,545,1177,4542
FORMULA BART-PT-050-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2519 transition count 6019
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 2501 transition count 6001
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 2501 transition count 6001
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 2492 transition count 5992
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 2492 transition count 5992
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 2484 transition count 5984
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 2469 transition count 5969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 2462 transition count 5962
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 2456 transition count 5956
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 2453 transition count 5953
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 2453 transition count 5953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 2451 transition count 5951
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 2451 transition count 5951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 2450 transition count 5950
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 2450 transition count 5950
Applied a total of 204 rules in 3233 ms. Remains 2450 /2552 variables (removed 102) and now considering 5950/6052 (removed 102) transitions.
[2026-05-23 17:46:40] [INFO ] Invariant cache hit.
[2026-05-23 17:46:40] [INFO ] Implicit Places using invariants in 688 ms returned []
[2026-05-23 17:46:40] [INFO ] Invariant cache hit.
[2026-05-23 17:46:43] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 3516 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2450/2552 places, 5950/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6753 ms. Remains : 2450/2552 places, 5950/6052 transitions.
[2026-05-23 17:46:43] [INFO ] Flatten gal took : 76 ms
[2026-05-23 17:46:43] [INFO ] Flatten gal took : 128 ms
[2026-05-23 17:46:44] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 17:46:44] [INFO ] Flatten gal took : 124 ms
[2026-05-23 17:46:44] [INFO ] Flatten gal took : 75 ms
[2026-05-23 17:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10372829240631460835.gal : 22 ms
[2026-05-23 17:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality18441778581525849850.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/CTLCardinality10372829240631460835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18441778581525849850.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,3.23448e+84,14.7985,88484,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,26.2743,88484,1,0,5,38291,7,0,23048,20646,1
FORMULA BART-PT-050-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2519 transition count 6019
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 2501 transition count 6001
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 2501 transition count 6001
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 2492 transition count 5992
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 2492 transition count 5992
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 2484 transition count 5984
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 2469 transition count 5969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 2462 transition count 5962
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 2456 transition count 5956
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 2453 transition count 5953
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 2453 transition count 5953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 2451 transition count 5951
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 2451 transition count 5951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 2450 transition count 5950
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 2450 transition count 5950
Applied a total of 204 rules in 2974 ms. Remains 2450 /2552 variables (removed 102) and now considering 5950/6052 (removed 102) transitions.
[2026-05-23 17:47:13] [INFO ] Invariant cache hit.
[2026-05-23 17:47:14] [INFO ] Implicit Places using invariants in 675 ms returned []
[2026-05-23 17:47:14] [INFO ] Invariant cache hit.
[2026-05-23 17:47:17] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 3983 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2450/2552 places, 5950/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6959 ms. Remains : 2450/2552 places, 5950/6052 transitions.
[2026-05-23 17:47:17] [INFO ] Flatten gal took : 68 ms
[2026-05-23 17:47:17] [INFO ] Flatten gal took : 94 ms
[2026-05-23 17:47:18] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 17:47:18] [INFO ] Flatten gal took : 103 ms
[2026-05-23 17:47:18] [INFO ] Flatten gal took : 93 ms
[2026-05-23 17:47:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality111044329195284308.gal : 19 ms
[2026-05-23 17:47:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality156115071885386089.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/CTLCardinality111044329195284308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality156115071885386089.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23448e+84,15.7991,88472,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:47:48] [INFO ] Flatten gal took : 68 ms
[2026-05-23 17:47:48] [INFO ] Applying decomposition
[2026-05-23 17:47:48] [INFO ] Flatten gal took : 72 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/graph15008201550595653830.txt' '-o' '/tmp/graph15008201550595653830.bin' '-w' '/tmp/graph15008201550595653830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15008201550595653830.bin' '-l' '-1' '-v' '-w' '/tmp/graph15008201550595653830.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:47:48] [INFO ] Decomposing Gal with order
[2026-05-23 17:47:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:47:49] [INFO ] Removed a total of 1905 redundant transitions.
[2026-05-23 17:47:49] [INFO ] Flatten gal took : 174 ms
[2026-05-23 17:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1092 labels/synchronizations in 38 ms.
[2026-05-23 17:47:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5141543403527910858.gal : 31 ms
[2026-05-23 17:47:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1758499921366508060.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/CTLCardinality5141543403527910858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1758499921366508060.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23448e+84,1.96047,31240,159,23,884,591,583,510,123,923,0


Converting to forward existential form...Done !
original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.02071,31240,1,0,980,591,1596,510,410,923,3636
FORMULA BART-PT-050-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2527 transition count 6027
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2527 transition count 6027
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 64 place count 2513 transition count 6013
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 2513 transition count 6013
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 2505 transition count 6005
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 2505 transition count 6005
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 2498 transition count 5998
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 2498 transition count 5998
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 2491 transition count 5991
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 2491 transition count 5991
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 129 place count 2484 transition count 5984
Iterating global reduction 0 with 7 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 143 place count 2477 transition count 5977
Iterating global reduction 0 with 7 rules applied. Total rules applied 150 place count 2477 transition count 5977
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 2471 transition count 5971
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 2471 transition count 5971
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 2468 transition count 5968
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 2468 transition count 5968
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 170 place count 2466 transition count 5966
Iterating global reduction 0 with 2 rules applied. Total rules applied 172 place count 2466 transition count 5966
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 2465 transition count 5965
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 2465 transition count 5965
Applied a total of 174 rules in 3121 ms. Remains 2465 /2552 variables (removed 87) and now considering 5965/6052 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4681016101536795745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16578362192934255149.kers'
[2026-05-23 17:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4681016101536795745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16578362192934255149.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5965 rows 2465 cols 11930 entries
Finished phase 1 with 2415 SingleSign rule and 0 generalized
[2026-05-23 17:47:54] [INFO ] Computed 50 invariants in 22 ms
Computed 50 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-16578362192934255149.kers
Total runtime 29 ms.
[2026-05-23 17:47:55] [INFO ] Implicit Places using invariants in 518 ms returned []
[2026-05-23 17:47:55] [INFO ] Invariant cache hit.
[2026-05-23 17:47:57] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3220 ms to find 0 implicit places.
Running 4165 sub problems to find dead transitions.
[2026-05-23 17:47:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2415/8430 variables, and 0 constraints, problems are : Problem set: 0 solved, 4165 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2465 constraints, PredecessorRefiner: 4165/4165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4165 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2415/8430 variables, and 0 constraints, problems are : Problem set: 0 solved, 4165 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2465 constraints, PredecessorRefiner: 0/4165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62743ms problems are : Problem set: 0 solved, 4165 unsolved
Search for dead transitions found 0 dead transitions in 62756ms
Starting structural reductions in LTL mode, iteration 1 : 2465/2552 places, 5965/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69114 ms. Remains : 2465/2552 places, 5965/6052 transitions.
[2026-05-23 17:49:00] [INFO ] Flatten gal took : 64 ms
[2026-05-23 17:49:00] [INFO ] Flatten gal took : 69 ms
[2026-05-23 17:49:00] [INFO ] Input system was already deterministic with 5965 transitions.
[2026-05-23 17:49:01] [INFO ] Flatten gal took : 101 ms
[2026-05-23 17:49:01] [INFO ] Flatten gal took : 121 ms
[2026-05-23 17:49:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5831741552849239942.gal : 32 ms
[2026-05-23 17:49:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6578462189037293421.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/CTLCardinality5831741552849239942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6578462189037293421.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.35732e+84,15.8749,89052,2,5072,5,41666,6,0,15828,22543,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:49:31] [INFO ] Flatten gal took : 68 ms
[2026-05-23 17:49:31] [INFO ] Applying decomposition
[2026-05-23 17:49:31] [INFO ] Flatten gal took : 72 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/graph4686684043436367683.txt' '-o' '/tmp/graph4686684043436367683.bin' '-w' '/tmp/graph4686684043436367683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4686684043436367683.bin' '-l' '-1' '-v' '-w' '/tmp/graph4686684043436367683.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:49:31] [INFO ] Decomposing Gal with order
[2026-05-23 17:49:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:49:32] [INFO ] Removed a total of 1912 redundant transitions.
[2026-05-23 17:49:32] [INFO ] Flatten gal took : 158 ms
[2026-05-23 17:49:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1082 labels/synchronizations in 31 ms.
[2026-05-23 17:49:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11757128302389806377.gal : 30 ms
[2026-05-23 17:49:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17348588548074610815.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/CTLCardinality11757128302389806377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17348588548074610815.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35732e+84,2.20647,31392,278,27,1709,903,873,1047,167,1440,0


Converting to forward existential form...Done !
original formula: AF((((EF(((i45.u329.TrainState_18_3_25==0)&&(i49.u151.TrainState_35_2_10==1))) * AF((i19.u317.TrainState_11_2_23==0))) * AF((i7.u324.Trai...369
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U ((i45.u329.TrainState_18_3_25==0)&&(i49.u151.TrainState_35_2_10==1))) * !(EG(!((i19.u31...450
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,2.38761,31672,1,0,3131,2473,4135,2179,697,2719,10518
FORMULA BART-PT-050-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Graph (trivial) has 6040 edges and 2552 vertex of which 2540 / 2552 are part of one of the 50 SCC in 14 ms
Free SCC test removed 2490 places
Ensure Unique test removed 5979 transitions
Reduce isomorphic transitions removed 5979 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 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 0 with 46 rules applied. Total rules applied 47 place count 16 transition count 27
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 15 transition count 25
Reduce places removed 1 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 2 with 3 rules applied. Total rules applied 53 place count 14 transition count 23
Reduce places removed 1 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 3 rules applied. Total rules applied 56 place count 13 transition count 21
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 59 place count 12 transition count 19
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 62 place count 11 transition count 17
Reduce places removed 1 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 6 with 3 rules applied. Total rules applied 65 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 67 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 71 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 71 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 73 place count 8 transition count 9
Applied a total of 73 rules in 57 ms. Remains 8 /2552 variables (removed 2544) and now considering 9/6052 (removed 6043) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7489198513573992795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12155192841442551637.kers'
[2026-05-23 17:49:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7489198513573992795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12155192841442551637.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 8 rows 4 cols 8 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-23 17:49:34] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12155192841442551637.kers
Total runtime 0 ms.
[2026-05-23 17:49:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-23 17:49:34] [INFO ] Invariant cache hit.
[2026-05-23 17:49:34] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-23 17:49:34] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-23 17:49:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/2552 places, 9/6052 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 257 ms. Remains : 8/2552 places, 9/6052 transitions.
[2026-05-23 17:49:35] [INFO ] Flatten gal took : 1 ms
[2026-05-23 17:49:35] [INFO ] Flatten gal took : 0 ms
[2026-05-23 17:49:35] [INFO ] Input system was already deterministic with 9 transitions.
[2026-05-23 17:49:35] [INFO ] Flatten gal took : 1 ms
[2026-05-23 17:49:35] [INFO ] Flatten gal took : 0 ms
[2026-05-23 17:49:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality8924699723742810483.gal : 0 ms
[2026-05-23 17:49:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15699325514970945708.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/CTLCardinality8924699723742810483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15699325514970945708.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,16,0.002587,3780,2,25,5,77,5,0,42,48,0


Converting to forward existential form...Done !
original formula: AG(((TrainState_47_3_8==1) + AG((!(E((TrainState_40_1_31==1) U (TrainState_6_2_33==1))) + EF((TrainState_43_1_14==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU((FwdU(Init,TRUE) * !((TrainState_47_3_8==1))),TRUE) * !(E(TRUE U (TrainState_43_1_14==1)))),(TrainS...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004433,4184,1,0,8,181,19,0,160,66,7
FORMULA BART-PT-050-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2521 transition count 6021
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2521 transition count 6021
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 79 place count 2504 transition count 6004
Iterating global reduction 0 with 17 rules applied. Total rules applied 96 place count 2504 transition count 6004
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 2496 transition count 5996
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 2496 transition count 5996
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 2489 transition count 5989
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 2489 transition count 5989
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 2482 transition count 5982
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 2482 transition count 5982
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 146 place count 2476 transition count 5976
Iterating global reduction 0 with 6 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 158 place count 2470 transition count 5970
Iterating global reduction 0 with 6 rules applied. Total rules applied 164 place count 2470 transition count 5970
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 169 place count 2465 transition count 5965
Iterating global reduction 0 with 5 rules applied. Total rules applied 174 place count 2465 transition count 5965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 177 place count 2462 transition count 5962
Iterating global reduction 0 with 3 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 182 place count 2460 transition count 5960
Iterating global reduction 0 with 2 rules applied. Total rules applied 184 place count 2460 transition count 5960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 2459 transition count 5959
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 2459 transition count 5959
Applied a total of 186 rules in 3449 ms. Remains 2459 /2552 variables (removed 93) and now considering 5959/6052 (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-3266872306303830561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-111264322034753812.kers'
[2026-05-23 17:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3266872306303830561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-111264322034753812.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5959 rows 2459 cols 11918 entries
Finished phase 1 with 2409 SingleSign rule and 0 generalized
[2026-05-23 17:49:38] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-111264322034753812.kers
Total runtime 35 ms.
[2026-05-23 17:49:39] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-23 17:49:39] [INFO ] Invariant cache hit.
[2026-05-23 17:49:41] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3265 ms to find 0 implicit places.
Running 4159 sub problems to find dead transitions.
[2026-05-23 17:49:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2409/8418 variables, and 0 constraints, problems are : Problem set: 0 solved, 4159 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2459 constraints, PredecessorRefiner: 4159/4159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4159 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2409/8418 variables, and 0 constraints, problems are : Problem set: 0 solved, 4159 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2459 constraints, PredecessorRefiner: 0/4159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62759ms problems are : Problem set: 0 solved, 4159 unsolved
Search for dead transitions found 0 dead transitions in 62766ms
Starting structural reductions in LTL mode, iteration 1 : 2459/2552 places, 5959/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69491 ms. Remains : 2459/2552 places, 5959/6052 transitions.
[2026-05-23 17:50:44] [INFO ] Flatten gal took : 98 ms
[2026-05-23 17:50:44] [INFO ] Flatten gal took : 104 ms
[2026-05-23 17:50:45] [INFO ] Input system was already deterministic with 5959 transitions.
[2026-05-23 17:50:45] [INFO ] Flatten gal took : 99 ms
[2026-05-23 17:50:45] [INFO ] Flatten gal took : 79 ms
[2026-05-23 17:50:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8540388705074393077.gal : 17 ms
[2026-05-23 17:50:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10662036872261368584.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/CTLCardinality8540388705074393077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10662036872261368584.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,3.83934e+84,15.2533,88872,2,4869,5,38679,6,0,15798,20858,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:51:15] [INFO ] Flatten gal took : 58 ms
[2026-05-23 17:51:15] [INFO ] Applying decomposition
[2026-05-23 17:51:15] [INFO ] Flatten gal took : 63 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/graph11967401473806914392.txt' '-o' '/tmp/graph11967401473806914392.bin' '-w' '/tmp/graph11967401473806914392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11967401473806914392.bin' '-l' '-1' '-v' '-w' '/tmp/graph11967401473806914392.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:51:15] [INFO ] Decomposing Gal with order
[2026-05-23 17:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:51:16] [INFO ] Removed a total of 1912 redundant transitions.
[2026-05-23 17:51:16] [INFO ] Flatten gal took : 139 ms
[2026-05-23 17:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1076 labels/synchronizations in 19 ms.
[2026-05-23 17:51:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality4705768599084645427.gal : 31 ms
[2026-05-23 17:51:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16361723797302863982.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/CTLCardinality4705768599084645427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16361723797302863982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83934e+84,2.15111,31364,184,25,1083,835,709,617,136,1234,0


Converting to forward existential form...Done !
original formula: AF(AG(E(EX(TRUE) U A((i13.u169.TrainState_43_4_12==0) U (i43.u458.TrainState_36_2_34==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(EX(TRUE) U !((E(!((i43.u458.TrainState_36_2_34==1)) U (!((i13.u169.TrainState_43_4_1...260
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,2.33907,31636,1,0,1830,1494,3299,1261,566,1651,7255
FORMULA BART-PT-050-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2529 transition count 6029
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2529 transition count 6029
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 2519 transition count 6019
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 2514 transition count 6014
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 2514 transition count 6014
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 2510 transition count 6010
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 2510 transition count 6010
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 2506 transition count 6006
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 2506 transition count 6006
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 2503 transition count 6003
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 2503 transition count 6003
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 2500 transition count 6000
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 2500 transition count 6000
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 2497 transition count 5997
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 2497 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 2496 transition count 5996
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 2496 transition count 5996
Applied a total of 112 rules in 2633 ms. Remains 2496 /2552 variables (removed 56) and now considering 5996/6052 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-399976131560252721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13165185712329133312.kers'
[2026-05-23 17:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-399976131560252721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13165185712329133312.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5996 rows 2496 cols 11992 entries
Finished phase 1 with 2446 SingleSign rule and 0 generalized
[2026-05-23 17:51:21] [INFO ] Computed 50 invariants in 22 ms
Computed 50 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-13165185712329133312.kers
Total runtime 28 ms.
[2026-05-23 17:51:22] [INFO ] Implicit Places using invariants in 596 ms returned []
[2026-05-23 17:51:22] [INFO ] Invariant cache hit.
[2026-05-23 17:51:24] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
Running 4196 sub problems to find dead transitions.
[2026-05-23 17:51:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/8492 variables, and 0 constraints, problems are : Problem set: 0 solved, 4196 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2496 constraints, PredecessorRefiner: 4196/4196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4196 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2446/8492 variables, and 0 constraints, problems are : Problem set: 0 solved, 4196 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2496 constraints, PredecessorRefiner: 0/4196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62542ms problems are : Problem set: 0 solved, 4196 unsolved
Search for dead transitions found 0 dead transitions in 62548ms
Starting structural reductions in LTL mode, iteration 1 : 2496/2552 places, 5996/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68745 ms. Remains : 2496/2552 places, 5996/6052 transitions.
[2026-05-23 17:52:27] [INFO ] Flatten gal took : 97 ms
[2026-05-23 17:52:27] [INFO ] Flatten gal took : 101 ms
[2026-05-23 17:52:27] [INFO ] Input system was already deterministic with 5996 transitions.
[2026-05-23 17:52:28] [INFO ] Flatten gal took : 99 ms
[2026-05-23 17:52:28] [INFO ] Flatten gal took : 103 ms
[2026-05-23 17:52:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality18134102174615925896.gal : 26 ms
[2026-05-23 17:52:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12270058750258625107.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/CTLCardinality18134102174615925896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12270058750258625107.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,7.74694e+84,16.4379,90484,2,5703,5,50644,6,0,15983,26527,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:52:58] [INFO ] Flatten gal took : 59 ms
[2026-05-23 17:52:58] [INFO ] Applying decomposition
[2026-05-23 17:52:58] [INFO ] Flatten gal took : 66 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/graph2719710030421436813.txt' '-o' '/tmp/graph2719710030421436813.bin' '-w' '/tmp/graph2719710030421436813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2719710030421436813.bin' '-l' '-1' '-v' '-w' '/tmp/graph2719710030421436813.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:52:58] [INFO ] Decomposing Gal with order
[2026-05-23 17:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:52:59] [INFO ] Removed a total of 1946 redundant transitions.
[2026-05-23 17:52:59] [INFO ] Flatten gal took : 151 ms
[2026-05-23 17:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1031 labels/synchronizations in 18 ms.
[2026-05-23 17:52:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3914083964536166562.gal : 28 ms
[2026-05-23 17:52:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2146588162826187018.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/CTLCardinality3914083964536166562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2146588162826187018.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.74694e+84,2.16668,31776,379,49,2695,1710,1209,1823,252,2466,0


Converting to forward existential form...Done !
original formula: E(AX(FALSE) U (!(((!(A((i49.i0.u239.TrainState_26_4_17==1) U ((i14.u238.TrainState_50_4_14==0)||(i38.u447.TrainState_49_3_33==1)))) + EX(...444
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(EX(!(FALSE)))) * !(((!(!((E(!(((i14.u238.TrainState_50_4_14==0)||(i38.u447.TrainState_49_3_33...822
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,0,2.39572,32120,1,0,5147,7043,5866,4373,1091,6366,15877
FORMULA BART-PT-050-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2519 transition count 6019
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 2501 transition count 6001
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 2501 transition count 6001
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 2492 transition count 5992
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 2492 transition count 5992
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 2484 transition count 5984
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 2469 transition count 5969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 2462 transition count 5962
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 2456 transition count 5956
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 2453 transition count 5953
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 2453 transition count 5953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 2451 transition count 5951
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 2451 transition count 5951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 2450 transition count 5950
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 2450 transition count 5950
Applied a total of 204 rules in 2922 ms. Remains 2450 /2552 variables (removed 102) and now considering 5950/6052 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15428537057466454797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13359909529231096957.kers'
[2026-05-23 17:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15428537057466454797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13359909529231096957.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5950 rows 2450 cols 11900 entries
Finished phase 1 with 2400 SingleSign rule and 0 generalized
[2026-05-23 17:53:04] [INFO ] Computed 50 invariants in 22 ms
Computed 50 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-13359909529231096957.kers
Total runtime 29 ms.
[2026-05-23 17:53:05] [INFO ] Implicit Places using invariants in 499 ms returned []
[2026-05-23 17:53:05] [INFO ] Invariant cache hit.
[2026-05-23 17:53:07] [INFO ] Implicit Places using invariants and state equation in 2681 ms returned []
Implicit Place search using SMT with State Equation took 3185 ms to find 0 implicit places.
Running 4150 sub problems to find dead transitions.
[2026-05-23 17:53:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4150/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4150 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62579ms problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 62585ms
Starting structural reductions in LTL mode, iteration 1 : 2450/2552 places, 5950/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68701 ms. Remains : 2450/2552 places, 5950/6052 transitions.
[2026-05-23 17:54:10] [INFO ] Flatten gal took : 99 ms
[2026-05-23 17:54:10] [INFO ] Flatten gal took : 102 ms
[2026-05-23 17:54:10] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 17:54:11] [INFO ] Flatten gal took : 100 ms
[2026-05-23 17:54:11] [INFO ] Flatten gal took : 105 ms
[2026-05-23 17:54:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15394086714093714256.gal : 30 ms
[2026-05-23 17:54:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4030818945871847325.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/CTLCardinality15394086714093714256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4030818945871847325.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,3.23448e+84,15.3055,88440,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:54:41] [INFO ] Flatten gal took : 62 ms
[2026-05-23 17:54:41] [INFO ] Applying decomposition
[2026-05-23 17:54:41] [INFO ] Flatten gal took : 65 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/graph3944514209004444302.txt' '-o' '/tmp/graph3944514209004444302.bin' '-w' '/tmp/graph3944514209004444302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3944514209004444302.bin' '-l' '-1' '-v' '-w' '/tmp/graph3944514209004444302.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:54:41] [INFO ] Decomposing Gal with order
[2026-05-23 17:54:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:54:42] [INFO ] Removed a total of 1881 redundant transitions.
[2026-05-23 17:54:42] [INFO ] Flatten gal took : 191 ms
[2026-05-23 17:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1097 labels/synchronizations in 19 ms.
[2026-05-23 17:54:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11693803085951270844.gal : 28 ms
[2026-05-23 17:54:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality3732203706425705229.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/CTLCardinality11693803085951270844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3732203706425705229.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23448e+84,1.99821,31244,172,27,1008,711,636,596,145,1075,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,2.16903,31244,1,0,1961,1126,3103,1407,637,2163,8468
FORMULA BART-PT-050-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2519 transition count 6019
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2519 transition count 6019
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 2501 transition count 6001
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 2501 transition count 6001
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 2492 transition count 5992
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 2492 transition count 5992
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 2484 transition count 5984
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 2484 transition count 5984
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 2476 transition count 5976
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 2476 transition count 5976
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 2469 transition count 5969
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 2469 transition count 5969
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 2462 transition count 5962
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 2462 transition count 5962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 2456 transition count 5956
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 2453 transition count 5953
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 2453 transition count 5953
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 2451 transition count 5951
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 2451 transition count 5951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 2450 transition count 5950
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 2450 transition count 5950
Applied a total of 204 rules in 3129 ms. Remains 2450 /2552 variables (removed 102) and now considering 5950/6052 (removed 102) transitions.
[2026-05-23 17:54:47] [INFO ] Invariant cache hit.
[2026-05-23 17:54:48] [INFO ] Implicit Places using invariants in 619 ms returned []
[2026-05-23 17:54:48] [INFO ] Invariant cache hit.
[2026-05-23 17:54:51] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2450/2552 places, 5950/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6772 ms. Remains : 2450/2552 places, 5950/6052 transitions.
[2026-05-23 17:54:51] [INFO ] Flatten gal took : 71 ms
[2026-05-23 17:54:51] [INFO ] Flatten gal took : 66 ms
[2026-05-23 17:54:51] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 17:54:51] [INFO ] Flatten gal took : 65 ms
[2026-05-23 17:54:51] [INFO ] Flatten gal took : 66 ms
[2026-05-23 17:54:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality7462189008537824404.gal : 27 ms
[2026-05-23 17:54:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8313429060867291868.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/CTLCardinality7462189008537824404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8313429060867291868.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,3.23448e+84,15.7708,88472,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,27.7714,88472,1,0,6,38291,7,1,20048,20646,1
FORMULA BART-PT-050-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2552/2552 places, 6052/6052 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2523 transition count 6023
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2523 transition count 6023
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 75 place count 2506 transition count 6006
Iterating global reduction 0 with 17 rules applied. Total rules applied 92 place count 2506 transition count 6006
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 2497 transition count 5997
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 2497 transition count 5997
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 2489 transition count 5989
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 2489 transition count 5989
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 134 place count 2481 transition count 5981
Iterating global reduction 0 with 8 rules applied. Total rules applied 142 place count 2481 transition count 5981
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 149 place count 2474 transition count 5974
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 2474 transition count 5974
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 163 place count 2467 transition count 5967
Iterating global reduction 0 with 7 rules applied. Total rules applied 170 place count 2467 transition count 5967
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 2461 transition count 5961
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 2461 transition count 5961
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 185 place count 2458 transition count 5958
Iterating global reduction 0 with 3 rules applied. Total rules applied 188 place count 2458 transition count 5958
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 190 place count 2456 transition count 5956
Iterating global reduction 0 with 2 rules applied. Total rules applied 192 place count 2456 transition count 5956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 2455 transition count 5955
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 2455 transition count 5955
Applied a total of 194 rules in 2994 ms. Remains 2455 /2552 variables (removed 97) and now considering 5955/6052 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3837081579213055425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4206626850223122806.kers'
[2026-05-23 17:55:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3837081579213055425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4206626850223122806.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5955 rows 2455 cols 11910 entries
Finished phase 1 with 2405 SingleSign rule and 0 generalized
[2026-05-23 17:55:22] [INFO ] Computed 50 invariants in 27 ms
Computed 50 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-4206626850223122806.kers
Total runtime 33 ms.
[2026-05-23 17:55:23] [INFO ] Implicit Places using invariants in 593 ms returned []
[2026-05-23 17:55:23] [INFO ] Invariant cache hit.
[2026-05-23 17:55:26] [INFO ] Implicit Places using invariants and state equation in 2987 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
Running 4155 sub problems to find dead transitions.
[2026-05-23 17:55:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2405/8410 variables, and 0 constraints, problems are : Problem set: 0 solved, 4155 unsolved in 30141 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2455 constraints, PredecessorRefiner: 4155/4155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2405/8410 variables, and 0 constraints, problems are : Problem set: 0 solved, 4155 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2455 constraints, PredecessorRefiner: 0/4155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62437ms problems are : Problem set: 0 solved, 4155 unsolved
Search for dead transitions found 0 dead transitions in 62443ms
Starting structural reductions in LTL mode, iteration 1 : 2455/2552 places, 5955/6052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69033 ms. Remains : 2455/2552 places, 5955/6052 transitions.
[2026-05-23 17:56:28] [INFO ] Flatten gal took : 100 ms
[2026-05-23 17:56:28] [INFO ] Flatten gal took : 120 ms
[2026-05-23 17:56:29] [INFO ] Input system was already deterministic with 5955 transitions.
[2026-05-23 17:56:29] [INFO ] Flatten gal took : 98 ms
[2026-05-23 17:56:29] [INFO ] Flatten gal took : 98 ms
[2026-05-23 17:56:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8210086198790535450.gal : 27 ms
[2026-05-23 17:56:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9032980520476356765.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/CTLCardinality8210086198790535450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9032980520476356765.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,3.57684e+84,15.9455,88696,2,4861,5,38576,6,0,15778,20770,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:56:59] [INFO ] Flatten gal took : 60 ms
[2026-05-23 17:56:59] [INFO ] Applying decomposition
[2026-05-23 17:56:59] [INFO ] Flatten gal took : 64 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/graph4736903665024759641.txt' '-o' '/tmp/graph4736903665024759641.bin' '-w' '/tmp/graph4736903665024759641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4736903665024759641.bin' '-l' '-1' '-v' '-w' '/tmp/graph4736903665024759641.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:56:59] [INFO ] Decomposing Gal with order
[2026-05-23 17:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:57:00] [INFO ] Removed a total of 1911 redundant transitions.
[2026-05-23 17:57:00] [INFO ] Flatten gal took : 151 ms
[2026-05-23 17:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1057 labels/synchronizations in 19 ms.
[2026-05-23 17:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4751896062861853926.gal : 26 ms
[2026-05-23 17:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11693780765442289868.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/CTLCardinality4751896062861853926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11693780765442289868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.57684e+84,2.13659,31364,212,29,1304,1008,703,766,169,1634,0


Converting to forward existential form...Done !
original formula: (AX(AG((((EF((i43.u484.TrainState_31_3_35==0)) * EX(TRUE)) + (i35.u424.TrainState_39_2_32==0)) + (i17.u112.TrainState_22_2_9==1)))) + AF(...231
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(E(TRUE U !((((E(TRUE U (i43.u484.TrainState_31_3_35==0)) * EX(TRUE)) + (i35.u424.TrainS...309
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,2.31414,31640,1,0,2088,2135,3304,1306,721,2311,7641
FORMULA BART-PT-050-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-23 17:57:02] [INFO ] Flatten gal took : 63 ms
[2026-05-23 17:57:02] [INFO ] Flatten gal took : 68 ms
Total runtime 815059 ms.

BK_STOP 1779559022910

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="BART-PT-050"
export BK_EXAMINATION="CTLCardinality"
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 BART-PT-050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946788100273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-050.tgz
mv BART-PT-050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;