Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r362-smll-167891812300137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RwMutex-PT-r0010w0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812300137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 23:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 23:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 23:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 887K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678992260292

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RwMutex-PT-r0010w0500
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:44:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 18:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:44:24] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2023-03-16 18:44:24] [INFO ] Transformed 1030 places.
[2023-03-16 18:44:24] [INFO ] Transformed 1020 transitions.
[2023-03-16 18:44:24] [INFO ] Found NUPN structural information;
[2023-03-16 18:44:24] [INFO ] Parsed PT model containing 1030 places and 1020 transitions and 12060 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 3 formulas.
FORMULA RwMutex-PT-r0010w0500-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 1030 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1030/1030 places, 1020/1020 transitions.
Applied a total of 0 rules in 192 ms. Remains 1030 /1030 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
// Phase 1: matrix 1020 rows 1030 cols
[2023-03-16 18:44:24] [INFO ] Computed 520 place invariants in 355 ms
[2023-03-16 18:44:26] [INFO ] Implicit Places using invariants in 1828 ms returned []
[2023-03-16 18:44:26] [INFO ] Invariant cache hit.
[2023-03-16 18:44:29] [INFO ] Implicit Places using invariants and state equation in 3130 ms returned [2, 13, 24, 35, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 113, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 141, 142, 143, 144, 145, 146, 147, 148, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 161, 162, 163, 164, 165, 166, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 238, 239, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 296, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 324, 325, 326, 327, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 339, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 498, 509, 520, 531, 542, 553, 564, 575, 587, 598, 609, 620, 631, 642, 653, 664, 697, 698, 709, 720, 731, 742, 753, 764, 775, 797, 808, 809, 820, 831, 842, 853, 864, 875, 886, 897, 908, 920, 953, 964, 975, 986, 997, 1008, 1019]
Discarding 478 places :
Implicit Place search using SMT with State Equation took 5021 ms to find 478 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 552/1030 places, 1020/1020 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 119 transition count 587
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 119 transition count 587
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Iterating post reduction 0 with 433 rules applied. Total rules applied 1299 place count 119 transition count 154
Applied a total of 1299 rules in 52 ms. Remains 119 /552 variables (removed 433) and now considering 154/1020 (removed 866) transitions.
// Phase 1: matrix 154 rows 119 cols
[2023-03-16 18:44:29] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-16 18:44:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 18:44:29] [INFO ] Invariant cache hit.
[2023-03-16 18:44:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/1030 places, 154/1020 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5521 ms. Remains : 119/1030 places, 154/1020 transitions.
Support contains 75 out of 119 places after structural reductions.
[2023-03-16 18:44:30] [INFO ] Flatten gal took : 125 ms
[2023-03-16 18:44:30] [INFO ] Flatten gal took : 69 ms
[2023-03-16 18:44:30] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 69 out of 119 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 40) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 18:44:31] [INFO ] Invariant cache hit.
[2023-03-16 18:44:31] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-16 18:44:32] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2023-03-16 18:44:32] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 41 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 37 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 43 out of 119 places (down from 46) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 14 edges and 119 vertex of which 14 / 119 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 112 transition count 79
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 233 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 12 transition count 14
Applied a total of 234 rules in 21 ms. Remains 12 /119 variables (removed 107) and now considering 14/154 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 12/119 places, 14/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 84 transition count 119
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 84 transition count 119
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 105 place count 84 transition count 84
Applied a total of 105 rules in 5 ms. Remains 84 /119 variables (removed 35) and now considering 84/154 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/119 places, 84/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 17 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 16 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 82 transition count 117
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 82 transition count 117
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 111 place count 82 transition count 80
Applied a total of 111 rules in 4 ms. Remains 82 /119 variables (removed 37) and now considering 80/154 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 82/119 places, 80/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 85 transition count 120
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 85 transition count 120
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 102 place count 85 transition count 86
Applied a total of 102 rules in 4 ms. Remains 85 /119 variables (removed 34) and now considering 86/154 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 85/119 places, 86/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 84 transition count 119
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 84 transition count 119
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 105 place count 84 transition count 84
Applied a total of 105 rules in 3 ms. Remains 84 /119 variables (removed 35) and now considering 84/154 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 84/119 places, 84/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 84 transition count 119
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 84 transition count 119
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 105 place count 84 transition count 84
Applied a total of 105 rules in 4 ms. Remains 84 /119 variables (removed 35) and now considering 84/154 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 84/119 places, 84/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 87 transition count 122
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 87 transition count 122
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 87 transition count 90
Applied a total of 96 rules in 3 ms. Remains 87 /119 variables (removed 32) and now considering 90/154 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 87/119 places, 90/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 85 transition count 120
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 85 transition count 120
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 102 place count 85 transition count 86
Applied a total of 102 rules in 3 ms. Remains 85 /119 variables (removed 34) and now considering 86/154 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 85/119 places, 86/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 82 transition count 117
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 82 transition count 117
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 111 place count 82 transition count 80
Applied a total of 111 rules in 4 ms. Remains 82 /119 variables (removed 37) and now considering 80/154 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 82/119 places, 80/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 14 edges and 119 vertex of which 14 / 119 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 112 transition count 80
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 229 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 14 transition count 16
Applied a total of 230 rules in 8 ms. Remains 14 /119 variables (removed 105) and now considering 16/154 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 14/119 places, 16/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 14 edges and 119 vertex of which 14 / 119 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 112 transition count 79
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 233 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 12 transition count 14
Applied a total of 234 rules in 8 ms. Remains 12 /119 variables (removed 107) and now considering 14/154 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 12/119 places, 14/154 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:44:32] [INFO ] Input system was already deterministic with 14 transitions.
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 15 ms
[2023-03-16 18:44:32] [INFO ] Flatten gal took : 15 ms
[2023-03-16 18:44:32] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-16 18:44:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 154 transitions and 1578 arcs took 2 ms.
Total runtime 8954 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 119 NrTr: 154 NrArc: 1578)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec

