Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407000153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is PermAdmissibility-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 484K May 18 16:43 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 PermAdmissibility-PT-01-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717252320212

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:32:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:32:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:32:02] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-06-01 14:32:02] [INFO ] Transformed 168 places.
[2024-06-01 14:32:02] [INFO ] Transformed 592 transitions.
[2024-06-01 14:32:02] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 171 ms.
Support contains 160 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Applied a total of 0 rules in 22 ms. Remains 168 /168 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 168 cols
[2024-06-01 14:32:02] [INFO ] Computed 32 invariants in 57 ms
[2024-06-01 14:32:03] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 14:32:03] [INFO ] Invariant cache hit.
[2024-06-01 14:32:03] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-06-01 14:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD590 is UNSAT
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 40 solved, 548 unsolved
[2024-06-01 14:32:09] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 20 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 10 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 1 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 2 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:32:12] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:32:12] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:32:12] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD573 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:32:20] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:32:20] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 2 ms to minimize.
[2024-06-01 14:32:20] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:32:20] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:32:21] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:32:21] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:32:21] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:32:23] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:32:23] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 19/67 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 5/72 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/73 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/760 variables, and 73 constraints, problems are : Problem set: 55 solved, 533 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 55 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 45/73 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-06-01 14:32:40] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/74 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/74 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/168 variables, 4/78 constraints. Problems are: Problem set: 64 solved, 524 unsolved
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 2/80 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/80 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 9 (OVERLAPS) 592/760 variables, 168/248 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 524/772 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 772 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 524/588 constraints, Known Traps: 48/48 constraints]
After SMT, in 62141ms problems are : Problem set: 64 solved, 524 unsolved
Search for dead transitions found 64 dead transitions in 62184ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 168/168 places, 528/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 168 /168 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63182 ms. Remains : 168/168 places, 528/592 transitions.
Support contains 160 out of 168 places after structural reductions.
[2024-06-01 14:33:06] [INFO ] Flatten gal took : 128 ms
[2024-06-01 14:33:06] [INFO ] Flatten gal took : 80 ms
[2024-06-01 14:33:06] [INFO ] Input system was already deterministic with 528 transitions.
RANDOM walk for 40000 steps (2352 resets) in 3627 ms. (11 steps per ms) remains 53/108 properties
BEST_FIRST walk for 4004 steps (80 resets) in 103 ms. (38 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 92 ms. (43 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 91 ms. (43 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 93 ms. (42 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 62 ms. (63 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 40 ms. (97 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 48 ms. (81 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 51 ms. (77 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 44 ms. (88 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 79 ms. (50 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 76 ms. (52 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 48 ms. (81 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 43 ms. (91 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 106 ms. (37 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 43 ms. (91 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 53/53 properties
// Phase 1: matrix 528 rows 168 cols
[2024-06-01 14:33:08] [INFO ] Computed 32 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp106 is UNSAT
At refinement iteration 2 (OVERLAPS) 25/168 variables, 27/32 constraints. Problems are: Problem set: 51 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 51 solved, 2 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 4 (OVERLAPS) 528/696 variables, 168/200 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/200 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/200 constraints. Problems are: Problem set: 52 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 200 constraints, problems are : Problem set: 52 solved, 1 unsolved in 843 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 1 unsolved
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Int declared 161/696 variables, and 25 constraints, problems are : Problem set: 53 solved, 0 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 0/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 53 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 53 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:33:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 14:33:09] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:33:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:33:09] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:33:09] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 65 out of 168 places (down from 100) after GAL structural reductions.
FORMULA PermAdmissibility-PT-01-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 168 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 528
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 94 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.7 ms
Discarding 74 places :
Also discarding 112 output transitions
Drop transitions (Output transitions of discarded places.) removed 112 transitions
Applied a total of 1 rules in 49 ms. Remains 94 /168 variables (removed 74) and now considering 416/528 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 94/168 places, 416/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 528
Applied a total of 64 rules in 24 ms. Remains 104 /168 variables (removed 64) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 104/168 places, 528/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 112 transition count 528
Applied a total of 56 rules in 15 ms. Remains 112 /168 variables (removed 56) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 112/168 places, 528/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 50 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.4 ms
Discarding 118 places :
Also discarding 336 output transitions
Drop transitions (Output transitions of discarded places.) removed 336 transitions
Applied a total of 1 rules in 13 ms. Remains 50 /168 variables (removed 118) and now considering 192/528 (removed 336) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 50/168 places, 192/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 110 transition count 528
Applied a total of 58 rules in 5 ms. Remains 110 /168 variables (removed 58) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/168 places, 528/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 110 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.4 ms
Discarding 58 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 110 /168 variables (removed 58) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 110/168 places, 528/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 106 transition count 528
Applied a total of 62 rules in 5 ms. Remains 106 /168 variables (removed 62) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/168 places, 528/528 transitions.
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:33:10] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:33:10] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 106 transition count 528
Applied a total of 62 rules in 4 ms. Remains 106 /168 variables (removed 62) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 106/168 places, 528/528 transitions.
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:33:11] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 108 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.4 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 108 /168 variables (removed 60) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 108/168 places, 528/528 transitions.
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:33:11] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 105 transition count 528
Applied a total of 63 rules in 5 ms. Remains 105 /168 variables (removed 63) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/168 places, 528/528 transitions.
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:33:11] [INFO ] Input system was already deterministic with 528 transitions.
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:33:11] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:33:11] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 14:33:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 528 transitions and 3112 arcs took 12 ms.
Total runtime 69693 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-03
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-04
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-06
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-08
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-09
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-10
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-12
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-13
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-14
Could not compute solution for formula : PermAdmissibility-PT-01-CTLCardinality-2024-15

BK_STOP 1717252391940

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/670/ctl_0_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/670/ctl_1_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/670/ctl_2_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/670/ctl_3_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/670/ctl_4_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/670/ctl_5_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/670/ctl_6_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/670/ctl_7_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/670/ctl_8_
ctl formula name PermAdmissibility-PT-01-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/670/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PermAdmissibility-PT-01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-PT-01, 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 r512-smll-171654407000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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