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.r106-tall-167814483100718.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 DLCround-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 6.1K Feb 25 19:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 19:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 19:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 20:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 566K Mar 5 18:22 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 DLCround-PT-09a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678460310012

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 14:58:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 14:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 14:58:31] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-10 14:58:31] [INFO ] Transformed 299 places.
[2023-03-10 14:58:31] [INFO ] Transformed 2243 transitions.
[2023-03-10 14:58:31] [INFO ] Found NUPN structural information;
[2023-03-10 14:58:31] [INFO ] Parsed PT model containing 299 places and 2243 transitions and 8689 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 216 transitions
Reduce redundant transitions removed 216 transitions.
FORMULA DLCround-PT-09a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 11) seen :4
FORMULA DLCround-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 14:58:32] [INFO ] Flow matrix only has 202 transitions (discarded 1825 similar events)
// Phase 1: matrix 202 rows 299 cols
[2023-03-10 14:58:32] [INFO ] Computed 184 place invariants in 14 ms
[2023-03-10 14:58:32] [INFO ] [Real]Absence check using 184 positive place invariants in 31 ms returned sat
[2023-03-10 14:58:32] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-10 14:58:32] [INFO ] [Nat]Absence check using 184 positive place invariants in 32 ms returned sat
[2023-03-10 14:58:32] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
FORMULA DLCround-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1515 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_09a
(NrP: 299 NrTr: 2243 NrArc: 8689)

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

net check time: 0m 0.000sec

init dd package: 0m 2.713sec


RS generation: 2m 2.563sec


-> reachability set: #nodes 611885 (6.1e+05) #states 24,010,000,000,001 (13)



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

checking: AG [p49<=1]
normalized: ~ [E [true U ~ [p49<=1]]]

abstracting: (p49<=1)
states: 24,010,000,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [p167<=p217]]
normalized: E [true U ~ [p167<=p217]]

abstracting: (p167<=p217)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: AG [p101<=p187]
normalized: ~ [E [true U ~ [p101<=p187]]]

abstracting: (p101<=p187)
states: 24,010,000,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[p133<=0 & 1<=p98]]
normalized: ~ [E [true U ~ [[p133<=0 & 1<=p98]]]]

abstracting: (1<=p98)
states: 2,401,000,000,000 (12)
abstracting: (p133<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m13.177sec

checking: EF [p199<=p250]
normalized: E [true U p199<=p250]

abstracting: (p199<=p250)
states: 24,010,000,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.622sec

checking: EF [~ [[p269<=p69 | 1<=p244]]]
normalized: E [true U ~ [[p269<=p69 | 1<=p244]]]

abstracting: (1<=p244)
states: 24,010,000,000,000 (13)
abstracting: (p269<=p69)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[p166<=p180 & ~ [1<=p116]] | p45<=0] & p109<=1]]
normalized: ~ [E [true U ~ [[p109<=1 & [p45<=0 | [p166<=p180 & ~ [1<=p116]]]]]]]

abstracting: (1<=p116)
states: 2,401,000,000,000 (12)
abstracting: (p166<=p180)
states: 24,010,000,000,001 (13)
abstracting: (p45<=0)
states: 21,609,000,000,001 (13)
abstracting: (p109<=1)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.673sec

checking: EF [~ [[[[~ [[p251<=p52 & [~ [p180<=p215] & p129<=p285]]] & [p134<=p83 | [p144<=p78 | p216<=p218]]] | p106<=1] & 1<=p268]]]
normalized: E [true U ~ [[1<=p268 & [p106<=1 | [[p134<=p83 | [p144<=p78 | p216<=p218]] & ~ [[p251<=p52 & [p129<=p285 & ~ [p180<=p215]]]]]]]]]

abstracting: (p180<=p215)
states: 24,010,000,000,001 (13)
abstracting: (p129<=p285)
states: 24,010,000,000,001 (13)
abstracting: (p251<=p52)
states: 2,401,000,000,001 (12)
abstracting: (p216<=p218)
states: 24,010,000,000,001 (13)
abstracting: (p144<=p78)
states: 2,401,000,000,001 (12)
abstracting: (p134<=p83)
states: 2,401,000,000,001 (12)
abstracting: (p106<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p268)
states: 24,010,000,000,000 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.441sec