net check time: 0m 0.000sec

init dd package: 0m 3.607sec


RS generation: 0m 0.184sec


-> reachability set: #nodes 15638 (1.6e+04) #states 1,091 (3)



starting MCC model checker
--------------------------

checking: EF [EX [[p63<=0 & 0<=p63]]]
normalized: E [true U EX [[p63<=0 & 0<=p63]]]

abstracting: (0<=p63)
states: 1,091 (3)
abstracting: (p63<=0)
states: 512
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.241sec

checking: EG [AX [[p77<=1 & 1<=p77]]]
normalized: EG [~ [EX [~ [[p77<=1 & 1<=p77]]]]]

abstracting: (1<=p77)
states: 1,090 (3)
abstracting: (p77<=1)
states: 1,091 (3)
...
EG iterations: 2
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EG [[[p91<=1 & 1<=p91] | [p98<=0 & 0<=p98]]]
normalized: EG [[[p98<=0 & 0<=p98] | [p91<=1 & 1<=p91]]]

abstracting: (1<=p91)
states: 1
abstracting: (p91<=1)
states: 1,091 (3)
abstracting: (0<=p98)
states: 1,091 (3)
abstracting: (p98<=0)
states: 1,090 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [AG [AG [[[p3<=0 & 0<=p3] | [p117<=1 & 1<=p117]]]]]
normalized: ~ [EG [E [true U E [true U ~ [[[p117<=1 & 1<=p117] | [p3<=0 & 0<=p3]]]]]]]

abstracting: (0<=p3)
states: 1,091 (3)
abstracting: (p3<=0)
states: 1,090 (3)
abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 1,091 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [~ [A [~ [[[p99<=0 & 0<=p99] | [p114<=1 & 1<=p114]]] U ~ [[p27<=1 & 1<=p27]]]]]
normalized: ~ [E [true U [~ [EG [[p27<=1 & 1<=p27]]] & ~ [E [[p27<=1 & 1<=p27] U [[[p114<=1 & 1<=p114] | [p99<=0 & 0<=p99]] & [p27<=1 & 1<=p27]]]]]]]

abstracting: (1<=p27)
states: 1,090 (3)
abstracting: (p27<=1)
states: 1,091 (3)
abstracting: (0<=p99)
states: 1,091 (3)
abstracting: (p99<=0)
states: 1,090 (3)
abstracting: (1<=p114)
states: 1
abstracting: (p114<=1)
states: 1,091 (3)
abstracting: (1<=p27)
states: 1,090 (3)
abstracting: (p27<=1)
states: 1,091 (3)
abstracting: (1<=p27)
states: 1,090 (3)
abstracting: (p27<=1)
states: 1,091 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: E [[p74<=0 & 0<=p74] U [[AF [AG [AF [[[0<=p110 & p110<=0] | [p58<=1 & 1<=p58]]]]] | [p54<=1 & 1<=p54]] | AX [1<=0]]]
normalized: E [[p74<=0 & 0<=p74] U [~ [EX [~ [1<=0]]] | [[p54<=1 & 1<=p54] | ~ [EG [E [true U EG [~ [[[p58<=1 & 1<=p58] | [0<=p110 & p110<=0]]]]]]]]]]

