fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100468
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.590 133000.00 236827.00 469.60 FTTFTTTFTTFTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itstools
Input is BusinessProcesses-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K Mar 24 05:37 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 BusinessProcesses-PT-03-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589250285295

[2020-05-12 02:24:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:24:50] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2020-05-12 02:24:50] [INFO ] Transformed 274 places.
[2020-05-12 02:24:50] [INFO ] Transformed 237 transitions.
[2020-05-12 02:24:50] [INFO ] Found NUPN structural information;
[2020-05-12 02:24:50] [INFO ] Parsed PT model containing 274 places and 237 transitions in 345 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 103 ms.
Incomplete random walk after 100000 steps, including 1173 resets, run finished after 433 ms. (steps per millisecond=230 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:24:51] [INFO ] Computed 43 place invariants in 49 ms
[2020-05-12 02:24:51] [INFO ] [Real]Absence check using 31 positive place invariants in 59 ms returned unsat
[2020-05-12 02:24:52] [INFO ] [Real]Absence check using 31 positive place invariants in 72 ms returned sat
[2020-05-12 02:24:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 9 ms returned sat
[2020-05-12 02:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:52] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2020-05-12 02:24:54] [INFO ] Deduced a trap composed of 8 places in 1593 ms
[2020-05-12 02:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1681 ms
[2020-05-12 02:24:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:24:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 345 ms returned sat
[2020-05-12 02:24:55] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 23 ms returned sat
[2020-05-12 02:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:56] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2020-05-12 02:24:56] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 72 ms.
[2020-05-12 02:24:56] [INFO ] Added : 70 causal constraints over 14 iterations in 604 ms. Result :sat
[2020-05-12 02:24:56] [INFO ] [Real]Absence check using 31 positive place invariants in 59 ms returned unsat
[2020-05-12 02:24:57] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2020-05-12 02:24:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 78 ms returned sat
[2020-05-12 02:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:57] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2020-05-12 02:24:59] [INFO ] Deduced a trap composed of 11 places in 1929 ms
[2020-05-12 02:25:00] [INFO ] Deduced a trap composed of 9 places in 161 ms
[2020-05-12 02:25:00] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-05-12 02:25:00] [INFO ] Deduced a trap composed of 15 places in 667 ms
[2020-05-12 02:25:04] [INFO ] Deduced a trap composed of 72 places in 3795 ms
[2020-05-12 02:25:05] [INFO ] Deduced a trap composed of 27 places in 1050 ms
[2020-05-12 02:25:06] [INFO ] Deduced a trap composed of 23 places in 555 ms
[2020-05-12 02:25:06] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-05-12 02:25:06] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-05-12 02:25:06] [INFO ] Deduced a trap composed of 70 places in 131 ms
[2020-05-12 02:25:07] [INFO ] Deduced a trap composed of 69 places in 417 ms
[2020-05-12 02:25:07] [INFO ] Deduced a trap composed of 74 places in 80 ms
[2020-05-12 02:25:09] [INFO ] Deduced a trap composed of 38 places in 2263 ms
[2020-05-12 02:25:10] [INFO ] Deduced a trap composed of 75 places in 600 ms
[2020-05-12 02:25:10] [INFO ] Deduced a trap composed of 52 places in 127 ms
[2020-05-12 02:25:10] [INFO ] Deduced a trap composed of 35 places in 401 ms
[2020-05-12 02:25:11] [INFO ] Deduced a trap composed of 26 places in 158 ms
[2020-05-12 02:25:11] [INFO ] Deduced a trap composed of 47 places in 116 ms
[2020-05-12 02:25:11] [INFO ] Deduced a trap composed of 76 places in 273 ms
[2020-05-12 02:25:13] [INFO ] Deduced a trap composed of 79 places in 1715 ms
[2020-05-12 02:25:13] [INFO ] Deduced a trap composed of 38 places in 210 ms
[2020-05-12 02:25:13] [INFO ] Deduced a trap composed of 22 places in 280 ms
[2020-05-12 02:25:16] [INFO ] Deduced a trap composed of 23 places in 2534 ms
[2020-05-12 02:25:16] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2020-05-12 02:25:16] [INFO ] Deduced a trap composed of 31 places in 82 ms
[2020-05-12 02:25:16] [INFO ] Deduced a trap composed of 33 places in 187 ms
[2020-05-12 02:25:17] [INFO ] Deduced a trap composed of 36 places in 122 ms
[2020-05-12 02:25:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s29 s30 s35 s62 s63 s79 s80 s81 s85 s86 s87 s88 s123 s124 s125 s134 s144 s149 s178 s179 s180 s184 s189 s194 s212 s213 s214 s230 s231 s268 s269) 0)") while checking expression at index 3
[2020-05-12 02:25:17] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2020-05-12 02:25:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2020-05-12 02:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:25:17] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-05-12 02:25:20] [INFO ] Deduced a trap composed of 8 places in 2822 ms
[2020-05-12 02:25:20] [INFO ] Deduced a trap composed of 63 places in 721 ms
[2020-05-12 02:25:21] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2020-05-12 02:25:21] [INFO ] Deduced a trap composed of 28 places in 147 ms
[2020-05-12 02:25:21] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2020-05-12 02:25:21] [INFO ] Deduced a trap composed of 33 places in 132 ms
[2020-05-12 02:25:21] [INFO ] Deduced a trap composed of 15 places in 144 ms
[2020-05-12 02:25:23] [INFO ] Deduced a trap composed of 12 places in 1327 ms
[2020-05-12 02:25:23] [INFO ] Deduced a trap composed of 39 places in 636 ms
[2020-05-12 02:25:24] [INFO ] Deduced a trap composed of 28 places in 80 ms
[2020-05-12 02:25:24] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2020-05-12 02:25:26] [INFO ] Deduced a trap composed of 43 places in 2318 ms
[2020-05-12 02:25:29] [INFO ] Deduced a trap composed of 15 places in 3125 ms
[2020-05-12 02:25:29] [INFO ] Deduced a trap composed of 22 places in 142 ms
[2020-05-12 02:25:29] [INFO ] Deduced a trap composed of 23 places in 95 ms
[2020-05-12 02:25:30] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-12 02:25:30] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2020-05-12 02:25:30] [INFO ] Deduced a trap composed of 41 places in 87 ms
[2020-05-12 02:25:30] [INFO ] Deduced a trap composed of 30 places in 750 ms
[2020-05-12 02:25:31] [INFO ] Deduced a trap composed of 34 places in 128 ms
[2020-05-12 02:25:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 13781 ms
[2020-05-12 02:25:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:25:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2020-05-12 02:25:31] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 14 ms returned sat
[2020-05-12 02:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:25:31] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2020-05-12 02:25:33] [INFO ] Deduced a trap composed of 8 places in 1463 ms
[2020-05-12 02:25:33] [INFO ] Deduced a trap composed of 63 places in 496 ms
[2020-05-12 02:25:33] [INFO ] Deduced a trap composed of 14 places in 77 ms
[2020-05-12 02:25:33] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2020-05-12 02:25:35] [INFO ] Deduced a trap composed of 32 places in 1572 ms
[2020-05-12 02:25:35] [INFO ] Deduced a trap composed of 33 places in 155 ms
[2020-05-12 02:25:37] [INFO ] Deduced a trap composed of 15 places in 2317 ms
[2020-05-12 02:25:41] [INFO ] Deduced a trap composed of 15 places in 3111 ms
[2020-05-12 02:25:43] [INFO ] Deduced a trap composed of 23 places in 2570 ms
[2020-05-12 02:25:45] [INFO ] Deduced a trap composed of 20 places in 1650 ms
[2020-05-12 02:25:46] [INFO ] Deduced a trap composed of 12 places in 1464 ms
[2020-05-12 02:25:48] [INFO ] Deduced a trap composed of 12 places in 1332 ms
[2020-05-12 02:25:49] [INFO ] Deduced a trap composed of 13 places in 1438 ms
[2020-05-12 02:25:50] [INFO ] Deduced a trap composed of 21 places in 1247 ms
[2020-05-12 02:25:51] [INFO ] Deduced a trap composed of 26 places in 497 ms
[2020-05-12 02:25:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s79 s80 s81 s85 s86 s87 s91 s92 s93 s98 s101 s139 s148 s149 s150 s178 s179 s180 s184 s189 s194 s248 s249) 0)") while checking expression at index 4
[2020-05-12 02:25:51] [INFO ] [Real]Absence check using 31 positive place invariants in 81 ms returned sat
[2020-05-12 02:25:51] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 56 ms returned sat
[2020-05-12 02:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:25:52] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2020-05-12 02:25:54] [INFO ] Deduced a trap composed of 11 places in 2118 ms
[2020-05-12 02:25:56] [INFO ] Deduced a trap composed of 12 places in 2470 ms
[2020-05-12 02:25:58] [INFO ] Deduced a trap composed of 20 places in 1891 ms
[2020-05-12 02:25:59] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-05-12 02:25:59] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2020-05-12 02:26:00] [INFO ] Deduced a trap composed of 31 places in 1005 ms
[2020-05-12 02:26:00] [INFO ] Deduced a trap composed of 29 places in 70 ms
[2020-05-12 02:26:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8065 ms
[2020-05-12 02:26:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 107 ms returned sat
[2020-05-12 02:26:00] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 24 ms returned sat
[2020-05-12 02:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:01] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-05-12 02:26:03] [INFO ] Deduced a trap composed of 11 places in 1782 ms
[2020-05-12 02:26:05] [INFO ] Deduced a trap composed of 20 places in 1948 ms
[2020-05-12 02:26:07] [INFO ] Deduced a trap composed of 11 places in 2586 ms
[2020-05-12 02:26:10] [INFO ] Deduced a trap composed of 32 places in 2496 ms
[2020-05-12 02:26:12] [INFO ] Deduced a trap composed of 20 places in 1736 ms
[2020-05-12 02:26:14] [INFO ] Deduced a trap composed of 12 places in 2012 ms
[2020-05-12 02:26:15] [INFO ] Deduced a trap composed of 14 places in 1683 ms
[2020-05-12 02:26:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 14368 ms
[2020-05-12 02:26:15] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 32 ms.
[2020-05-12 02:26:17] [INFO ] Added : 149 causal constraints over 31 iterations in 1452 ms. Result :sat
[2020-05-12 02:26:17] [INFO ] [Real]Absence check using 31 positive place invariants in 96 ms returned sat
[2020-05-12 02:26:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 36 ms returned sat
[2020-05-12 02:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:18] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2020-05-12 02:26:19] [INFO ] Deduced a trap composed of 8 places in 1587 ms
[2020-05-12 02:26:20] [INFO ] Deduced a trap composed of 28 places in 682 ms
[2020-05-12 02:26:20] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2020-05-12 02:26:21] [INFO ] Deduced a trap composed of 12 places in 947 ms
[2020-05-12 02:26:23] [INFO ] Deduced a trap composed of 15 places in 1864 ms
[2020-05-12 02:26:25] [INFO ] Deduced a trap composed of 27 places in 1913 ms
[2020-05-12 02:26:27] [INFO ] Deduced a trap composed of 14 places in 1859 ms
[2020-05-12 02:26:27] [INFO ] Deduced a trap composed of 24 places in 183 ms
[2020-05-12 02:26:29] [INFO ] Deduced a trap composed of 20 places in 2032 ms
[2020-05-12 02:26:31] [INFO ] Deduced a trap composed of 33 places in 1902 ms
[2020-05-12 02:26:33] [INFO ] Deduced a trap composed of 22 places in 2006 ms
[2020-05-12 02:26:35] [INFO ] Deduced a trap composed of 13 places in 1706 ms
[2020-05-12 02:26:36] [INFO ] Deduced a trap composed of 25 places in 1384 ms
[2020-05-12 02:26:38] [INFO ] Deduced a trap composed of 37 places in 1496 ms
[2020-05-12 02:26:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s15 s18 s19 s20 s21 s40 s41 s42 s62 s63 s98 s101 s128 s129 s130 s134 s139 s144 s149 s178 s179 s180 s184 s189 s194 s219 s220 s225 s260 s261 s264 s265 s268 s269) 0)") while checking expression at index 6
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-12 02:26:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:26:38] [INFO ] Flatten gal took : 191 ms
[2020-05-12 02:26:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:26:38] [INFO ] Flatten gal took : 43 ms
FORMULA BusinessProcesses-PT-03-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:26:38] [INFO ] Applying decomposition
[2020-05-12 02:26:39] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16648073189898792394.txt, -o, /tmp/graph16648073189898792394.bin, -w, /tmp/graph16648073189898792394.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16648073189898792394.bin, -l, -1, -v, -w, /tmp/graph16648073189898792394.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:26:39] [INFO ] Decomposing Gal with order
[2020-05-12 02:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:26:39] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-12 02:26:39] [INFO ] Flatten gal took : 289 ms
[2020-05-12 02:26:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-12 02:26:39] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 22 ms
[2020-05-12 02:26:39] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 44 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 37 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4794e+13,0.44275,13108,1616,24,16301,407,616,28895,49,674,0


