fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r044-tall-174854028900689
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CSRepetitions-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 7056.00 0.00 0.00 FFTFTFTFFTFFTFTF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028900689.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CSRepetitions-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028900689
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K May 29 14:32 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 CSRepetitions-COL-02-CTLCardinality-2025-00
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-01
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-02
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-03
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-04
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-05
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-06
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-07
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-08
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-09
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-10
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-11
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-12
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-13
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-14
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748641786282

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-05-30 21:49:47] [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]
[2025-05-30 21:49:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:49:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-30 21:49:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 21:49:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2025-05-30 21:49:48] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2025-05-30 21:49:48] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 5 ms.
[2025-05-30 21:49:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 40004 steps (1897 resets) in 1310 ms. (30 steps per ms) remains 55/77 properties
BEST_FIRST walk for 4001 steps (92 resets) in 74 ms. (53 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (76 resets) in 50 ms. (78 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (117 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (77 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (73 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (156 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (77 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (140 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (81 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (67 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (65 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (119 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (76 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (78 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (112 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (73 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (111 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (78 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (76 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (66 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (78 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (82 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (156 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (156 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (119 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (158 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (157 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (113 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (76 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (76 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (140 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (98 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (90 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (81 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (72 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
// Phase 1: matrix 5 rows 6 cols
[2025-05-30 21:49:49] [INFO ] Computed 2 invariants in 2 ms
[2025-05-30 21:49:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 38 solved, 17 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp76 is UNSAT
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 55 solved, 0 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 55 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 21:49:49] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2025-05-30 21:49:49] [INFO ] Flatten gal took : 12 ms
[2025-05-30 21:49:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 21:49:49] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 2
[2025-05-30 21:49:49] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 9 ms.
[2025-05-30 21:49:49] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2025-05-30 21:49:49] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 21:49:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:49] [INFO ] Invariant cache hit.
[2025-05-30 21:49:49] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 509ms
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 18 out of 18 places after structural reductions.
[2025-05-30 21:49:50] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:50] [INFO ] Flatten gal took : 5 ms
[2025-05-30 21:49:50] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (2330 resets) in 653 ms. (61 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40002 steps (510 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (660 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (511 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (497 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (511 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (474 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (496 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (487 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (349 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
[2025-05-30 21:49:50] [INFO ] Invariant cache hit.
[2025-05-30 21:49:50] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 9 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 4 simplifications.
[2025-05-30 21:49:50] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:50] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:50] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 4 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-05-30 21:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 21:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:49:50] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:50] [INFO ] Invariant cache hit.
[2025-05-30 21:49:50] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 405ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 475 ms. Remains : 18/18 places, 20/20 transitions.
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:51] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11281174096101424033.gal : 1 ms
[2025-05-30 21:49:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10016558608638762929.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11281174096101424033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10016558608638762929.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
[2025-05-30 21:49:51] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 359ms
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 18/18 places, 20/20 transitions.
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 4 ms
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 5 ms
[2025-05-30 21:49:51] [INFO ] Input system was already deterministic with 20 transitions.
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:51] [INFO ] Flatten gal took : 1 ms
[2025-05-30 21:49:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15051081152024486790.gal : 0 ms
[2025-05-30 21:49:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14533662710178951763.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15051081152024486790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14533662710178951763.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4430,0.019032,4168,2,257,5,1930,6,0,91,2575,0


Converting to forward existential form...Done !
original formula: EG(E(EX(EX((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))<=((Client_Waiting_0+Client_Waiting_1)+(Client_Waiti...194
=> equivalent forward existential formula: [FwdG(Init,E(EX(EX((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))<=((Client_Waiting_...237
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, Intersection with reachable at eac...217
(forward)formula 0,1,0.094219,7880,1,0,110,20906,65,74,593,32976,107
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 21:49:51] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:51] [INFO ] Invariant cache hit.
[2025-05-30 21:49:51] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 398ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 463 ms. Remains : 18/18 places, 20/20 transitions.
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:52] [INFO ] Input system was already deterministic with 20 transitions.
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 1 ms
[2025-05-30 21:49:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9711113795858715062.gal : 0 ms
[2025-05-30 21:49:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7568918657754263559.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9711113795858715062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7568918657754263559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4430,0.010218,4208,2,257,5,1930,6,0,91,2575,0


Converting to forward existential form...Done !
original formula: EF((((RequestBufferSlots<=((RequestBuffer_0+RequestBuffer_1)+(RequestBuffer_2+RequestBuffer_3))) * AG(((((Client_Sending_0+Client_Sending...337
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((RequestBuffer_0+RequestBuffer_1)+(RequestBuffer_2+RequestBuffer_3))<=Server_Waiting)) *...401
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, Intersection with reachable at eac...217
(forward)formula 0,0,0.03475,5360,1,0,65,8754,62,25,585,9289,53
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
[2025-05-30 21:49:52] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 356ms
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 18/18 places, 20/20 transitions.
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 6 ms
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:52] [INFO ] Input system was already deterministic with 20 transitions.
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 21:49:52] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11282571778174036689.gal : 1 ms
[2025-05-30 21:49:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality81027039448093306.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11282571778174036689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality81027039448093306.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,4430,0.017438,4212,2,257,5,1930,6,0,91,2575,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.017705,4212,1,0,6,1930,7,1,137,2575,1
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 21:49:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 21:49:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2025-05-30 21:49:52] [INFO ] Invariant cache hit.
[2025-05-30 21:49:52] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 20/38 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 347ms
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 18/18 places, 20/20 transitions.
[2025-05-30 21:49:53] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:53] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:53] [INFO ] Input system was already deterministic with 20 transitions.
[2025-05-30 21:49:53] [INFO ] Flatten gal took : 1 ms
[2025-05-30 21:49:53] [INFO ] Flatten gal took : 2 ms
[2025-05-30 21:49:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13400009832491993908.gal : 1 ms
[2025-05-30 21:49:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality13352962035346713594.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13400009832491993908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13352962035346713594.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4430,0.011734,4208,2,257,5,1930,6,0,91,2575,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((Server_Waiting>((Server_Anwering_0+Server_Anwering_1)+(Server_Anwering_2+Server_Anwering_3))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((Server_Waiting>((Server_Anwering_0+Server_Anwering_1)+(Server_Anwering_2+...190
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, Intersection with reachable at eac...217
(forward)formula 0,1,0.055882,6256,1,0,89,13850,62,38,575,17206,82
FORMULA CSRepetitions-COL-02-CTLCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 21:49:53] [INFO ] Flatten gal took : 3 ms
[2025-05-30 21:49:53] [INFO ] Flatten gal took : 3 ms
Total runtime 5844 ms.

BK_STOP 1748641793338

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CSRepetitions-COL-02"
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-5832"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-02, 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 r044-tall-174854028900689"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;