fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749169500129
Last Updated
June 26, 2018

About the Execution of LoLA for DiscoveryGPU-PT-13a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3650.670 3600000.00 697466.00 337.50 TFTFFTTFTFFFTFFF normal

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 208K
-rw-r--r-- 1 mcc users 2.9K May 30 21:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 30 21:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 14:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 28 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 06:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 06:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 46K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-13a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169500129

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527779054522

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-13a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DiscoveryGPU-PT-13a formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DiscoveryGPU-PT-13a @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 316/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 133
lola: finding significant places
lola: 133 places, 183 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 225 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-13a-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p58)
lola: LP says that atomic proposition is always false: (3 <= p6)
lola: LP says that atomic proposition is always false: (3 <= p121)
lola: LP says that atomic proposition is always false: (2 <= p40)
lola: LP says that atomic proposition is always false: (3 <= p58)
lola: LP says that atomic proposition is always false: (2 <= p43)
lola: LP says that atomic proposition is always false: (3 <= p105)
lola: LP says that atomic proposition is always false: (3 <= p3)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: LP says that atomic proposition is always false: (2 <= p69)
lola: LP says that atomic proposition is always false: (2 <= p101)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: LP says that atomic proposition is always false: (2 <= p29)
lola: LP says that atomic proposition is always false: (2 <= p8)
lola: NOT(E ((TRUE U FALSE))) : (A (G (A (X ((p11 <= p40))))) OR FALSE) : (E (G (E (X ((p113 <= p99))))) AND (E (F ((p97 + 1 <= p33))) AND E (G (TRUE)))) : NOT(((p6 <= p27) AND A (G (TRUE)))) : E (X (E (F (())))) : ((A (F ((p44 + 1 <= p99))) OR NOT(E (F (FALSE)))) OR E (X (((p63 + 1 <= p61))))) : NOT(E ((((1 <= p94) OR (p22 <= p42)) U ()))) : NOT(E (((p71 <= p1) U (1 <= p76)))) : A (F (NOT(E (F (FALSE))))) : ((E (X ((p15 <= p45))) AND E (F (FALSE))) OR E (((p92 + 1 <= p65) U ((1 <= p120) OR (1 <= p105))))) : E ((E (F (FALSE)) U A (G ((1 <= p18))))) : NOT(NOT(E (F (FALSE)))) : E (F ((1 <= p83))) : A (F (NOT(E (F ((1 <= p14)))))) : A (G (A (G ((p124 <= p103))))) : NOT(E ((((p77 <= p92) OR (p87 <= p4)) U ((p58 <= p123) AND (1 <= p62)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p27 + 1 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p27 + 1 <= p6)
lola: processed formula length: 15
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 64 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p11 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p40 + 1 <= p11)
lola: processed formula length: 16
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((p113 <= p99))))) AND E (F ((p97 + 1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p97 + 1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p97 + 1 <= p33)))
lola: processed formula length: 24
lola: 65 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p113 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((p113 <= p99)))))
lola: processed formula length: 37
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 9 markings, 9 edges
lola: lola: ======================================== SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p18)))
lola: processed formula length: 18
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p18 <= 0)
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: 0 markings, 0 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= p83)))
lola: processed formula length: 18
lola: 65 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= p83)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-13a-CTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p124 <= p103)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p124 <= p103)))
lola: processed formula length: 22
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p103 + 1 <= p124)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-13a-CTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p1 + 1 <= p71) R (p76 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p1 + 1 <= p71) R (p76 <= 0)))
lola: processed formula length: 34
lola: 70 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (1 <= p76)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-13a-CTLCardinality-12-0.sara
sara: try reading problem file DiscoveryGPU-PT-13a-CTLCardinality-10-0.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 62 markings, 86 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p92 + 1 <= p65) U ((1 <= p120) OR (1 <= p105))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p92 + 1 <= p65) U ((1 <= p120) OR (1 <= p105))))
lola: processed formula length: 54
lola: 67 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p92 + 1 <= p77) AND (p4 + 1 <= p87)) R ((p123 + 1 <= p58) OR (p62 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((((p92 + 1 <= p77) AND (p4 + 1 <= p87)) R ((p123 + 1 <= p58) OR (p62 <= 0))))
lola: processed formula length: 81
lola: 70 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((p58 <= p123) AND (1 <= p62))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-13a-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic

sara: try reading problem file DiscoveryGPU-PT-13a-CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 10152 markings, 52251 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p14 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= p14)
lola: processed formula length: 10
lola: 66 rewrites
lola: closed formula file DiscoveryGPU-PT-13a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 766204 markings, 3873753 edges, 153241 markings/sec, 0 secs
lola: 1509812 markings, 7393387 edges, 148722 markings/sec, 5 secs
lola: 2247173 markings, 10898625 edges, 147472 markings/sec, 10 secs
lola: 2892295 markings, 14596950 edges, 129024 markings/sec, 15 secs
lola: 3499094 markings, 18192179 edges, 121360 markings/sec, 20 secs
lola: 4169958 markings, 22022857 edges, 134173 markings/sec, 25 secs
lola: 4833462 markings, 25846672 edges, 132701 markings/sec, 30 secs
lola: 5426613 markings, 29494108 edges, 118630 markings/sec, 35 secs
lola: 6043977 markings, 33319294 edges, 123473 markings/sec, 40 secs
lola: 6655358 markings, 37037008 edges, 122276 markings/sec, 45 secs
lola: 7337043 markings, 40814711 edges, 136337 markings/sec, 50 secs
lola: 7916490 markings, 44531126 edges, 115889 markings/sec, 55 secs
lola: 8438855 markings, 47896019 edges, 104473 markings/sec, 60 secs
lola: 9310275 markings, 51465167 edges, 174284 markings/sec, 65 secs
lola: 10101634 markings, 54594730 edges, 158272 markings/sec, 70 secs
lola: 10990718 markings, 57935955 edges, 177817 markings/sec, 75 secs
lola: 11817039 markings, 61133118 edges, 165264 markings/sec, 80 secs
lola: 12630755 markings, 64730600 edges, 162743 markings/sec, 85 secs
lola: 13307184 markings, 67834898 edges, 135286 markings/sec, 90 secs
lola: 14012154 markings, 71070358 edges, 140994 markings/sec, 95 secs
lola: 14752459 markings, 74315161 edges, 148061 markings/sec, 100 secs
lola: 15585397 markings, 77834283 edges, 166588 markings/sec, 105 secs
lola: 16286649 markings, 81138869 edges, 140250 markings/sec, 110 secs
lola: 16976101 markings, 84348011 edges, 137890 markings/sec, 115 secs
lola: 17659144 markings, 87635004 edges, 136609 markings/sec, 120 secs
lola: 18413773 markings, 90869003 edges, 150926 markings/sec, 125 secs
lola: 19099430 markings, 93921364 edges, 137131 markings/sec, 130 secs
lola: 19846686 markings, 97049262 edges, 149451 markings/sec, 135 secs
lola: 20517799 markings, 100171821 edges, 134223 markings/sec, 140 secs
lola: 21149860 markings, 103217643 edges, 126412 markings/sec, 145 secs
lola: 21807607 markings, 106372965 edges, 131549 markings/sec, 150 secs
lola: 22433388 markings, 110276749 edges, 125156 markings/sec, 155 secs
lola: 23079234 markings, 113699167 edges, 129169 markings/sec, 160 secs
lola: 23763258 markings, 117046234 edges, 136805 markings/sec, 165 secs
lola: 24374535 markings, 120425103 edges, 122255 markings/sec, 170 secs
lola: 24800967 markings, 123964421 edges, 85286 markings/sec, 175 secs
lola: 25334283 markings, 127655199 edges, 106663 markings/sec, 180 secs
lola: 25873333 markings, 131446452 edges, 107810 markings/sec, 185 secs
lola: 26310767 markings, 134879659 edges, 87487 markings/sec, 190 secs
lola: 26798658 markings, 138678966 edges, 97578 markings/sec, 195 secs
lola: 27341379 markings, 142691424 edges, 108544 markings/sec, 200 secs
lola: 27888679 markings, 146631675 edges, 109460 markings/sec, 205 secs
lola: 28441059 markings, 150625673 edges, 110476 markings/sec, 210 secs
lola: 29081909 markings, 154594687 edges, 128170 markings/sec, 215 secs
lola: 29583611 markings, 158637844 edges, 100340 markings/sec, 220 secs
lola: 30106958 markings, 162610877 edges, 104669 markings/sec, 225 secs
lola: 30806346 markings, 166672861 edges, 139878 markings/sec, 230 secs
lola: 31436739 markings, 170891764 edges, 126079 markings/sec, 235 secs
lola: 32057036 markings, 174962813 edges, 124059 markings/sec, 240 secs
lola: 32782394 markings, 179000782 edges, 145072 markings/sec, 245 secs
lola: 33621225 markings, 182959227 edges, 167766 markings/sec, 250 secs
lola: 34401027 markings, 186745963 edges, 155960 markings/sec, 255 secs
lola: 34981084 markings, 190839004 edges, 116011 markings/sec, 260 secs
lola: 35661144 markings, 194911286 edges, 136012 markings/sec, 265 secs
lola: 36229390 markings, 199026596 edges, 113649 markings/sec, 270 secs
lola: 36797801 markings, 203035556 edges, 113682 markings/sec, 275 secs
lola: 37419795 markings, 206956622 edges, 124399 markings/sec, 280 secs
lola: 38042584 markings, 210914982 edges, 124558 markings/sec, 285 secs
lola: 38653928 markings, 214962915 edges, 122269 markings/sec, 290 secs
lola: 39342986 markings, 218986804 edges, 137812 markings/sec, 295 secs
lola: 39901622 markings, 223136603 edges, 111727 markings/sec, 300 secs
lola: 40430896 markings, 227108537 edges, 105855 markings/sec, 305 secs
lola: 41035572 markings, 231054852 edges, 120935 markings/sec, 310 secs
lola: 41529063 markings, 235007003 edges, 98698 markings/sec, 315 secs
lola: 42025944 markings, 238831718 edges, 99376 markings/sec, 320 secs
lola: 42682974 markings, 242729942 edges, 131406 markings/sec, 325 secs
lola: 43229694 markings, 246725067 edges, 109344 markings/sec, 330 secs
lola: 43779986 markings, 250627267 edges, 110058 markings/sec, 335 secs
lola: 44441827 markings, 254625116 edges, 132368 markings/sec, 340 secs
lola: 45046153 markings, 258614291 edges, 120865 markings/sec, 345 secs
lola: 45630974 markings, 262546983 edges, 116964 markings/sec, 350 secs
lola: 46136898 markings, 266564097 edges, 101185 markings/sec, 355 secs
lola: 46668521 markings, 270467365 edges, 106325 markings/sec, 360 secs
lola: 47188594 markings, 274339883 edges, 104015 markings/sec, 365 secs
lola: 47800631 markings, 278290830 edges, 122407 markings/sec, 370 secs
lola: 48422069 markings, 282239257 edges, 124288 markings/sec, 375 secs
lola: 49175347 markings, 286110909 edges, 150656 markings/sec, 380 secs
lola: 49769975 markings, 290122567 edges, 118926 markings/sec, 385 secs
lola: 50357707 markings, 294120423 edges, 117546 markings/sec, 390 secs
lola: 50914299 markings, 298054425 edges, 111318 markings/sec, 395 secs
lola: 51522383 markings, 301990051 edges, 121617 markings/sec, 400 secs
lola: 52103924 markings, 306031105 edges, 116308 markings/sec, 405 secs
lola: 52646623 markings, 309955432 edges, 108540 markings/sec, 410 secs
lola: 53119493 markings, 313841501 edges, 94574 markings/sec, 415 secs
lola: 53692947 markings, 317721094 edges, 114691 markings/sec, 420 secs
lola: 54222387 markings, 321581818 edges, 105888 markings/sec, 425 secs
lola: 54800201 markings, 325495336 edges, 115563 markings/sec, 430 secs
lola: 55318941 markings, 329385417 edges, 103748 markings/sec, 435 secs
lola: 55804097 markings, 333222890 edges, 97031 markings/sec, 440 secs
lola: 56543453 markings, 337397601 edges, 147871 markings/sec, 445 secs
lola: 57314704 markings, 341455440 edges, 154250 markings/sec, 450 secs
lola: 58072151 markings, 345444897 edges, 151489 markings/sec, 455 secs
lola: 58729538 markings, 349532741 edges, 131477 markings/sec, 460 secs
lola: 59347126 markings, 353507640 edges, 123518 markings/sec, 465 secs
lola: 59992551 markings, 357524582 edges, 129085 markings/sec, 470 secs
lola: 60631627 markings, 361599772 edges, 127815 markings/sec, 475 secs
lola: 61224024 markings, 365600867 edges, 118479 markings/sec, 480 secs
lola: 61780772 markings, 369529095 edges, 111350 markings/sec, 485 secs
lola: 62399458 markings, 373487456 edges, 123737 markings/sec, 490 secs
lola: 63046135 markings, 377483863 edges, 129335 markings/sec, 495 secs
lola: 63637655 markings, 381492791 edges, 118304 markings/sec, 500 secs
lola: 64187092 markings, 385446708 edges, 109887 markings/sec, 505 secs
lola: 64910591 markings, 389621654 edges, 144700 markings/sec, 510 secs
lola: 65568865 markings, 393813476 edges, 131655 markings/sec, 515 secs
lola: 66269671 markings, 397954055 edges, 140161 markings/sec, 520 secs
lola: 67179343 markings, 401852292 edges, 181934 markings/sec, 525 secs
lola: 67986164 markings, 405720708 edges, 161364 markings/sec, 530 secs
lola: 68798527 markings, 409525142 edges, 162473 markings/sec, 535 secs
lola: 69495267 markings, 413613772 edges, 139348 markings/sec, 540 secs
lola: 70021925 markings, 417804972 edges, 105332 markings/sec, 545 secs
lola: 70550926 markings, 421906879 edges, 105800 markings/sec, 550 secs
lola: 71160532 markings, 426065132 edges, 121921 markings/sec, 555 secs
lola: 71854396 markings, 430220872 edges, 138773 markings/sec, 560 secs
lola: 72427704 markings, 434346773 edges, 114662 markings/sec, 565 secs
lola: 72989122 markings, 438499281 edges, 112284 markings/sec, 570 secs
lola: 73527504 markings, 442526929 edges, 107676 markings/sec, 575 secs
lola: 74074874 markings, 446603648 edges, 109474 markings/sec, 580 secs
lola: 74671758 markings, 450575589 edges, 119377 markings/sec, 585 secs
lola: 75222542 markings, 454617657 edges, 110157 markings/sec, 590 secs
lola: 75731190 markings, 458564588 edges, 101730 markings/sec, 595 secs
lola: 76299468 markings, 462549635 edges, 113656 markings/sec, 600 secs
lola: 76938081 markings, 466563364 edges, 127723 markings/sec, 605 secs
lola: 77491935 markings, 470523367 edges, 110771 markings/sec, 610 secs
lola: 78069255 markings, 474566777 edges, 115464 markings/sec, 615 secs
lola: 78827589 markings, 478474744 edges, 151667 markings/sec, 620 secs
lola: 79370385 markings, 482589588 edges, 108559 markings/sec, 625 secs
lola: 79869854 markings, 486563357 edges, 99894 markings/sec, 630 secs
lola: 80387053 markings, 490435559 edges, 103440 markings/sec, 635 secs
lola: 80944739 markings, 494398455 edges, 111537 markings/sec, 640 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 81310572 markings, 497428933 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-13a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no yes no no no yes no no no
lola:
preliminary result: yes no yes no no yes yes no yes no no no yes no no no
lola: memory consumption: 22152 KB
lola: time consumption: 649 seconds

BK_TIME_CONFINEMENT_REACHED

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

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="DiscoveryGPU-PT-13a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a 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 lola"
echo " Input is DiscoveryGPU-PT-13a, 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 r280-csrt-152749169500129"
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 ;