checking: EF [~ [[[[[~ [1<=p36] | [1<=p295 | p182<=0]] | [~ [p203<=0] | [1<=p9 & p61<=0]]] & [p250<=0 & p101<=1]] | [~ [[[1<=p58 & p111<=p124] & p254<=p17]] | ~ [[[p197<=0 & 1<=p262] | [p133<=0 & p46<=0]]]]]]]
normalized: E [true U ~ [[[~ [[[p133<=0 & p46<=0] | [p197<=0 & 1<=p262]]] | ~ [[p254<=p17 & [1<=p58 & p111<=p124]]]] | [[p250<=0 & p101<=1] & [[[1<=p9 & p61<=0] | ~ [p203<=0]] | [[1<=p295 | p182<=0] | ~ [1<=p36]]]]]]]

abstracting: (1<=p36)
states: 2,401,000,000,000 (12)
abstracting: (p182<=0)
states: 1
abstracting: (1<=p295)
states: 24,010,000,000,000 (13)
abstracting: (p203<=0)
states: 1
abstracting: (p61<=0)
states: 21,609,000,000,001 (13)
abstracting: (1<=p9)
states: 3,430,000,000,000 (12)
abstracting: (p101<=1)
states: 24,010,000,000,001 (13)
abstracting: (p250<=0)
states: 1
abstracting: (p111<=p124)
states: 21,849,100,000,001 (13)
abstracting: (1<=p58)
states: 2,401,000,000,000 (12)
abstracting: (p254<=p17)
states: 3,430,000,000,001 (12)
abstracting: (1<=p262)
states: 24,010,000,000,000 (13)
abstracting: (p197<=0)
states: 1
abstracting: (p46<=0)
states: 21,609,000,000,001 (13)
abstracting: (p133<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.849sec

checking: EF [~ [[[[[[p278<=p122 & [[[p243<=p181 | p12<=0] | ~ [1<=p223]] | ~ [1<=p290]]] | [~ [p188<=p258] | [[[p47<=p60 & 1<=p226] | ~ [p62<=1]] | [[p72<=0 | p170<=0] & [1<=p262 | p16<=p149]]]]] | 1<=p127] | 1<=p261] & ~ [[p172<=1 & [1<=p274 & p239<=0]]]]]]
normalized: E [true U ~ [[~ [[p172<=1 & [1<=p274 & p239<=0]]] & [1<=p261 | [1<=p127 | [[[[[1<=p262 | p16<=p149] & [p72<=0 | p170<=0]] | [~ [p62<=1] | [p47<=p60 & 1<=p226]]] | ~ [p188<=p258]] | [p278<=p122 & [~ [1<=p290] | [~ [1<=p223] | [p243<=p181 | p12<=0]]]]]]]]]]

abstracting: (p12<=0)
states: 20,580,000,000,001 (13)
abstracting: (p243<=p181)
states: 24,010,000,000,001 (13)
abstracting: (1<=p223)
states: 24,010,000,000,000 (13)
abstracting: (1<=p290)
states: 24,010,000,000,000 (13)
abstracting: (p278<=p122)
states: 2,401,000,000,001 (12)
abstracting: (p188<=p258)
states: 24,010,000,000,001 (13)
abstracting: (1<=p226)
states: 24,010,000,000,000 (13)
abstracting: (p47<=p60)
states: 21,849,100,000,001 (13)
abstracting: (p62<=1)
states: 24,010,000,000,001 (13)
abstracting: (p170<=0)
states: 1
abstracting: (p72<=0)
states: 21,609,000,000,001 (13)
abstracting: (p16<=p149)
states: 24,010,000,000,001 (13)
abstracting: (1<=p262)
states: 24,010,000,000,000 (13)
abstracting: (1<=p127)
states: 2,401,000,000,000 (12)
abstracting: (1<=p261)
states: 24,010,000,000,000 (13)
abstracting: (p239<=0)
states: 1
abstracting: (1<=p274)
states: 24,010,000,000,000 (13)
abstracting: (p172<=1)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.980sec

checking: EF [[~ [[[p242<=p40 & [[~ [p33<=p88] & ~ [[p195<=p70 & [p162<=p95 | p3<=p132]]]] & ~ [[[[p172<=1 & p147<=0] | [p30<=1 & p230<=1]] & [[1<=p121 & p275<=1] | [1<=p133 | p214<=p120]]]]]] & ~ [[1<=p207 | [[~ [[p207<=1 | p151<=p177]] & ~ [[p124<=1 | p148<=1]]] & ~ [[p195<=0 | [p0<=0 | p129<=0]]]]]]]] & ~ [[p26<=p206 & p266<=1]]]]
normalized: E [true U [~ [[p26<=p206 & p266<=1]] & ~ [[~ [[1<=p207 | [~ [[p195<=0 | [p0<=0 | p129<=0]]] & [~ [[p124<=1 | p148<=1]] & ~ [[p207<=1 | p151<=p177]]]]]] & [p242<=p40 & [~ [[[[1<=p133 | p214<=p120] | [1<=p121 & p275<=1]] & [[p30<=1 & p230<=1] | [p172<=1 & p147<=0]]]] & [~ [[p195<=p70 & [p162<=p95 | p3<=p132]]] & ~ [p33<=p88]]]]]]]]

abstracting: (p33<=p88)
states: 21,849,100,000,001 (13)
abstracting: (p3<=p132)
states: 24,010,000,000,001 (13)
abstracting: (p162<=p95)
states: 2,401,000,000,001 (12)
abstracting: (p195<=p70)
states: 2,401,000,000,001 (12)
abstracting: (p147<=0)
states: 1
abstracting: (p172<=1)
states: 24,010,000,000,001 (13)
abstracting: (p230<=1)
states: 24,010,000,000,001 (13)
abstracting: (p30<=1)
states: 24,010,000,000,001 (13)
abstracting: (p275<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p121)
states: 2,401,000,000,000 (12)
abstracting: (p214<=p120)
states: 2,401,000,000,001 (12)
abstracting: (1<=p133)
states: 24,010,000,000,000 (13)
abstracting: (p242<=p40)
states: 2,401,000,000,001 (12)
abstracting: (p151<=p177)
states: 24,010,000,000,001 (13)
abstracting: (p207<=1)
states: 24,010,000,000,001 (13)
abstracting: (p148<=1)
states: 24,010,000,000,001 (13)
abstracting: (p124<=1)
states: 24,010,000,000,001 (13)
abstracting: (p129<=0)
states: 1
abstracting: (p0<=0)
states: 24,010,000,000,000 (13)
abstracting: (p195<=0)
states: 1
abstracting: (1<=p207)
states: 24,010,000,000,000 (13)
abstracting: (p266<=1)
states: 24,010,000,000,001 (13)
abstracting: (p26<=p206)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.032sec

checking: AG [[1<=p75 | [~ [[[~ [[[p34<=0 & p161<=p256] | [1<=p14 | p244<=1]]] & ~ [1<=p48]] & 1<=p137]] & ~ [[[[~ [[~ [p114<=p37] & [p263<=0 | 1<=p231]]] | [~ [p36<=p154] & 1<=p30]] & 1<=p85] & [[[[~ [p99<=0] | [1<=p209 & p63<=1]] | [p270<=p182 | ~ [1<=p242]]] & ~ [[[p36<=0 & 1<=p91] | ~ [1<=p259]]]] | ~ [[~ [[p273<=p236 | p290<=0]] | [[p44<=p200 & p215<=0] | 1<=p164]]]]]]]]]
normalized: ~ [E [true U ~ [[1<=p75 | [~ [[[~ [[[1<=p164 | [p44<=p200 & p215<=0]] | ~ [[p273<=p236 | p290<=0]]]] | [~ [[~ [1<=p259] | [p36<=0 & 1<=p91]]] & [[p270<=p182 | ~ [1<=p242]] | [[1<=p209 & p63<=1] | ~ [p99<=0]]]]] & [1<=p85 & [[1<=p30 & ~ [p36<=p154]] | ~ [[[p263<=0 | 1<=p231] & ~ [p114<=p37]]]]]]] & ~ [[1<=p137 & [~ [1<=p48] & ~ [[[1<=p14 | p244<=1] | [p34<=0 & p161<=p256]]]]]]]]]]]

abstracting: (p161<=p256)
states: 24,010,000,000,001 (13)
abstracting: (p34<=0)
states: 21,609,000,000,001 (13)
abstracting: (p244<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p14)
states: 3,430,000,000,000 (12)
abstracting: (1<=p48)
states: 2,401,000,000,000 (12)
abstracting: (1<=p137)
states: 24,010,000,000,000 (13)
abstracting: (p114<=p37)
states: 21,849,100,000,001 (13)
abstracting: (1<=p231)
states: 24,010,000,000,000 (13)
abstracting: (p263<=0)
states: 1
abstracting: (p36<=p154)
states: 24,010,000,000,001 (13)
abstracting: (1<=p30)
states: 2,401,000,000,000 (12)
abstracting: (1<=p85)
states: 2,401,000,000,000 (12)
abstracting: (p99<=0)
states: 21,609,000,000,001 (13)
abstracting: (p63<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p209)
states: 24,010,000,000,000 (13)
abstracting: (1<=p242)
states: 24,010,000,000,000 (13)
abstracting: (p270<=p182)
states: 24,010,000,000,001 (13)
abstracting: (1<=p91)
states: 2,401,000,000,000 (12)
abstracting: (p36<=0)
states: 21,609,000,000,001 (13)
abstracting: (1<=p259)
states: 24,010,000,000,000 (13)
abstracting: (p290<=0)
states: 1
abstracting: (p273<=p236)
states: 24,010,000,000,001 (13)
abstracting: (p215<=0)
states: 1
abstracting: (p44<=p200)
states: 24,010,000,000,001 (13)
abstracting: (1<=p164)
states: 24,010,000,000,000 (13)
abstracting: (1<=p75)
states: 2,401,000,000,000 (12)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.910sec

checking: AG [[[p116<=p127 | [[[[[[~ [p199<=p103] & [1<=p14 & 1<=p281]] & 1<=p112] & [1<=p128 & [p25<=0 & [p258<=1 & p21<=p257]]]] | ~ [[p5<=1 & [[p186<=1 | p263<=0] & p196<=0]]]] | p246<=p239] | [[[[p9<=0 | [[1<=p22 & 1<=p69] & 1<=p199]] & ~ [[[p172<=1 & p152<=p203] | [p127<=p267 | 1<=p10]]]] & [p72<=p15 & p89<=0]] | 1<=p189]]] | ~ [[1<=p47 | p145<=0]]]]
normalized: ~ [E [true U ~ [[[p116<=p127 | [[p246<=p239 | [[[1<=p112 & [[1<=p14 & 1<=p281] & ~ [p199<=p103]]] & [1<=p128 & [p25<=0 & [p258<=1 & p21<=p257]]]] | ~ [[p5<=1 & [p196<=0 & [p186<=1 | p263<=0]]]]]] | [1<=p189 | [[[p9<=0 | [1<=p199 & [1<=p22 & 1<=p69]]] & ~ [[[p127<=p267 | 1<=p10] | [p172<=1 & p152<=p203]]]] & [p72<=p15 & p89<=0]]]]] | ~ [[1<=p47 | p145<=0]]]]]]

abstracting: (p145<=0)
states: 1
abstracting: (1<=p47)
states: 2,401,000,000,000 (12)
abstracting: (p89<=0)
states: 21,609,000,000,001 (13)
abstracting: (p72<=p15)
states: 21,952,000,000,001 (13)
abstracting: (p152<=p203)
states: 24,010,000,000,001 (13)
abstracting: (p172<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p10)
states: 3,430,000,000,000 (12)
abstracting: (p127<=p267)
states: 24,010,000,000,001 (13)
abstracting: (1<=p69)
states: 2,401,000,000,000 (12)
abstracting: (1<=p22)
states: 3,430,000,000,000 (12)
abstracting: (1<=p199)
states: 24,010,000,000,000 (13)
abstracting: (p9<=0)
states: 20,580,000,000,001 (13)
abstracting: (1<=p189)
states: 24,010,000,000,000 (13)
abstracting: (p263<=0)
states: 1
abstracting: (p186<=1)
states: 24,010,000,000,001 (13)
abstracting: (p196<=0)
states: 1
abstracting: (p5<=1)
states: 24,010,000,000,001 (13)
abstracting: (p21<=p257)
states: 24,010,000,000,001 (13)
abstracting: (p258<=1)
states: 24,010,000,000,001 (13)
abstracting: (p25<=0)
states: 20,580,000,000,001 (13)
abstracting: (1<=p128)
states: 2,401,000,000,000 (12)
abstracting: (p199<=p103)
states: 2,401,000,000,001 (12)
abstracting: (1<=p281)
states: 24,010,000,000,000 (13)
abstracting: (1<=p14)
states: 3,430,000,000,000 (12)
abstracting: (1<=p112)
states: 2,401,000,000,000 (12)
abstracting: (p246<=p239)
states: 24,010,000,000,001 (13)
abstracting: (p116<=p127)
states: 21,849,100,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.807sec

checking: AG [[[p287<=0 & [[p37<=p244 & [[[[~ [p89<=1] | ~ [p38<=0]] & [~ [p54<=p261] | p297<=1]] & [[[p118<=1 & p58<=0] & p157<=0] | ~ [[p260<=p37 & p203<=p129]]]] | [~ [[p106<=p118 | p117<=1]] | [[1<=p94 & p75<=p282] & p113<=p235]]]] & ~ [[~ [[1<=p177 & p155<=p205]] & p201<=p45]]]] | [p19<=1 & ~ [[p24<=1 | [[p73<=p170 | ~ [[[1<=p120 & p222<=p212] & ~ [1<=p73]]]] & 1<=p44]]]]]]
normalized: ~ [E [true U ~ [[[p19<=1 & ~ [[p24<=1 | [1<=p44 & [p73<=p170 | ~ [[~ [1<=p73] & [1<=p120 & p222<=p212]]]]]]]] | [p287<=0 & [~ [[p201<=p45 & ~ [[1<=p177 & p155<=p205]]]] & [p37<=p244 & [[[p113<=p235 & [1<=p94 & p75<=p282]] | ~ [[p106<=p118 | p117<=1]]] | [[~ [[p260<=p37 & p203<=p129]] | [p157<=0 & [p118<=1 & p58<=0]]] & [[p297<=1 | ~ [p54<=p261]] & [~ [p38<=0] | ~ [p89<=1]]]]]]]]]]]]

abstracting: (p89<=1)
states: 24,010,000,000,001 (13)
abstracting: (p38<=0)
states: 21,609,000,000,001 (13)
abstracting: (p54<=p261)
states: 24,010,000,000,001 (13)
abstracting: (p297<=1)
states: 24,010,000,000,001 (13)
abstracting: (p58<=0)
states: 21,609,000,000,001 (13)
abstracting: (p118<=1)
states: 24,010,000,000,001 (13)
abstracting: (p157<=0)
states: 1
abstracting: (p203<=p129)
states: 24,010,000,000,001 (13)
abstracting: (p260<=p37)
states: 2,401,000,000,001 (12)
abstracting: (p117<=1)
states: 24,010,000,000,001 (13)
abstracting: (p106<=p118)
states: 21,849,100,000,001 (13)
abstracting: (p75<=p282)
states: 24,010,000,000,001 (13)
abstracting: (1<=p94)
states: 2,401,000,000,000 (12)
abstracting: (p113<=p235)
states: 24,010,000,000,001 (13)
abstracting: (p37<=p244)
states: 24,010,000,000,001 (13)
abstracting: (p155<=p205)
states: 24,010,000,000,001 (13)
abstracting: (1<=p177)
states: 24,010,000,000,000 (13)
abstracting: (p201<=p45)
states: 2,401,000,000,001 (12)
abstracting: (p287<=0)
states: 1
abstracting: (p222<=p212)
states: 24,010,000,000,001 (13)
abstracting: (1<=p120)
states: 2,401,000,000,000 (12)
abstracting: (1<=p73)
states: 2,401,000,000,000 (12)
abstracting: (p73<=p170)
states: 24,010,000,000,001 (13)
abstracting: (1<=p44)
states: 2,401,000,000,000 (12)
abstracting: (p24<=1)
states: 24,010,000,000,001 (13)
abstracting: (p19<=1)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.981sec

checking: EF [[[[~ [[[[[[p67<=p281 | p140<=0] | ~ [p232<=p168]] & [p80<=0 | p75<=0]] | [[p176<=1 & ~ [p91<=p295]] | 1<=p272]] & [p44<=0 | [[1<=p40 & [p117<=0 & 1<=p45]] & [[p223<=p290 & p280<=p86] | p289<=0]]]]] | [[[p3<=1 | ~ [p116<=0]] | [p114<=p297 | [[1<=p116 & p186<=0] | [p165<=p23 & [p264<=p193 & p199<=p8]]]]] & ~ [[~ [[p184<=0 & p97<=1]] & ~ [p183<=p165]]]]] | p292<=1] & [~ [p74<=p13] | [~ [p121<=0] & [p234<=p0 & 1<=p110]]]]]
normalized: E [true U [[[[p234<=p0 & 1<=p110] & ~ [p121<=0]] | ~ [p74<=p13]] & [p292<=1 | [[~ [[~ [p183<=p165] & ~ [[p184<=0 & p97<=1]]]] & [[p114<=p297 | [[p165<=p23 & [p264<=p193 & p199<=p8]] | [1<=p116 & p186<=0]]] | [p3<=1 | ~ [p116<=0]]]] | ~ [[[p44<=0 | [[p289<=0 | [p223<=p290 & p280<=p86]] & [1<=p40 & [p117<=0 & 1<=p45]]]] & [[1<=p272 | [p176<=1 & ~ [p91<=p295]]] | [[p80<=0 | p75<=0] & [~ [p232<=p168] | [p67<=p281 | p140<=0]]]]]]]]]]

abstracting: (p140<=0)
states: 1
abstracting: (p67<=p281)
states: 24,010,000,000,001 (13)
abstracting: (p232<=p168)
states: 24,010,000,000,001 (13)
abstracting: (p75<=0)
states: 21,609,000,000,001 (13)
abstracting: (p80<=0)
states: 21,609,000,000,001 (13)
abstracting: (p91<=p295)
states: 24,010,000,000,001 (13)
abstracting: (p176<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p272)
states: 24,010,000,000,000 (13)
abstracting: (1<=p45)
states: 2,401,000,000,000 (12)
abstracting: (p117<=0)
states: 21,609,000,000,001 (13)
abstracting: (1<=p40)
states: 2,401,000,000,000 (12)
abstracting: (p280<=p86)
states: 2,401,000,000,001 (12)
abstracting: (p223<=p290)
states: 24,010,000,000,001 (13)
abstracting: (p289<=0)
states: 1
abstracting: (p44<=0)
states: 21,609,000,000,001 (13)
abstracting: (p116<=0)
states: 21,609,000,000,001 (13)
abstracting: (p3<=1)
states: 24,010,000,000,001 (13)
abstracting: (p186<=0)
states: 1
abstracting: (1<=p116)
states: 2,401,000,000,000 (12)
abstracting: (p199<=p8)
states: 3,430,000,000,001 (12)
abstracting: (p264<=p193)
states: 24,010,000,000,001 (13)
abstracting: (p165<=p23)
states: 3,430,000,000,001 (12)
abstracting: (p114<=p297)
states: 24,010,000,000,001 (13)
abstracting: (p97<=1)
states: 24,010,000,000,001 (13)
abstracting: (p184<=0)
states: 1
abstracting: (p183<=p165)
states: 24,010,000,000,001 (13)
abstracting: (p292<=1)
states: 24,010,000,000,001 (13)
abstracting: (p74<=p13)
states: 21,952,000,000,001 (13)
abstracting: (p121<=0)
states: 21,609,000,000,001 (13)
abstracting: (1<=p110)
states: 2,401,000,000,000 (12)
abstracting: (p234<=p0)
states: 1
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.631sec

checking: EF [[[[~ [[p204<=p6 & ~ [[p85<=1 | p133<=p141]]]] & [[[[[p252<=0 | ~ [p179<=1]] & [[p151<=1 & p286<=1] & [p243<=p182 | 1<=p104]]] & [[~ [p8<=1] & [p292<=1 & 1<=p289]] | [[p190<=p151 | p149<=p0] & [p199<=0 & p277<=1]]]] & ~ [1<=p21]] & ~ [[[~ [p105<=p130] | [~ [p262<=0] & [p3<=p179 | p285<=p234]]] | p223<=0]]]] | [[1<=p83 & ~ [p78<=p189]] | 1<=p245]] | ~ [[1<=p265 | [[~ [p177<=1] & [[1<=p95 | [1<=p154 & p118<=0]] | [[1<=p101 | p42<=p228] | 1<=p209]]] | [~ [1<=p172] | p253<=1]]]]]]
normalized: E [true U [~ [[1<=p265 | [[p253<=1 | ~ [1<=p172]] | [[[1<=p209 | [1<=p101 | p42<=p228]] | [1<=p95 | [1<=p154 & p118<=0]]] & ~ [p177<=1]]]]] | [[1<=p245 | [1<=p83 & ~ [p78<=p189]]] | [[~ [[p223<=0 | [[[p3<=p179 | p285<=p234] & ~ [p262<=0]] | ~ [p105<=p130]]]] & [~ [1<=p21] & [[[[p199<=0 & p277<=1] & [p190<=p151 | p149<=p0]] | [[p292<=1 & 1<=p289] & ~ [p8<=1]]] & [[[p243<=p182 | 1<=p104] & [p151<=1 & p286<=1]] & [p252<=0 | ~ [p179<=1]]]]]] & ~ [[p204<=p6 & ~ [[p85<=1 | p133<=p141]]]]]]]]

abstracting: (p133<=p141)
states: 24,010,000,000,001 (13)
abstracting: (p85<=1)
states: 24,010,000,000,001 (13)
abstracting: (p204<=p6)
states: 3,430,000,000,001 (12)
abstracting: (p179<=1)
states: 24,010,000,000,001 (13)
abstracting: (p252<=0)
states: 1
abstracting: (p286<=1)
states: 24,010,000,000,001 (13)
abstracting: (p151<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p104)
states: 2,401,000,000,000 (12)
abstracting: (p243<=p182)
states: 24,010,000,000,001 (13)
abstracting: (p8<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p289)
states: 24,010,000,000,000 (13)
abstracting: (p292<=1)
states: 24,010,000,000,001 (13)
abstracting: (p149<=p0)
states: 1
abstracting: (p190<=p151)
states: 24,010,000,000,001 (13)
abstracting: (p277<=1)
states: 24,010,000,000,001 (13)
abstracting: (p199<=0)
states: 1
abstracting: (1<=p21)
states: 3,430,000,000,000 (12)
abstracting: (p105<=p130)
states: 24,010,000,000,001 (13)
abstracting: (p262<=0)
states: 1
abstracting: (p285<=p234)
states: 24,010,000,000,001 (13)
abstracting: (p3<=p179)
states: 24,010,000,000,001 (13)
abstracting: (p223<=0)
states: 1
abstracting: (p78<=p189)
states: 24,010,000,000,001 (13)
abstracting: (1<=p83)
states: 2,401,000,000,000 (12)
abstracting: (1<=p245)
states: 24,010,000,000,000 (13)
abstracting: (p177<=1)
states: 24,010,000,000,001 (13)
abstracting: (p118<=0)
states: 21,609,000,000,001 (13)
abstracting: (1<=p154)
states: 24,010,000,000,000 (13)
abstracting: (1<=p95)
states: 2,401,000,000,000 (12)
abstracting: (p42<=p228)
states: 24,010,000,000,001 (13)
abstracting: (1<=p101)
states: 2,401,000,000,000 (12)
abstracting: (1<=p209)
states: 24,010,000,000,000 (13)
abstracting: (1<=p172)
states: 24,010,000,000,000 (13)
abstracting: (p253<=1)
states: 24,010,000,000,001 (13)
abstracting: (1<=p265)
states: 24,010,000,000,000 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.445sec

totally nodes used: 9444591 (9.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 137262740 926400562 1063663302
used/not used/entry size/cache size: 67107523 1341 16 1024MB
basic ops cache: hits/miss/sum: 7105492 47167496 54272988
used/not used/entry size/cache size: 16343413 433803 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: 979261 6049436 7028697
used/not used/entry size/cache size: 4317374 4071234 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 58368248
1 8079497
2 620655
3 38198
4 2141
5 124
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 7m25.938sec


BK_STOP 1678460759779

--------------------
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
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.018sec


iterations count:89402 (39), effective:115 (0)

initing FirstDep: 0m 0.019sec


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

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

iterations count:11194 (4), effective:19 (0)

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

iterations count:12167 (5), effective:23 (0)

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

iterations count:8031 (3), effective:11 (0)

iterations count:4450 (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="DLCround-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DLCround-PT-09a, 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 r106-tall-167814483100718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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