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-167814483300890.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 DNAwalker-PT-03track12BlockBoth, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483300890
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-03track12BlockBoth-CTLFireability-00
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-01
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-02
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-03
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-04
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-05
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-06
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-07
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-08
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-09
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-10
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-11
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-12
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-13
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-14
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678498600066

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-03track12BlockBoth
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:36:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:36:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:36:41] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-11 01:36:41] [INFO ] Transformed 14 places.
[2023-03-11 01:36:41] [INFO ] Transformed 84 transitions.
[2023-03-11 01:36:41] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:41] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2023-03-11 01:36:41] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-11 01:36:42] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
[2023-03-11 01:36:42] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:42] [INFO ] Invariant cache hit.
[2023-03-11 01:36:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 01:36:42] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:42] [INFO ] Invariant cache hit.
[2023-03-11 01:36:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-11 01:36:42] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-11 01:36:42] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:42] [INFO ] Invariant cache hit.
[2023-03-11 01:36:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 14/14 places, 84/84 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-11 01:36:42] [INFO ] Flatten gal took : 21 ms
[2023-03-11 01:36:42] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:36:42] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 1109 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 67) seen :54
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 165 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 01:36:43] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:43] [INFO ] Invariant cache hit.
[2023-03-11 01:36:43] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 01:36:44] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
Fused 13 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:36:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 8 ms
FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:36:44] [INFO ] Input system was already deterministic with 84 transitions.
FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 82 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:44] [INFO ] Invariant cache hit.
[2023-03-11 01:36:44] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:36:44] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:44] [INFO ] Invariant cache hit.
[2023-03-11 01:36:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:44] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:44] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:44] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:44] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 01:36:45] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2023-03-11 01:36:45] [INFO ] Invariant cache hit.
[2023-03-11 01:36:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 14/14 places, 84/84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Input system was already deterministic with 84 transitions.
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:36:45] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:36:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 01:36:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 84 transitions and 244 arcs took 1 ms.
Total runtime 4059 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 14 NrTr: 84 NrArc: 244)

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

net check time: 0m 0.000sec

init dd package: 0m 2.706sec


RS generation: 0m 0.036sec


-> reachability set: #nodes 206 (2.1e+02) #states 5,248 (3)



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

checking: EG [AG [AX [AF [[1<=p4 & 2<=p12]]]]]
normalized: EG [~ [E [true U EX [EG [~ [[1<=p4 & 2<=p12]]]]]]]

abstracting: (2<=p12)
states: 448
abstracting: (1<=p4)
states: 1,758 (3)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AF [AG [AF [[[1<=p6 & 2<=p9] | [2<=p4 & 1<=p11]]]]]
normalized: ~ [EG [E [true U EG [~ [[[2<=p4 & 1<=p11] | [1<=p6 & 2<=p9]]]]]]]

