About the Execution of Smart+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 |
| 2345.048 | 3600000.00 | 3681484.00 | 9091.90 | 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.r299-tall-167873953300693.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 smartxred
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 r299-tall-167873953300693
=====================================================================
--------------------
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 1679532649824
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 00:50:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 00:50:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:50:51] [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-23 00:50:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 00:50:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2023-03-23 00:50:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 00:50:52] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 00:50:52] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 00:50:52] [INFO ] Computed 13 place invariants in 11 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-23 00:50:52] [INFO ] Invariant cache hit.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 00:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 00:50:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:50:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2023-03-23 00:50:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-23 00:50:52] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2023-03-23 00:50:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 108 ms
[2023-03-23 00:50:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-23 00:50:52] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 00:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:50:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:50:52] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2023-03-23 00:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 00:50:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:50:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:50:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-23 00:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-23 00:50:52] [INFO ] Added : 36 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:50:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2023-03-23 00:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-23 00:50:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:53] [INFO ] Added : 20 causal constraints over 4 iterations in 217 ms. Result :sat
Minimization took 75 ms.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:50:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:50:53] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-23 00:50:53] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2023-03-23 00:50:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2023-03-23 00:50:53] [INFO ] Added : 36 causal constraints over 8 iterations in 185 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:53] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 00:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 00:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:53] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 00:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-23 00:50:54] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2023-03-23 00:50:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2023-03-23 00:50:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:54] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 00:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-23 00:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-23 00:50:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:54] [INFO ] Added : 14 causal constraints over 4 iterations in 243 ms. Result :sat
Minimization took 86 ms.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:50:54] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:50:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:50:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-23 00:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-23 00:50:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:50:54] [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-23 00:50:55] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 198 ms.
[2023-03-23 00:50:55] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 27 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 209 ms. (steps per millisecond=47 ) 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 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) 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 39 ms. (steps per millisecond=256 ) 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 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 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 105 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :3
[2023-03-23 00:50:55] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-23 00:50:55] [INFO ] Computed 112 place invariants in 130 ms
[2023-03-23 00:50:56] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2023-03-23 00:50:56] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 00:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:56] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2023-03-23 00:50:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:50:56] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2023-03-23 00:50:56] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 00:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:50:57] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2023-03-23 00:50:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:50:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 318 ms returned sat
[2023-03-23 00:50:58] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 273 ms.
[2023-03-23 00:51:00] [INFO ] Deduced a trap composed of 19 places in 567 ms of which 0 ms to minimize.
[2023-03-23 00:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 877 ms
[2023-03-23 00:51:01] [INFO ] Deduced a trap composed of 212 places in 422 ms of which 1 ms to minimize.
[2023-03-23 00:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 650 ms
[2023-03-23 00:51:01] [INFO ] Added : 32 causal constraints over 7 iterations in 3192 ms. Result :sat
Minimization took 187 ms.
[2023-03-23 00:51:01] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:01] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned unsat
[2023-03-23 00:51:02] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:02] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 00:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:02] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-23 00:51:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:02] [INFO ] [Nat]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 00:51:02] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 00:51:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:07] [INFO ] [Nat]Absence check using state equation in 4881 ms returned unknown
[2023-03-23 00:51:07] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 00:51:07] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 00:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:08] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-23 00:51:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:08] [INFO ] [Nat]Absence check using 105 positive place invariants in 172 ms returned sat
[2023-03-23 00:51:08] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 00:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:09] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-23 00:51:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 783 ms returned sat
[2023-03-23 00:51:10] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 487 ms.
[2023-03-23 00:51:11] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 0 ms to minimize.
[2023-03-23 00:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-23 00:51:11] [INFO ] Added : 27 causal constraints over 6 iterations in 1658 ms. Result :sat
Minimization took 1023 ms.
[2023-03-23 00:51:12] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:12] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned unsat
[2023-03-23 00:51:13] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2023-03-23 00:51:13] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 00:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:13] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2023-03-23 00:51:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:13] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2023-03-23 00:51:13] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-23 00:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:14] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2023-03-23 00:51:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 231 ms returned sat
[2023-03-23 00:51:15] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 144 ms.
[2023-03-23 00:51:16] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 0 ms to minimize.
[2023-03-23 00:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2023-03-23 00:51:16] [INFO ] Added : 24 causal constraints over 6 iterations in 1394 ms. Result :sat
Minimization took 1517 ms.
[2023-03-23 00:51:18] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-23 00:51:18] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 00:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:18] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-23 00:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:18] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2023-03-23 00:51:18] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 00:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:19] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2023-03-23 00:51:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 228 ms returned sat
[2023-03-23 00:51:20] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 167 ms.
[2023-03-23 00:51:21] [INFO ] Deduced a trap composed of 19 places in 527 ms of which 1 ms to minimize.
[2023-03-23 00:51:22] [INFO ] Deduced a trap composed of 212 places in 472 ms of which 0 ms to minimize.
[2023-03-23 00:51:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1497 ms
[2023-03-23 00:51:22] [INFO ] Added : 27 causal constraints over 6 iterations in 2654 ms. Result :sat
Minimization took 860 ms.
[2023-03-23 00:51:23] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-23 00:51:23] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 00:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:24] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-23 00:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:24] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:24] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 00:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:29] [INFO ] [Nat]Absence check using state equation in 4862 ms returned unknown
[2023-03-23 00:51:29] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-23 00:51:29] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-23 00:51:29] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2023-03-23 00:51:29] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 00:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:30] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-23 00:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:30] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:30] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 00:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:31] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2023-03-23 00:51:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-23 00:51:31] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 161 ms.
[2023-03-23 00:51:32] [INFO ] Added : 7 causal constraints over 2 iterations in 467 ms. Result :sat
Minimization took 249 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 1 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 262 ms. Remains 796 /854 variables (removed 58) and now considering 2182/2230 (removed 48) transitions.
[2023-03-23 00:51:33] [INFO ] Flow matrix only has 2173 transitions (discarded 9 similar events)
// Phase 1: matrix 2173 rows 796 cols
[2023-03-23 00:51:33] [INFO ] Computed 102 place invariants in 62 ms
[2023-03-23 00:51:34] [INFO ] Dead Transitions using invariants and state equation in 1563 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 73 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 1901 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-23 00:51:34] [INFO ] Computed 102 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 67374 resets, run finished after 9655 ms. (steps per millisecond=103 ) 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 8194 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8195 resets, run finished after 2281 ms. (steps per millisecond=438 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8143 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8217 resets, run finished after 1860 ms. (steps per millisecond=537 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8133 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 5) seen :7
[2023-03-23 00:51:54] [INFO ] Flow matrix only has 1558 transitions (discarded 9 similar events)
// Phase 1: matrix 1558 rows 796 cols
[2023-03-23 00:51:54] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned unsat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive place invariants in 23 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned unsat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-23 00:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:55] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-23 00:51:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:51:55] [INFO ] [Nat]Absence check using 96 positive place invariants in 26 ms returned sat
[2023-03-23 00:51:55] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-23 00:51:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:51:55] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-23 00:51:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:51:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 321 ms returned sat
[2023-03-23 00:51:56] [INFO ] Deduced a trap composed of 352 places in 363 ms of which 1 ms to minimize.
[2023-03-23 00:51:56] [INFO ] Deduced a trap composed of 362 places in 377 ms of which 0 ms to minimize.
[2023-03-23 00:51:57] [INFO ] Deduced a trap composed of 350 places in 348 ms of which 0 ms to minimize.
[2023-03-23 00:51:57] [INFO ] Deduced a trap composed of 352 places in 355 ms of which 1 ms to minimize.
[2023-03-23 00:51:58] [INFO ] Deduced a trap composed of 350 places in 348 ms of which 1 ms to minimize.
[2023-03-23 00:51:58] [INFO ] Deduced a trap composed of 352 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:51:58] [INFO ] Deduced a trap composed of 366 places in 341 ms of which 1 ms to minimize.
[2023-03-23 00:51:59] [INFO ] Deduced a trap composed of 364 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:51:59] [INFO ] Deduced a trap composed of 358 places in 353 ms of which 0 ms to minimize.
[2023-03-23 00:52:00] [INFO ] Deduced a trap composed of 360 places in 353 ms of which 0 ms to minimize.
[2023-03-23 00:52:00] [INFO ] Deduced a trap composed of 360 places in 353 ms of which 0 ms to minimize.
[2023-03-23 00:52:01] [INFO ] Deduced a trap composed of 366 places in 331 ms of which 1 ms to minimize.
[2023-03-23 00:52:01] [INFO ] Deduced a trap composed of 360 places in 360 ms of which 0 ms to minimize.
[2023-03-23 00:52:01] [INFO ] Deduced a trap composed of 360 places in 357 ms of which 1 ms to minimize.
[2023-03-23 00:52:02] [INFO ] Deduced a trap composed of 366 places in 334 ms of which 0 ms to minimize.
[2023-03-23 00:52:02] [INFO ] Deduced a trap composed of 350 places in 364 ms of which 1 ms to minimize.
[2023-03-23 00:52:03] [INFO ] Deduced a trap composed of 352 places in 358 ms of which 1 ms to minimize.
[2023-03-23 00:52:03] [INFO ] Deduced a trap composed of 350 places in 356 ms of which 3 ms to minimize.
[2023-03-23 00:52:04] [INFO ] Deduced a trap composed of 350 places in 351 ms of which 0 ms to minimize.
[2023-03-23 00:52:04] [INFO ] Deduced a trap composed of 350 places in 375 ms of which 1 ms to minimize.
[2023-03-23 00:52:05] [INFO ] Deduced a trap composed of 338 places in 373 ms of which 0 ms to minimize.
[2023-03-23 00:52:06] [INFO ] Deduced a trap composed of 350 places in 361 ms of which 0 ms to minimize.
[2023-03-23 00:52:06] [INFO ] Deduced a trap composed of 344 places in 364 ms of which 1 ms to minimize.
[2023-03-23 00:52:07] [INFO ] Deduced a trap composed of 354 places in 360 ms of which 0 ms to minimize.
[2023-03-23 00:52:07] [INFO ] Deduced a trap composed of 344 places in 361 ms of which 0 ms to minimize.
[2023-03-23 00:52:08] [INFO ] Deduced a trap composed of 353 places in 328 ms of which 1 ms to minimize.
[2023-03-23 00:52:08] [INFO ] Deduced a trap composed of 348 places in 332 ms of which 0 ms to minimize.
[2023-03-23 00:52:08] [INFO ] Deduced a trap composed of 346 places in 332 ms of which 1 ms to minimize.
[2023-03-23 00:52:09] [INFO ] Deduced a trap composed of 362 places in 347 ms of which 1 ms to minimize.
[2023-03-23 00:52:09] [INFO ] Deduced a trap composed of 358 places in 353 ms of which 1 ms to minimize.
[2023-03-23 00:52:10] [INFO ] Deduced a trap composed of 360 places in 331 ms of which 1 ms to minimize.
[2023-03-23 00:52:10] [INFO ] Deduced a trap composed of 354 places in 359 ms of which 0 ms to minimize.
[2023-03-23 00:52:11] [INFO ] Deduced a trap composed of 350 places in 363 ms of which 1 ms to minimize.
[2023-03-23 00:52:11] [INFO ] Deduced a trap composed of 348 places in 353 ms of which 1 ms to minimize.
[2023-03-23 00:52:12] [INFO ] Deduced a trap composed of 364 places in 331 ms of which 0 ms to minimize.
[2023-03-23 00:52:12] [INFO ] Deduced a trap composed of 358 places in 353 ms of which 1 ms to minimize.
[2023-03-23 00:52:13] [INFO ] Deduced a trap composed of 360 places in 348 ms of which 1 ms to minimize.
[2023-03-23 00:52:13] [INFO ] Deduced a trap composed of 348 places in 372 ms of which 0 ms to minimize.
[2023-03-23 00:52:13] [INFO ] Deduced a trap composed of 358 places in 362 ms of which 0 ms to minimize.
[2023-03-23 00:52:14] [INFO ] Deduced a trap composed of 356 places in 362 ms of which 4 ms to minimize.
[2023-03-23 00:52:14] [INFO ] Deduced a trap composed of 358 places in 351 ms of which 1 ms to minimize.
[2023-03-23 00:52:15] [INFO ] Deduced a trap composed of 360 places in 360 ms of which 0 ms to minimize.
[2023-03-23 00:52:16] [INFO ] Deduced a trap composed of 358 places in 352 ms of which 1 ms to minimize.
[2023-03-23 00:52:17] [INFO ] Deduced a trap composed of 364 places in 359 ms of which 1 ms to minimize.
[2023-03-23 00:52:17] [INFO ] Deduced a trap composed of 360 places in 350 ms of which 1 ms to minimize.
[2023-03-23 00:52:17] [INFO ] Deduced a trap composed of 358 places in 348 ms of which 1 ms to minimize.
[2023-03-23 00:52:18] [INFO ] Deduced a trap composed of 354 places in 348 ms of which 1 ms to minimize.
[2023-03-23 00:52:18] [INFO ] Deduced a trap composed of 360 places in 352 ms of which 0 ms to minimize.
[2023-03-23 00:52:19] [INFO ] Deduced a trap composed of 362 places in 370 ms of which 2 ms to minimize.
[2023-03-23 00:52:19] [INFO ] Deduced a trap composed of 354 places in 352 ms of which 1 ms to minimize.
[2023-03-23 00:52:20] [INFO ] Deduced a trap composed of 360 places in 357 ms of which 2 ms to minimize.
[2023-03-23 00:52:20] [INFO ] Deduced a trap composed of 360 places in 369 ms of which 14 ms to minimize.
[2023-03-23 00:52:21] [INFO ] Deduced a trap composed of 366 places in 319 ms of which 1 ms to minimize.
[2023-03-23 00:52:21] [INFO ] Deduced a trap composed of 356 places in 323 ms of which 1 ms to minimize.
[2023-03-23 00:52:22] [INFO ] Deduced a trap composed of 354 places in 330 ms of which 0 ms to minimize.
[2023-03-23 00:52:22] [INFO ] Deduced a trap composed of 360 places in 356 ms of which 1 ms to minimize.
[2023-03-23 00:52:23] [INFO ] Deduced a trap composed of 354 places in 349 ms of which 1 ms to minimize.
[2023-03-23 00:52:23] [INFO ] Deduced a trap composed of 362 places in 361 ms of which 1 ms to minimize.
[2023-03-23 00:52:24] [INFO ] Deduced a trap composed of 360 places in 337 ms of which 7 ms to minimize.
[2023-03-23 00:52:24] [INFO ] Deduced a trap composed of 354 places in 366 ms of which 1 ms to minimize.
[2023-03-23 00:52:25] [INFO ] Deduced a trap composed of 358 places in 357 ms of which 0 ms to minimize.
[2023-03-23 00:52:25] [INFO ] Deduced a trap composed of 360 places in 372 ms of which 0 ms to minimize.
[2023-03-23 00:52:26] [INFO ] Deduced a trap composed of 348 places in 350 ms of which 1 ms to minimize.
[2023-03-23 00:52:26] [INFO ] Deduced a trap composed of 362 places in 354 ms of which 1 ms to minimize.
[2023-03-23 00:52:27] [INFO ] Deduced a trap composed of 356 places in 329 ms of which 1 ms to minimize.
[2023-03-23 00:52:27] [INFO ] Deduced a trap composed of 360 places in 359 ms of which 1 ms to minimize.
[2023-03-23 00:52:28] [INFO ] Deduced a trap composed of 356 places in 357 ms of which 1 ms to minimize.
[2023-03-23 00:52:28] [INFO ] Deduced a trap composed of 366 places in 341 ms of which 1 ms to minimize.
[2023-03-23 00:52:29] [INFO ] Deduced a trap composed of 356 places in 353 ms of which 0 ms to minimize.
[2023-03-23 00:52:30] [INFO ] Deduced a trap composed of 348 places in 397 ms of which 1 ms to minimize.
[2023-03-23 00:52:30] [INFO ] Deduced a trap composed of 348 places in 362 ms of which 3 ms to minimize.
[2023-03-23 00:52:31] [INFO ] Deduced a trap composed of 350 places in 345 ms of which 1 ms to minimize.
[2023-03-23 00:52:32] [INFO ] Deduced a trap composed of 354 places in 328 ms of which 1 ms to minimize.
[2023-03-23 00:52:33] [INFO ] Deduced a trap composed of 356 places in 353 ms of which 1 ms to minimize.
[2023-03-23 00:52:34] [INFO ] Deduced a trap composed of 372 places in 361 ms of which 1 ms to minimize.
[2023-03-23 00:52:34] [INFO ] Deduced a trap composed of 354 places in 363 ms of which 1 ms to minimize.
[2023-03-23 00:52:34] [INFO ] Deduced a trap composed of 358 places in 350 ms of which 1 ms to minimize.
[2023-03-23 00:52:35] [INFO ] Deduced a trap composed of 358 places in 363 ms of which 1 ms to minimize.
[2023-03-23 00:52:38] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 42322 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 0 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-23 00:52:38] [INFO ] Computed 102 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 70343 resets, run finished after 9233 ms. (steps per millisecond=108 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8163 resets, run finished after 1765 ms. (steps per millisecond=566 ) properties (out of 1) seen :3
[2023-03-23 00:52:49] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 00:52:49] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-23 00:52:49] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-23 00:52:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:52:50] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-23 00:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:52:50] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-23 00:52:50] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:52:50] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-23 00:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:52:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 487 ms returned sat
[2023-03-23 00:52:51] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 1 ms to minimize.
[2023-03-23 00:52:51] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 0 ms to minimize.
[2023-03-23 00:52:52] [INFO ] Deduced a trap composed of 310 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:52:52] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 1 ms to minimize.
[2023-03-23 00:52:53] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 1 ms to minimize.
[2023-03-23 00:52:53] [INFO ] Deduced a trap composed of 302 places in 333 ms of which 0 ms to minimize.
[2023-03-23 00:52:53] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 0 ms to minimize.
[2023-03-23 00:52:54] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 0 ms to minimize.
[2023-03-23 00:52:54] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 0 ms to minimize.
[2023-03-23 00:52:55] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:52:55] [INFO ] Deduced a trap composed of 296 places in 322 ms of which 0 ms to minimize.
[2023-03-23 00:52:56] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2023-03-23 00:52:56] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 1 ms to minimize.
[2023-03-23 00:52:56] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
[2023-03-23 00:52:57] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:52:57] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 1 ms to minimize.
[2023-03-23 00:52:58] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-23 00:52:58] [INFO ] Deduced a trap composed of 304 places in 328 ms of which 1 ms to minimize.
[2023-03-23 00:52:58] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-23 00:52:59] [INFO ] Deduced a trap composed of 298 places in 326 ms of which 0 ms to minimize.
[2023-03-23 00:52:59] [INFO ] Deduced a trap composed of 310 places in 331 ms of which 1 ms to minimize.
[2023-03-23 00:53:00] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 1 ms to minimize.
[2023-03-23 00:53:00] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 1 ms to minimize.
[2023-03-23 00:53:01] [INFO ] Deduced a trap composed of 306 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:53:01] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2023-03-23 00:53:02] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:53:02] [INFO ] Deduced a trap composed of 296 places in 322 ms of which 0 ms to minimize.
[2023-03-23 00:53:03] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:53:03] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 0 ms to minimize.
[2023-03-23 00:53:04] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 1 ms to minimize.
[2023-03-23 00:53:04] [INFO ] Deduced a trap composed of 302 places in 343 ms of which 0 ms to minimize.
[2023-03-23 00:53:04] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-23 00:53:05] [INFO ] Deduced a trap composed of 290 places in 355 ms of which 0 ms to minimize.
[2023-03-23 00:53:05] [INFO ] Deduced a trap composed of 312 places in 320 ms of which 0 ms to minimize.
[2023-03-23 00:53:06] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:53:07] [INFO ] Deduced a trap composed of 292 places in 329 ms of which 1 ms to minimize.
[2023-03-23 00:53:07] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 0 ms to minimize.
[2023-03-23 00:53:09] [INFO ] Deduced a trap composed of 296 places in 343 ms of which 3 ms to minimize.
[2023-03-23 00:53:10] [INFO ] Deduced a trap composed of 294 places in 331 ms of which 0 ms to minimize.
[2023-03-23 00:53:12] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 1 ms to minimize.
[2023-03-23 00:53:12] [INFO ] Deduced a trap composed of 294 places in 319 ms of which 0 ms to minimize.
[2023-03-23 00:53:13] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 0 ms to minimize.
[2023-03-23 00:53:13] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 0 ms to minimize.
[2023-03-23 00:53:14] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 1 ms to minimize.
[2023-03-23 00:53:15] [INFO ] Deduced a trap composed of 296 places in 352 ms of which 1 ms to minimize.
[2023-03-23 00:53:16] [INFO ] Deduced a trap composed of 310 places in 326 ms of which 0 ms to minimize.
[2023-03-23 00:53:19] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 28105 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 76 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 76 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 86 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 00:53:19] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:53:19] [INFO ] Invariant cache hit.
[2023-03-23 00:53:20] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-23 00:53:20] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:53:20] [INFO ] Invariant cache hit.
[2023-03-23 00:53:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:53:24] [INFO ] Implicit Places using invariants and state equation in 3852 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
[2023-03-23 00:53:24] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-23 00:53:24] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:53:24] [INFO ] Invariant cache hit.
[2023-03-23 00:53:24] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5552 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-23 00:53:25] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 692 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-23 00:53:25] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 00:53:25] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-23 00:53:25] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-23 00:53:25] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 00:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:53:25] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-23 00:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:53:25] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-23 00:53:25] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:53:26] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-23 00:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:53:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 476 ms returned sat
[2023-03-23 00:53:27] [INFO ] Deduced a trap composed of 306 places in 321 ms of which 0 ms to minimize.
[2023-03-23 00:53:27] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 11 ms to minimize.
[2023-03-23 00:53:27] [INFO ] Deduced a trap composed of 310 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:53:28] [INFO ] Deduced a trap composed of 304 places in 322 ms of which 1 ms to minimize.
[2023-03-23 00:53:28] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:53:29] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2023-03-23 00:53:29] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:53:29] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:53:30] [INFO ] Deduced a trap composed of 296 places in 364 ms of which 1 ms to minimize.
[2023-03-23 00:53:30] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-23 00:53:30] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 4110 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 66 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 00:53:30] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:53:30] [INFO ] Invariant cache hit.
[2023-03-23 00:53:31] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 946 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-23 00:53:31] [INFO ] Computed 102 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 70057 resets, run finished after 9161 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8371 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 1) seen :3
[2023-03-23 00:53:42] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 00:53:42] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-23 00:53:42] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-23 00:53:42] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 00:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:53:43] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-23 00:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:53:43] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-23 00:53:43] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:53:43] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-23 00:53:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:53:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 473 ms returned sat
[2023-03-23 00:53:44] [INFO ] Deduced a trap composed of 306 places in 328 ms of which 1 ms to minimize.
[2023-03-23 00:53:44] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 0 ms to minimize.
[2023-03-23 00:53:45] [INFO ] Deduced a trap composed of 310 places in 313 ms of which 1 ms to minimize.
[2023-03-23 00:53:45] [INFO ] Deduced a trap composed of 304 places in 338 ms of which 1 ms to minimize.
[2023-03-23 00:53:46] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 1 ms to minimize.
[2023-03-23 00:53:46] [INFO ] Deduced a trap composed of 302 places in 339 ms of which 1 ms to minimize.
[2023-03-23 00:53:46] [INFO ] Deduced a trap composed of 304 places in 364 ms of which 0 ms to minimize.
[2023-03-23 00:53:47] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 0 ms to minimize.
[2023-03-23 00:53:47] [INFO ] Deduced a trap composed of 296 places in 356 ms of which 1 ms to minimize.
[2023-03-23 00:53:48] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 1 ms to minimize.
[2023-03-23 00:53:48] [INFO ] Deduced a trap composed of 296 places in 336 ms of which 0 ms to minimize.
[2023-03-23 00:53:49] [INFO ] Deduced a trap composed of 302 places in 339 ms of which 1 ms to minimize.
[2023-03-23 00:53:49] [INFO ] Deduced a trap composed of 306 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:53:50] [INFO ] Deduced a trap composed of 302 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:53:50] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 0 ms to minimize.
[2023-03-23 00:53:50] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 0 ms to minimize.
[2023-03-23 00:53:51] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-23 00:53:51] [INFO ] Deduced a trap composed of 304 places in 319 ms of which 0 ms to minimize.
[2023-03-23 00:53:51] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-23 00:53:52] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:53:52] [INFO ] Deduced a trap composed of 310 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:53:53] [INFO ] Deduced a trap composed of 296 places in 348 ms of which 0 ms to minimize.
[2023-03-23 00:53:53] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 0 ms to minimize.
[2023-03-23 00:53:54] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:53:55] [INFO ] Deduced a trap composed of 302 places in 362 ms of which 0 ms to minimize.
[2023-03-23 00:53:55] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 1 ms to minimize.
[2023-03-23 00:53:55] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 0 ms to minimize.
[2023-03-23 00:53:56] [INFO ] Deduced a trap composed of 296 places in 352 ms of which 1 ms to minimize.
[2023-03-23 00:53:56] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 1 ms to minimize.
[2023-03-23 00:53:57] [INFO ] Deduced a trap composed of 298 places in 330 ms of which 1 ms to minimize.
[2023-03-23 00:53:57] [INFO ] Deduced a trap composed of 302 places in 342 ms of which 1 ms to minimize.
[2023-03-23 00:53:58] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 0 ms to minimize.
[2023-03-23 00:53:58] [INFO ] Deduced a trap composed of 290 places in 331 ms of which 1 ms to minimize.
[2023-03-23 00:53:58] [INFO ] Deduced a trap composed of 312 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:54:00] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-23 00:54:00] [INFO ] Deduced a trap composed of 292 places in 332 ms of which 0 ms to minimize.
[2023-03-23 00:54:00] [INFO ] Deduced a trap composed of 298 places in 358 ms of which 0 ms to minimize.
[2023-03-23 00:54:02] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-23 00:54:03] [INFO ] Deduced a trap composed of 294 places in 322 ms of which 1 ms to minimize.
[2023-03-23 00:54:05] [INFO ] Deduced a trap composed of 304 places in 319 ms of which 1 ms to minimize.
[2023-03-23 00:54:06] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2023-03-23 00:54:06] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-23 00:54:07] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:54:07] [INFO ] Deduced a trap composed of 306 places in 344 ms of which 1 ms to minimize.
[2023-03-23 00:54:08] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 1 ms to minimize.
[2023-03-23 00:54:09] [INFO ] Deduced a trap composed of 310 places in 318 ms of which 1 ms to minimize.
[2023-03-23 00:54:12] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 28094 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 40 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 40 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 49 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 00:54:12] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:54:12] [INFO ] Invariant cache hit.
[2023-03-23 00:54:13] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-23 00:54:13] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:54:13] [INFO ] Invariant cache hit.
[2023-03-23 00:54:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:54:16] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 4316 ms to find 0 implicit places.
[2023-03-23 00:54:16] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 00:54:16] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 00:54:16] [INFO ] Invariant cache hit.
[2023-03-23 00:54:17] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5120 ms. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13 in 52531 ms.
[2023-03-23 00:54:18] [INFO ] Flatten gal took : 351 ms
[2023-03-23 00:54:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 12 ms.
[2023-03-23 00:54:18] [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 206916 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J40
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 751 places, 1522 transitions, 9221 arcs.
Final Score: 170944.648
Took : 25 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13801932 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101004 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="smartxred"
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 smartxred"
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 r299-tall-167873953300693"
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 ;