About the Execution of Marcie+red for PolyORBNT-COL-S10J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8804.796 | 3600000.00 | 3668116.00 | 8626.50 | 10 10 41 1 1 1 4 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.r298-tall-167873952100693.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 PolyORBNT-COL-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 12K Feb 26 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:53 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 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 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 PolyORBNT-COL-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679637293026
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=PolyORBNT-COL-S10J40
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 05:54:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 05:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:54:54] [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.
[2023-03-24 05:54:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 05:54:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 704 ms
[2023-03-24 05:54:55] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-24 05:54:55] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 05:54:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 05:54:55] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-24 05:54:55] [INFO ] Invariant cache hit.
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-24 05:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-24 05:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:54:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
[2023-03-24 05:54:55] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-24 05:54:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-24 05:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2023-03-24 05:54:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 05:54:55] [INFO ] Added : 36 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-24 05:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:55] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-24 05:54:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 05:54:56] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 05:54:56] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-24 05:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-24 05:54:56] [INFO ] Added : 36 causal constraints over 8 iterations in 191 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 05:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2023-03-24 05:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-24 05:54:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 05:54:56] [INFO ] Added : 20 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 78 ms.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 05:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:56] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-24 05:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 05:54:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 05:54:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-24 05:54:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 3 ms to minimize.
[2023-03-24 05:54:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-24 05:54:57] [INFO ] Added : 36 causal constraints over 8 iterations in 193 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 05:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 05:54:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 05:54:57] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 05:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 05:54:57] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 05:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-24 05:54:57] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2023-03-24 05:54:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-24 05:54:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 05:54:57] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 05:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-24 05:54:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 05:54:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-24 05:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-24 05:54:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 05:54:58] [INFO ] Added : 14 causal constraints over 4 iterations in 248 ms. Result :sat
Minimization took 83 ms.
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 05:54:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 05:54:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-24 05:54:58] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 05:54:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:54:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 05:54:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 05:54:58] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-24 05:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 05:54:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 05:54:58] [INFO ] Added : 15 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 4, -1, -1, -1, -1, 10, -1, 1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 05:54:58] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 228 ms.
[2023-03-24 05:54:58] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 26 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 11) seen :4
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :3
[2023-03-24 05:54:59] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-24 05:54:59] [INFO ] Computed 112 place invariants in 128 ms
[2023-03-24 05:54:59] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-24 05:54:59] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 05:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:00] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-24 05:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:00] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-24 05:55:00] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-24 05:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:01] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2023-03-24 05:55:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:55:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 314 ms returned sat
[2023-03-24 05:55:02] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 231 ms.
[2023-03-24 05:55:03] [INFO ] Deduced a trap composed of 19 places in 603 ms of which 1 ms to minimize.
[2023-03-24 05:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 922 ms
[2023-03-24 05:55:04] [INFO ] Deduced a trap composed of 212 places in 435 ms of which 0 ms to minimize.
[2023-03-24 05:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 650 ms
[2023-03-24 05:55:05] [INFO ] Added : 32 causal constraints over 7 iterations in 3230 ms. Result :sat
Minimization took 197 ms.
[2023-03-24 05:55:05] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:05] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-24 05:55:05] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:05] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 05:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:06] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-24 05:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:06] [INFO ] [Nat]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-24 05:55:06] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 05:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:11] [INFO ] [Nat]Absence check using state equation in 4854 ms returned unknown
[2023-03-24 05:55:11] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-24 05:55:11] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 05:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:11] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-24 05:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:12] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2023-03-24 05:55:12] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-24 05:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:12] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2023-03-24 05:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 796 ms returned sat
[2023-03-24 05:55:13] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 474 ms.
[2023-03-24 05:55:14] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 0 ms to minimize.
[2023-03-24 05:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2023-03-24 05:55:15] [INFO ] Added : 27 causal constraints over 6 iterations in 1707 ms. Result :sat
Minimization took 1032 ms.
[2023-03-24 05:55:16] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:16] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-24 05:55:16] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-24 05:55:16] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-24 05:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:17] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2023-03-24 05:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:17] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:17] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 05:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:18] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2023-03-24 05:55:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 245 ms returned sat
[2023-03-24 05:55:18] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 180 ms.
[2023-03-24 05:55:19] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 1 ms to minimize.
[2023-03-24 05:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-24 05:55:20] [INFO ] Added : 24 causal constraints over 6 iterations in 1424 ms. Result :sat
Minimization took 1462 ms.
[2023-03-24 05:55:21] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2023-03-24 05:55:21] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 05:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:22] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-24 05:55:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:22] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:22] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 05:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:23] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2023-03-24 05:55:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 230 ms returned sat
[2023-03-24 05:55:24] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 175 ms.
[2023-03-24 05:55:25] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 0 ms to minimize.
[2023-03-24 05:55:26] [INFO ] Deduced a trap composed of 212 places in 448 ms of which 0 ms to minimize.
[2023-03-24 05:55:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1464 ms
[2023-03-24 05:55:26] [INFO ] Added : 27 causal constraints over 6 iterations in 2650 ms. Result :sat
Minimization took 858 ms.
[2023-03-24 05:55:27] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-24 05:55:27] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-24 05:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:28] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-24 05:55:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:28] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2023-03-24 05:55:28] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-24 05:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:33] [INFO ] [Nat]Absence check using state equation in 4860 ms returned unknown
[2023-03-24 05:55:33] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:33] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-24 05:55:33] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-24 05:55:33] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-24 05:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:34] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2023-03-24 05:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:55:34] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:55:34] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-24 05:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:55:35] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2023-03-24 05:55:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-24 05:55:35] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 171 ms.
[2023-03-24 05:55:35] [INFO ] Added : 7 causal constraints over 2 iterations in 463 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 4, 2147483647, 1, 2147483647, 2147483647, 10, 1, 1] Max seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 46 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 45 rules applied. Total rules applied 57 place count 842 transition count 2185
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 799 transition count 2182
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 796 transition count 2182
Applied a total of 106 rules in 321 ms. Remains 796 /854 variables (removed 58) and now considering 2182/2230 (removed 48) transitions.
[2023-03-24 05:55:36] [INFO ] Flow matrix only has 2173 transitions (discarded 9 similar events)
// Phase 1: matrix 2173 rows 796 cols
[2023-03-24 05:55:36] [INFO ] Computed 102 place invariants in 43 ms
[2023-03-24 05:55:38] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 796/854 places, 1567/2230 transitions.
Applied a total of 0 rules in 49 ms. Remains 796 /796 variables (removed 0) and now considering 1567/1567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2042 ms. Remains : 796/854 places, 1567/2230 transitions.
Normalized transition count is 1558 out of 1567 initially.
// Phase 1: matrix 1558 rows 796 cols
[2023-03-24 05:55:38] [INFO ] Computed 102 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 67377 resets, run finished after 10075 ms. (steps per millisecond=99 ) properties (out of 6) seen :11
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8168 resets, run finished after 1975 ms. (steps per millisecond=506 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8207 resets, run finished after 2558 ms. (steps per millisecond=390 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8164 resets, run finished after 2014 ms. (steps per millisecond=496 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8300 resets, run finished after 2036 ms. (steps per millisecond=491 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8347 resets, run finished after 2042 ms. (steps per millisecond=489 ) properties (out of 5) seen :7
[2023-03-24 05:55:59] [INFO ] Flow matrix only has 1558 transitions (discarded 9 similar events)
// Phase 1: matrix 1558 rows 796 cols
[2023-03-24 05:55:59] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive place invariants in 24 ms returned sat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned unsat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive place invariants in 23 ms returned sat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-24 05:55:59] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-24 05:56:00] [INFO ] [Real]Absence check using 96 positive place invariants in 24 ms returned sat
[2023-03-24 05:56:00] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-24 05:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:56:00] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-24 05:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:56:00] [INFO ] [Nat]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-24 05:56:00] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-24 05:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:56:00] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-24 05:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:56:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 327 ms returned sat
[2023-03-24 05:56:01] [INFO ] Deduced a trap composed of 352 places in 358 ms of which 1 ms to minimize.
[2023-03-24 05:56:02] [INFO ] Deduced a trap composed of 362 places in 363 ms of which 1 ms to minimize.
[2023-03-24 05:56:02] [INFO ] Deduced a trap composed of 350 places in 354 ms of which 1 ms to minimize.
[2023-03-24 05:56:02] [INFO ] Deduced a trap composed of 352 places in 339 ms of which 0 ms to minimize.
[2023-03-24 05:56:03] [INFO ] Deduced a trap composed of 350 places in 356 ms of which 2 ms to minimize.
[2023-03-24 05:56:03] [INFO ] Deduced a trap composed of 352 places in 363 ms of which 1 ms to minimize.
[2023-03-24 05:56:04] [INFO ] Deduced a trap composed of 366 places in 357 ms of which 0 ms to minimize.
[2023-03-24 05:56:04] [INFO ] Deduced a trap composed of 364 places in 358 ms of which 1 ms to minimize.
[2023-03-24 05:56:05] [INFO ] Deduced a trap composed of 358 places in 327 ms of which 0 ms to minimize.
[2023-03-24 05:56:05] [INFO ] Deduced a trap composed of 360 places in 345 ms of which 1 ms to minimize.
[2023-03-24 05:56:05] [INFO ] Deduced a trap composed of 360 places in 340 ms of which 0 ms to minimize.
[2023-03-24 05:56:06] [INFO ] Deduced a trap composed of 366 places in 339 ms of which 1 ms to minimize.
[2023-03-24 05:56:06] [INFO ] Deduced a trap composed of 360 places in 349 ms of which 1 ms to minimize.
[2023-03-24 05:56:07] [INFO ] Deduced a trap composed of 360 places in 351 ms of which 1 ms to minimize.
[2023-03-24 05:56:07] [INFO ] Deduced a trap composed of 366 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:56:08] [INFO ] Deduced a trap composed of 350 places in 350 ms of which 1 ms to minimize.
[2023-03-24 05:56:08] [INFO ] Deduced a trap composed of 352 places in 348 ms of which 1 ms to minimize.
[2023-03-24 05:56:08] [INFO ] Deduced a trap composed of 350 places in 388 ms of which 5 ms to minimize.
[2023-03-24 05:56:09] [INFO ] Deduced a trap composed of 350 places in 385 ms of which 0 ms to minimize.
[2023-03-24 05:56:09] [INFO ] Deduced a trap composed of 350 places in 355 ms of which 1 ms to minimize.
[2023-03-24 05:56:11] [INFO ] Deduced a trap composed of 338 places in 366 ms of which 0 ms to minimize.
[2023-03-24 05:56:11] [INFO ] Deduced a trap composed of 350 places in 360 ms of which 1 ms to minimize.
[2023-03-24 05:56:11] [INFO ] Deduced a trap composed of 344 places in 356 ms of which 1 ms to minimize.
[2023-03-24 05:56:12] [INFO ] Deduced a trap composed of 354 places in 356 ms of which 1 ms to minimize.
[2023-03-24 05:56:12] [INFO ] Deduced a trap composed of 344 places in 369 ms of which 1 ms to minimize.
[2023-03-24 05:56:13] [INFO ] Deduced a trap composed of 353 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:56:13] [INFO ] Deduced a trap composed of 348 places in 357 ms of which 1 ms to minimize.
[2023-03-24 05:56:14] [INFO ] Deduced a trap composed of 346 places in 342 ms of which 1 ms to minimize.
[2023-03-24 05:56:14] [INFO ] Deduced a trap composed of 362 places in 336 ms of which 0 ms to minimize.
[2023-03-24 05:56:15] [INFO ] Deduced a trap composed of 358 places in 363 ms of which 0 ms to minimize.
[2023-03-24 05:56:15] [INFO ] Deduced a trap composed of 360 places in 357 ms of which 1 ms to minimize.
[2023-03-24 05:56:15] [INFO ] Deduced a trap composed of 354 places in 375 ms of which 0 ms to minimize.
[2023-03-24 05:56:16] [INFO ] Deduced a trap composed of 350 places in 371 ms of which 1 ms to minimize.
[2023-03-24 05:56:16] [INFO ] Deduced a trap composed of 348 places in 389 ms of which 2 ms to minimize.
[2023-03-24 05:56:17] [INFO ] Deduced a trap composed of 364 places in 367 ms of which 1 ms to minimize.
[2023-03-24 05:56:17] [INFO ] Deduced a trap composed of 358 places in 349 ms of which 0 ms to minimize.
[2023-03-24 05:56:18] [INFO ] Deduced a trap composed of 360 places in 365 ms of which 1 ms to minimize.
[2023-03-24 05:56:18] [INFO ] Deduced a trap composed of 348 places in 365 ms of which 0 ms to minimize.
[2023-03-24 05:56:19] [INFO ] Deduced a trap composed of 358 places in 359 ms of which 1 ms to minimize.
[2023-03-24 05:56:19] [INFO ] Deduced a trap composed of 356 places in 342 ms of which 4 ms to minimize.
[2023-03-24 05:56:20] [INFO ] Deduced a trap composed of 358 places in 349 ms of which 1 ms to minimize.
[2023-03-24 05:56:20] [INFO ] Deduced a trap composed of 360 places in 364 ms of which 1 ms to minimize.
[2023-03-24 05:56:21] [INFO ] Deduced a trap composed of 358 places in 353 ms of which 1 ms to minimize.
[2023-03-24 05:56:22] [INFO ] Deduced a trap composed of 364 places in 350 ms of which 1 ms to minimize.
[2023-03-24 05:56:22] [INFO ] Deduced a trap composed of 360 places in 357 ms of which 1 ms to minimize.
[2023-03-24 05:56:23] [INFO ] Deduced a trap composed of 358 places in 350 ms of which 0 ms to minimize.
[2023-03-24 05:56:23] [INFO ] Deduced a trap composed of 354 places in 356 ms of which 1 ms to minimize.
[2023-03-24 05:56:24] [INFO ] Deduced a trap composed of 360 places in 344 ms of which 1 ms to minimize.
[2023-03-24 05:56:24] [INFO ] Deduced a trap composed of 362 places in 360 ms of which 2 ms to minimize.
[2023-03-24 05:56:25] [INFO ] Deduced a trap composed of 354 places in 354 ms of which 0 ms to minimize.
[2023-03-24 05:56:25] [INFO ] Deduced a trap composed of 360 places in 362 ms of which 2 ms to minimize.
[2023-03-24 05:56:26] [INFO ] Deduced a trap composed of 360 places in 362 ms of which 1 ms to minimize.
[2023-03-24 05:56:26] [INFO ] Deduced a trap composed of 366 places in 353 ms of which 1 ms to minimize.
[2023-03-24 05:56:27] [INFO ] Deduced a trap composed of 356 places in 351 ms of which 0 ms to minimize.
[2023-03-24 05:56:27] [INFO ] Deduced a trap composed of 354 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:56:28] [INFO ] Deduced a trap composed of 360 places in 357 ms of which 1 ms to minimize.
[2023-03-24 05:56:28] [INFO ] Deduced a trap composed of 354 places in 359 ms of which 1 ms to minimize.
[2023-03-24 05:56:29] [INFO ] Deduced a trap composed of 362 places in 365 ms of which 1 ms to minimize.
[2023-03-24 05:56:29] [INFO ] Deduced a trap composed of 360 places in 354 ms of which 1 ms to minimize.
[2023-03-24 05:56:30] [INFO ] Deduced a trap composed of 354 places in 333 ms of which 1 ms to minimize.
[2023-03-24 05:56:30] [INFO ] Deduced a trap composed of 358 places in 356 ms of which 1 ms to minimize.
[2023-03-24 05:56:31] [INFO ] Deduced a trap composed of 360 places in 363 ms of which 1 ms to minimize.
[2023-03-24 05:56:31] [INFO ] Deduced a trap composed of 348 places in 357 ms of which 1 ms to minimize.
[2023-03-24 05:56:32] [INFO ] Deduced a trap composed of 362 places in 358 ms of which 1 ms to minimize.
[2023-03-24 05:56:32] [INFO ] Deduced a trap composed of 356 places in 351 ms of which 1 ms to minimize.
[2023-03-24 05:56:33] [INFO ] Deduced a trap composed of 360 places in 354 ms of which 0 ms to minimize.
[2023-03-24 05:56:33] [INFO ] Deduced a trap composed of 356 places in 361 ms of which 0 ms to minimize.
[2023-03-24 05:56:34] [INFO ] Deduced a trap composed of 366 places in 355 ms of which 1 ms to minimize.
[2023-03-24 05:56:34] [INFO ] Deduced a trap composed of 356 places in 350 ms of which 1 ms to minimize.
[2023-03-24 05:56:35] [INFO ] Deduced a trap composed of 348 places in 335 ms of which 1 ms to minimize.
[2023-03-24 05:56:36] [INFO ] Deduced a trap composed of 348 places in 336 ms of which 0 ms to minimize.
[2023-03-24 05:56:36] [INFO ] Deduced a trap composed of 350 places in 364 ms of which 0 ms to minimize.
[2023-03-24 05:56:38] [INFO ] Deduced a trap composed of 354 places in 341 ms of which 0 ms to minimize.
[2023-03-24 05:56:38] [INFO ] Deduced a trap composed of 356 places in 330 ms of which 0 ms to minimize.
[2023-03-24 05:56:39] [INFO ] Deduced a trap composed of 372 places in 344 ms of which 2 ms to minimize.
[2023-03-24 05:56:39] [INFO ] Deduced a trap composed of 354 places in 360 ms of which 0 ms to minimize.
[2023-03-24 05:56:40] [INFO ] Deduced a trap composed of 358 places in 367 ms of which 1 ms to minimize.
[2023-03-24 05:56:40] [INFO ] Deduced a trap composed of 358 places in 368 ms of which 1 ms to minimize.
[2023-03-24 05:56:43] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 42593 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 10] Max seen :[1, 1, 1, 1, 3]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1567/1567 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 796 transition count 1566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 795 transition count 1566
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 795 transition count 1525
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 753 transition count 1524
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 2 with 4 rules applied. Total rules applied 90 place count 751 transition count 1522
Applied a total of 90 rules in 157 ms. Remains 751 /796 variables (removed 45) and now considering 1522/1567 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 751/796 places, 1522/1567 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:56:44] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70651 resets, run finished after 9737 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8215 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties (out of 1) seen :3
[2023-03-24 05:56:55] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:56:55] [INFO ] Computed 102 place invariants in 40 ms
[2023-03-24 05:56:55] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-24 05:56:55] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:56:56] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-24 05:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:56:56] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-24 05:56:56] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-24 05:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:56:56] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-24 05:56:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:56:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 492 ms returned sat
[2023-03-24 05:56:57] [INFO ] Deduced a trap composed of 306 places in 315 ms of which 1 ms to minimize.
[2023-03-24 05:56:58] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 0 ms to minimize.
[2023-03-24 05:56:58] [INFO ] Deduced a trap composed of 310 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:56:58] [INFO ] Deduced a trap composed of 304 places in 344 ms of which 1 ms to minimize.
[2023-03-24 05:56:59] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2023-03-24 05:56:59] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 0 ms to minimize.
[2023-03-24 05:57:00] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 1 ms to minimize.
[2023-03-24 05:57:00] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-24 05:57:01] [INFO ] Deduced a trap composed of 296 places in 340 ms of which 0 ms to minimize.
[2023-03-24 05:57:01] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-24 05:57:01] [INFO ] Deduced a trap composed of 296 places in 330 ms of which 1 ms to minimize.
[2023-03-24 05:57:02] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:57:02] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2023-03-24 05:57:03] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 1 ms to minimize.
[2023-03-24 05:57:03] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2023-03-24 05:57:03] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2023-03-24 05:57:04] [INFO ] Deduced a trap composed of 304 places in 337 ms of which 0 ms to minimize.
[2023-03-24 05:57:04] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-24 05:57:05] [INFO ] Deduced a trap composed of 300 places in 345 ms of which 1 ms to minimize.
[2023-03-24 05:57:05] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2023-03-24 05:57:05] [INFO ] Deduced a trap composed of 310 places in 328 ms of which 1 ms to minimize.
[2023-03-24 05:57:06] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 0 ms to minimize.
[2023-03-24 05:57:06] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2023-03-24 05:57:07] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:57:08] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:57:08] [INFO ] Deduced a trap composed of 306 places in 338 ms of which 1 ms to minimize.
[2023-03-24 05:57:09] [INFO ] Deduced a trap composed of 296 places in 338 ms of which 0 ms to minimize.
[2023-03-24 05:57:09] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 1 ms to minimize.
[2023-03-24 05:57:10] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 1 ms to minimize.
[2023-03-24 05:57:10] [INFO ] Deduced a trap composed of 298 places in 338 ms of which 1 ms to minimize.
[2023-03-24 05:57:10] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 1 ms to minimize.
[2023-03-24 05:57:11] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 1 ms to minimize.
[2023-03-24 05:57:11] [INFO ] Deduced a trap composed of 290 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:57:12] [INFO ] Deduced a trap composed of 312 places in 335 ms of which 1 ms to minimize.
[2023-03-24 05:57:13] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-24 05:57:13] [INFO ] Deduced a trap composed of 292 places in 314 ms of which 1 ms to minimize.
[2023-03-24 05:57:14] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 0 ms to minimize.
[2023-03-24 05:57:15] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 3 ms to minimize.
[2023-03-24 05:57:17] [INFO ] Deduced a trap composed of 294 places in 343 ms of which 1 ms to minimize.
[2023-03-24 05:57:18] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 1 ms to minimize.
[2023-03-24 05:57:19] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 1 ms to minimize.
[2023-03-24 05:57:19] [INFO ] Deduced a trap composed of 304 places in 329 ms of which 1 ms to minimize.
[2023-03-24 05:57:20] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2023-03-24 05:57:21] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 0 ms to minimize.
[2023-03-24 05:57:22] [INFO ] Deduced a trap composed of 296 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:57:22] [INFO ] Deduced a trap composed of 310 places in 337 ms of which 0 ms to minimize.
[2023-03-24 05:57:25] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 28293 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 47 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 30 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 05:57:25] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:57:25] [INFO ] Invariant cache hit.
[2023-03-24 05:57:26] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-24 05:57:26] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:57:26] [INFO ] Invariant cache hit.
[2023-03-24 05:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:57:30] [INFO ] Implicit Places using invariants and state equation in 3822 ms returned []
Implicit Place search using SMT with State Equation took 4385 ms to find 0 implicit places.
[2023-03-24 05:57:30] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-24 05:57:30] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:57:30] [INFO ] Invariant cache hit.
[2023-03-24 05:57:31] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5255 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:57:31] [INFO ] Computed 102 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 690 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-24 05:57:31] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:57:31] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-24 05:57:31] [INFO ] [Real]Absence check using 95 positive place invariants in 30 ms returned sat
[2023-03-24 05:57:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:57:31] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-24 05:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:57:31] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-24 05:57:31] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:57:32] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-03-24 05:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:57:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 471 ms returned sat
[2023-03-24 05:57:33] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 1 ms to minimize.
[2023-03-24 05:57:33] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 2 ms to minimize.
[2023-03-24 05:57:33] [INFO ] Deduced a trap composed of 310 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:57:34] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:57:34] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 0 ms to minimize.
[2023-03-24 05:57:35] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-24 05:57:35] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 0 ms to minimize.
[2023-03-24 05:57:35] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-24 05:57:36] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 1 ms to minimize.
[2023-03-24 05:57:36] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 0 ms to minimize.
[2023-03-24 05:57:37] [INFO ] Deduced a trap composed of 3 places in 436 ms of which 1 ms to minimize.
[2023-03-24 05:57:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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:733)
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)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 31 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 05:57:37] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:57:37] [INFO ] Invariant cache hit.
[2023-03-24 05:57:38] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:57:38] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70565 resets, run finished after 9681 ms. (steps per millisecond=103 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8132 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :3
[2023-03-24 05:57:49] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:57:49] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 05:57:49] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-24 05:57:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:57:50] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-24 05:57:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 05:57:50] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-24 05:57:50] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 05:57:50] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-24 05:57:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:57:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 478 ms returned sat
[2023-03-24 05:57:51] [INFO ] Deduced a trap composed of 306 places in 324 ms of which 0 ms to minimize.
[2023-03-24 05:57:52] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2023-03-24 05:57:52] [INFO ] Deduced a trap composed of 310 places in 334 ms of which 0 ms to minimize.
[2023-03-24 05:57:52] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 1 ms to minimize.
[2023-03-24 05:57:53] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 0 ms to minimize.
[2023-03-24 05:57:53] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2023-03-24 05:57:54] [INFO ] Deduced a trap composed of 304 places in 346 ms of which 1 ms to minimize.
[2023-03-24 05:57:54] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:57:55] [INFO ] Deduced a trap composed of 296 places in 342 ms of which 1 ms to minimize.
[2023-03-24 05:57:55] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-24 05:57:55] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-24 05:57:56] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 0 ms to minimize.
[2023-03-24 05:57:56] [INFO ] Deduced a trap composed of 306 places in 315 ms of which 0 ms to minimize.
[2023-03-24 05:57:57] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:57:57] [INFO ] Deduced a trap composed of 302 places in 333 ms of which 1 ms to minimize.
[2023-03-24 05:57:57] [INFO ] Deduced a trap composed of 302 places in 337 ms of which 0 ms to minimize.
[2023-03-24 05:57:58] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 1 ms to minimize.
[2023-03-24 05:57:58] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-24 05:57:59] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:57:59] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 1 ms to minimize.
[2023-03-24 05:57:59] [INFO ] Deduced a trap composed of 310 places in 323 ms of which 1 ms to minimize.
[2023-03-24 05:58:00] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-24 05:58:00] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 0 ms to minimize.
[2023-03-24 05:58:01] [INFO ] Deduced a trap composed of 306 places in 345 ms of which 1 ms to minimize.
[2023-03-24 05:58:02] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:58:02] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:58:03] [INFO ] Deduced a trap composed of 296 places in 340 ms of which 1 ms to minimize.
[2023-03-24 05:58:03] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 1 ms to minimize.
[2023-03-24 05:58:03] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2023-03-24 05:58:04] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 1 ms to minimize.
[2023-03-24 05:58:04] [INFO ] Deduced a trap composed of 302 places in 369 ms of which 1 ms to minimize.
[2023-03-24 05:58:05] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 0 ms to minimize.
[2023-03-24 05:58:05] [INFO ] Deduced a trap composed of 290 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:58:05] [INFO ] Deduced a trap composed of 312 places in 316 ms of which 1 ms to minimize.
[2023-03-24 05:58:07] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 1 ms to minimize.
[2023-03-24 05:58:07] [INFO ] Deduced a trap composed of 292 places in 329 ms of which 0 ms to minimize.
[2023-03-24 05:58:07] [INFO ] Deduced a trap composed of 298 places in 326 ms of which 1 ms to minimize.
[2023-03-24 05:58:09] [INFO ] Deduced a trap composed of 296 places in 332 ms of which 1 ms to minimize.
[2023-03-24 05:58:10] [INFO ] Deduced a trap composed of 294 places in 355 ms of which 0 ms to minimize.
[2023-03-24 05:58:12] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 1 ms to minimize.
[2023-03-24 05:58:13] [INFO ] Deduced a trap composed of 294 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:58:13] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2023-03-24 05:58:14] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 0 ms to minimize.
[2023-03-24 05:58:15] [INFO ] Deduced a trap composed of 306 places in 338 ms of which 0 ms to minimize.
[2023-03-24 05:58:15] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2023-03-24 05:58:16] [INFO ] Deduced a trap composed of 310 places in 339 ms of which 0 ms to minimize.
[2023-03-24 05:58:19] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 28299 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 28 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 27 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-24 05:58:19] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:58:19] [INFO ] Invariant cache hit.
[2023-03-24 05:58:20] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-24 05:58:20] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:58:20] [INFO ] Invariant cache hit.
[2023-03-24 05:58:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:58:24] [INFO ] Implicit Places using invariants and state equation in 3858 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
[2023-03-24 05:58:24] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-24 05:58:24] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-24 05:58:24] [INFO ] Invariant cache hit.
[2023-03-24 05:58:24] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5204 ms. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13 in 53794 ms.
[2023-03-24 05:58:25] [INFO ] Flatten gal took : 207 ms
[2023-03-24 05:58:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-24 05:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 751 places, 1522 transitions and 9221 arcs took 10 ms.
Total runtime 210586 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PolyORBNT_COL_S10J40_unf
(NrP: 751 NrTr: 1522 NrArc: 9221)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.146sec
net check time: 0m 0.001sec
init dd package: 0m 2.800sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7339444 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098836 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.014sec
1232321 1841550 2187551 2740514
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="PolyORBNT-COL-S10J40"
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 PolyORBNT-COL-S10J40, 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 r298-tall-167873952100693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 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 '
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 ;