About the Execution of Marcie+red for DiscoveryGPU-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5880.184 | 22726.00 | 28842.00 | 437.20 | TFTTFTTTFTFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r138-smll-167819420200297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DiscoveryGPU-PT-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420200297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678738387785
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:13:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:13:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:13:10] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-13 20:13:10] [INFO ] Transformed 73 places.
[2023-03-13 20:13:10] [INFO ] Transformed 99 transitions.
[2023-03-13 20:13:10] [INFO ] Found NUPN structural information;
[2023-03-13 20:13:10] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 92
Applied a total of 7 rules in 19 ms. Remains 73 /73 variables (removed 0) and now considering 92/99 (removed 7) transitions.
// Phase 1: matrix 92 rows 73 cols
[2023-03-13 20:13:11] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-13 20:13:11] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-13 20:13:11] [INFO ] Invariant cache hit.
[2023-03-13 20:13:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-13 20:13:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-13 20:13:11] [INFO ] Invariant cache hit.
[2023-03-13 20:13:11] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/73 places, 92/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 73/73 places, 92/99 transitions.
Support contains 57 out of 73 places after structural reductions.
[2023-03-13 20:13:11] [INFO ] Flatten gal took : 46 ms
[2023-03-13 20:13:11] [INFO ] Flatten gal took : 15 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 92 transitions.
Support contains 56 out of 73 places (down from 57) after GAL structural reductions.
Finished random walk after 1093 steps, including 14 resets, run visited all 50 properties in 128 ms. (steps per millisecond=8 )
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 9 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 92 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 200 edges and 73 vertex of which 66 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 67 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 65 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 65 transition count 84
Applied a total of 16 rules in 14 ms. Remains 65 /73 variables (removed 8) and now considering 84/92 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 65/73 places, 84/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 7 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Graph (complete) has 200 edges and 73 vertex of which 68 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 68 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 58 transition count 77
Applied a total of 21 rules in 21 ms. Remains 58 /73 variables (removed 15) and now considering 77/92 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 58/73 places, 77/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 62 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 62 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 57 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 57 transition count 76
Applied a total of 32 rules in 8 ms. Remains 57 /73 variables (removed 16) and now considering 76/92 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 57/73 places, 76/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Graph (complete) has 200 edges and 73 vertex of which 66 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 66 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 56 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 56 transition count 75
Applied a total of 21 rules in 11 ms. Remains 56 /73 variables (removed 17) and now considering 75/92 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 56/73 places, 75/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 61 transition count 80
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 61 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 56 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 56 transition count 75
Applied a total of 34 rules in 8 ms. Remains 56 /73 variables (removed 17) and now considering 75/92 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 56/73 places, 75/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 64 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 64 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 61 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 61 transition count 80
Applied a total of 24 rules in 7 ms. Remains 61 /73 variables (removed 12) and now considering 80/92 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 61/73 places, 80/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 63 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 59 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 59 transition count 78
Applied a total of 28 rules in 9 ms. Remains 59 /73 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/73 places, 78/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Graph (complete) has 200 edges and 73 vertex of which 67 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 71 edges and 64 vertex of which 52 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 58 edges and 52 vertex of which 28 / 52 are part of one of the 14 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 38 transition count 65
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 35 place count 30 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 25 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 25 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 20 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 20 transition count 31
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 15 transition count 21
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 15 transition count 21
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 10 transition count 16
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 10 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 10 transition count 15
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 7 transition count 12
Applied a total of 80 rules in 16 ms. Remains 7 /73 variables (removed 66) and now considering 12/92 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 7/73 places, 12/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 0 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 61 transition count 80
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 61 transition count 80
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 55 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 55 transition count 74
Applied a total of 36 rules in 7 ms. Remains 55 /73 variables (removed 18) and now considering 74/92 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/73 places, 74/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 61 transition count 80
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 61 transition count 80
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 55 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 55 transition count 74
Applied a total of 36 rules in 8 ms. Remains 55 /73 variables (removed 18) and now considering 74/92 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 55/73 places, 74/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Graph (complete) has 200 edges and 73 vertex of which 66 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 70 edges and 63 vertex of which 52 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 57 edges and 52 vertex of which 28 / 52 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 38 transition count 66
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 33 place count 31 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 27 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 27 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 23 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 23 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 19 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 19 transition count 28
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 15 transition count 24
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 15 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 15 transition count 23
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 14 transition count 22
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 71 place count 11 transition count 19
Applied a total of 71 rules in 12 ms. Remains 11 /73 variables (removed 62) and now considering 19/92 (removed 73) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 11/73 places, 19/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 1 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 64 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 64 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 62 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 62 transition count 81
Applied a total of 22 rules in 6 ms. Remains 62 /73 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 62/73 places, 81/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 62 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 62 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 57 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 57 transition count 76
Applied a total of 32 rules in 5 ms. Remains 57 /73 variables (removed 16) and now considering 76/92 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/73 places, 76/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 63 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 63 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 59 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 59 transition count 78
Applied a total of 28 rules in 3 ms. Remains 59 /73 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/73 places, 78/92 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 22 ms
[2023-03-13 20:13:12] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 7 ms
[2023-03-13 20:13:12] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:12] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 20:13:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 92 transitions and 290 arcs took 1 ms.
Total runtime 2045 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 73 NrTr: 92 NrArc: 290)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.384sec
RS generation: 0m 0.163sec
-> reachability set: #nodes 4660 (4.7e+03) #states 19,487,172 (7)
starting MCC model checker
--------------------------
checking: AX [AG [EX [EG [[p47<=0 & 0<=p47]]]]]
normalized: ~ [EX [E [true U ~ [EX [EG [[p47<=0 & 0<=p47]]]]]]]
abstracting: (0<=p47)
states: 19,487,172 (7)
abstracting: (p47<=0)
states: 17,715,611 (7)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.571sec
checking: EF [AX [AG [[[p13<=0 & 0<=p13] | [p27<=1 & 1<=p27]]]]]
normalized: E [true U ~ [EX [E [true U ~ [[[p27<=1 & 1<=p27] | [p13<=0 & 0<=p13]]]]]]]
abstracting: (0<=p13)
states: 19,487,172 (7)
abstracting: (p13<=0)
states: 17,715,611 (7)
abstracting: (1<=p27)
states: 1,771,561 (6)
abstracting: (p27<=1)
states: 19,487,172 (7)
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.356sec
checking: [EF [[p32<=1 & 1<=p32]] | AF [EG [AG [[p43<=1 & 1<=p43]]]]]
normalized: [~ [EG [~ [EG [~ [E [true U ~ [[p43<=1 & 1<=p43]]]]]]]] | E [true U [p32<=1 & 1<=p32]]]
abstracting: (1<=p32)
states: 1,771,561 (6)
abstracting: (p32<=1)
states: 19,487,172 (7)
abstracting: (1<=p43)
states: 1,771,561 (6)
abstracting: (p43<=1)
states: 19,487,172 (7)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.136sec
checking: [EG [EF [[[p55<=1 & 1<=p55] & [p33<=1 & 1<=p33]]]] | EF [AX [EF [[p61<=1 & 1<=p61]]]]]
normalized: [E [true U ~ [EX [~ [E [true U [p61<=1 & 1<=p61]]]]]] | EG [E [true U [[p33<=1 & 1<=p33] & [p55<=1 & 1<=p55]]]]]
abstracting: (1<=p55)
states: 1,771,561 (6)
abstracting: (p55<=1)
states: 19,487,172 (7)
abstracting: (1<=p33)
states: 1,771,561 (6)
abstracting: (p33<=1)
states: 19,487,172 (7)
.
EG iterations: 1
abstracting: (1<=p61)
states: 1,771,561 (6)
abstracting: (p61<=1)
states: 19,487,172 (7)
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.570sec
checking: EX [E [[EF [[[p7<=0 & 0<=p7] | [p5<=1 & 1<=p5]]] | AX [EX [[p17<=0 & 0<=p17]]]] U EF [~ [EG [[p2<=0 & 0<=p2]]]]]]
normalized: EX [E [[~ [EX [~ [EX [[p17<=0 & 0<=p17]]]]] | E [true U [[p5<=1 & 1<=p5] | [p7<=0 & 0<=p7]]]] U E [true U ~ [EG [[p2<=0 & 0<=p2]]]]]]
abstracting: (0<=p2)
states: 19,487,172 (7)
abstracting: (p2<=0)
states: 17,715,611 (7)
....................
EG iterations: 20
abstracting: (0<=p7)
states: 19,487,172 (7)
abstracting: (p7<=0)
states: 17,715,611 (7)
abstracting: (1<=p5)
states: 1,771,561 (6)
abstracting: (p5<=1)
states: 19,487,172 (7)
abstracting: (0<=p17)
states: 19,487,172 (7)
abstracting: (p17<=0)
states: 17,715,611 (7)
...-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.527sec
checking: EF [[EX [[[p65<=0 & 0<=p65] | [[p29<=1 & 1<=p29] | [p42<=1 & 1<=p42]]]] & AG [[p36<=1 & 1<=p36]]]]
normalized: E [true U [~ [E [true U ~ [[p36<=1 & 1<=p36]]]] & EX [[[[p42<=1 & 1<=p42] | [p29<=1 & 1<=p29]] | [p65<=0 & 0<=p65]]]]]
abstracting: (0<=p65)
states: 19,487,172 (7)
abstracting: (p65<=0)
states: 17,715,611 (7)
abstracting: (1<=p29)
states: 1,771,561 (6)
abstracting: (p29<=1)
states: 19,487,172 (7)
abstracting: (1<=p42)
states: 1,771,561 (6)
abstracting: (p42<=1)
states: 19,487,172 (7)
.abstracting: (1<=p36)
states: 1,771,561 (6)
abstracting: (p36<=1)
states: 19,487,172 (7)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.081sec
checking: EX [EX [[AF [[[p42<=0 & 0<=p42] | [p15<=1 & 1<=p15]]] & [EG [[p12<=1 & 1<=p12]] | [[p59<=1 & 1<=p59] & [p19<=0 & 0<=p19]]]]]]
normalized: EX [EX [[[[[p19<=0 & 0<=p19] & [p59<=1 & 1<=p59]] | EG [[p12<=1 & 1<=p12]]] & ~ [EG [~ [[[p15<=1 & 1<=p15] | [p42<=0 & 0<=p42]]]]]]]]
abstracting: (0<=p42)
states: 19,487,172 (7)
abstracting: (p42<=0)
states: 17,715,611 (7)
abstracting: (1<=p15)
states: 1,771,561 (6)
abstracting: (p15<=1)
states: 19,487,172 (7)
.....................
EG iterations: 21
abstracting: (1<=p12)
states: 1,771,561 (6)
abstracting: (p12<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
abstracting: (1<=p59)
states: 1,771,561 (6)
abstracting: (p59<=1)
states: 19,487,172 (7)
abstracting: (0<=p19)
states: 19,487,172 (7)
abstracting: (p19<=0)
states: 17,715,611 (7)
..-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.158sec
checking: EG [[E [[~ [[~ [[[p53<=0 & 0<=p53] | [p2<=1 & 1<=p2]]] | [[p39<=0 & 0<=p39] | [p38<=1 & 1<=p38]]]] | ~ [[p26<=1 & 1<=p26]]] U [p71<=0 & 0<=p71]] & EF [[[p7<=1 & 1<=p7] | [p15<=0 & 0<=p15]]]]]
normalized: EG [[E [true U [[p15<=0 & 0<=p15] | [p7<=1 & 1<=p7]]] & E [[~ [[p26<=1 & 1<=p26]] | ~ [[[[p38<=1 & 1<=p38] | [p39<=0 & 0<=p39]] | ~ [[[p2<=1 & 1<=p2] | [p53<=0 & 0<=p53]]]]]] U [p71<=0 & 0<=p71]]]]
abstracting: (0<=p71)
states: 19,487,172 (7)
abstracting: (p71<=0)
states: 1
abstracting: (0<=p53)
states: 19,487,172 (7)
abstracting: (p53<=0)
states: 17,715,611 (7)
abstracting: (1<=p2)
states: 1,771,561 (6)
abstracting: (p2<=1)
states: 19,487,172 (7)
abstracting: (0<=p39)
states: 19,487,172 (7)
abstracting: (p39<=0)
states: 17,715,611 (7)
abstracting: (1<=p38)
states: 1,771,561 (6)
abstracting: (p38<=1)
states: 19,487,172 (7)
abstracting: (1<=p26)
states: 1,771,561 (6)
abstracting: (p26<=1)
states: 19,487,172 (7)
abstracting: (1<=p7)
states: 1,771,561 (6)
abstracting: (p7<=1)
states: 19,487,172 (7)
abstracting: (0<=p15)
states: 19,487,172 (7)
abstracting: (p15<=0)
states: 17,715,611 (7)
..
EG iterations: 2
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: EX [[[p72<=1 & 1<=p72] & [EF [[[p66<=0 & 0<=p66] | AF [[p54<=1 & 1<=p54]]]] & A [EF [[p24<=1 & 1<=p24]] U [[[p56<=0 & 0<=p56] | [p18<=1 & 1<=p18]] | [[p4<=0 & 0<=p4] | [p27<=1 & 1<=p27]]]]]]]
normalized: EX [[[[~ [EG [~ [[[[p27<=1 & 1<=p27] | [p4<=0 & 0<=p4]] | [[p18<=1 & 1<=p18] | [p56<=0 & 0<=p56]]]]]] & ~ [E [~ [[[[p27<=1 & 1<=p27] | [p4<=0 & 0<=p4]] | [[p18<=1 & 1<=p18] | [p56<=0 & 0<=p56]]]] U [~ [E [true U [p24<=1 & 1<=p24]]] & ~ [[[[p27<=1 & 1<=p27] | [p4<=0 & 0<=p4]] | [[p18<=1 & 1<=p18] | [p56<=0 & 0<=p56]]]]]]]] & E [true U [~ [EG [~ [[p54<=1 & 1<=p54]]]] | [p66<=0 & 0<=p66]]]] & [p72<=1 & 1<=p72]]]
abstracting: (1<=p72)
states: 19,487,171 (7)
abstracting: (p72<=1)
states: 19,487,172 (7)
abstracting: (0<=p66)
states: 19,487,172 (7)
abstracting: (p66<=0)
states: 17,715,611 (7)
abstracting: (1<=p54)
states: 1,771,561 (6)
abstracting: (p54<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
abstracting: (0<=p56)
states: 19,487,172 (7)
abstracting: (p56<=0)
states: 17,715,611 (7)
abstracting: (1<=p18)
states: 1,771,561 (6)
abstracting: (p18<=1)
states: 19,487,172 (7)
abstracting: (0<=p4)
states: 19,487,172 (7)
abstracting: (p4<=0)
states: 17,715,611 (7)
abstracting: (1<=p27)
states: 1,771,561 (6)
abstracting: (p27<=1)
states: 19,487,172 (7)
abstracting: (1<=p24)
states: 1,771,561 (6)
abstracting: (p24<=1)
states: 19,487,172 (7)
abstracting: (0<=p56)
states: 19,487,172 (7)
abstracting: (p56<=0)
states: 17,715,611 (7)
abstracting: (1<=p18)
states: 1,771,561 (6)
abstracting: (p18<=1)
states: 19,487,172 (7)
abstracting: (0<=p4)
states: 19,487,172 (7)
abstracting: (p4<=0)
states: 17,715,611 (7)
abstracting: (1<=p27)
states: 1,771,561 (6)
abstracting: (p27<=1)
states: 19,487,172 (7)
abstracting: (0<=p56)
states: 19,487,172 (7)
abstracting: (p56<=0)
states: 17,715,611 (7)
abstracting: (1<=p18)
states: 1,771,561 (6)
abstracting: (p18<=1)
states: 19,487,172 (7)
abstracting: (0<=p4)
states: 19,487,172 (7)
abstracting: (p4<=0)
states: 17,715,611 (7)
abstracting: (1<=p27)
states: 1,771,561 (6)
abstracting: (p27<=1)
states: 19,487,172 (7)
.................
EG iterations: 17
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.098sec
checking: AG [[A [[EG [AG [[[p36<=1 & 1<=p36] | [p61<=0 & 0<=p61]]]] | ~ [[p54<=0 & 0<=p54]]] U [A [[p24<=0 & 0<=p24] U AG [[[p30<=0 & 0<=p30] | [p14<=1 & 1<=p14]]]] | [[p51<=0 & 0<=p51] | [p14<=1 & 1<=p14]]]] & AF [[p63<=0 & 0<=p63]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[~ [EG [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]]]] & ~ [E [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] U [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] & ~ [[p24<=0 & 0<=p24]]]]]] | [[p14<=1 & 1<=p14] | [p51<=0 & 0<=p51]]]]]] & ~ [E [~ [[[~ [EG [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]]]] & ~ [E [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] U [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] & ~ [[p24<=0 & 0<=p24]]]]]] | [[p14<=1 & 1<=p14] | [p51<=0 & 0<=p51]]]] U [~ [[[~ [EG [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]]]] & ~ [E [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] U [E [true U ~ [[[p14<=1 & 1<=p14] | [p30<=0 & 0<=p30]]]] & ~ [[p24<=0 & 0<=p24]]]]]] | [[p14<=1 & 1<=p14] | [p51<=0 & 0<=p51]]]] & ~ [[~ [[p54<=0 & 0<=p54]] | EG [~ [E [true U ~ [[[p36<=1 & 1<=p36] | [p61<=0 & 0<=p61]]]]]]]]]]]] & ~ [EG [~ [[p63<=0 & 0<=p63]]]]]]]]
abstracting: (0<=p63)
states: 19,487,172 (7)
abstracting: (p63<=0)
states: 17,715,611 (7)
....................
EG iterations: 20
abstracting: (0<=p61)
states: 19,487,172 (7)
abstracting: (p61<=0)
states: 17,715,611 (7)
abstracting: (1<=p36)
states: 1,771,561 (6)
abstracting: (p36<=1)
states: 19,487,172 (7)
.
EG iterations: 1
abstracting: (0<=p54)
states: 19,487,172 (7)
abstracting: (p54<=0)
states: 17,715,611 (7)
abstracting: (0<=p51)
states: 19,487,172 (7)
abstracting: (p51<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p24)
states: 19,487,172 (7)
abstracting: (p24<=0)
states: 17,715,611 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
abstracting: (0<=p51)
states: 19,487,172 (7)
abstracting: (p51<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p24)
states: 19,487,172 (7)
abstracting: (p24<=0)
states: 17,715,611 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
abstracting: (0<=p51)
states: 19,487,172 (7)
abstracting: (p51<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p24)
states: 19,487,172 (7)
abstracting: (p24<=0)
states: 17,715,611 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
abstracting: (0<=p30)
states: 19,487,172 (7)
abstracting: (p30<=0)
states: 17,715,611 (7)
abstracting: (1<=p14)
states: 1,771,561 (6)
abstracting: (p14<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
................
EG iterations: 16
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.392sec
checking: EF [[AG [AX [[[p33<=0 & 0<=p33] & [p30<=1 & 1<=p30]]]] | [AF [~ [E [[[p16<=0 & 0<=p16] | [p62<=1 & 1<=p62]] U [[p11<=0 & 0<=p11] | [p20<=1 & 1<=p20]]]]] | [[p70<=0 & 0<=p70] & [[p34<=1 & 1<=p34] & [[p10<=1 & 1<=p10] | [p5<=1 & 1<=p5]]]]]]]
normalized: E [true U [[~ [EG [E [[[p62<=1 & 1<=p62] | [p16<=0 & 0<=p16]] U [[p20<=1 & 1<=p20] | [p11<=0 & 0<=p11]]]]] | [[[[p10<=1 & 1<=p10] | [p5<=1 & 1<=p5]] & [p34<=1 & 1<=p34]] & [p70<=0 & 0<=p70]]] | ~ [E [true U EX [~ [[[p30<=1 & 1<=p30] & [p33<=0 & 0<=p33]]]]]]]]
abstracting: (0<=p33)
states: 19,487,172 (7)
abstracting: (p33<=0)
states: 17,715,611 (7)
abstracting: (1<=p30)
states: 1,771,561 (6)
abstracting: (p30<=1)
states: 19,487,172 (7)
.abstracting: (0<=p70)
states: 19,487,172 (7)
abstracting: (p70<=0)
states: 17,715,611 (7)
abstracting: (1<=p34)
states: 1,771,561 (6)
abstracting: (p34<=1)
states: 19,487,172 (7)
abstracting: (1<=p5)
states: 1,771,561 (6)
abstracting: (p5<=1)
states: 19,487,172 (7)
abstracting: (1<=p10)
states: 1,771,561 (6)
abstracting: (p10<=1)
states: 19,487,172 (7)
abstracting: (0<=p11)
states: 19,487,172 (7)
abstracting: (p11<=0)
states: 17,715,611 (7)
abstracting: (1<=p20)
states: 1,771,561 (6)
abstracting: (p20<=1)
states: 19,487,172 (7)
abstracting: (0<=p16)
states: 19,487,172 (7)
abstracting: (p16<=0)
states: 17,715,611 (7)
abstracting: (1<=p62)
states: 1,771,561 (6)
abstracting: (p62<=1)
states: 19,487,172 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.599sec
checking: EF [[EG [[~ [[0<=p54 & p54<=0]] & ~ [[p31<=1 & 1<=p31]]]] & [AX [[[p21<=1 & 1<=p21] | [p1<=0 & 0<=p1]]] | [AF [[[[p1<=0 & 0<=p1] | [p28<=1 & 1<=p28]] & EG [[[p10<=0 & 0<=p10] & [p67<=1 & 1<=p67]]]]] | [EX [[p17<=1 & 1<=p17]] & [[p63<=1 & 1<=p63] & [p55<=1 & 1<=p55]]]]]]]
normalized: E [true U [[[[[[p55<=1 & 1<=p55] & [p63<=1 & 1<=p63]] & EX [[p17<=1 & 1<=p17]]] | ~ [EG [~ [[EG [[[p67<=1 & 1<=p67] & [p10<=0 & 0<=p10]]] & [[p28<=1 & 1<=p28] | [p1<=0 & 0<=p1]]]]]]] | ~ [EX [~ [[[p1<=0 & 0<=p1] | [p21<=1 & 1<=p21]]]]]] & EG [[~ [[p31<=1 & 1<=p31]] & ~ [[0<=p54 & p54<=0]]]]]]
abstracting: (p54<=0)
states: 17,715,611 (7)
abstracting: (0<=p54)
states: 19,487,172 (7)
abstracting: (1<=p31)
states: 1,771,561 (6)
abstracting: (p31<=1)
states: 19,487,172 (7)
..................
EG iterations: 18
abstracting: (1<=p21)
states: 1,771,561 (6)
abstracting: (p21<=1)
states: 19,487,172 (7)
abstracting: (0<=p1)
states: 19,487,172 (7)
abstracting: (p1<=0)
states: 17,715,611 (7)
.abstracting: (0<=p1)
states: 19,487,172 (7)
abstracting: (p1<=0)
states: 17,715,611 (7)
abstracting: (1<=p28)
states: 1,771,561 (6)
abstracting: (p28<=1)
states: 19,487,172 (7)
abstracting: (0<=p10)
states: 19,487,172 (7)
abstracting: (p10<=0)
states: 17,715,611 (7)
abstracting: (1<=p67)
states: 1,771,561 (6)
abstracting: (p67<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
.
EG iterations: 1
abstracting: (1<=p17)
states: 1,771,561 (6)
abstracting: (p17<=1)
states: 19,487,172 (7)
.abstracting: (1<=p63)
states: 1,771,561 (6)
abstracting: (p63<=1)
states: 19,487,172 (7)
abstracting: (1<=p55)
states: 1,771,561 (6)
abstracting: (p55<=1)
states: 19,487,172 (7)
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.389sec
checking: ~ [E [[[[EX [0<=0] & [[[p68<=0 & 0<=p68] | [p42<=1 & 1<=p42]] & [[p72<=1 & 1<=p72] | [[p60<=0 & 0<=p60] | ~ [[p28<=1 & 1<=p28]]]]]] | [p45<=1 & 1<=p45]] & EF [[[[p49<=0 & 0<=p49] | [p3<=1 & 1<=p3]] & EF [[p41<=0 & 0<=p41]]]]] U [[[[p22<=0 & 0<=p22] | [p46<=1 & 1<=p46]] & AG [[p5<=0 & 0<=p5]]] | [A [[[EF [[[p65<=0 & 0<=p65] | [p70<=1 & 1<=p70]]] | [p4<=0 & 0<=p4]] | [[p33<=0 & 0<=p33] | [p66<=1 & 1<=p66]]] U [~ [[p42<=1 & 1<=p42]] | EX [[p15<=1 & 1<=p15]]]] & EG [[p18<=1 & 1<=p18]]]]]]
normalized: ~ [E [[E [true U [E [true U [p41<=0 & 0<=p41]] & [[p3<=1 & 1<=p3] | [p49<=0 & 0<=p49]]]] & [[p45<=1 & 1<=p45] | [[[[~ [[p28<=1 & 1<=p28]] | [p60<=0 & 0<=p60]] | [p72<=1 & 1<=p72]] & [[p42<=1 & 1<=p42] | [p68<=0 & 0<=p68]]] & EX [0<=0]]]] U [[EG [[p18<=1 & 1<=p18]] & [~ [EG [~ [[EX [[p15<=1 & 1<=p15]] | ~ [[p42<=1 & 1<=p42]]]]]] & ~ [E [~ [[EX [[p15<=1 & 1<=p15]] | ~ [[p42<=1 & 1<=p42]]]] U [~ [[[[p66<=1 & 1<=p66] | [p33<=0 & 0<=p33]] | [[p4<=0 & 0<=p4] | E [true U [[p70<=1 & 1<=p70] | [p65<=0 & 0<=p65]]]]]] & ~ [[EX [[p15<=1 & 1<=p15]] | ~ [[p42<=1 & 1<=p42]]]]]]]]] | [~ [E [true U ~ [[p5<=0 & 0<=p5]]]] & [[p46<=1 & 1<=p46] | [p22<=0 & 0<=p22]]]]]]
abstracting: (0<=p22)
states: 19,487,172 (7)
abstracting: (p22<=0)
states: 17,715,611 (7)
abstracting: (1<=p46)
states: 1,771,561 (6)
abstracting: (p46<=1)
states: 19,487,172 (7)
abstracting: (0<=p5)
states: 19,487,172 (7)
abstracting: (p5<=0)
states: 17,715,611 (7)
abstracting: (1<=p42)
states: 1,771,561 (6)
abstracting: (p42<=1)
states: 19,487,172 (7)
abstracting: (1<=p15)
states: 1,771,561 (6)
abstracting: (p15<=1)
states: 19,487,172 (7)
.abstracting: (0<=p65)
states: 19,487,172 (7)
abstracting: (p65<=0)
states: 17,715,611 (7)
abstracting: (1<=p70)
states: 1,771,561 (6)
abstracting: (p70<=1)
states: 19,487,172 (7)
abstracting: (0<=p4)
states: 19,487,172 (7)
abstracting: (p4<=0)
states: 17,715,611 (7)
abstracting: (0<=p33)
states: 19,487,172 (7)
abstracting: (p33<=0)
states: 17,715,611 (7)
abstracting: (1<=p66)
states: 1,771,561 (6)
abstracting: (p66<=1)
states: 19,487,172 (7)
abstracting: (1<=p42)
states: 1,771,561 (6)
abstracting: (p42<=1)
states: 19,487,172 (7)
abstracting: (1<=p15)
states: 1,771,561 (6)
abstracting: (p15<=1)
states: 19,487,172 (7)
.abstracting: (1<=p42)
states: 1,771,561 (6)
abstracting: (p42<=1)
states: 19,487,172 (7)
abstracting: (1<=p15)
states: 1,771,561 (6)
abstracting: (p15<=1)
states: 19,487,172 (7)
.....................
EG iterations: 20
abstracting: (1<=p18)
states: 1,771,561 (6)
abstracting: (p18<=1)
states: 19,487,172 (7)
....................
EG iterations: 20
abstracting: (0<=0)
states: 19,487,172 (7)
.abstracting: (0<=p68)
states: 19,487,172 (7)
abstracting: (p68<=0)
states: 17,715,611 (7)
abstracting: (1<=p42)
states: 1,771,561 (6)
abstracting: (p42<=1)
states: 19,487,172 (7)
abstracting: (1<=p72)
states: 19,487,171 (7)
abstracting: (p72<=1)
states: 19,487,172 (7)
abstracting: (0<=p60)
states: 19,487,172 (7)
abstracting: (p60<=0)
states: 17,715,611 (7)
abstracting: (1<=p28)
states: 1,771,561 (6)
abstracting: (p28<=1)
states: 19,487,172 (7)
abstracting: (1<=p45)
states: 1,771,561 (6)
abstracting: (p45<=1)
states: 19,487,172 (7)
abstracting: (0<=p49)
states: 19,487,172 (7)
abstracting: (p49<=0)
states: 17,715,611 (7)
abstracting: (1<=p3)
states: 1,771,561 (6)
abstracting: (p3<=1)
states: 19,487,172 (7)
abstracting: (0<=p41)
states: 19,487,172 (7)
abstracting: (p41<=0)
states: 17,715,611 (7)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.692sec
totally nodes used: 5755875 (5.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7221611 16358914 23580525
used/not used/entry size/cache size: 17644744 49464120 16 1024MB
basic ops cache: hits/miss/sum: 2071135 5020679 7091814
used/not used/entry size/cache size: 7654955 9122261 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 44694 93194 137888
used/not used/entry size/cache size: 92677 8295931 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61898938
1 4727856
2 424859
3 51130
4 5532
5 514
6 32
7 3
8 0
9 0
>= 10 0
Total processing time: 0m16.534sec
BK_STOP 1678738410511
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:2158 (23), effective:71 (0)
initing FirstDep: 0m 0.000sec
iterations count:1926 (20), effective:71 (0)
iterations count:362 (3), effective:9 (0)
iterations count:1128 (12), effective:46 (0)
iterations count:365 (3), effective:9 (0)
iterations count:94 (1), effective:1 (0)
iterations count:541 (5), effective:14 (0)
iterations count:499 (5), effective:10 (0)
iterations count:1623 (17), effective:63 (0)
iterations count:302 (3), effective:9 (0)
iterations count:100 (1), effective:1 (0)
iterations count:92 (1), effective:0 (0)
iterations count:93 (1), effective:1 (0)
iterations count:92 (1), effective:0 (0)
iterations count:120 (1), effective:1 (0)
iterations count:234 (2), effective:4 (0)
iterations count:313 (3), effective:7 (0)
iterations count:160 (1), effective:3 (0)
iterations count:500 (5), effective:11 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:92 (1), effective:0 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:150 (1), effective:2 (0)
iterations count:748 (8), effective:18 (0)
iterations count:147 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:2068 (22), effective:77 (0)
iterations count:380 (4), effective:10 (0)
iterations count:234 (2), effective:7 (0)
iterations count:145 (1), effective:1 (0)
iterations count:94 (1), effective:1 (0)
iterations count:109 (1), effective:1 (0)
iterations count:506 (5), effective:15 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-07a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DiscoveryGPU-PT-07a, 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 r138-smll-167819420200297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;