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

About the Execution of 2021-gold for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
789.571 157191.00 176948.00 2104.40 1 33 33 1 33 1 1 1 19 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 119K Apr 30 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 720K Apr 30 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 30 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Apr 30 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 69K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 281K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 942K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652842522167

Running Version 0
[2022-05-18 02:55:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 02:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:55:24] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2022-05-18 02:55:24] [INFO ] Transformed 3806 places.
[2022-05-18 02:55:24] [INFO ] Transformed 506 transitions.
[2022-05-18 02:55:24] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 506 rows 3806 cols
[2022-05-18 02:55:24] [INFO ] Computed 3301 place invariants in 265 ms
Incomplete random walk after 10000 steps, including 268 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :21
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
// Phase 1: matrix 506 rows 3806 cols
[2022-05-18 02:55:24] [INFO ] Computed 3301 place invariants in 164 ms
[2022-05-18 02:55:25] [INFO ] [Real]Absence check using 3 positive place invariants in 65 ms returned sat
[2022-05-18 02:55:26] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 747 ms returned sat
[2022-05-18 02:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:27] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2022-05-18 02:55:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 45 ms returned sat
[2022-05-18 02:55:28] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 751 ms returned sat
[2022-05-18 02:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:30] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2022-05-18 02:55:30] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 51 ms.
[2022-05-18 02:55:31] [INFO ] Added : 67 causal constraints over 14 iterations in 1473 ms. Result :sat
Minimization took 205 ms.
[2022-05-18 02:55:32] [INFO ] [Real]Absence check using 3 positive place invariants in 51 ms returned sat
[2022-05-18 02:55:33] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 761 ms returned sat
[2022-05-18 02:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:34] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2022-05-18 02:55:34] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 50 ms.
[2022-05-18 02:55:37] [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 close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:55:37] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2022-05-18 02:55:38] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 802 ms returned sat
[2022-05-18 02:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:39] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2022-05-18 02:55:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 36 ms returned sat
[2022-05-18 02:55:41] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 731 ms returned sat
[2022-05-18 02:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:42] [INFO ] [Nat]Absence check using state equation in 1393 ms returned sat
[2022-05-18 02:55:42] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 55 ms.
[2022-05-18 02:55:43] [INFO ] Added : 36 causal constraints over 8 iterations in 892 ms. Result :sat
Minimization took 265 ms.
[2022-05-18 02:55:44] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2022-05-18 02:55:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 743 ms returned sat
[2022-05-18 02:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:46] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2022-05-18 02:55:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2022-05-18 02:55:47] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 760 ms returned sat
[2022-05-18 02:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:48] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2022-05-18 02:55:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2022-05-18 02:55:50] [INFO ] Added : 66 causal constraints over 14 iterations in 1367 ms. Result :sat
Minimization took 484 ms.
[2022-05-18 02:55:50] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2022-05-18 02:55:51] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 747 ms returned sat
[2022-05-18 02:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:53] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2022-05-18 02:55:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2022-05-18 02:55:54] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 751 ms returned sat
[2022-05-18 02:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:55] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2022-05-18 02:55:55] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2022-05-18 02:55:57] [INFO ] Added : 101 causal constraints over 21 iterations in 1910 ms. Result :sat
Minimization took 199 ms.
[2022-05-18 02:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2022-05-18 02:55:58] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 689 ms returned sat
[2022-05-18 02:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:00] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2022-05-18 02:56:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 39 ms returned sat
[2022-05-18 02:56:01] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 719 ms returned sat
[2022-05-18 02:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:02] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2022-05-18 02:56:02] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 34 ms.
[2022-05-18 02:56:03] [INFO ] Added : 49 causal constraints over 10 iterations in 963 ms. Result :sat
Minimization took 202 ms.
[2022-05-18 02:56:04] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2022-05-18 02:56:04] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 744 ms returned sat
[2022-05-18 02:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:06] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2022-05-18 02:56:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2022-05-18 02:56:07] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 741 ms returned sat
[2022-05-18 02:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:08] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2022-05-18 02:56:08] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 42 ms.
[2022-05-18 02:56:10] [INFO ] Added : 78 causal constraints over 16 iterations in 1553 ms. Result :sat
Minimization took 202 ms.
[2022-05-18 02:56:10] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2022-05-18 02:56:11] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 745 ms returned sat
[2022-05-18 02:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:12] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2022-05-18 02:56:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2022-05-18 02:56:14] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 729 ms returned sat
[2022-05-18 02:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:15] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2022-05-18 02:56:15] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 38 ms.
[2022-05-18 02:56:16] [INFO ] Added : 42 causal constraints over 9 iterations in 920 ms. Result :sat
Minimization took 194 ms.
[2022-05-18 02:56:17] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2022-05-18 02:56:17] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 738 ms returned sat
[2022-05-18 02:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:20] [INFO ] [Real]Absence check using state equation in 2814 ms returned sat
[2022-05-18 02:56:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2022-05-18 02:56:21] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 692 ms returned sat
[2022-05-18 02:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:24] [INFO ] [Nat]Absence check using state equation in 2268 ms returned sat
[2022-05-18 02:56:24] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
[2022-05-18 02:56:29] [INFO ] Deduced a trap composed of 5 places in 4270 ms of which 28 ms to minimize.
[2022-05-18 02:56:29] [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 close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 02:56:30] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2022-05-18 02:56:31] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 743 ms returned sat
[2022-05-18 02:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:32] [INFO ] [Real]Absence check using state equation in 1313 ms returned sat
[2022-05-18 02:56:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2022-05-18 02:56:33] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 742 ms returned sat
[2022-05-18 02:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:34] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2022-05-18 02:56:34] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2022-05-18 02:56:35] [INFO ] Added : 33 causal constraints over 7 iterations in 917 ms. Result :sat
Minimization took 187 ms.
[2022-05-18 02:56:36] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2022-05-18 02:56:37] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 688 ms returned sat
[2022-05-18 02:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:38] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2022-05-18 02:56:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2022-05-18 02:56:39] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 705 ms returned sat
[2022-05-18 02:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:40] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2022-05-18 02:56:40] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 50 ms.
[2022-05-18 02:56:42] [INFO ] Added : 102 causal constraints over 21 iterations in 1963 ms. Result :sat
Minimization took 207 ms.
[2022-05-18 02:56:43] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2022-05-18 02:56:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 733 ms returned sat
[2022-05-18 02:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:45] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2022-05-18 02:56:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 36 ms returned sat
[2022-05-18 02:56:46] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 706 ms returned sat
[2022-05-18 02:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:47] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2022-05-18 02:56:47] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 63 ms.
[2022-05-18 02:56:50] [INFO ] Added : 135 causal constraints over 27 iterations in 2588 ms. Result :sat
Minimization took 84 ms.
[2022-05-18 02:56:50] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2022-05-18 02:56:51] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 749 ms returned sat
[2022-05-18 02:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:52] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2022-05-18 02:56:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2022-05-18 02:56:54] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 737 ms returned sat
[2022-05-18 02:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:55] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2022-05-18 02:56:55] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 34 ms.
[2022-05-18 02:56:57] [INFO ] Added : 101 causal constraints over 21 iterations in 1943 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : [1, 1089, -1, -1, 1, 1, 1, -1, 33, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 10500 steps, including 119 resets, run finished after 79 ms. (steps per millisecond=132 ) properties (out of 13) seen :73 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10500 steps, including 121 resets, run finished after 73 ms. (steps per millisecond=143 ) properties (out of 7) seen :68 could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=152 ) properties (out of 7) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4400 steps, including 96 resets, run finished after 28 ms. (steps per millisecond=157 ) properties (out of 7) seen :42 could not realise parikh vector
Incomplete Parikh walk after 8100 steps, including 106 resets, run finished after 59 ms. (steps per millisecond=137 ) properties (out of 7) seen :67 could not realise parikh vector
Incomplete Parikh walk after 5100 steps, including 98 resets, run finished after 33 ms. (steps per millisecond=154 ) properties (out of 7) seen :49 could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 122 resets, run finished after 75 ms. (steps per millisecond=140 ) properties (out of 7) seen :68 could not realise parikh vector
Incomplete Parikh walk after 6900 steps, including 100 resets, run finished after 47 ms. (steps per millisecond=146 ) properties (out of 7) seen :67 could not realise parikh vector
Incomplete Parikh walk after 3600 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=156 ) properties (out of 7) seen :34 could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 99 resets, run finished after 45 ms. (steps per millisecond=155 ) properties (out of 7) seen :67 could not realise parikh vector
Support contains 101 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2580 are kept as prefixes of interest. Removing 1226 places using SCC suffix rule.34 ms
Discarding 1226 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Drop transitions removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 2514 transition count 237
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 334 place count 2482 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 335 place count 2481 transition count 236
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 335 place count 2481 transition count 201
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 65 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 470 place count 2381 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 470 place count 2381 transition count 200
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 473 place count 2379 transition count 200
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 1023 places
Reduce places removed 1055 places and 0 transitions.
Iterating global reduction 3 with 1087 rules applied. Total rules applied 1560 place count 1324 transition count 168
Applied a total of 1560 rules in 467 ms. Remains 1324 /3806 variables (removed 2482) and now considering 168/506 (removed 338) transitions.
Finished structural reductions, in 1 iterations. Remains : 1324/3806 places, 168/506 transitions.
Successfully produced net in file /tmp/petri1000_3906254007555664206.dot
Successfully produced net in file /tmp/petri1001_8212551024227957410.dot
Successfully produced net in file /tmp/petri1002_1219692482460387352.dot
Successfully produced net in file /tmp/petri1003_15810011345617307120.dot
Successfully produced net in file /tmp/petri1004_3830693403284042078.dot
Successfully produced net in file /tmp/petri1005_1820888505431314319.dot
Successfully produced net in file /tmp/petri1006_12644935029864334841.dot
Successfully produced net in file /tmp/petri1007_11149724361502323559.dot
Successfully produced net in file /tmp/petri1008_15056223415005417853.dot
Successfully produced net in file /tmp/petri1009_11040765435855657484.dot
Successfully produced net in file /tmp/petri1010_827264194077667570.dot
Successfully produced net in file /tmp/petri1011_549800062515149813.dot
Successfully produced net in file /tmp/petri1012_13985376703991068624.dot
Successfully produced net in file /tmp/petri1013_14640475326248393969.dot
Successfully produced net in file /tmp/petri1014_13826340647892729389.dot
Successfully produced net in file /tmp/petri1015_3676159581749737088.dot
Successfully produced net in file /tmp/petri1016_11290428975994686107.dot
Successfully produced net in file /tmp/petri1017_17369159487751421158.dot
Successfully produced net in file /tmp/petri1018_7923245498349684888.dot
Successfully produced net in file /tmp/petri1019_10432639047327498408.dot
Successfully produced net in file /tmp/petri1020_2174614061816242206.dot
Successfully produced net in file /tmp/petri1021_13488104634565432102.dot
Successfully produced net in file /tmp/petri1022_3755226686563560694.dot
Successfully produced net in file /tmp/petri1023_14803841220726784650.dot
Successfully produced net in file /tmp/petri1024_2794877756166615719.dot
Successfully produced net in file /tmp/petri1025_7425093197097496884.dot
Successfully produced net in file /tmp/petri1026_7025172224337167561.dot
Successfully produced net in file /tmp/petri1027_17009051712245092120.dot
Successfully produced net in file /tmp/petri1028_4000456134832655684.dot
Successfully produced net in file /tmp/petri1029_7293938766614059420.dot
Successfully produced net in file /tmp/petri1030_16421220372018598605.dot
Successfully produced net in file /tmp/petri1031_6508222047366995134.dot
Successfully produced net in file /tmp/petri1032_14642926376135189390.dot
Drop transitions removed 33 transitions
Dominated transitions for bounds rules discarded 33 transitions
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 135 rows 1323 cols
[2022-05-18 02:56:59] [INFO ] Computed 1188 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 7352 resets, run finished after 19649 ms. (steps per millisecond=50 ) properties (out of 7) seen :94
Interrupted Best-First random walk after 881403 steps, including 303 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen :{0=33, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 779152 steps, including 295 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen :{0=21, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 772822 steps, including 292 resets, run timeout after 5001 ms. (steps per millisecond=154 ) properties seen :{0=23, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 778555 steps, including 295 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen :{0=21, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 809404 steps, including 304 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{0=22, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 836449 steps, including 316 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen :{0=22, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 869734 steps, including 331 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen :{0=22, 1=33, 2=33, 3=1, 4=1, 5=1, 6=1}
// Phase 1: matrix 135 rows 1323 cols
[2022-05-18 02:57:53] [INFO ] Computed 1188 place invariants in 14 ms
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 211 ms returned sat
[2022-05-18 02:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 190 ms returned sat
[2022-05-18 02:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 195 ms returned sat
[2022-05-18 02:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:54] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 199 ms returned sat
[2022-05-18 02:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 186 ms returned sat
[2022-05-18 02:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 191 ms returned sat
[2022-05-18 02:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:55] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2022-05-18 02:57:56] [INFO ] [Real]Absence check using 0 positive and 1188 generalized place invariants in 201 ms returned sat
[2022-05-18 02:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:56] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
Current structural bounds on expressions (after SMT) : [33, 33, 33, 1, 1, 1, 1] Max seen :[33, 33, 33, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652842679358

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is QuasiCertifProtocol-PT-32, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027200376"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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