Converting to forward existential form...Done !
original formula: ((EX(EF(((i13.i0.u31.p78==1)||(i15.u100.p246==1)))) + AG((i14.u2.p6==1))) + AX((((i0.i0.u6.p13==1)&&(i14.u110.p266==1))||((((i10.i0.u16.p38==1)&&(i5.i2.u34.p85==1))&&(i5.i2.u77.p190==1))&&(i14.u110.p265==1)))))
=> equivalent forward existential formula: [(EY((Init * !((EX(E(TRUE U ((i13.i0.u31.p78==1)||(i15.u100.p246==1)))) + !(E(TRUE U !((i14.u2.p6==1)))))))) * !((((i0.i0.u6.p13==1)&&(i14.u110.p266==1))||((((i10.i0.u16.p38==1)&&(i5.i2.u34.p85==1))&&(i5.i2.u77.p190==1))&&(i14.u110.p265==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t157, t163, t169, t179, i0.i0.t187, i0.i0.u8.t193, i0.i0.u10.t190, i0.i1.t195, i0.i1.u9.t191, i0.i2.t127, i0.i2.u50.t128, i1.t186, i1.t184, i1.u14.t182, i1.u15.t180, i2.i0.u27.t156, i2.i1.t95, i2.i1.u67.t96, i3.t166, i3.u21.t168, i4.i1.u37.t136, i5.i1.t79, i5.i1.u74.t80, i5.i2.t75, i5.i2.u77.t76, i5.i3.t71, i5.i3.u79.t72, i6.i1.t103, i6.i1.u63.t104, i6.i2.t91, i6.i2.u69.t92, i6.i3.t87, i6.i3.u71.t88, i7.i1.t130, i7.i1.u48.t131, i7.i2.t123, i7.i2.u53.t124, i7.i3.t119, i7.i3.u54.t120, i8.u29.t152, i9.t115, i9.u57.t116, i10.i0.u16.t178, i10.i1.t111, i10.i1.u59.t112, i11.i0.t162, i11.i0.u25.t160, i11.i1.t107, i11.i1.u61.t108, i12.i0.t172, i12.i0.u18.t174, i12.i1.t99, i12.i1.u64.t100, i13.i0.u31.t148, i13.i1.t83, i13.i1.u72.t84, i14.t141, i14.t137, i14.u33.t144, i14.u35.t140, i15.t55, i15.t51, i15.t47, i15.t40, i15.t36, i15.t33, i15.t31, i15.t28, i15.t26, i15.t23, i15.t21, i15.t18, i15.t15, i15.t12, i15.t9, i15.t6, i15.t3, i15.u80.t1, i16.t49, i16.u83.t53, i17.t42, i17.t38, i17.u88.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
(forward)formula 0,1,1.40545,44908,1,0,87861,495,3622,133540,239,679,268448
FORMULA BusinessProcesses-PT-03-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E((AF((i16.u85.p215==1)) + EF((i5.i1.u74.p183==1))) U (i13.i0.u32.p80==1))
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((i16.u85.p215==1)))) + E(TRUE U (i5.i1.u74.p183==1)))) * (i13.i0.u32.p80==1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 1,1,8.09267,258484,1,0,560953,544,4010,726896,260,996,914639
FORMULA BusinessProcesses-PT-03-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((((EG((i6.i2.u69.p168==1)) * (i5.i3.u79.p193!=1)) * AX((i6.i0.u43.p107==1))) * (i7.i0.u47.p116==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i7.i0.u47.p116==1)) * (EG((i6.i2.u69.p168==1)) * (i5.i3.u79.p193!=1))) * !(EX(!((i6.i0.u43.p107==1)))))] != FALSE
(forward)formula 2,0,8.48361,268516,1,0,582498,547,4037,755002,261,1005,944901
FORMULA BusinessProcesses-PT-03-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(EF((((i1.u14.p28==1)&&(i6.i1.u63.p154==1))&&(i15.u80.p273==1))) U EF(((i13.i1.u73.p181==1)&&(i15.u84.p211==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,E(TRUE U (((i1.u14.p28==1)&&(i6.i1.u63.p154==1))&&(i15.u80.p273==1)))),TRUE) * ((i13.i1.u73.p181==1)&&(i15.u84.p211==1)))] != FALSE
(forward)formula 3,1,9.18556,285676,1,0,619325,746,4618,805885,283,1388,1023180
FORMULA BusinessProcesses-PT-03-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((i16.u85.p214==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i16.u85.p214==1))] != FALSE
(forward)formula 4,1,9.19927,286204,1,0,619341,746,4619,805978,283,1388,1023987
FORMULA BusinessProcesses-PT-03-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (E(((i15.u86.p217!=1)||(i2.i0.u27.p66!=1)) U (i6.i0.u45.p111==1)) + AG(((((((i15.u80.p273==1)&&(i12.i0.u20.p48==1))&&(i12.i1.u64.p160==1))&&(i12.i0.u96.p237==1))&&((i8.u30.p75==1)||(i0.i0.u11.p26==1))) * EX((i12.i1.u64.p158==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(E(((i15.u86.p217!=1)||(i2.i0.u27.p66!=1)) U (i6.i0.u45.p111==1)))),TRUE) * !((((((i15.u80.p273==1)&&(i12.i0.u20.p48==1))&&(i12.i1.u64.p160==1))&&(i12.i0.u96.p237==1))&&((i8.u30.p75==1)||(i0.i0.u11.p26==1)))))] = FALSE * [(FwdU((Init * !(E(((i15.u86.p217!=1)||(i2.i0.u27.p66!=1)) U (i6.i0.u45.p111==1)))),TRUE) * !(EX((i12.i1.u64.p158==1))))] = FALSE)
(forward)formula 5,1,9.25064,286732,1,0,620509,746,4702,807665,283,1388,1028646
FORMULA BusinessProcesses-PT-03-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(((((i16.u85.p215==1)&&(i5.i2.u76.p191!=1))&&(i3.u99.p244!=1)) * AX(((i9.u57.p138==1)||(i15.u109.p264==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((i16.u85.p215==1)&&(i5.i2.u76.p191!=1))&&(i3.u99.p244!=1))) * !(EX(!(((i9.u57.p138==1)||(i15.u109.p264==1))))))] != FALSE
(forward)formula 6,0,9.2782,286996,1,0,621201,746,4716,808721,283,1388,1031293
FORMULA BusinessProcesses-PT-03-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((AG(((((i0.i0.u10.p22==1)&&(i0.i2.u50.p124==1))&&(i15.u80.p273==1))||(i4.i0.u1.p2==1))) + EF(((i10.i1.u58.p142==1)||(i11.i0.u25.p60==1)))) + AF(AX((i12.i1.u65.p157==1))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(((((i0.i0.u10.p22==1)&&(i0.i2.u50.p124==1))&&(i15.u80.p273==1))||(i4.i0.u1.p2==1))))) + E(TRUE U ((i10.i1.u58.p142==1)||(i11.i0.u25.p60==1)))))),!(!(EX(!((i12.i1.u65.p157==1))))))] = FALSE
(forward)formula 7,1,9.54112,292012,1,0,632286,752,4738,825521,283,1409,1052920
FORMULA BusinessProcesses-PT-03-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: ((AX((i15.u84.p211==1)) + E((i14.u33.p83!=1) U ((i7.i0.u46.p114==1)||(i0.i0.u11.p27==1)))) + ((!(AG((i10.i0.u16.p39==1))) * !(AG((i9.u36.p93==1)))) * EG(AG((i11.i0.u25.p61==1)))))
=> equivalent forward existential formula: [(EY(((Init * !(((!(!(E(TRUE U !((i10.i0.u16.p39==1))))) * !(!(E(TRUE U !((i9.u36.p93==1)))))) * EG(!(E(TRUE U !((i11.i0.u25.p61==1)))))))) * !(E((i14.u33.p83!=1) U ((i7.i0.u46.p114==1)||(i0.i0.u11.p27==1)))))) * !((i15.u84.p211==1)))] = FALSE
(forward)formula 8,1,10.4373,319468,1,0,676746,752,4769,920977,283,1411,1100737
FORMULA BusinessProcesses-PT-03-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((((((i15.u97.p239==1)||((((i9.u36.p91==1)&&(i5.i3.u79.p195==1))&&(i14.u112.p269==1))&&(i7.i1.u49.p117==1)))||(i5.i2.u34.p85!=1))||(i5.i2.u77.p190!=1))||(i14.u110.p265!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((i15.u97.p239==1)||((((i9.u36.p91==1)&&(i5.i3.u79.p195==1))&&(i14.u112.p269==1))&&(i7.i1.u49.p117==1)))||(i5.i2.u34.p85!=1))||(i5.i2.u77.p190!=1))||(i14.u110.p265!=1))))] = FALSE
(forward)formula 9,0,10.4664,319468,1,0,676783,752,4804,921106,283,1411,1101465
FORMULA BusinessProcesses-PT-03-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(AG((i7.i2.u52.p127!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i7.i2.u52.p127!=1)))))] != FALSE
(forward)formula 10,1,10.6167,322372,1,0,683891,752,4806,932414,283,1411,1113596
FORMULA BusinessProcesses-PT-03-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(EF(((i7.i1.u49.p117==1)&&(i10.i0.u93.p232==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i7.i1.u49.p117==1)&&(i10.i0.u93.p232==1)))] = FALSE
(forward)formula 11,0,10.6284,322900,1,0,683943,752,4809,932500,283,1411,1114382
FORMULA BusinessProcesses-PT-03-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(EF(EG((i15.u95.p236==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i15.u95.p236==1))] = FALSE
(forward)formula 12,1,10.6828,324220,1,0,689436,752,4846,935125,283,1411,1125879
FORMULA BusinessProcesses-PT-03-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EF(((i1.u14.p34==1)||(i4.i0.u1.p2==1))) * AG((i3.u21.p52!=1)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i1.u14.p34==1)||(i4.i0.u1.p2==1)))))] = FALSE * [(FwdU(Init,TRUE) * !((i3.u21.p52!=1)))] = FALSE)
(forward)formula 13,0,10.7077,324484,1,0,689631,752,4848,935532,283,1411,1126572
FORMULA BusinessProcesses-PT-03-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (A(((i13.i1.u73.p177!=1)||(i17.u91.p227!=1)) U EF((i15.u92.p229==1))) + AG(!(EF((i0.i0.u8.p19==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!((E(!(E(TRUE U (i15.u92.p229==1))) U (!(((i13.i1.u73.p177!=1)||(i17.u91.p227!=1))) * !(E(TRUE U (i15.u92.p229==1))))) + EG(!(E(TRUE U (i15.u92.p229==1)))))))),TRUE),TRUE) * (i0.i0.u8.p19==1))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 14,1,17.6344,481828,1,0,982666,811,5075,1.38561e+06,298,1544,1466660
FORMULA BusinessProcesses-PT-03-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1589250418295

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;