fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r028-tall-165251935900025
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for BridgeAndVehicles-COL-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5768.231 1935779.00 1981940.00 4810.50 1 50 50 20 1 1 1 1 1 50 1 10 1 50 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251935900025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BridgeAndVehicles-COL-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251935900025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.9K Apr 29 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 23:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 23:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652537341119

Running Version 0
[2022-05-14 14:09:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 14:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:09:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-14 14:09:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:09:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 716 ms
[2022-05-14 14:09:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-14 14:09:03] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 3 ms.
[2022-05-14 14:09:03] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_15334904774411290286.dot
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:09:03] [INFO ] Computed 4 place invariants in 8 ms
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-14 14:09:03] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 36 ms.
[2022-05-14 14:09:03] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:09:03] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:09:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:09:03] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-14 14:09:03] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:09:03] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:09:03] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:09:03] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:09:03] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:09:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:09:03] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:09:03] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:09:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:09:03] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:09:03] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-14 14:09:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:09:04] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:09:04] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:09:04] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:09:04] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:09:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:09:04] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-14 14:09:04] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [1, 50, 1, 1, 50, 20, 1, 1]
[2022-05-14 14:09:04] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 43 ms.
[2022-05-14 14:09:04] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_12920312818143523241.dot
Incomplete random walk after 10000 steps, including 22 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :101
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :57
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-14 14:09:04] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2022-05-14 14:09:04] [INFO ] Computed 7 place invariants in 21 ms
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-14 14:09:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:04] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2022-05-14 14:09:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:04] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-14 14:09:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2022-05-14 14:09:04] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 3 ms to minimize.
[2022-05-14 14:09:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2022-05-14 14:09:05] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 72 ms.
[2022-05-14 14:09:05] [INFO ] Added : 107 causal constraints over 23 iterations in 520 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[7]
Incomplete Parikh walk after 47600 steps, including 526 resets, run finished after 212 ms. (steps per millisecond=224 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 191 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2022-05-14 14:09:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 14:09:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:09:06] [INFO ] Dead Transitions using invariants and state equation in 431 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 14:09:06] [INFO ] Computed 5 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 5211 ms. (steps per millisecond=191 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1030 resets, run finished after 2030 ms. (steps per millisecond=492 ) properties (out of 1) seen :10
[2022-05-14 14:09:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 14:09:13] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:09:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:13] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-14 14:09:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:13] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-14 14:09:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2022-05-14 14:09:14] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2022-05-14 14:09:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-14 14:09:14] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 38 ms.
[2022-05-14 14:09:14] [INFO ] Added : 103 causal constraints over 23 iterations in 783 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 39500 steps, including 463 resets, run finished after 193 ms. (steps per millisecond=204 ) properties (out of 1) seen :8 could not realise parikh vector
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 106 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 103 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 14:09:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 14:09:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:09:15] [INFO ] Implicit Places using invariants in 220 ms returned []
[2022-05-14 14:09:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2022-05-14 14:09:15] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:09:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:16] [INFO ] Implicit Places using invariants and state equation in 735 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 974 ms to find 2 implicit places.
[2022-05-14 14:09:16] [INFO ] Redundant transitions in 93 ms returned []
[2022-05-14 14:09:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:09:16] [INFO ] Dead Transitions using invariants and state equation in 403 ms returned []
Starting structural reductions, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 14:09:16] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-14 14:09:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:09:17] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Finished structural reductions, in 2 iterations. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:17] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4486 ms. (steps per millisecond=222 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 1031 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties (out of 1) seen :10
[2022-05-14 14:09:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:09:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:23] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-14 14:09:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-14 14:09:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2022-05-14 14:09:23] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2022-05-14 14:09:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-14 14:09:23] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 29 ms.
[2022-05-14 14:09:24] [INFO ] Added : 103 causal constraints over 23 iterations in 450 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 60400 steps, including 718 resets, run finished after 173 ms. (steps per millisecond=349 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 63 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 14:09:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:09:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2022-05-14 14:09:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:09:25] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2022-05-14 14:09:25] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-14 14:09:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:09:26] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:26] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :10
[2022-05-14 14:09:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:09:26] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2022-05-14 14:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-14 14:09:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:26] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-14 14:09:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 36 ms returned sat
[2022-05-14 14:09:26] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2022-05-14 14:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-14 14:09:26] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 32 ms.
[2022-05-14 14:09:27] [INFO ] Added : 103 causal constraints over 23 iterations in 480 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 60400 steps, including 716 resets, run finished after 178 ms. (steps per millisecond=339 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 73 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 14:09:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:09:27] [INFO ] Dead Transitions using invariants and state equation in 392 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:27] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000002 steps, including 2622 resets, run finished after 4432 ms. (steps per millisecond=225 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 1031 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 1) seen :10
[2022-05-14 14:09:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:33] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:09:34] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-14 14:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:34] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-14 14:09:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:09:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:09:34] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-14 14:09:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:09:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 38 ms returned sat
[2022-05-14 14:09:34] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2022-05-14 14:09:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-14 14:09:34] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 31 ms.
[2022-05-14 14:09:34] [INFO ] Added : 103 causal constraints over 23 iterations in 431 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Incomplete Parikh walk after 60400 steps, including 720 resets, run finished after 161 ms. (steps per millisecond=375 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2022-05-14 14:09:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:09:35] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-14 14:09:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:09:35] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2022-05-14 14:09:35] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-14 14:09:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2022-05-14 14:09:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:09:36] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 in 10048 ms.
[2022-05-14 14:09:36] [INFO ] Flatten gal took : 236 ms
[2022-05-14 14:09:36] [INFO ] Applying decomposition
[2022-05-14 14:09:36] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4787501937722702283.txt, -o, /tmp/graph4787501937722702283.bin, -w, /tmp/graph4787501937722702283.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4787501937722702283.bin, -l, -1, -v, -w, /tmp/graph4787501937722702283.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 14:09:37] [INFO ] Decomposing Gal with order
[2022-05-14 14:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:09:38] [INFO ] Removed a total of 2769 redundant transitions.
[2022-05-14 14:09:38] [INFO ] Flatten gal took : 890 ms
[2022-05-14 14:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 54 ms.
[2022-05-14 14:09:38] [INFO ] Time to serialize gal into /tmp/UpperBounds18330055723655561014.gal : 8 ms
[2022-05-14 14:09:38] [INFO ] Time to serialize properties into /tmp/UpperBounds4371221670634342922.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18330055723655561014.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4371221670634342922.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18330055723655561014.gal -t CGAL -reachable-file /tmp/UpperBounds4371221670634342922.prop --nowitness
Loading property file /tmp/UpperBounds4371221670634342922.prop.
Detected timeout of ITS tools.
[2022-05-14 14:29:49] [INFO ] Applying decomposition
[2022-05-14 14:29:49] [INFO ] Flatten gal took : 94 ms
[2022-05-14 14:29:49] [INFO ] Decomposing Gal with order
[2022-05-14 14:29:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:29:50] [INFO ] Removed a total of 6981 redundant transitions.
[2022-05-14 14:29:50] [INFO ] Flatten gal took : 191 ms
[2022-05-14 14:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2022-05-14 14:29:50] [INFO ] Time to serialize gal into /tmp/UpperBounds5561376573066515821.gal : 17 ms
[2022-05-14 14:29:50] [INFO ] Time to serialize properties into /tmp/UpperBounds5355787797936264051.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5561376573066515821.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5355787797936264051.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5561376573066515821.gal -t CGAL -reachable-file /tmp/UpperBounds5355787797936264051.prop --nowitness
Loading property file /tmp/UpperBounds5355787797936264051.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.04953e+08,665.192,4527224,1.751e+06,60,1.14721e+07,1912,1690,9.67774e+06,17,3132,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 :0 <= SUR_PONT_B.SUR_PONT_B_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P20N10-UpperBounds-11,0,684.714,4527224,1,0,1.14721e+07,1912,2406,9.67774e+06,35,3132,10947

BK_STOP 1652539276898

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BridgeAndVehicles-COL-V50P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BridgeAndVehicles-COL-V50P20N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251935900025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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