fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482300141
Last Updated
May 14, 2023

About the Execution of Marcie+red for CloudReconfiguration-PT-318

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
706.600 92115.00 109484.00 463.20 1 1 1 1 1 1 1 1 1 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/mcc2023-input.r106-tall-167814482300141.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 CloudReconfiguration-PT-318, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482300141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 661K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678337155956

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-318
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 04:45:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:45:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:45:57] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-09 04:45:57] [INFO ] Transformed 2587 places.
[2023-03-09 04:45:57] [INFO ] Transformed 3099 transitions.
[2023-03-09 04:45:57] [INFO ] Found NUPN structural information;
[2023-03-09 04:45:57] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2023-03-09 04:45:57] [INFO ] Computed 4 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 77 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-318-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2023-03-09 04:45:57] [INFO ] Invariant cache hit.
[2023-03-09 04:45:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:45:59] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2023-03-09 04:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:01] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2023-03-09 04:46:02] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-09 04:46:05] [INFO ] Added : 115 causal constraints over 23 iterations in 3097 ms. Result :unknown
[2023-03-09 04:46:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:06] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-09 04:46:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:08] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-09 04:46:08] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 04:46:11] [INFO ] Added : 135 causal constraints over 27 iterations in 3386 ms. Result :unknown
[2023-03-09 04:46:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:13] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2023-03-09 04:46:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:14] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2023-03-09 04:46:15] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-09 04:46:18] [INFO ] Added : 130 causal constraints over 26 iterations in 3383 ms. Result :unknown
[2023-03-09 04:46:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:19] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-09 04:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:21] [INFO ] [Nat]Absence check using state equation in 1633 ms returned sat
[2023-03-09 04:46:22] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-09 04:46:24] [INFO ] Added : 115 causal constraints over 23 iterations in 2910 ms. Result :unknown
[2023-03-09 04:46:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:26] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2023-03-09 04:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:28] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2023-03-09 04:46:28] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-09 04:46:31] [INFO ] Added : 126 causal constraints over 27 iterations in 3487 ms. Result :unknown
[2023-03-09 04:46:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:33] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-09 04:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:34] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2023-03-09 04:46:35] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-09 04:46:38] [INFO ] Added : 130 causal constraints over 26 iterations in 3371 ms. Result :unknown
[2023-03-09 04:46:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:40] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-09 04:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:41] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2023-03-09 04:46:41] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 04:46:45] [INFO ] Added : 132 causal constraints over 27 iterations in 3409 ms. Result :unknown
[2023-03-09 04:46:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:46] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2023-03-09 04:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:48] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2023-03-09 04:46:48] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 123 ms.
[2023-03-09 04:46:51] [INFO ] Added : 120 causal constraints over 24 iterations in 3382 ms. Result :unknown
[2023-03-09 04:46:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:53] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2023-03-09 04:46:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:46:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:54] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2023-03-09 04:46:55] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-09 04:46:58] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:46:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:46:59] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2023-03-09 04:47:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:47:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:01] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2023-03-09 04:47:01] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-09 04:47:05] [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: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:47:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:06] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-09 04:47:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:47:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:47:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:08] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2023-03-09 04:47:08] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 04:47:11] [INFO ] Added : 140 causal constraints over 28 iterations in 3451 ms. Result :unknown
[2023-03-09 04:47:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:13] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2023-03-09 04:47:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:47:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-09 04:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:14] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2023-03-09 04:47:15] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-09 04:47:18] [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 11
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:47:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 04:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:19] [INFO ] [Real]Absence check using state equation in 1119 ms returned sat
[2023-03-09 04:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:47:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:47:21] [INFO ] [Nat]Absence check using state equation in 1122 ms returned sat
[2023-03-09 04:47:21] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 04:47:25] [INFO ] Added : 140 causal constraints over 28 iterations in 3462 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2928 edges and 2587 vertex of which 839 / 2587 are part of one of the 60 SCC in 15 ms
Free SCC test removed 779 places
Drop transitions removed 948 transitions
Reduce isomorphic transitions removed 948 transitions.
Graph (complete) has 2437 edges and 1808 vertex of which 1794 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1205 place count 1794 transition count 939
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 1 with 1338 rules applied. Total rules applied 2543 place count 600 transition count 795
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 78 rules applied. Total rules applied 2621 place count 533 transition count 784
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 2633 place count 529 transition count 776
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 2643 place count 524 transition count 771
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 2653 place count 522 transition count 763
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2661 place count 514 transition count 763
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2661 place count 514 transition count 739
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2709 place count 490 transition count 739
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2787 place count 412 transition count 661
Iterating global reduction 7 with 78 rules applied. Total rules applied 2865 place count 412 transition count 661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2867 place count 412 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2868 place count 411 transition count 659
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2868 place count 411 transition count 650
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2886 place count 402 transition count 650
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2945 place count 343 transition count 591
Iterating global reduction 9 with 59 rules applied. Total rules applied 3004 place count 343 transition count 591
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 9 with 34 rules applied. Total rules applied 3038 place count 343 transition count 557
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 29 rules applied. Total rules applied 3067 place count 326 transition count 545
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3073 place count 320 transition count 545
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 3092 place count 301 transition count 516
Iterating global reduction 12 with 19 rules applied. Total rules applied 3111 place count 301 transition count 516
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3119 place count 301 transition count 508
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3127 place count 293 transition count 492
Iterating global reduction 13 with 8 rules applied. Total rules applied 3135 place count 293 transition count 492
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3138 place count 290 transition count 486
Iterating global reduction 13 with 3 rules applied. Total rules applied 3141 place count 290 transition count 486
Performed 149 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 13 with 298 rules applied. Total rules applied 3439 place count 141 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3440 place count 141 transition count 258
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3444 place count 139 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3448 place count 139 transition count 252
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3452 place count 137 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3456 place count 137 transition count 246
Performed 35 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 16 with 70 rules applied. Total rules applied 3526 place count 102 transition count 289
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 16 with 33 rules applied. Total rules applied 3559 place count 102 transition count 256
Discarding 19 places :
Symmetric choice reduction at 17 with 19 rule applications. Total rules 3578 place count 83 transition count 218
Iterating global reduction 17 with 19 rules applied. Total rules applied 3597 place count 83 transition count 218
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 3606 place count 83 transition count 209
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 3610 place count 79 transition count 201
Iterating global reduction 18 with 4 rules applied. Total rules applied 3614 place count 79 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 3616 place count 79 transition count 199
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 3626 place count 79 transition count 189
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3627 place count 78 transition count 188
Iterating global reduction 19 with 1 rules applied. Total rules applied 3628 place count 78 transition count 188
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 3632 place count 78 transition count 184
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 3638 place count 74 transition count 182
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 3642 place count 74 transition count 182
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3643 place count 74 transition count 181
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3644 place count 73 transition count 180
Iterating global reduction 20 with 1 rules applied. Total rules applied 3645 place count 73 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3646 place count 72 transition count 179
Applied a total of 3646 rules in 397 ms. Remains 72 /2587 variables (removed 2515) and now considering 179/3099 (removed 2920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 72/2587 places, 179/3099 transitions.
Normalized transition count is 165 out of 179 initially.
// Phase 1: matrix 165 rows 72 cols
[2023-03-09 04:47:25] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 8246 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties (out of 13) seen :13
FORMULA CloudReconfiguration-PT-318-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 89651 ms.
ITS solved all properties within timeout

BK_STOP 1678337248071

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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="CloudReconfiguration-PT-318"
export BK_EXAMINATION="UpperBounds"
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 CloudReconfiguration-PT-318, 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 r106-tall-167814482300141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-318.tgz
mv CloudReconfiguration-PT-318 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 ;