abstracting: (2<=p9)
states: 308
abstracting: (1<=p6)
states: 2,648 (3)
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p4)
states: 308
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [AX [[EG [AG [[2<=p2 & 1<=p3]]] | EF [[2<=p4 & 1<=p12]]]]]
normalized: EG [~ [EX [~ [[EG [~ [E [true U ~ [[2<=p2 & 1<=p3]]]]] | E [true U [2<=p4 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 3,025 (3)
abstracting: (2<=p4)
states: 308
abstracting: (1<=p3)
states: 2,424 (3)
abstracting: (2<=p2)
states: 436
.
EG iterations: 1
.....
EG iterations: 4
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AF [AX [[AG [EF [[1<=p1 & 2<=p4]]] | [1<=p2 & 2<=p6]]]]
normalized: ~ [EG [EX [~ [[[1<=p2 & 2<=p6] | ~ [E [true U ~ [E [true U [1<=p1 & 2<=p4]]]]]]]]]]

abstracting: (2<=p4)
states: 308
abstracting: (1<=p1)
states: 2,630 (3)
abstracting: (2<=p6)
states: 448
abstracting: (1<=p2)
states: 2,424 (3)
....
EG iterations: 3
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EX [~ [A [E [EF [2<=p13] U 1<=p10] U AX [[2<=p13 | [1<=p4 & 2<=p9]]]]]]
normalized: EX [~ [[~ [EG [EX [~ [[[1<=p4 & 2<=p9] | 2<=p13]]]]] & ~ [E [EX [~ [[[1<=p4 & 2<=p9] | 2<=p13]]] U [~ [E [E [true U 2<=p13] U 1<=p10]] & EX [~ [[[1<=p4 & 2<=p9] | 2<=p13]]]]]]]]]

abstracting: (2<=p13)
states: 776
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,758 (3)
.abstracting: (1<=p10)
states: 1,450 (3)
abstracting: (2<=p13)
states: 776
abstracting: (2<=p13)
states: 776
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,758 (3)
.abstracting: (2<=p13)
states: 776
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,758 (3)
........
EG iterations: 7
.-> the formula is TRUE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: [EG [AX [[AX [[p6<=1 | p11<=0]] | EG [[p11<=0 | p12<=1]]]]] | AG [EX [AF [EX [[1<=p4 & 2<=p6]]]]]]
normalized: [~ [E [true U ~ [EX [~ [EG [~ [EX [[1<=p4 & 2<=p6]]]]]]]]] | EG [~ [EX [~ [[EG [[p11<=0 | p12<=1]] | ~ [EX [~ [[p6<=1 | p11<=0]]]]]]]]]]

abstracting: (p11<=0)
states: 2,600 (3)
abstracting: (p6<=1)
states: 4,800 (3)
.abstracting: (p12<=1)
states: 4,800 (3)
abstracting: (p11<=0)
states: 2,600 (3)
.
EG iterations: 1
.
EG iterations: 0
abstracting: (2<=p6)
states: 448
abstracting: (1<=p4)
states: 1,758 (3)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [~ [EX [~ [AX [AX [2<=p8]]]]] U AG [E [EF [[2<=p6 & 1<=p9]] U [[2<=p6 & 1<=p7] | [2<=p3 & 1<=p7]]]]]
normalized: E [~ [EX [EX [EX [~ [2<=p8]]]]] U ~ [E [true U ~ [E [E [true U [2<=p6 & 1<=p9]] U [[2<=p3 & 1<=p7] | [2<=p6 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 3,025 (3)
abstracting: (2<=p6)
states: 448
abstracting: (1<=p7)
states: 3,025 (3)
abstracting: (2<=p3)
states: 436
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p6)
states: 448
abstracting: (2<=p8)
states: 776
...-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EX [EF [[AF [AG [[2<=p4 & 1<=p12]]] | EF [[E [[2<=p0 & 1<=p9] U [2<=p2 & 1<=p4]] & [2<=p6 & 1<=p11]]]]]]
normalized: EX [E [true U [E [true U [[2<=p6 & 1<=p11] & E [[2<=p0 & 1<=p9] U [2<=p2 & 1<=p4]]]] | ~ [EG [E [true U ~ [[2<=p4 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 3,025 (3)
abstracting: (2<=p4)
states: 308

EG iterations: 0
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p2)
states: 436
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p0)
states: 9
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p6)
states: 448
.-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [EG [[[2<=p1 & 1<=p9] | [E [[1<=p2 & 2<=p4] U [1<=p11 & 2<=p12]] & [AF [[1<=p1 & 2<=p4]] & [p1<=0 | p6<=1]]]]]]
normalized: E [true U EG [[[[[p1<=0 | p6<=1] & ~ [EG [~ [[1<=p1 & 2<=p4]]]]] & E [[1<=p2 & 2<=p4] U [1<=p11 & 2<=p12]]] | [2<=p1 & 1<=p9]]]]

abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p1)
states: 407
abstracting: (2<=p12)
states: 448
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p4)
states: 308
abstracting: (1<=p2)
states: 2,424 (3)
abstracting: (2<=p4)
states: 308
abstracting: (1<=p1)
states: 2,630 (3)
.
EG iterations: 1
abstracting: (p6<=1)
states: 4,800 (3)
abstracting: (p1<=0)
states: 2,618 (3)
....
EG iterations: 4
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [EG [EF [~ [A [AG [[1<=p11 & 2<=p12]] U ~ [[p6<=1 | p11<=0]]]]]] | AX [[EF [[[1<=p2 & 2<=p11] | EX [[p7<=1 | p8<=0]]]] & EX [[1<=p2 & 2<=p6]]]]]
normalized: [~ [EX [~ [[EX [[1<=p2 & 2<=p6]] & E [true U [EX [[p7<=1 | p8<=0]] | [1<=p2 & 2<=p11]]]]]]] | EG [E [true U ~ [[~ [EG [[p6<=1 | p11<=0]]] & ~ [E [[p6<=1 | p11<=0] U [E [true U ~ [[1<=p11 & 2<=p12]]] & [p6<=1 | p11<=0]]]]]]]]]

abstracting: (p11<=0)
states: 2,600 (3)
abstracting: (p6<=1)
states: 4,800 (3)
abstracting: (2<=p12)
states: 448
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (p11<=0)
states: 2,600 (3)
abstracting: (p6<=1)
states: 4,800 (3)
abstracting: (p11<=0)
states: 2,600 (3)
abstracting: (p6<=1)
states: 4,800 (3)
.
EG iterations: 1

EG iterations: 0
abstracting: (2<=p11)
states: 448
abstracting: (1<=p2)
states: 2,424 (3)
abstracting: (p8<=0)
states: 0
abstracting: (p7<=1)
states: 4,800 (3)
.abstracting: (2<=p6)
states: 448
abstracting: (1<=p2)
states: 2,424 (3)
..-> the formula is TRUE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [AF [[AX [AF [1<=p10]] & [2<=p7 & 1<=p9]]] & [AF [[E [[1<=p10 | [2<=p3 & 1<=p4]] U [1<=p3 & 2<=p12]] & [2<=p2 & 1<=p7]]] & [~ [E [EX [EG [[2<=p1 & 1<=p11]]] U [2<=p2 & 1<=p11]]] | AG [EX [[p6<=1 | p11<=0]]]]]]
normalized: [[[~ [E [true U ~ [EX [[p6<=1 | p11<=0]]]]] | ~ [E [EX [EG [[2<=p1 & 1<=p11]]] U [2<=p2 & 1<=p11]]]] & ~ [EG [~ [[[2<=p2 & 1<=p7] & E [[1<=p10 | [2<=p3 & 1<=p4]] U [1<=p3 & 2<=p12]]]]]]] & ~ [EG [~ [[[2<=p7 & 1<=p9] & ~ [EX [EG [~ [1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 1,450 (3)
.
EG iterations: 1
.abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p7)
states: 448

EG iterations: 0
abstracting: (2<=p12)
states: 448
abstracting: (1<=p3)
states: 2,424 (3)
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p3)
states: 436
abstracting: (1<=p10)
states: 1,450 (3)
abstracting: (1<=p7)
states: 3,025 (3)
abstracting: (2<=p2)
states: 436
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p2)
states: 436
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p1)
states: 407
....
EG iterations: 4
.abstracting: (p11<=0)
states: 2,600 (3)
abstracting: (p6<=1)
states: 4,800 (3)
.-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: EF [[[AG [[AX [[2<=p4 & 1<=p11]] & EX [[2<=p1 & 1<=p2]]]] & [AF [p5<=0] | AG [AF [[2<=p0 & 1<=p4]]]]] & [[AG [[p11<=1 | p13<=0]] | EF [[[[2<=p12 & 1<=p13] | [2<=p3 & 1<=p9]] | [[1<=p6 & 2<=p9] | [1<=p11 & 2<=p12]]]]] & [AF [[2<=p4 & 1<=p7]] | [A [E [AG [[2<=p9 & 1<=p13]] U [1<=p4 & 2<=p9]] U EG [[[1<=p4 & 2<=p6] | 2<=p13]]] | [1<=p3 & 2<=p9]]]]]]
normalized: E [true U [[[[[1<=p3 & 2<=p9] | [~ [EG [~ [EG [[2<=p13 | [1<=p4 & 2<=p6]]]]]] & ~ [E [~ [EG [[2<=p13 | [1<=p4 & 2<=p6]]]] U [~ [E [~ [E [true U ~ [[2<=p9 & 1<=p13]]]] U [1<=p4 & 2<=p9]]] & ~ [EG [[2<=p13 | [1<=p4 & 2<=p6]]]]]]]]] | ~ [EG [~ [[2<=p4 & 1<=p7]]]]] & [E [true U [[[1<=p11 & 2<=p12] | [1<=p6 & 2<=p9]] | [[2<=p3 & 1<=p9] | [2<=p12 & 1<=p13]]]] | ~ [E [true U ~ [[p11<=1 | p13<=0]]]]]] & [[~ [E [true U EG [~ [[2<=p0 & 1<=p4]]]]] | ~ [EG [~ [p5<=0]]]] & ~ [E [true U ~ [[EX [[2<=p1 & 1<=p2]] & ~ [EX [~ [[2<=p4 & 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (2<=p4)
states: 308
.abstracting: (1<=p2)
states: 2,424 (3)
abstracting: (2<=p1)
states: 407
.abstracting: (p5<=0)
states: 3,798 (3)
....
EG iterations: 4
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p0)
states: 9
.
EG iterations: 1
abstracting: (p13<=0)
states: 0
abstracting: (p11<=1)
states: 4,800 (3)
abstracting: (1<=p13)
states: 5,248 (3)
abstracting: (2<=p12)
states: 448
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p3)
states: 436
abstracting: (2<=p9)
states: 308
abstracting: (1<=p6)
states: 2,648 (3)
abstracting: (2<=p12)
states: 448
abstracting: (1<=p11)
states: 2,648 (3)
abstracting: (1<=p7)
states: 3,025 (3)
abstracting: (2<=p4)
states: 308
..
EG iterations: 2
abstracting: (2<=p6)
states: 448
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p13)
states: 776
...
EG iterations: 3
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (1<=p13)
states: 5,248 (3)
abstracting: (2<=p9)
states: 308
abstracting: (2<=p6)
states: 448
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p13)
states: 776
...
EG iterations: 3
abstracting: (2<=p6)
states: 448
abstracting: (1<=p4)
states: 1,758 (3)
abstracting: (2<=p13)
states: 776
...
EG iterations: 3
......
EG iterations: 6
abstracting: (2<=p9)
states: 308
abstracting: (1<=p3)
states: 2,424 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-03track12BlockBoth-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

totally nodes used: 266633 (2.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 454293 634667 1088960
used/not used/entry size/cache size: 846797 66262067 16 1024MB
basic ops cache: hits/miss/sum: 275850 227700 503550
used/not used/entry size/cache size: 439378 16337838 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: 1365 1424 2789
used/not used/entry size/cache size: 1424 8387184 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 66880183
1 208022
2 12620
3 4711
4 1444
5 680
6 336
7 326
8 144
9 117
>= 10 281

Total processing time: 0m 4.721sec


BK_STOP 1678498611326

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:11436 (136), effective:544 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:118 (1), effective:3 (0)

iterations count:584 (6), effective:25 (0)

iterations count:229 (2), effective:8 (0)

iterations count:588 (7), effective:24 (0)

iterations count:517 (6), effective:17 (0)

iterations count:2929 (34), effective:113 (1)

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

iterations count:98 (1), effective:2 (0)

iterations count:411 (4), effective:13 (0)

iterations count:553 (6), effective:18 (0)

iterations count:426 (5), effective:12 (0)

iterations count:425 (5), effective:14 (0)

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

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

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

iterations count:343 (4), effective:7 (0)

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

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

iterations count:144 (1), effective:2 (0)

iterations count:854 (10), effective:31 (0)

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

iterations count:12386 (147), effective:526 (6)

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

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

iterations count:1530 (18), effective:58 (0)

iterations count:2673 (31), effective:108 (1)

iterations count:391 (4), effective:10 (0)

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

iterations count:124 (1), effective:3 (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="DNAwalker-PT-03track12BlockBoth"
export BK_EXAMINATION="CTLFireability"
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 DNAwalker-PT-03track12BlockBoth, examination is CTLFireability"
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-167814483300890"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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