abstracting: (p110<=0)
states: 1
abstracting: (0<=p110)
states: 1,091 (3)
abstracting: (1<=p58)
states: 1
abstracting: (p58<=1)
states: 1,091 (3)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,091 (3)
abstracting: (1<=0)
states: 0
.abstracting: (0<=p74)
states: 1,091 (3)
abstracting: (p74<=0)
states: 1,090 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AG [AX [[[[[0<=p77 & p77<=0] & [p105<=1 & 1<=p105]] | [p82<=0 & 0<=p82]] & [p109<=0 & 0<=p109]]]]
normalized: ~ [E [true U EX [~ [[[p109<=0 & 0<=p109] & [[p82<=0 & 0<=p82] | [[p105<=1 & 1<=p105] & [0<=p77 & p77<=0]]]]]]]]

abstracting: (p77<=0)
states: 1
abstracting: (0<=p77)
states: 1,091 (3)
abstracting: (1<=p105)
states: 1
abstracting: (p105<=1)
states: 1,091 (3)
abstracting: (0<=p82)
states: 1,091 (3)
abstracting: (p82<=0)
states: 1,090 (3)
abstracting: (0<=p109)
states: 1,091 (3)
abstracting: (p109<=0)
states: 512
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AF [[A [[AF [[[p65<=0 & 0<=p65] | [p96<=1 & 1<=p96]]] & ~ [[p8<=1 & 1<=p8]]] U ~ [[p90<=0 & 0<=p90]]] | EF [EX [0<=0]]]]
normalized: ~ [EG [~ [[E [true U EX [0<=0]] | [~ [EG [[p90<=0 & 0<=p90]]] & ~ [E [[p90<=0 & 0<=p90] U [~ [[~ [[p8<=1 & 1<=p8]] & ~ [EG [~ [[[p96<=1 & 1<=p96] | [p65<=0 & 0<=p65]]]]]]] & [p90<=0 & 0<=p90]]]]]]]]]

abstracting: (0<=p90)
states: 1,091 (3)
abstracting: (p90<=0)
states: 1,090 (3)
abstracting: (0<=p65)
states: 1,091 (3)
abstracting: (p65<=0)
states: 1,090 (3)
abstracting: (1<=p96)
states: 1
abstracting: (p96<=1)
states: 1,091 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 1,090 (3)
abstracting: (p8<=1)
states: 1,091 (3)
abstracting: (0<=p90)
states: 1,091 (3)
abstracting: (p90<=0)
states: 1,090 (3)
abstracting: (0<=p90)
states: 1,091 (3)
abstracting: (p90<=0)
states: 1,090 (3)
.
EG iterations: 1
abstracting: (0<=0)
states: 1,091 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[[EX [[[p89<=1 & 1<=p89] | [p118<=0 & 0<=p118]]] | [[p26<=0 & 0<=p26] & [[p41<=0 & 0<=p41] | [p25<=1 & 1<=p25]]]] & [p101<=0 & 0<=p101]]]
normalized: ~ [E [true U ~ [[[p101<=0 & 0<=p101] & [[[[p25<=1 & 1<=p25] | [p41<=0 & 0<=p41]] & [p26<=0 & 0<=p26]] | EX [[[p118<=0 & 0<=p118] | [p89<=1 & 1<=p89]]]]]]]]

abstracting: (1<=p89)
states: 1
abstracting: (p89<=1)
states: 1,091 (3)
abstracting: (0<=p118)
states: 1,091 (3)
abstracting: (p118<=0)
states: 1,090 (3)
.abstracting: (0<=p26)
states: 1,091 (3)
abstracting: (p26<=0)
states: 1
abstracting: (0<=p41)
states: 1,091 (3)
abstracting: (p41<=0)
states: 579
abstracting: (1<=p25)
states: 1,090 (3)
abstracting: (p25<=1)
states: 1,091 (3)
abstracting: (0<=p101)
states: 1,091 (3)
abstracting: (p101<=0)
states: 1,090 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: [E [AG [[AF [EG [[p83<=0 & 0<=p83]]] | [EX [[p4<=0 & 0<=p4]] & [p18<=1 & 1<=p18]]]] U ~ [EG [~ [[p14<=1 & 1<=p14]]]]] & EX [[EG [[[p57<=0 & 0<=p57] & EX [[p20<=1 & 1<=p20]]]] & [[p83<=0 & 0<=p83] & EX [[[p61<=0 & 0<=p61] & [p64<=1 & 1<=p64]]]]]]]
normalized: [EX [[[EX [[[p64<=1 & 1<=p64] & [p61<=0 & 0<=p61]]] & [p83<=0 & 0<=p83]] & EG [[EX [[p20<=1 & 1<=p20]] & [p57<=0 & 0<=p57]]]]] & E [~ [E [true U ~ [[[[p18<=1 & 1<=p18] & EX [[p4<=0 & 0<=p4]]] | ~ [EG [~ [EG [[p83<=0 & 0<=p83]]]]]]]]] U ~ [EG [~ [[p14<=1 & 1<=p14]]]]]]

