Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979500286.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K 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 ShieldRVt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679383633875

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:27:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 07:27:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:27:15] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-21 07:27:15] [INFO ] Transformed 1003 places.
[2023-03-21 07:27:15] [INFO ] Transformed 1003 transitions.
[2023-03-21 07:27:15] [INFO ] Found NUPN structural information;
[2023-03-21 07:27:15] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 14) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-21 07:27:16] [INFO ] Computed 81 place invariants in 20 ms
[2023-03-21 07:27:16] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:27:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-21 07:27:17] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:27:18] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 7 ms to minimize.
[2023-03-21 07:27:18] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2023-03-21 07:27:18] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2023-03-21 07:27:19] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2023-03-21 07:27:19] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2023-03-21 07:27:19] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2023-03-21 07:27:19] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2023-03-21 07:27:20] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2023-03-21 07:27:20] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 0 ms to minimize.
[2023-03-21 07:27:20] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2023-03-21 07:27:20] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2023-03-21 07:27:21] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 0 ms to minimize.
[2023-03-21 07:27:21] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 2 ms to minimize.
[2023-03-21 07:27:21] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-03-21 07:27:21] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 2 ms to minimize.
[2023-03-21 07:27:22] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2023-03-21 07:27:22] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2023-03-21 07:27:22] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-21 07:27:22] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-21 07:27:23] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 0 ms to minimize.
[2023-03-21 07:27:23] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2023-03-21 07:27:23] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-03-21 07:27:23] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2023-03-21 07:27:23] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2023-03-21 07:27:24] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 0 ms to minimize.
[2023-03-21 07:27:24] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 0 ms to minimize.
[2023-03-21 07:27:24] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-21 07:27:24] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2023-03-21 07:27:24] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 0 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 5 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2023-03-21 07:27:25] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2023-03-21 07:27:26] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2023-03-21 07:27:26] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8058 ms
[2023-03-21 07:27:26] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2023-03-21 07:27:27] [INFO ] Deduced a trap composed of 28 places in 293 ms of which 1 ms to minimize.
[2023-03-21 07:27:27] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 1 ms to minimize.
[2023-03-21 07:27:27] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 2 ms to minimize.
[2023-03-21 07:27:28] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-03-21 07:27:28] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 1 ms to minimize.
[2023-03-21 07:27:28] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 1 ms to minimize.
[2023-03-21 07:27:28] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2023-03-21 07:27:29] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 1 ms to minimize.
[2023-03-21 07:27:29] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 0 ms to minimize.
[2023-03-21 07:27:29] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-21 07:27:29] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 2 ms to minimize.
[2023-03-21 07:27:30] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 1 ms to minimize.
[2023-03-21 07:27:30] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-21 07:27:30] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 1 ms to minimize.
[2023-03-21 07:27:30] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2023-03-21 07:27:31] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 1 ms to minimize.
[2023-03-21 07:27:31] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 1 ms to minimize.
[2023-03-21 07:27:31] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2023-03-21 07:27:31] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 1 ms to minimize.
[2023-03-21 07:27:32] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
[2023-03-21 07:27:32] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 1 ms to minimize.
[2023-03-21 07:27:32] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 0 ms to minimize.
[2023-03-21 07:27:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5925 ms
[2023-03-21 07:27:32] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2023-03-21 07:27:32] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 1 ms to minimize.
[2023-03-21 07:27:33] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 0 ms to minimize.
[2023-03-21 07:27:33] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2023-03-21 07:27:33] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2023-03-21 07:27:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1024 ms
[2023-03-21 07:27:34] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2023-03-21 07:27:34] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2023-03-21 07:27:34] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2023-03-21 07:27:34] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2023-03-21 07:27:34] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 5 ms to minimize.
[2023-03-21 07:27:35] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-21 07:27:35] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-21 07:27:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1696 ms
[2023-03-21 07:27:35] [INFO ] After 18523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-21 07:27:36] [INFO ] After 19552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 126 ms.
Support contains 109 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1003 transition count 773
Reduce places removed 230 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 260 rules applied. Total rules applied 490 place count 773 transition count 743
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 520 place count 743 transition count 743
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 520 place count 743 transition count 665
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 676 place count 665 transition count 665
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 778 place count 563 transition count 563
Iterating global reduction 3 with 102 rules applied. Total rules applied 880 place count 563 transition count 563
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 880 place count 563 transition count 529
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 948 place count 529 transition count 529
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1268 place count 369 transition count 369
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1334 place count 336 transition count 385
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1335 place count 336 transition count 384
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1341 place count 336 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1347 place count 330 transition count 378
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1348 place count 330 transition count 378
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1349 place count 330 transition count 378
Applied a total of 1349 rules in 248 ms. Remains 330 /1003 variables (removed 673) and now considering 378/1003 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 330/1003 places, 378/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 378 rows 330 cols
[2023-03-21 07:27:37] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-21 07:27:37] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:27:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 21 ms returned sat
[2023-03-21 07:27:37] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:27:37] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-21 07:27:37] [INFO ] After 228ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 445 ms
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-21 07:27:38] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-21 07:27:39] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-21 07:27:39] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2023-03-21 07:27:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 712 ms
[2023-03-21 07:27:39] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-21 07:27:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-21 07:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-21 07:27:39] [INFO ] After 1756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-21 07:27:39] [INFO ] After 2345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 68 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 378/378 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 330 transition count 366
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 318 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 316 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 28 place count 316 transition count 351
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 54 place count 303 transition count 351
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 100 place count 280 transition count 328
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 271 transition count 336
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 271 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 270 transition count 335
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 270 transition count 335
Applied a total of 121 rules in 49 ms. Remains 270 /330 variables (removed 60) and now considering 335/378 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 270/330 places, 335/378 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) 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 2) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 335 rows 270 cols
[2023-03-21 07:27:39] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-21 07:27:39] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:27:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-21 07:27:40] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:40] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-21 07:27:40] [INFO ] After 114ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:40] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-21 07:27:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-21 07:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-21 07:27:40] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-21 07:27:40] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 35 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 335/335 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 270 transition count 325
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 260 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 259 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 22 place count 259 transition count 318
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 34 place count 253 transition count 318
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 90 place count 225 transition count 290
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 102 place count 219 transition count 293
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 219 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 218 transition count 291
Applied a total of 104 rules in 75 ms. Remains 218 /270 variables (removed 52) and now considering 291/335 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 218/270 places, 291/335 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 742045 steps, run timeout after 3004 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 742045 steps, saw 477053 distinct states, run finished after 3005 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 218 cols
[2023-03-21 07:27:43] [INFO ] Computed 81 place invariants in 8 ms
[2023-03-21 07:27:43] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:27:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-21 07:27:44] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:44] [INFO ] State equation strengthened by 105 read => feed constraints.
[2023-03-21 07:27:44] [INFO ] After 124ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:44] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-21 07:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-21 07:27:44] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-21 07:27:44] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 35 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 291/291 transitions.
Applied a total of 0 rules in 17 ms. Remains 218 /218 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 218/218 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 291/291 transitions.
Applied a total of 0 rules in 10 ms. Remains 218 /218 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-21 07:27:44] [INFO ] Invariant cache hit.
[2023-03-21 07:27:44] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-21 07:27:44] [INFO ] Invariant cache hit.
[2023-03-21 07:27:44] [INFO ] State equation strengthened by 105 read => feed constraints.
[2023-03-21 07:27:44] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2023-03-21 07:27:44] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-21 07:27:44] [INFO ] Invariant cache hit.
[2023-03-21 07:27:45] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 717 ms. Remains : 218/218 places, 291/291 transitions.
Graph (trivial) has 55 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 683 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 216 transition count 282
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 216 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 216 transition count 275
Applied a total of 24 rules in 52 ms. Remains 216 /218 variables (removed 2) and now considering 275/291 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 275 rows 216 cols
[2023-03-21 07:27:45] [INFO ] Computed 80 place invariants in 5 ms
[2023-03-21 07:27:45] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:27:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-21 07:27:45] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:45] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-21 07:27:45] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:27:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-21 07:27:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 218 places, 291 transitions and 1412 arcs took 7 ms.
[2023-03-21 07:27:45] [INFO ] Flatten gal took : 70 ms
Total runtime 30316 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 020B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 218 places, 291 transitions, 1412 arcs.
Final Score: 4668.517
Took : 13 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVt-PT-020B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( ( (tk(P171)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P171)) ) ) | ( ( (tk(P149)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P149)) ) ) ) | ( ( ( (tk(P86)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P86)) ) ) | ( ( ( (tk(P105)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P105)) ) ) | ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) ) ) ) | ( ( ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) | ( ( ( ( (tk(P196)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P196)) ) ) & ( ( ( (tk(P215)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P215)) ) ) & ( ( (tk(P129)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P129)) ) ) ) ) & ( ( ( ( (tk(P139)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P139)) ) ) & ( ( ( (tk(P115)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P115)) ) ) | ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) ) ) & ( ( ( ( (tk(P11)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P11)) ) ) | ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) & ( ( ( ( (tk(P169)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P169)) ) ) | ( ( (tk(P37)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P37)) ) ) ) | ( ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) ) | ( ( (tk(P35)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P35)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) & ( ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( (tk(P200)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P200)) ) ) ) & ( ( ( ( (tk(P175)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P175)) ) ) | ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) ) | ( ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) | ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) ) ) ) | ( ( ( ( (tk(P172)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P172)) ) ) & ( ( ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) | ( ( ( (tk(P210)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P210)) ) ) | ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) ) ) & ( ( ( (tk(P133)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P133)) ) ) | ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) | ( ( (tk(P19)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P19)) ) ) ) ) ) ) | ( ( ( (tk(P121)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P121)) ) ) & ( ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) & ( ( (tk(P162)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P162)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 159536 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16260384 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVt-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r427-tajo-167905979500286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;