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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 221K Mar 5 09:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 805K Mar 5 09:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Mar 5 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Mar 5 09:21 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 118K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 322K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 172K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 376K Mar 5 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Mar 5 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 493K Mar 5 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:23 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 534K 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-002-CTLCardinality-2024-00
FORMULA_NAME BART-PT-002-CTLCardinality-2024-01
FORMULA_NAME BART-PT-002-CTLCardinality-2024-02
FORMULA_NAME BART-PT-002-CTLCardinality-2024-03
FORMULA_NAME BART-PT-002-CTLCardinality-2024-04
FORMULA_NAME BART-PT-002-CTLCardinality-2024-05
FORMULA_NAME BART-PT-002-CTLCardinality-2024-06
FORMULA_NAME BART-PT-002-CTLCardinality-2024-07
FORMULA_NAME BART-PT-002-CTLCardinality-2024-08
FORMULA_NAME BART-PT-002-CTLCardinality-2024-09
FORMULA_NAME BART-PT-002-CTLCardinality-2024-10
FORMULA_NAME BART-PT-002-CTLCardinality-2024-11
FORMULA_NAME BART-PT-002-CTLCardinality-2024-12
FORMULA_NAME BART-PT-002-CTLCardinality-2024-13
FORMULA_NAME BART-PT-002-CTLCardinality-2024-14
FORMULA_NAME BART-PT-002-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779548032611

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-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 14:53:54] [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 14:53:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:53:54] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2026-05-23 14:53:54] [INFO ] Transformed 474 places.
[2026-05-23 14:53:54] [INFO ] Transformed 404 transitions.
[2026-05-23 14:53:54] [INFO ] Found NUPN structural information;
[2026-05-23 14:53:54] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 60 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 206 transition count 346
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 160 place count 162 transition count 302
Iterating global reduction 0 with 44 rules applied. Total rules applied 204 place count 162 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 211 place count 155 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 218 place count 155 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 224 place count 149 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 236 place count 143 transition count 283
Iterating global reduction 0 with 6 rules applied. Total rules applied 242 place count 143 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 247 place count 138 transition count 278
Iterating global reduction 0 with 5 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 257 place count 133 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 267 place count 128 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 276 place count 124 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 280 place count 124 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 284 place count 120 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 290 place count 118 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 292 place count 118 transition count 258
Applied a total of 292 rules in 107 ms. Remains 118 /264 variables (removed 146) and now considering 258/404 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15203438353797337246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16956921826587768902.kers'
[2026-05-23 14:53:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15203438353797337246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16956921826587768902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 118 cols 516 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 14:53:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16956921826587768902.kers
Total runtime 3 ms.
[2026-05-23 14:53:55] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-23 14:53:55] [INFO ] Invariant cache hit.
[2026-05-23 14:53:55] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-23 14:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 120 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9746 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 258/376 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 186/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 306 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18088ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 18106ms
Starting structural reductions in LTL mode, iteration 1 : 118/264 places, 258/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18843 ms. Remains : 118/264 places, 258/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2026-05-23 14:54:13] [INFO ] Invariant cache hit.
[2026-05-23 14:54:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 14:54:13] [INFO ] Invariant cache hit.
[2026-05-23 14:54:13] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 118/118 places, 258/258 transitions.
Support contains 15 out of 118 places after structural reductions.
[2026-05-23 14:54:14] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 14:54:14] [INFO ] Flatten gal took : 58 ms
[2026-05-23 14:54:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BART-PT-002-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 14:54:14] [INFO ] Flatten gal took : 25 ms
[2026-05-23 14:54:14] [INFO ] Input system was already deterministic with 258 transitions.
RANDOM walk for 40000 steps (8 resets) in 990 ms. (40 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2026-05-23 14:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 60/376 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2026-05-23 14:54:14] [INFO ] Flatten gal took : 15 ms
[2026-05-23 14:54:14] [INFO ] Flatten gal took : 15 ms
[2026-05-23 14:54:14] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 108 transition count 248
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 108 transition count 248
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 102 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 102 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 100 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 99 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 98 transition count 238
Applied a total of 40 rules in 11 ms. Remains 98 /118 variables (removed 20) and now considering 238/258 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-285279251312527652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11129822853120394938.kers'
[2026-05-23 14:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-285279251312527652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11129822853120394938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 98 cols 476 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-23 14:54:14] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11129822853120394938.kers
Total runtime 1 ms.
[2026-05-23 14:54:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 14:54:14] [INFO ] Invariant cache hit.
[2026-05-23 14:54:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 14:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13431ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13433ms
Starting structural reductions in LTL mode, iteration 1 : 98/118 places, 238/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13603 ms. Remains : 98/118 places, 238/258 transitions.
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 13 ms
[2026-05-23 14:54:28] [INFO ] Input system was already deterministic with 238 transitions.
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 12 ms
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 12 ms
[2026-05-23 14:54:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13281755048898977692.gal : 7 ms
[2026-05-23 14:54:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3308423064912797197.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13281755048898977692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3308423064912797197.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,2401,0.063586,4900,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.072438,4928,1,0,6,4104,7,1,804,1950,1
FORMULA BART-PT-002-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 252 edges and 118 vertex of which 114 / 118 are part of one of the 2 SCC in 4 ms
Free SCC test removed 112 places
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 4 transition count 6
Applied a total of 5 rules in 27 ms. Remains 4 /118 variables (removed 114) and now considering 6/258 (removed 252) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16352410849475102213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3767761810549854256.kers'
[2026-05-23 14:54:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16352410849475102213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3767761810549854256.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 10 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-23 14:54:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3767761810549854256.kers
Total runtime 0 ms.
[2026-05-23 14:54:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 14:54:28] [INFO ] Invariant cache hit.
[2026-05-23 14:54:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2026-05-23 14:54:28] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 14:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/118 places, 6/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 204 ms. Remains : 4/118 places, 6/258 transitions.
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:28] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:28] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality18140275960620254695.gal : 1 ms
[2026-05-23 14:54:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17853681609007330482.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/CTLCardinality18140275960620254695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17853681609007330482.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,0.002694,3740,2,8,5,29,5,0,23,18,0


Converting to forward existential form...Done !
original formula: EG(((TrainState_1_1_20==1) + AG((TrainState_1_3_11==0))))
=> equivalent forward existential formula: [FwdG(Init,((TrainState_1_1_20==1) + !(E(TRUE U !((TrainState_1_3_11==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004232,4032,1,0,7,71,20,1,93,44,8
FORMULA BART-PT-002-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 255 edges and 118 vertex of which 117 / 118 are part of one of the 2 SCC in 1 ms
Free SCC test removed 115 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 3 ms. Remains 2 /118 variables (removed 116) and now considering 3/258 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12023792663064722410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-624808573100819386.kers'
[2026-05-23 14:54:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12023792663064722410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-624808573100819386.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 14:54:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-624808573100819386.kers
Total runtime 0 ms.
[2026-05-23 14:54:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 14:54:28] [INFO ] Invariant cache hit.
[2026-05-23 14:54:28] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-23 14:54:28] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 14:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/118 places, 3/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 2/118 places, 3/258 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2874954430360751897.gal : 1 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17524016670496069614.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/CTLCardinality2874954430360751897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17524016670496069614.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF((TrainState_2_1_5==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (TrainState_2_1_5==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.00294,4000,1,0,5,19,12,0,42,10,5
FORMULA BART-PT-002-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 254 edges and 118 vertex of which 117 / 118 are part of one of the 2 SCC in 0 ms
Free SCC test removed 115 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 2 ms. Remains 2 /118 variables (removed 116) and now considering 3/258 (removed 255) transitions.
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-23 14:54:29] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/118 places, 3/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 2/118 places, 3/258 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12885054810394314875.gal : 1 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2179588497460757296.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/CTLCardinality12885054810394314875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2179588497460757296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF((TrainState_2_1_9==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (TrainState_2_1_9==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002836,4004,1,0,5,19,12,0,42,10,5
FORMULA BART-PT-002-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 252 edges and 118 vertex of which 116 / 118 are part of one of the 2 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Applied a total of 1 rules in 2 ms. Remains 4 /118 variables (removed 114) and now considering 6/258 (removed 252) transitions.
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8460593370203228426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16395469274264022536.kers'
[2026-05-23 14:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8460593370203228426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16395469274264022536.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 14:54:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16395469274264022536.kers
Total runtime 0 ms.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-23 14:54:29] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/118 places, 6/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 134 ms. Remains : 4/118 places, 6/258 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 2 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17969369646776807977.gal : 0 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13936630368346548902.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/CTLCardinality17969369646776807977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13936630368346548902.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,0.002643,3748,2,7,5,25,6,0,23,14,0


Converting to forward existential form...Done !
original formula: EG(AG(AF(((TrainState_1_1_20==0)||(TrainState_2_2_36==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(((TrainState_1_1_20==0)||(TrainState_2_2_36==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004253,4036,1,0,6,52,27,0,94,27,8
FORMULA BART-PT-002-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 248 edges and 118 vertex of which 110 / 118 are part of one of the 2 SCC in 0 ms
Free SCC test removed 108 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8 transition count 12
Applied a total of 6 rules in 4 ms. Remains 8 /118 variables (removed 110) and now considering 12/258 (removed 246) transitions.
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14054725918573178867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6322356870774814537.kers'
[2026-05-23 14:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14054725918573178867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6322356870774814537.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 14:54:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6322356870774814537.kers
Total runtime 0 ms.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-23 14:54:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2026-05-23 14:54:29] [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) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 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) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/118 places, 12/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 235 ms. Remains : 8/118 places, 12/258 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 14:54:29] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6144984837369681471.gal : 0 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15463792710364170052.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/CTLCardinality6144984837369681471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15463792710364170052.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,15,0.00272,3788,2,15,5,64,6,0,45,41,0


Converting to forward existential form...Done !
original formula: A(!(AF(((TrainState_1_1_17==1)&&((TrainState_2_3_27==0)||(TrainState_1_3_32==1))))) U EG((TrainState_1_2_35==0)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((TrainState_1_2_35==0)))))) * !(E(!(EG((TrainState_1_2_35==0))) U (!(!(!(EG(!(((TrainState_1...266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.006388,4328,1,0,9,220,31,6,193,144,9
FORMULA BART-PT-002-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 258/258 transitions.
Graph (trivial) has 250 edges and 118 vertex of which 109 / 118 are part of one of the 2 SCC in 0 ms
Free SCC test removed 107 places
Ensure Unique test removed 241 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 8 transition count 12
Applied a total of 9 rules in 3 ms. Remains 8 /118 variables (removed 110) and now considering 12/258 (removed 246) transitions.
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-119156322014236645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-344121269447730253.kers'
[2026-05-23 14:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-119156322014236645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-344121269447730253.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 14:54:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-344121269447730253.kers
Total runtime 0 ms.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-23 14:54:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2026-05-23 14:54:29] [INFO ] Invariant cache hit.
[2026-05-23 14:54:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-23 14:54:29] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 8/118 places, 12/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 8/118 places, 12/258 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14159852451159786050.gal : 0 ms
[2026-05-23 14:54:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8045638916169861114.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/CTLCardinality14159852451159786050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8045638916169861114.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,15,0.00339,3784,2,20,5,79,6,0,45,53,0


Converting to forward existential form...Done !
original formula: AF((((TrainState_2_4_23!=0)&&(TrainState_1_3_33!=1))&&((TrainState_1_2_14==1)||(TrainState_1_2_15==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((TrainState_2_4_23!=0)&&(TrainState_1_3_33!=1))&&((TrainState_1_2_14==1)||(TrainState_1_2_15==1))...167
Hit Full ! (commute/partial/dont) 4/0/8
(forward)formula 0,0,0.005618,4068,1,0,6,250,20,1,203,164,8
FORMULA BART-PT-002-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 14:54:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:54:29] [INFO ] Flatten gal took : 10 ms
Total runtime 35368 ms.

BK_STOP 1779548069719

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

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