Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 536K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-12b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001100164
=====================================================================

--------------------
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 FlexibleBarrier-PT-12b-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527061222707


BK_STOP 1527061691548

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-12b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2032198, 'Memory': 7861.79, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FlexibleBarrier-PT-12b...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-12b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-12b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ FlexibleBarrier-PT-12b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4277/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1988 places, 2289 transitions, 1974 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-12b-CTLCardinality.task
lola: (A (((p1421 <= p1109) U (3 <= p1596))) OR A (G ((p1908 <= p101)))) : (NOT(E (F (((p1671 <= p270) AND (p1483 <= p236))))) OR A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))) : A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904))))) : (A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201)))) OR (((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576))) AND E (X (((p117 <= p92) AND (2 <= p1029)))))) : A (X (E (G (((p1127 <= p1887) OR (2 <= p511)))))) : E (X (E (G (((p318 <= p1513) OR (p1811 <= p1205)))))) : A (G ((p156 <= p1557))) : A (G ((A (G ((2 <= p243))) OR E (G ((p732 <= p1364)))))) : A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572)))) : E (((3 <= p980) U E (G ((p47 <= p258))))) : E (F (A (F ((p748 + 1 <= p461))))) : ((p1084 <= p1796) AND (NOT(A (G ((p223 <= p1962)))) OR NOT(A (F ((p686 <= p914)))))) : A ((E (G ((3 <= p880))) U E (G ((p771 <= p1060))))) : E (G ((A (F ((p367 <= p880))) OR ((1 <= p1343) OR (p1264 <= p782) OR ((p608 <= p1208) AND (2 <= p1753)))))) : (NOT(NOT(A (G ((p1251 <= p2))))) AND E (X (E (G ((p1164 <= p1049)))))) : NOT(E (F ((2 <= p710))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p1421 <= p1109) U (3 <= p1596))) OR A (G ((p1908 <= p101))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1421 <= p1109) U (3 <= p1596)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1421 <= p1109) U (3 <= p1596)))
lola: processed formula: A (((p1421 <= p1109) U (3 <= p1596)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 80 markings, 80 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1908 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((p1671 <= p270) AND (p1483 <= p236))))) OR A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p270 + 1 <= p1671) OR (p236 + 1 <= p1483))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: processed formula: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: processed formula length: 55
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 80 markings, 80 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: processed formula: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 80 markings, 80 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201)))) OR (((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576))) AND E (X (((p117 <= p92) AND (2 <= p1029))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 142372 markings, 173071 edges, 28474 markings/sec, 0 secs
lola: sara is running 5 secs || 279932 markings, 347450 edges, 27512 markings/sec, 5 secs
lola: sara is running 10 secs || 419081 markings, 524448 edges, 27830 markings/sec, 10 secs
lola: sara is running 15 secs || 561169 markings, 701639 edges, 28418 markings/sec, 15 secs
lola: sara is running 20 secs || 701449 markings, 878278 edges, 28056 markings/sec, 20 secs
lola: sara is running 25 secs || 844011 markings, 1052381 edges, 28512 markings/sec, 25 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p117 <= p92) AND (2 <= p1029))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p117 <= p92) AND (2 <= p1029)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p1127 <= p1887) OR (2 <= p511))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((p1887 + 1 <= p1127) AND (p511 <= 1)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p318 <= p1513) OR (p1811 <= p1205))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((p1513 + 1 <= p318) AND (p1205 + 1 <= p1811)))))
lola: processed formula length: 65
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p156 <= p1557)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((2 <= p243))) OR E (G ((p732 <= p1364))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (p243 <= 1)) AND A(TRUE U (p1364 + 1 <= p732)))))
lola: processed formula length: 72
lola: 8 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 193370 markings, 921630 edges, 3687031648961953792 markings/sec, 0 secs
lola: 377098 markings, 1938380 edges, 36746 markings/sec, 5 secs
lola: 554909 markings, 2976474 edges, 35562 markings/sec, 10 secs
lola: 723005 markings, 3986414 edges, 33619 markings/sec, 15 secs
lola: 906311 markings, 5002202 edges, 36661 markings/sec, 20 secs
lola: 1057199 markings, 5971754 edges, 30178 markings/sec, 25 secs
lola: 1245463 markings, 6970563 edges, 37653 markings/sec, 30 secs
lola: 1408139 markings, 7981984 edges, 32535 markings/sec, 35 secs
lola: 1586140 markings, 8964607 edges, 35600 markings/sec, 40 secs
lola: 1758505 markings, 9980642 edges, 34473 markings/sec, 45 secs
lola: 1926291 markings, 10966806 edges, 33557 markings/sec, 50 secs
lola: 2103592 markings, 11965036 edges, 35460 markings/sec, 55 secs
lola: 2261536 markings, 12944869 edges, 31589 markings/sec, 60 secs
lola: 2442091 markings, 13926137 edges, 36111 markings/sec, 65 secs
lola: 2593105 markings, 14894893 edges, 30203 markings/sec, 70 secs
lola: 2772607 markings, 15849998 edges, 35900 markings/sec, 75 secs
lola: 2926276 markings, 16807886 edges, 30734 markings/sec, 80 secs
lola: 3095606 markings, 17736382 edges, 33866 markings/sec, 85 secs
lola: 3254617 markings, 18695409 edges, 31802 markings/sec, 90 secs
lola: 3419040 markings, 19616871 edges, 32885 markings/sec, 95 secs
lola: 3579055 markings, 20565057 edges, 32003 markings/sec, 100 secs
lola: 3733007 markings, 21447634 edges, 30790 markings/sec, 105 secs
lola: 3891865 markings, 22374945 edges, 31772 markings/sec, 110 secs
lola: 4043267 markings, 23266041 edges, 30280 markings/sec, 115 secs
lola: 4205817 markings, 24191406 edges, 32510 markings/sec, 120 secs
lola: 4352016 markings, 25061944 edges, 29240 markings/sec, 125 secs
lola: 4513620 markings, 25976638 edges, 32321 markings/sec, 130 secs
lola: 4657180 markings, 26835343 edges, 28712 markings/sec, 135 secs
lola: 4816863 markings, 27740309 edges, 31937 markings/sec, 140 secs
lola: 4958846 markings, 28588395 edges, 28397 markings/sec, 145 secs
lola: 5116329 markings, 29484019 edges, 31497 markings/sec, 150 secs
lola: 5257486 markings, 30321341 edges, 28231 markings/sec, 155 secs
lola: 5411964 markings, 31208946 edges, 30896 markings/sec, 160 secs
lola: 5557213 markings, 32049059 edges, 29050 markings/sec, 165 secs
lola: 5692609 markings, 32860191 edges, 27079 markings/sec, 170 secs
lola: 5839414 markings, 33682757 edges, 29361 markings/sec, 175 secs
lola: 5979789 markings, 34541391 edges, 28075 markings/sec, 180 secs
lola: 6128661 markings, 35360046 edges, 29774 markings/sec, 185 secs
lola: 6261192 markings, 36196579 edges, 26506 markings/sec, 190 secs
lola: 6415875 markings, 37019520 edges, 30937 markings/sec, 195 secs
lola: 6537031 markings, 37818873 edges, 24231 markings/sec, 200 secs
lola: 6694377 markings, 38638736 edges, 31469 markings/sec, 205 secs
lola: 6815012 markings, 39400413 edges, 24127 markings/sec, 210 secs
lola: 6968435 markings, 40237290 edges, 30685 markings/sec, 215 secs
lola: 7096096 markings, 41012446 edges, 25532 markings/sec, 220 secs
lola: 7238124 markings, 41821502 edges, 28406 markings/sec, 225 secs
lola: 7365585 markings, 42552033 edges, 25492 markings/sec, 230 secs
lola: 7495625 markings, 43354951 edges, 26008 markings/sec, 235 secs
lola: 7639152 markings, 44135598 edges, 28705 markings/sec, 240 secs
lola: 7758522 markings, 44915253 edges, 23874 markings/sec, 245 secs
lola: 7902152 markings, 45658819 edges, 28726 markings/sec, 250 secs
lola: 8021502 markings, 46404096 edges, 23870 markings/sec, 255 secs
lola: 8169677 markings, 47221630 edges, 29635 markings/sec, 260 secs
lola: 8294475 markings, 47959220 edges, 24960 markings/sec, 265 secs
lola: 8424796 markings, 48741459 edges, 26064 markings/sec, 270 secs
lola: 8558875 markings, 49482764 edges, 26816 markings/sec, 275 secs
lola: 8670636 markings, 50216059 edges, 22352 markings/sec, 280 secs
lola: 8815748 markings, 50967968 edges, 29022 markings/sec, 285 secs
lola: 8928145 markings, 51667475 edges, 22479 markings/sec, 290 secs
lola: 9069163 markings, 52455574 edges, 28204 markings/sec, 295 secs
lola: 9192974 markings, 53172055 edges, 24762 markings/sec, 300 secs
lola: 9312975 markings, 53921680 edges, 24000 markings/sec, 305 secs
lola: 9451490 markings, 54660433 edges, 27703 markings/sec, 310 secs
lola: 9561855 markings, 55376544 edges, 22073 markings/sec, 315 secs
lola: 9706594 markings, 56149884 edges, 28948 markings/sec, 320 secs
lola: 9820408 markings, 56840982 edges, 22763 markings/sec, 325 secs
lola: 9945852 markings, 57579712 edges, 25089 markings/sec, 330 secs
lola: 10070049 markings, 58259762 edges, 24839 markings/sec, 335 secs
lola: 10172461 markings, 58931363 edges, 20482 markings/sec, 340 secs
lola: 10310545 markings, 59660914 edges, 27617 markings/sec, 345 secs
lola: 10423060 markings, 60330571 edges, 22503 markings/sec, 350 secs
lola: 10536540 markings, 61026959 edges, 22696 markings/sec, 355 secs
lola: 10664874 markings, 61712137 edges, 25667 markings/sec, 360 secs
lola: 10769310 markings, 62382070 edges, 20887 markings/sec, 365 secs
lola: 10903847 markings, 63112359 edges, 26907 markings/sec, 370 secs
lola: 11011464 markings, 63740346 edges, 21523 markings/sec, 375 secs
lola: 11113534 markings, 64404919 edges, 20414 markings/sec, 380 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: processed formula: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 98 markings, 98 edges
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p980) U E (G ((p47 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p980) U NOT(A(TRUE U (p258 + 1 <= p47))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 66 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((p748 + 1 <= p461)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p748 + 1 <= p461)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 108 markings, 314 edges
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1084 <= p1796) AND (NOT(A (G ((p223 <= p1962)))) OR NOT(A (F ((p686 <= p914))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1084 <= p1796)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1084 <= p1796)
lola: processed formula length: 16
lola: 6 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1962 + 1 <= p223)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((3 <= p880))) U E (G ((p771 <= p1060)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p880 <= 2))) U NOT(A(TRUE U (p1060 + 1 <= p771))))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 66 edges
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p367 <= p880))) OR ((1 <= p1343) OR (p1264 <= p782) OR ((p608 <= p1208) AND (2 <= p1753))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (p367 <= p880))) AND ((p1343 <= 0) AND (p782 + 1 <= p1264) AND ((p1208 + 1 <= p608) OR (p1753 <= 1))))))
lola: processed formula length: 132
lola: 4 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 130 edges
lola: ========================================
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (G ((p1251 <= p2))))) AND E (X (E (G ((p1164 <= p1049))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1251 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= p710))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no unknown no yes yes yes yes yes no yes
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is FlexibleBarrier-PT-12b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-blw7-152650001100164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;