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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 76M
-rw-r--r-- 1 mcc users 2.2M Mar 5 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Mar 5 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Mar 5 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.2M Mar 5 09:39 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.6M Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4M Mar 5 09:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.1M Mar 5 09:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2M Mar 5 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20M Mar 5 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 242K Mar 15 07:24 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 9.5M 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-040-CTLCardinality-2024-00
FORMULA_NAME BART-PT-040-CTLCardinality-2024-01
FORMULA_NAME BART-PT-040-CTLCardinality-2024-02
FORMULA_NAME BART-PT-040-CTLCardinality-2024-03
FORMULA_NAME BART-PT-040-CTLCardinality-2024-04
FORMULA_NAME BART-PT-040-CTLCardinality-2024-05
FORMULA_NAME BART-PT-040-CTLCardinality-2024-06
FORMULA_NAME BART-PT-040-CTLCardinality-2024-07
FORMULA_NAME BART-PT-040-CTLCardinality-2024-08
FORMULA_NAME BART-PT-040-CTLCardinality-2024-09
FORMULA_NAME BART-PT-040-CTLCardinality-2024-10
FORMULA_NAME BART-PT-040-CTLCardinality-2024-11
FORMULA_NAME BART-PT-040-CTLCardinality-2024-12
FORMULA_NAME BART-PT-040-CTLCardinality-2024-13
FORMULA_NAME BART-PT-040-CTLCardinality-2024-14
FORMULA_NAME BART-PT-040-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779554666305

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-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 16:44:28] [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 16:44:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:44:29] [INFO ] Load time of PNML (sax parser for PT used): 1012 ms
[2026-05-23 16:44:29] [INFO ] Transformed 5490 places.
[2026-05-23 16:44:29] [INFO ] Transformed 8080 transitions.
[2026-05-23 16:44:29] [INFO ] Found NUPN structural information;
[2026-05-23 16:44:29] [INFO ] Parsed PT model containing 5490 places and 8080 transitions and 64800 arcs in 1219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 288 ms.
Initial state reduction rules removed 1 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1252 places :
Symmetric choice reduction at 0 with 1252 rule applications. Total rules 1252 place count 4028 transition count 6828
Iterating global reduction 0 with 1252 rules applied. Total rules applied 2504 place count 4028 transition count 6828
Discarding 1043 places :
Symmetric choice reduction at 0 with 1043 rule applications. Total rules 3547 place count 2985 transition count 5785
Iterating global reduction 0 with 1043 rules applied. Total rules applied 4590 place count 2985 transition count 5785
Discarding 151 places :
Symmetric choice reduction at 0 with 151 rule applications. Total rules 4741 place count 2834 transition count 5634
Iterating global reduction 0 with 151 rules applied. Total rules applied 4892 place count 2834 transition count 5634
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 5007 place count 2719 transition count 5519
Iterating global reduction 0 with 115 rules applied. Total rules applied 5122 place count 2719 transition count 5519
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 5235 place count 2606 transition count 5406
Iterating global reduction 0 with 113 rules applied. Total rules applied 5348 place count 2606 transition count 5406
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 5460 place count 2494 transition count 5294
Iterating global reduction 0 with 112 rules applied. Total rules applied 5572 place count 2494 transition count 5294
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 5682 place count 2384 transition count 5184
Iterating global reduction 0 with 110 rules applied. Total rules applied 5792 place count 2384 transition count 5184
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 5897 place count 2279 transition count 5079
Iterating global reduction 0 with 105 rules applied. Total rules applied 6002 place count 2279 transition count 5079
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 6074 place count 2207 transition count 5007
Iterating global reduction 0 with 72 rules applied. Total rules applied 6146 place count 2207 transition count 5007
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 6217 place count 2136 transition count 4936
Iterating global reduction 0 with 71 rules applied. Total rules applied 6288 place count 2136 transition count 4936
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 6322 place count 2102 transition count 4902
Iterating global reduction 0 with 34 rules applied. Total rules applied 6356 place count 2102 transition count 4902
Applied a total of 6356 rules in 3833 ms. Remains 2102 /5280 variables (removed 3178) and now considering 4902/8080 (removed 3178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17660972115445854150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-566597301336975442.kers'
[2026-05-23 16:44:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17660972115445854150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-566597301336975442.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4902 rows 2102 cols 9804 entries
Finished phase 1 with 2062 SingleSign rule and 0 generalized
[2026-05-23 16:44:34] [INFO ] Computed 40 invariants in 18 ms
Computed 40 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-566597301336975442.kers
Total runtime 24 ms.
[2026-05-23 16:44:35] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2026-05-23 16:44:35] [INFO ] Invariant cache hit.
[2026-05-23 16:44:38] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 4213 ms to find 0 implicit places.
Running 3462 sub problems to find dead transitions.
[2026-05-23 16:44:38] [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 2062/7004 variables, and 0 constraints, problems are : Problem set: 0 solved, 3462 unsolved in 30200 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/2102 constraints, PredecessorRefiner: 3462/3462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2062/7004 variables, and 0 constraints, problems are : Problem set: 0 solved, 3462 unsolved in 30141 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/2102 constraints, PredecessorRefiner: 0/3462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62853ms problems are : Problem set: 0 solved, 3462 unsolved
Search for dead transitions found 0 dead transitions in 62942ms
Starting structural reductions in LTL mode, iteration 1 : 2102/5280 places, 4902/8080 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71077 ms. Remains : 2102/5280 places, 4902/8080 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Applied a total of 0 rules in 134 ms. Remains 2102 /2102 variables (removed 0) and now considering 4902/4902 (removed 0) transitions.
[2026-05-23 16:45:41] [INFO ] Invariant cache hit.
[2026-05-23 16:45:41] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-23 16:45:41] [INFO ] Invariant cache hit.
[2026-05-23 16:45:44] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2736 ms. Remains : 2102/2102 places, 4902/4902 transitions.
Support contains 55 out of 2102 places after structural reductions.
[2026-05-23 16:45:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 16:45:44] [INFO ] Flatten gal took : 328 ms
[2026-05-23 16:45:44] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BART-PT-040-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 16:45:44] [INFO ] Flatten gal took : 177 ms
[2026-05-23 16:45:45] [INFO ] Input system was already deterministic with 4902 transitions.
Support contains 48 out of 2102 places (down from 55) after GAL structural reductions.
FORMULA BART-PT-040-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3059 ms. (13 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2026-05-23 16:45:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 262/267 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 617/884 variables, 267/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/884 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/884 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/7004 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 5/40 constraints, State Equation: 267/2102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 262/267 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 617/884 variables, 267/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/884 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/884 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/7004 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 5/40 constraints, State Equation: 267/2102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
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 14 ms.
[2026-05-23 16:45:47] [INFO ] Flatten gal took : 99 ms
[2026-05-23 16:45:47] [INFO ] Flatten gal took : 98 ms
[2026-05-23 16:45:48] [INFO ] Input system was already deterministic with 4902 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 2058 transition count 4858
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 2058 transition count 4858
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 116 place count 2030 transition count 4830
Iterating global reduction 0 with 28 rules applied. Total rules applied 144 place count 2030 transition count 4830
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 2017 transition count 4817
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 2017 transition count 4817
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 181 place count 2006 transition count 4806
Iterating global reduction 0 with 11 rules applied. Total rules applied 192 place count 2006 transition count 4806
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 203 place count 1995 transition count 4795
Iterating global reduction 0 with 11 rules applied. Total rules applied 214 place count 1995 transition count 4795
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 225 place count 1984 transition count 4784
Iterating global reduction 0 with 11 rules applied. Total rules applied 236 place count 1984 transition count 4784
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 245 place count 1975 transition count 4775
Iterating global reduction 0 with 9 rules applied. Total rules applied 254 place count 1975 transition count 4775
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 261 place count 1968 transition count 4768
Iterating global reduction 0 with 7 rules applied. Total rules applied 268 place count 1968 transition count 4768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 274 place count 1962 transition count 4762
Iterating global reduction 0 with 6 rules applied. Total rules applied 280 place count 1962 transition count 4762
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 1960 transition count 4760
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 1960 transition count 4760
Applied a total of 284 rules in 1521 ms. Remains 1960 /2102 variables (removed 142) and now considering 4760/4902 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15591009298924538515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177597255976036824.kers'
[2026-05-23 16:45:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15591009298924538515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177597255976036824.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4760 rows 1960 cols 9520 entries
Finished phase 1 with 1920 SingleSign rule and 0 generalized
[2026-05-23 16:45:49] [INFO ] Computed 40 invariants in 30 ms
Computed 40 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-6177597255976036824.kers
Total runtime 34 ms.
[2026-05-23 16:45:50] [INFO ] Implicit Places using invariants in 542 ms returned []
[2026-05-23 16:45:50] [INFO ] Invariant cache hit.
[2026-05-23 16:45:52] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 16:45:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/6720 variables, and 0 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/6720 variables, and 0 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61746ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61764ms
Starting structural reductions in LTL mode, iteration 1 : 1960/2102 places, 4760/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66084 ms. Remains : 1960/2102 places, 4760/4902 transitions.
[2026-05-23 16:46:54] [INFO ] Flatten gal took : 78 ms
[2026-05-23 16:46:54] [INFO ] Flatten gal took : 77 ms
[2026-05-23 16:46:54] [INFO ] Input system was already deterministic with 4760 transitions.
[2026-05-23 16:46:54] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:46:54] [INFO ] Flatten gal took : 82 ms
[2026-05-23 16:46:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15376440990522438019.gal : 87 ms
[2026-05-23 16:46:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11789448784582046836.ctl : 4 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/CTLCardinality15376440990522438019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11789448784582046836.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,4.05362e+67,9.15781,59336,2,3881,5,30648,6,0,12603,16490,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,16.4881,59364,1,0,6,30648,7,1,16040,16490,1
FORMULA BART-PT-040-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 2058 transition count 4858
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 2058 transition count 4858
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 116 place count 2030 transition count 4830
Iterating global reduction 0 with 28 rules applied. Total rules applied 144 place count 2030 transition count 4830
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 2017 transition count 4817
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 2017 transition count 4817
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 181 place count 2006 transition count 4806
Iterating global reduction 0 with 11 rules applied. Total rules applied 192 place count 2006 transition count 4806
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 203 place count 1995 transition count 4795
Iterating global reduction 0 with 11 rules applied. Total rules applied 214 place count 1995 transition count 4795
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 225 place count 1984 transition count 4784
Iterating global reduction 0 with 11 rules applied. Total rules applied 236 place count 1984 transition count 4784
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 245 place count 1975 transition count 4775
Iterating global reduction 0 with 9 rules applied. Total rules applied 254 place count 1975 transition count 4775
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 261 place count 1968 transition count 4768
Iterating global reduction 0 with 7 rules applied. Total rules applied 268 place count 1968 transition count 4768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 274 place count 1962 transition count 4762
Iterating global reduction 0 with 6 rules applied. Total rules applied 280 place count 1962 transition count 4762
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 1960 transition count 4760
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 1960 transition count 4760
Applied a total of 284 rules in 1474 ms. Remains 1960 /2102 variables (removed 142) and now considering 4760/4902 (removed 142) transitions.
[2026-05-23 16:47:13] [INFO ] Invariant cache hit.
[2026-05-23 16:47:13] [INFO ] Implicit Places using invariants in 545 ms returned []
[2026-05-23 16:47:13] [INFO ] Invariant cache hit.
[2026-05-23 16:47:15] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1960/2102 places, 4760/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4361 ms. Remains : 1960/2102 places, 4760/4902 transitions.
[2026-05-23 16:47:16] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:47:16] [INFO ] Flatten gal took : 66 ms
[2026-05-23 16:47:16] [INFO ] Input system was already deterministic with 4760 transitions.
[2026-05-23 16:47:16] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:47:16] [INFO ] Flatten gal took : 66 ms
[2026-05-23 16:47:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5121052077542248054.gal : 50 ms
[2026-05-23 16:47:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4940902922107856893.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/CTLCardinality5121052077542248054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4940902922107856893.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.05362e+67,9.09703,59428,2,3881,5,30648,6,0,12603,16490,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,16.2508,59428,1,0,6,30648,7,1,16040,16490,1
FORMULA BART-PT-040-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 : 2102/2102 places, 4902/4902 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2072 transition count 4872
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2072 transition count 4872
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 83 place count 2049 transition count 4849
Iterating global reduction 0 with 23 rules applied. Total rules applied 106 place count 2049 transition count 4849
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 2039 transition count 4839
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 2039 transition count 4839
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 135 place count 2030 transition count 4830
Iterating global reduction 0 with 9 rules applied. Total rules applied 144 place count 2030 transition count 4830
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 2021 transition count 4821
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 2021 transition count 4821
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 171 place count 2012 transition count 4812
Iterating global reduction 0 with 9 rules applied. Total rules applied 180 place count 2012 transition count 4812
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 187 place count 2005 transition count 4805
Iterating global reduction 0 with 7 rules applied. Total rules applied 194 place count 2005 transition count 4805
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 200 place count 1999 transition count 4799
Iterating global reduction 0 with 6 rules applied. Total rules applied 206 place count 1999 transition count 4799
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 211 place count 1994 transition count 4794
Iterating global reduction 0 with 5 rules applied. Total rules applied 216 place count 1994 transition count 4794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 1993 transition count 4793
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 1993 transition count 4793
Applied a total of 218 rules in 1443 ms. Remains 1993 /2102 variables (removed 109) and now considering 4793/4902 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-133115291601864841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13987278488334289816.kers'
[2026-05-23 16:47:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-133115291601864841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13987278488334289816.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4793 rows 1993 cols 9586 entries
Finished phase 1 with 1953 SingleSign rule and 0 generalized
[2026-05-23 16:47:34] [INFO ] Computed 40 invariants in 31 ms
Computed 40 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-13987278488334289816.kers
Total runtime 37 ms.
[2026-05-23 16:47:34] [INFO ] Implicit Places using invariants in 557 ms returned []
[2026-05-23 16:47:34] [INFO ] Invariant cache hit.
[2026-05-23 16:47:37] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
Running 3353 sub problems to find dead transitions.
[2026-05-23 16:47:37] [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 1953/6786 variables, and 0 constraints, problems are : Problem set: 0 solved, 3353 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1993 constraints, PredecessorRefiner: 3353/3353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1953/6786 variables, and 0 constraints, problems are : Problem set: 0 solved, 3353 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1993 constraints, PredecessorRefiner: 0/3353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61744ms problems are : Problem set: 0 solved, 3353 unsolved
Search for dead transitions found 0 dead transitions in 61754ms
Starting structural reductions in LTL mode, iteration 1 : 1993/2102 places, 4793/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66183 ms. Remains : 1993/2102 places, 4793/4902 transitions.
[2026-05-23 16:48:39] [INFO ] Flatten gal took : 101 ms
[2026-05-23 16:48:39] [INFO ] Flatten gal took : 101 ms
[2026-05-23 16:48:39] [INFO ] Input system was already deterministic with 4793 transitions.
[2026-05-23 16:48:39] [INFO ] Flatten gal took : 72 ms
[2026-05-23 16:48:39] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:48:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality1767027193412365882.gal : 19 ms
[2026-05-23 16:48:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9866003736119539029.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1767027193412365882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9866003736119539029.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,7.61309e+67,10.1563,60792,2,4148,5,34875,6,0,12768,19090,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 16:49:09] [INFO ] Flatten gal took : 52 ms
[2026-05-23 16:49:09] [INFO ] Applying decomposition
[2026-05-23 16:49:09] [INFO ] Flatten gal took : 52 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/graph5181773149830314773.txt' '-o' '/tmp/graph5181773149830314773.bin' '-w' '/tmp/graph5181773149830314773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5181773149830314773.bin' '-l' '-1' '-v' '-w' '/tmp/graph5181773149830314773.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:49:10] [INFO ] Decomposing Gal with order
[2026-05-23 16:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:49:10] [INFO ] Removed a total of 1557 redundant transitions.
[2026-05-23 16:49:11] [INFO ] Flatten gal took : 339 ms
[2026-05-23 16:49:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 838 labels/synchronizations in 50 ms.
[2026-05-23 16:49:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality11863607788198094005.gal : 42 ms
[2026-05-23 16:49:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4110439212922607632.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/CTLCardinality11863607788198094005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4110439212922607632.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,7.61309e+67,1.38377,26128,288,35,2087,1298,948,1463,200,2077,0


Converting to forward existential form...Done !
original formula: E(EX((EX((((i21.u116.TrainState_36_2_10==1)&&(i14.u218.TrainState_33_2_19==1)) + EF(((i12.u192.TrainState_7_1_21==0)||(i34.u214.TrainStat...782
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,EX((EX((((i21.u116.TrainState_36_2_10==1)&&(i14.u218.TrainState_33_2_19==1)) + E(TRUE U (...872
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
(forward)formula 0,1,1.66222,26476,1,0,6314,4620,6403,6060,1063,5892,22135
FORMULA BART-PT-040-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 2059 transition count 4859
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 2059 transition count 4859
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 114 place count 2031 transition count 4831
Iterating global reduction 0 with 28 rules applied. Total rules applied 142 place count 2031 transition count 4831
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 2018 transition count 4818
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 2018 transition count 4818
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 179 place count 2007 transition count 4807
Iterating global reduction 0 with 11 rules applied. Total rules applied 190 place count 2007 transition count 4807
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 201 place count 1996 transition count 4796
Iterating global reduction 0 with 11 rules applied. Total rules applied 212 place count 1996 transition count 4796
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 223 place count 1985 transition count 4785
Iterating global reduction 0 with 11 rules applied. Total rules applied 234 place count 1985 transition count 4785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 243 place count 1976 transition count 4776
Iterating global reduction 0 with 9 rules applied. Total rules applied 252 place count 1976 transition count 4776
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 259 place count 1969 transition count 4769
Iterating global reduction 0 with 7 rules applied. Total rules applied 266 place count 1969 transition count 4769
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 272 place count 1963 transition count 4763
Iterating global reduction 0 with 6 rules applied. Total rules applied 278 place count 1963 transition count 4763
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 280 place count 1961 transition count 4761
Iterating global reduction 0 with 2 rules applied. Total rules applied 282 place count 1961 transition count 4761
Applied a total of 282 rules in 1461 ms. Remains 1961 /2102 variables (removed 141) and now considering 4761/4902 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17024996590828451421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3675939476115780464.kers'
[2026-05-23 16:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17024996590828451421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3675939476115780464.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4761 rows 1961 cols 9522 entries
Finished phase 1 with 1921 SingleSign rule and 0 generalized
[2026-05-23 16:49:14] [INFO ] Computed 40 invariants in 29 ms
Computed 40 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-3675939476115780464.kers
Total runtime 34 ms.
[2026-05-23 16:49:14] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-23 16:49:14] [INFO ] Invariant cache hit.
[2026-05-23 16:49:17] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
Running 3321 sub problems to find dead transitions.
[2026-05-23 16:49:17] [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 1921/6722 variables, and 0 constraints, problems are : Problem set: 0 solved, 3321 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1961 constraints, PredecessorRefiner: 3321/3321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3321 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 1921/6722 variables, and 0 constraints, problems are : Problem set: 0 solved, 3321 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1961 constraints, PredecessorRefiner: 0/3321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61820ms problems are : Problem set: 0 solved, 3321 unsolved
Search for dead transitions found 0 dead transitions in 61829ms
Starting structural reductions in LTL mode, iteration 1 : 1961/2102 places, 4761/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66251 ms. Remains : 1961/2102 places, 4761/4902 transitions.
[2026-05-23 16:50:19] [INFO ] Flatten gal took : 97 ms
[2026-05-23 16:50:19] [INFO ] Flatten gal took : 113 ms
[2026-05-23 16:50:19] [INFO ] Input system was already deterministic with 4761 transitions.
[2026-05-23 16:50:19] [INFO ] Flatten gal took : 109 ms
[2026-05-23 16:50:19] [INFO ] Flatten gal took : 115 ms
[2026-05-23 16:50:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10378872155145900518.gal : 28 ms
[2026-05-23 16:50:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17570846305280864028.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/CTLCardinality10378872155145900518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17570846305280864028.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,4.13635e+67,9.45628,59456,2,3888,5,30740,6,0,12608,16576,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.13635e+67,1.27598,25836,160,25,942,801,614,558,141,1288,0


Converting to forward existential form...Done !
original formula: AX(EG(EX(((i22.u155.TrainState_19_1_16==0)||(i10.u221.TrainState_9_2_19==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(((i22.u155.TrainState_19_1_16==0)||(i10.u221.TrainState_9_2_19==1))))))] = 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
(forward)formula 0,1,1.36986,26100,1,0,1341,801,1982,800,499,1288,4148
FORMULA BART-PT-040-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 2060 transition count 4860
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 2060 transition count 4860
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 110 place count 2034 transition count 4834
Iterating global reduction 0 with 26 rules applied. Total rules applied 136 place count 2034 transition count 4834
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 148 place count 2022 transition count 4822
Iterating global reduction 0 with 12 rules applied. Total rules applied 160 place count 2022 transition count 4822
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 171 place count 2011 transition count 4811
Iterating global reduction 0 with 11 rules applied. Total rules applied 182 place count 2011 transition count 4811
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 193 place count 2000 transition count 4800
Iterating global reduction 0 with 11 rules applied. Total rules applied 204 place count 2000 transition count 4800
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 215 place count 1989 transition count 4789
Iterating global reduction 0 with 11 rules applied. Total rules applied 226 place count 1989 transition count 4789
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 235 place count 1980 transition count 4780
Iterating global reduction 0 with 9 rules applied. Total rules applied 244 place count 1980 transition count 4780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 251 place count 1973 transition count 4773
Iterating global reduction 0 with 7 rules applied. Total rules applied 258 place count 1973 transition count 4773
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 264 place count 1967 transition count 4767
Iterating global reduction 0 with 6 rules applied. Total rules applied 270 place count 1967 transition count 4767
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 272 place count 1965 transition count 4765
Iterating global reduction 0 with 2 rules applied. Total rules applied 274 place count 1965 transition count 4765
Applied a total of 274 rules in 1841 ms. Remains 1965 /2102 variables (removed 137) and now considering 4765/4902 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14225624477132749478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1957168861977608821.kers'
[2026-05-23 16:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14225624477132749478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1957168861977608821.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4765 rows 1965 cols 9530 entries
Finished phase 1 with 1925 SingleSign rule and 0 generalized
[2026-05-23 16:50:54] [INFO ] Computed 40 invariants in 18 ms
Computed 40 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-1957168861977608821.kers
Total runtime 24 ms.
[2026-05-23 16:50:54] [INFO ] Implicit Places using invariants in 431 ms returned []
[2026-05-23 16:50:54] [INFO ] Invariant cache hit.
[2026-05-23 16:50:56] [INFO ] Implicit Places using invariants and state equation in 2426 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
Running 3325 sub problems to find dead transitions.
[2026-05-23 16:50:56] [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 1925/6730 variables, and 0 constraints, problems are : Problem set: 0 solved, 3325 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 3325/3325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3325 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1925/6730 variables, and 0 constraints, problems are : Problem set: 0 solved, 3325 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/3325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61879ms problems are : Problem set: 0 solved, 3325 unsolved
Search for dead transitions found 0 dead transitions in 61890ms
Starting structural reductions in LTL mode, iteration 1 : 1965/2102 places, 4765/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66606 ms. Remains : 1965/2102 places, 4765/4902 transitions.
[2026-05-23 16:51:58] [INFO ] Flatten gal took : 83 ms
[2026-05-23 16:51:59] [INFO ] Flatten gal took : 87 ms
[2026-05-23 16:51:59] [INFO ] Input system was already deterministic with 4765 transitions.
[2026-05-23 16:51:59] [INFO ] Flatten gal took : 95 ms
[2026-05-23 16:51:59] [INFO ] Flatten gal took : 85 ms
[2026-05-23 16:51:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6442487772942579248.gal : 26 ms
[2026-05-23 16:51:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3117695759927799175.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/CTLCardinality6442487772942579248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3117695759927799175.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.47739e+67,10.6353,59600,2,3891,5,30817,6,0,12628,16663,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 16:52:29] [INFO ] Flatten gal took : 53 ms
[2026-05-23 16:52:29] [INFO ] Applying decomposition
[2026-05-23 16:52:29] [INFO ] Flatten gal took : 60 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/graph13723786451527344020.txt' '-o' '/tmp/graph13723786451527344020.bin' '-w' '/tmp/graph13723786451527344020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13723786451527344020.bin' '-l' '-1' '-v' '-w' '/tmp/graph13723786451527344020.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:52:29] [INFO ] Decomposing Gal with order
[2026-05-23 16:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:52:30] [INFO ] Removed a total of 1516 redundant transitions.
[2026-05-23 16:52:30] [INFO ] Flatten gal took : 135 ms
[2026-05-23 16:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 881 labels/synchronizations in 21 ms.
[2026-05-23 16:52:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2906107326520659172.gal : 35 ms
[2026-05-23 16:52:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15418343388931376874.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/CTLCardinality2906107326520659172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15418343388931376874.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.47739e+67,1.38491,25764,184,25,1087,801,639,657,148,1275,0


Converting to forward existential form...Done !
original formula: EX(AF(!(E(EX((i25.u292.TrainState_18_3_26==1)) U AG((i24.u344.TrainState_5_4_31==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(EX((i25.u292.TrainState_18_3_26==1)) U !(E(TRUE U !((i24.u344.TrainState_5_4_31==1))))))...169
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
(forward)formula 0,1,1.53145,26040,1,0,2118,1962,3155,1463,667,2214,7127
FORMULA BART-PT-040-CTLCardinality-2024-10 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 : 2102/2102 places, 4902/4902 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 2064 transition count 4864
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 2064 transition count 4864
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 99 place count 2041 transition count 4841
Iterating global reduction 0 with 23 rules applied. Total rules applied 122 place count 2041 transition count 4841
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 133 place count 2030 transition count 4830
Iterating global reduction 0 with 11 rules applied. Total rules applied 144 place count 2030 transition count 4830
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 2021 transition count 4821
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 2021 transition count 4821
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 171 place count 2012 transition count 4812
Iterating global reduction 0 with 9 rules applied. Total rules applied 180 place count 2012 transition count 4812
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 189 place count 2003 transition count 4803
Iterating global reduction 0 with 9 rules applied. Total rules applied 198 place count 2003 transition count 4803
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 206 place count 1995 transition count 4795
Iterating global reduction 0 with 8 rules applied. Total rules applied 214 place count 1995 transition count 4795
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 220 place count 1989 transition count 4789
Iterating global reduction 0 with 6 rules applied. Total rules applied 226 place count 1989 transition count 4789
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 231 place count 1984 transition count 4784
Iterating global reduction 0 with 5 rules applied. Total rules applied 236 place count 1984 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 1983 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 1983 transition count 4783
Applied a total of 238 rules in 2085 ms. Remains 1983 /2102 variables (removed 119) and now considering 4783/4902 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7661746325608988126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6181460138230531927.kers'
[2026-05-23 16:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7661746325608988126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6181460138230531927.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4783 rows 1983 cols 9566 entries
Finished phase 1 with 1943 SingleSign rule and 0 generalized
[2026-05-23 16:52:33] [INFO ] Computed 40 invariants in 20 ms
Computed 40 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-6181460138230531927.kers
Total runtime 29 ms.
[2026-05-23 16:52:34] [INFO ] Implicit Places using invariants in 417 ms returned []
[2026-05-23 16:52:34] [INFO ] Invariant cache hit.
[2026-05-23 16:52:36] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
Running 3343 sub problems to find dead transitions.
[2026-05-23 16:52:36] [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 1943/6766 variables, and 0 constraints, problems are : Problem set: 0 solved, 3343 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1983 constraints, PredecessorRefiner: 3343/3343 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3343 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/6766 variables, and 0 constraints, problems are : Problem set: 0 solved, 3343 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1983 constraints, PredecessorRefiner: 0/3343 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61650ms problems are : Problem set: 0 solved, 3343 unsolved
Search for dead transitions found 0 dead transitions in 61656ms
Starting structural reductions in LTL mode, iteration 1 : 1983/2102 places, 4783/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66496 ms. Remains : 1983/2102 places, 4783/4902 transitions.
[2026-05-23 16:53:38] [INFO ] Flatten gal took : 51 ms
[2026-05-23 16:53:38] [INFO ] Flatten gal took : 55 ms
[2026-05-23 16:53:38] [INFO ] Input system was already deterministic with 4783 transitions.
[2026-05-23 16:53:38] [INFO ] Flatten gal took : 50 ms
[2026-05-23 16:53:38] [INFO ] Flatten gal took : 55 ms
[2026-05-23 16:53:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9982923468041689298.gal : 16 ms
[2026-05-23 16:53:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6621361214585303245.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/CTLCardinality9982923468041689298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6621361214585303245.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,6.30321e+67,10.1951,60532,2,4118,5,34112,6,0,12718,18348,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 16:54:08] [INFO ] Flatten gal took : 49 ms
[2026-05-23 16:54:08] [INFO ] Applying decomposition
[2026-05-23 16:54:08] [INFO ] Flatten gal took : 52 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/graph8609379306202342427.txt' '-o' '/tmp/graph8609379306202342427.bin' '-w' '/tmp/graph8609379306202342427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8609379306202342427.bin' '-l' '-1' '-v' '-w' '/tmp/graph8609379306202342427.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:54:09] [INFO ] Decomposing Gal with order
[2026-05-23 16:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:54:09] [INFO ] Removed a total of 1538 redundant transitions.
[2026-05-23 16:54:09] [INFO ] Flatten gal took : 143 ms
[2026-05-23 16:54:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 30 ms.
[2026-05-23 16:54:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality18033311369333049892.gal : 31 ms
[2026-05-23 16:54:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality17744420079732372785.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/CTLCardinality18033311369333049892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17744420079732372785.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,6.30321e+67,1.33593,25960,227,25,1452,783,813,879,125,1184,0


Converting to forward existential form...Done !
original formula: AF(((AG(EX((i15.u103.TrainState_34_3_7==0))) * !(E((i11.u377.TrainState_22_3_33!=1) U (((i33.u252.TrainState_10_3_21==0)||(i9.u387.TrainS...250
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(EX((i15.u103.TrainState_34_3_7==0))))) * !(E((i11.u377.TrainState_22_3_33!=1) U (((i...307
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
(forward)formula 0,0,2.15505,34772,1,0,65984,1583,4214,76897,531,2433,43546
FORMULA BART-PT-040-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 SI_CTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Graph (trivial) has 4890 edges and 2102 vertex of which 2078 / 2102 are part of one of the 40 SCC in 12 ms
Free SCC test removed 2038 places
Ensure Unique test removed 4821 transitions
Reduce isomorphic transitions removed 4821 transitions.
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 30 transition count 46
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 28 transition count 42
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 26 transition count 38
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 54 place count 24 transition count 34
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 60 place count 22 transition count 30
Reduce places removed 2 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 4 rules applied. Total rules applied 64 place count 20 transition count 28
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 67 place count 19 transition count 26
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 69 place count 18 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 75 place count 18 transition count 19
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 75 place count 18 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 87 place count 12 transition count 13
Applied a total of 87 rules in 87 ms. Remains 12 /2102 variables (removed 2090) and now considering 13/4902 (removed 4889) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3593902884561595821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-174438547798282161.kers'
[2026-05-23 16:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3593902884561595821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-174438547798282161.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 12 rows 6 cols 12 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 16:54:11] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-174438547798282161.kers
Total runtime 0 ms.
[2026-05-23 16:54:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 16:54:11] [INFO ] Invariant cache hit.
[2026-05-23 16:54:11] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-23 16:54:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 16:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 24 constraints, problems are : Problem set: 0 solved, 6 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 312ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/2102 places, 13/4902 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 479 ms. Remains : 12/2102 places, 13/4902 transitions.
[2026-05-23 16:54:12] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:54:12] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:54:12] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-23 16:54:12] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:54:12] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:54:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2150758989778105559.gal : 1 ms
[2026-05-23 16:54:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13593198676586127023.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/CTLCardinality2150758989778105559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13593198676586127023.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,64,0.004799,3800,2,25,5,91,5,0,62,56,0


Converting to forward existential form...Done !
original formula: AG((((TrainState_8_3_18==0)&&(TrainState_28_3_16==0)) * (AG(((TrainState_2_4_15==0)&&(TrainState_15_3_14==1))) + !(A((TrainState_31_3_10=...189
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((TrainState_8_3_18==0)&&(TrainState_28_3_16==0))))] = FALSE * [(FwdU((FwdU(Init,TRUE) * ...361
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/3
(forward)formula 0,0,0.011069,4360,1,0,11,321,26,4,265,168,12
FORMULA BART-PT-040-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2102/2102 places, 4902/4902 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2062 transition count 4862
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2062 transition count 4862
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 2037 transition count 4837
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 2037 transition count 4837
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 142 place count 2025 transition count 4825
Iterating global reduction 0 with 12 rules applied. Total rules applied 154 place count 2025 transition count 4825
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 164 place count 2015 transition count 4815
Iterating global reduction 0 with 10 rules applied. Total rules applied 174 place count 2015 transition count 4815
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 184 place count 2005 transition count 4805
Iterating global reduction 0 with 10 rules applied. Total rules applied 194 place count 2005 transition count 4805
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 204 place count 1995 transition count 4795
Iterating global reduction 0 with 10 rules applied. Total rules applied 214 place count 1995 transition count 4795
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 222 place count 1987 transition count 4787
Iterating global reduction 0 with 8 rules applied. Total rules applied 230 place count 1987 transition count 4787
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 236 place count 1981 transition count 4781
Iterating global reduction 0 with 6 rules applied. Total rules applied 242 place count 1981 transition count 4781
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 248 place count 1975 transition count 4775
Iterating global reduction 0 with 6 rules applied. Total rules applied 254 place count 1975 transition count 4775
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 256 place count 1973 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 258 place count 1973 transition count 4773
Applied a total of 258 rules in 1938 ms. Remains 1973 /2102 variables (removed 129) and now considering 4773/4902 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11156418529184680341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4740506935884619748.kers'
[2026-05-23 16:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11156418529184680341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4740506935884619748.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4773 rows 1973 cols 9546 entries
Finished phase 1 with 1933 SingleSign rule and 0 generalized
[2026-05-23 16:54:14] [INFO ] Computed 40 invariants in 21 ms
Computed 40 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-4740506935884619748.kers
Total runtime 26 ms.
[2026-05-23 16:54:14] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-23 16:54:14] [INFO ] Invariant cache hit.
[2026-05-23 16:54:17] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
Running 3333 sub problems to find dead transitions.
[2026-05-23 16:54:17] [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 1933/6746 variables, and 0 constraints, problems are : Problem set: 0 solved, 3333 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1973 constraints, PredecessorRefiner: 3333/3333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1933/6746 variables, and 0 constraints, problems are : Problem set: 0 solved, 3333 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1973 constraints, PredecessorRefiner: 0/3333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61866ms problems are : Problem set: 0 solved, 3333 unsolved
Search for dead transitions found 0 dead transitions in 61872ms
Starting structural reductions in LTL mode, iteration 1 : 1973/2102 places, 4773/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66657 ms. Remains : 1973/2102 places, 4773/4902 transitions.
[2026-05-23 16:55:19] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:55:19] [INFO ] Flatten gal took : 82 ms
[2026-05-23 16:55:19] [INFO ] Input system was already deterministic with 4773 transitions.
[2026-05-23 16:55:19] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:55:19] [INFO ] Flatten gal took : 54 ms
[2026-05-23 16:55:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4516708627173513983.gal : 21 ms
[2026-05-23 16:55:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12134967206283466168.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/CTLCardinality4516708627173513983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12134967206283466168.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,5.21248e+67,10.439,59888,2,3907,5,31087,6,0,12668,16846,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 16:55:49] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:55:49] [INFO ] Applying decomposition
[2026-05-23 16:55:49] [INFO ] Flatten gal took : 84 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/graph14412424286312869192.txt' '-o' '/tmp/graph14412424286312869192.bin' '-w' '/tmp/graph14412424286312869192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14412424286312869192.bin' '-l' '-1' '-v' '-w' '/tmp/graph14412424286312869192.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:55:49] [INFO ] Decomposing Gal with order
[2026-05-23 16:55:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:55:50] [INFO ] Removed a total of 1539 redundant transitions.
[2026-05-23 16:55:50] [INFO ] Flatten gal took : 209 ms
[2026-05-23 16:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 867 labels/synchronizations in 17 ms.
[2026-05-23 16:55:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15760346568598185401.gal : 30 ms
[2026-05-23 16:55:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9974886369646814114.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/CTLCardinality15760346568598185401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9974886369646814114.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,5.21248e+67,1.46361,25892,177,23,1092,620,686,686,131,939,0


Converting to forward existential form...Done !
original formula: (AX(AG((AX(((i24.u319.TrainState_4_1_30!=0)&&(i30.u323.TrainState_9_1_31!=1))) * AF((i38.u138.TrainState_1_4_12!=1))))) + AG(AX(((((i34.u...291
=> equivalent forward existential formula: [((EY(FwdU((Init * !(!(EX(!(!(E(TRUE U !((!(EX(!(((i24.u319.TrainState_4_1_30!=0)&&(i30.u323.TrainState_9_1_31!=...387
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.55924,26164,1,0,1648,1605,2923,974,533,1678,6088
FORMULA BART-PT-040-CTLCardinality-2024-13 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 : 2102/2102 places, 4902/4902 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2062 transition count 4862
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2062 transition count 4862
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 2037 transition count 4837
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 2037 transition count 4837
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 141 place count 2026 transition count 4826
Iterating global reduction 0 with 11 rules applied. Total rules applied 152 place count 2026 transition count 4826
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 161 place count 2017 transition count 4817
Iterating global reduction 0 with 9 rules applied. Total rules applied 170 place count 2017 transition count 4817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 179 place count 2008 transition count 4808
Iterating global reduction 0 with 9 rules applied. Total rules applied 188 place count 2008 transition count 4808
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 197 place count 1999 transition count 4799
Iterating global reduction 0 with 9 rules applied. Total rules applied 206 place count 1999 transition count 4799
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 213 place count 1992 transition count 4792
Iterating global reduction 0 with 7 rules applied. Total rules applied 220 place count 1992 transition count 4792
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 225 place count 1987 transition count 4787
Iterating global reduction 0 with 5 rules applied. Total rules applied 230 place count 1987 transition count 4787
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 234 place count 1983 transition count 4783
Iterating global reduction 0 with 4 rules applied. Total rules applied 238 place count 1983 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 239 place count 1982 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 240 place count 1982 transition count 4782
Applied a total of 240 rules in 1712 ms. Remains 1982 /2102 variables (removed 120) and now considering 4782/4902 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15436198111612878626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6168042856522635350.kers'
[2026-05-23 16:55:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15436198111612878626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6168042856522635350.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 4782 rows 1982 cols 9564 entries
Finished phase 1 with 1942 SingleSign rule and 0 generalized
[2026-05-23 16:55:53] [INFO ] Computed 40 invariants in 30 ms
Computed 40 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-6168042856522635350.kers
Total runtime 36 ms.
[2026-05-23 16:55:54] [INFO ] Implicit Places using invariants in 426 ms returned []
[2026-05-23 16:55:54] [INFO ] Invariant cache hit.
[2026-05-23 16:55:57] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 3415 ms to find 0 implicit places.
Running 3342 sub problems to find dead transitions.
[2026-05-23 16:55:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1942/6764 variables, and 0 constraints, problems are : Problem set: 0 solved, 3342 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 3342/3342 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1942/6764 variables, and 0 constraints, problems are : Problem set: 0 solved, 3342 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 0/3342 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61791ms problems are : Problem set: 0 solved, 3342 unsolved
Search for dead transitions found 0 dead transitions in 61799ms
Starting structural reductions in LTL mode, iteration 1 : 1982/2102 places, 4782/4902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66939 ms. Remains : 1982/2102 places, 4782/4902 transitions.
[2026-05-23 16:56:59] [INFO ] Flatten gal took : 76 ms
[2026-05-23 16:56:59] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:56:59] [INFO ] Input system was already deterministic with 4782 transitions.
[2026-05-23 16:56:59] [INFO ] Flatten gal took : 77 ms
[2026-05-23 16:56:59] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:56:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5296944772193900826.gal : 24 ms
[2026-05-23 16:56:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality18053851294580381950.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/CTLCardinality5296944772193900826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18053851294580381950.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,6.13591e+67,10.1289,60104,2,3925,5,31353,6,0,12713,17069,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.13591e+67,1.26984,26012,273,33,1843,1081,990,1187,184,1699,0


Converting to forward existential form...Done !
original formula: EG(((i30.u6.TrainState_26_1_1==0) + A(!((((i0.u79.TrainState_14_3_7==0)||(i38.u155.TrainState_36_2_20==1)) * EG((i16.u136.TrainState_1_3_...212
=> equivalent forward existential formula: [FwdG(Init,((i30.u6.TrainState_26_1_1==0) + !((E(!(!(EG(!(!(EX((i2.u346.TrainState_20_3_30==1))))))) U (!(!((((i...386
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 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
(forward)formula 0,1,2.06844,34840,1,0,68022,1553,3749,73801,692,3568,51783
FORMULA BART-PT-040-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-23 16:57:32] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:57:32] [INFO ] Flatten gal took : 80 ms
Total runtime 784388 ms.

BK_STOP 1779555452952

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-040"
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-040, 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-177946788100265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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