abstracting: (1<=p14)
states: 1,090 (3)
abstracting: (p14<=1)
states: 1,091 (3)
..
EG iterations: 2
abstracting: (0<=p83)
states: 1,091 (3)
abstracting: (p83<=0)
states: 1,090 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (0<=p4)
states: 1,091 (3)
abstracting: (p4<=0)
states: 1,090 (3)
.abstracting: (1<=p18)
states: 1,090 (3)
abstracting: (p18<=1)
states: 1,091 (3)
abstracting: (0<=p57)
states: 1,091 (3)
abstracting: (p57<=0)
states: 1,090 (3)
abstracting: (1<=p20)
states: 1,090 (3)
abstracting: (p20<=1)
states: 1,091 (3)
..
EG iterations: 1
abstracting: (0<=p83)
states: 1,091 (3)
abstracting: (p83<=0)
states: 1,090 (3)
abstracting: (0<=p61)
states: 1,091 (3)
abstracting: (p61<=0)
states: 1,090 (3)
abstracting: (1<=p64)
states: 1
abstracting: (p64<=1)
states: 1,091 (3)
..-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[[EF [AX [[p12<=1 & 1<=p12]]] | [p81<=1 & 1<=p81]] | [[p23<=1 & 1<=p23] | [~ [E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]] & [[p42<=0 & 0<=p42] | [[p30<=0 & 0<=p30] | [[p55<=0 & 0<=p55] & [p7<=1 & 1<=p7]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p7<=1 & 1<=p7] & [p55<=0 & 0<=p55]] | [p30<=0 & 0<=p30]] | [p42<=0 & 0<=p42]] & ~ [E [[p1<=1 & 1<=p1] U [p29<=1 & 1<=p29]]]] | [p23<=1 & 1<=p23]] | [[p81<=1 & 1<=p81] | E [true U ~ [EX [~ [[p12<=1 & 1<=p12]]]]]]]]]]

abstracting: (1<=p12)
states: 1,090 (3)
abstracting: (p12<=1)
states: 1,091 (3)
.abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 1,091 (3)
abstracting: (1<=p23)
states: 1,090 (3)
abstracting: (p23<=1)
states: 1,091 (3)
abstracting: (1<=p29)
states: 1,090 (3)
abstracting: (p29<=1)
states: 1,091 (3)
abstracting: (1<=p1)
states: 579
abstracting: (p1<=1)
states: 1,091 (3)
abstracting: (0<=p42)
states: 1,091 (3)
abstracting: (p42<=0)
states: 579
abstracting: (0<=p30)
states: 1,091 (3)
abstracting: (p30<=0)
states: 1
abstracting: (0<=p55)
states: 1,091 (3)
abstracting: (p55<=0)
states: 1,090 (3)
abstracting: (1<=p7)
states: 1
abstracting: (p7<=1)
states: 1,091 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

totally nodes used: 56334 (5.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 192782 1909194 2101976
used/not used/entry size/cache size: 1939965 65168899 16 1024MB
basic ops cache: hits/miss/sum: 34491 147663 182154
used/not used/entry size/cache size: 206755 16570461 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3116 22835 25951
used/not used/entry size/cache size: 22834 8365774 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67053544
1 54312
2 1002
3 6
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.020sec


BK_STOP 1678992280001

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:5965 (38), effective:77 (0)

initing FirstDep: 0m 0.001sec


iterations count:6082 (39), effective:67 (0)

iterations count:6097 (39), effective:77 (0)

iterations count:154 (1), effective:0 (0)

iterations count:232 (1), effective:1 (0)

iterations count:6097 (39), effective:77 (0)

iterations count:311 (2), effective:2 (0)

iterations count:6039 (39), effective:76 (0)

iterations count:154 (1), effective:0 (0)

iterations count:264 (1), effective:1 (0)

iterations count:154 (1), effective:0 (0)

iterations count:6097 (39), effective:77 (0)

iterations count:154 (1), effective:0 (0)

iterations count:155 (1), effective:1 (0)

iterations count:304 (1), effective:1 (0)

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="RwMutex-PT-r0010w0500"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is RwMutex-PT-r0010w0500, 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 r362-smll-167891812300137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0500.tgz
mv RwMutex-PT-r0010w0500 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;