Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 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 LamportFastMutEx-COL-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716522964044

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 03:56:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 03:56:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:56:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 03:56:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 03:56:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 596 ms
[2024-05-24 03:56:05] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-24 03:56:05] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 03:56:05] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 03:56:05] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2] Max Struct:[1, 2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 1, 2, 2]
FORMULA LamportFastMutEx-COL-2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 03:56:05] [INFO ] Invariant cache hit.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 03:56:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:06] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:06] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:06] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:06] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:06] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:06] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:06] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:06] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:06] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:06] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:06] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:06] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:06] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 03:56:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:06] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:06] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:07] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:07] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:07] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:07] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 03:56:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 03:56:07] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2]
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 03:56:07] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 21 ms.
[2024-05-24 03:56:07] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2]
[2024-05-24 03:56:07] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 03:56:07] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2]
RANDOM walk for 10000 steps (2 resets) in 40 ms. (243 steps per ms)
FORMULA LamportFastMutEx-COL-2-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (16 resets) in 91 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 1, 2, 1, 1, 1] Max Struct:[2, 2, 4, 2, 4, 2, 2, 2]
[2024-05-24 03:56:07] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 03:56:07] [INFO ] Invariant cache hit.
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 03:56:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 03:56:07] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 8 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 188 ms
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 93 ms
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 03:56:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 03:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 92 ms
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 127 ms
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 122 ms
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:56:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 73 ms
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Computed and/alt/rep : 56/152/52 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-24 03:56:08] [INFO ] Added : 35 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 16 ms.
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:56:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:09] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:56:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 115 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 1, 2, 1, 1, 1] Max Struct:[1, 1, 2, 1, 2, 1, 2, 1]
FORMULA LamportFastMutEx-COL-2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 62/62 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 40 transition count 58
Applied a total of 8 rules in 19 ms. Remains 40 /44 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 40/44 places, 58/62 transitions.
[2024-05-24 03:56:09] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 40 cols
[2024-05-24 03:56:09] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 861 ms. (1160 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 356 ms. (2801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-05-24 03:56:10] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:10] [INFO ] Invariant cache hit.
[2024-05-24 03:56:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 03:56:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:56:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 03:56:10] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:56:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:10] [INFO ] Computed and/alt/rep : 48/148/46 causal constraints (skipped 4 transitions) in 10 ms.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-24 03:56:10] [INFO ] Added : 28 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-24 03:56:10] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:10] [INFO ] Invariant cache hit.
[2024-05-24 03:56:10] [INFO ] Implicit Places using invariants in 50 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/40 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59 ms. Remains : 38/40 places, 58/58 transitions.
[2024-05-24 03:56:10] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 38 cols
[2024-05-24 03:56:10] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 689 ms. (1449 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 342 ms. (2915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-05-24 03:56:11] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:11] [INFO ] Invariant cache hit.
[2024-05-24 03:56:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 03:56:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 03:56:11] [INFO ] [Real]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 03:56:11] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2024-05-24 03:56:11] [INFO ] Computed and/alt/rep : 52/148/48 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-24 03:56:11] [INFO ] Added : 24 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-24 03:56:11] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:11] [INFO ] Invariant cache hit.
[2024-05-24 03:56:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:56:11] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:11] [INFO ] Invariant cache hit.
[2024-05-24 03:56:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 03:56:11] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 03:56:12] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:56:12] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-05-24 03:56:12] [INFO ] Invariant cache hit.
[2024-05-24 03:56:12] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 5 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 19/27 constraints. Problems are: Problem set: 12 solved, 44 unsolved
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/29 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/29 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 52/90 variables, 38/67 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/79 constraints. Problems are: Problem set: 12 solved, 44 unsolved
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/80 constraints. Problems are: Problem set: 12 solved, 44 unsolved
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/82 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/82 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/82 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 82 constraints, problems are : Problem set: 12 solved, 44 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 12 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/21 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 11/32 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 52/90 variables, 38/70 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 12/82 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 44/126 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/126 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/126 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 126 constraints, problems are : Problem set: 12 solved, 44 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 44/56 constraints, Known Traps: 24/24 constraints]
After SMT, in 2318ms problems are : Problem set: 12 solved, 44 unsolved
Search for dead transitions found 12 dead transitions in 2419ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/38 places, 46/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-24 03:56:14] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2534 ms. Remains : 38/38 places, 46/58 transitions.
[2024-05-24 03:56:14] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2024-05-24 03:56:14] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 634 ms. (1574 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 324 ms. (3076 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:15] [INFO ] Invariant cache hit.
[2024-05-24 03:56:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 03:56:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 03:56:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:15] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:56:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 03:56:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:56:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:56:15] [INFO ] Computed and/alt/rep : 44/124/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 03:56:15] [INFO ] Added : 31 causal constraints over 7 iterations in 31 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 38/38 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:15] [INFO ] Invariant cache hit.
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:15] [INFO ] Invariant cache hit.
[2024-05-24 03:56:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 03:56:15] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:15] [INFO ] Invariant cache hit.
[2024-05-24 03:56:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 7 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:56:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/82 variables, 38/70 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/82 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 81 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:17] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/82 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:56:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/82 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 0/82 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 127 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 27/27 constraints]
After SMT, in 2513ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2514ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2605 ms. Remains : 38/38 places, 46/46 transitions.
RANDOM walk for 40000 steps (8 resets) in 786 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 18 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 7 ms. (steps per millisecond=133 ) properties seen :0
FORMULA LamportFastMutEx-COL-2-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13448 ms.
ITS solved all properties within timeout

BK_STOP 1716522978639

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="LamportFastMutEx-COL-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-COL-2, 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 r223-tall-171649610900205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 ;