About the Execution of Marcie+red for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6439.271 | 3600000.00 | 3649693.00 | 9024.40 | 4 1 2 1 1 3 1 1 1 4 10 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-167873952000661.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-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952000661
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 94K 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679624907927
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-S05J60
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 02:28:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 02:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 02:28:29] [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 02:28:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 02:28:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2023-03-24 02:28:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-24 02:28:30] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 02:28:30] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 02:28:30] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-24 02:28:30] [INFO ] Invariant cache hit.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-24 02:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-24 02:28:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:28:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-24 02:28:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-24 02:28:30] [INFO ] Added : 33 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-24 02:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 02:28:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 02:28:30] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 02:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-24 02:28:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 6 ms to minimize.
[2023-03-24 02:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-24 02:28:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 02:28:30] [INFO ] Added : 20 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 18 ms.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-24 02:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2023-03-24 02:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-24 02:28:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 02:28:31] [INFO ] Added : 36 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 13 ms.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 02:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 02:28:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-24 02:28:31] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2023-03-24 02:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-24 02:28:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 02:28:31] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2023-03-24 02:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 02:28:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 02:28:31] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-24 02:28:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-24 02:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-24 02:28:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-24 02:28:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-24 02:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-24 02:28:32] [INFO ] Added : 36 causal constraints over 8 iterations in 176 ms. Result :sat
Minimization took 13 ms.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 02:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-24 02:28:32] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-24 02:28:32] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2023-03-24 02:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-24 02:28:32] [INFO ] Added : 36 causal constraints over 8 iterations in 184 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2023-03-24 02:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-24 02:28:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 02:28:32] [INFO ] Added : 20 causal constraints over 4 iterations in 214 ms. Result :sat
Minimization took 17 ms.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-24 02:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-24 02:28:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 02:28:32] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 02:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-24 02:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 02:28:32] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-24 02:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-24 02:28:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 02:28:32] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 173 ms.
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 02:28:33] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-24 02:28:33] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2023-03-24 02:28:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2023-03-24 02:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 82 ms
[2023-03-24 02:28:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 02:28:33] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 21 ms.
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 02:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-24 02:28:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 02:28:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-24 02:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 02:28:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 02:28:33] [INFO ] Added : 22 causal constraints over 5 iterations in 157 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [5, -1, 2, -1, -1, 3, 1, -1, -1, 4, -1, 10, -1, 4]
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 02:28:33] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 51 ms.
[2023-03-24 02:28:33] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 12 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :24
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :19
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10000 steps, including 255 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :16
[2023-03-24 02:28:34] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-24 02:28:34] [INFO ] Computed 142 place invariants in 95 ms
[2023-03-24 02:28:34] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 02:28:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-24 02:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:34] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-24 02:28:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:35] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-24 02:28:35] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 02:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:40] [INFO ] [Nat]Absence check using state equation in 4860 ms returned unknown
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive place invariants in 52 ms returned sat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-24 02:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:41] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-24 02:28:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:41] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:41] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 02:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:41] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2023-03-24 02:28:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:28:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2023-03-24 02:28:42] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 99 ms.
[2023-03-24 02:28:42] [INFO ] Added : 8 causal constraints over 2 iterations in 358 ms. Result :sat
Minimization took 144 ms.
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-24 02:28:43] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:43] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-24 02:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:43] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-24 02:28:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:43] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 02:28:43] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-24 02:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:44] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-24 02:28:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 281 ms returned sat
[2023-03-24 02:28:44] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 88 ms.
[2023-03-24 02:28:45] [INFO ] Added : 16 causal constraints over 4 iterations in 1005 ms. Result :sat
Minimization took 404 ms.
[2023-03-24 02:28:46] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 02:28:46] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-24 02:28:46] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 02:28:46] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 02:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:46] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-24 02:28:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:28:46] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-24 02:28:46] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-24 02:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:28:47] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-24 02:28:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 392 ms returned sat
[2023-03-24 02:28:47] [INFO ] Deduced a trap composed of 507 places in 322 ms of which 5 ms to minimize.
[2023-03-24 02:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2023-03-24 02:28:48] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 69 ms.
[2023-03-24 02:28:48] [INFO ] Added : 19 causal constraints over 4 iterations in 465 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 1, 1, 1, 1, 1, 10, 1, 4] Max seen :[4, 1, 1, 1, 0, 1, 1, 1, 3, 1, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 307 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
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 271 place count 771 transition count 1182
Applied a total of 271 rules in 192 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2023-03-24 02:28:49] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2023-03-24 02:28:49] [INFO ] Computed 137 place invariants in 37 ms
[2023-03-24 02:28:50] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 38 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:28:50] [INFO ] Computed 137 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 47376 resets, run finished after 8648 ms. (steps per millisecond=115 ) properties (out of 3) seen :10
Finished Best-First random walk after 973932 steps, including 3280 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=194 )
Incomplete Best-First random walk after 1000001 steps, including 3310 resets, run finished after 1628 ms. (steps per millisecond=614 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 3317 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 3) seen :10
[2023-03-24 02:29:07] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:29:07] [INFO ] Computed 137 place invariants in 32 ms
[2023-03-24 02:29:07] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-24 02:29:07] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 02:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:07] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-24 02:29:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:29:07] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-24 02:29:07] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-24 02:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:11] [INFO ] [Nat]Absence check using state equation in 3376 ms returned unsat
[2023-03-24 02:29:11] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:29:11] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 02:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:11] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-24 02:29:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:29:11] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-24 02:29:11] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 02:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:12] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-24 02:29:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:29:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 249 ms returned sat
[2023-03-24 02:29:12] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2023-03-24 02:29:12] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 1 ms to minimize.
[2023-03-24 02:29:13] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:29:13] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:29:13] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:29:14] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 0 ms to minimize.
[2023-03-24 02:29:14] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:29:14] [INFO ] Deduced a trap composed of 245 places in 210 ms of which 0 ms to minimize.
[2023-03-24 02:29:15] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 1 ms to minimize.
[2023-03-24 02:29:15] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:29:15] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2023-03-24 02:29:17] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 1 ms to minimize.
[2023-03-24 02:29:17] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2023-03-24 02:29:20] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8541 ms
[2023-03-24 02:29:20] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-24 02:29:20] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 02:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:21] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-24 02:29:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:29:21] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:29:21] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 02:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:21] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-24 02:29:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 265 ms returned sat
[2023-03-24 02:29:22] [INFO ] Deduced a trap composed of 251 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:29:22] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 0 ms to minimize.
[2023-03-24 02:29:22] [INFO ] Deduced a trap composed of 230 places in 209 ms of which 0 ms to minimize.
[2023-03-24 02:29:23] [INFO ] Deduced a trap composed of 239 places in 215 ms of which 0 ms to minimize.
[2023-03-24 02:29:23] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 0 ms to minimize.
[2023-03-24 02:29:23] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 0 ms to minimize.
[2023-03-24 02:29:23] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 3 ms to minimize.
[2023-03-24 02:29:24] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 0 ms to minimize.
[2023-03-24 02:29:24] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:29:25] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 0 ms to minimize.
[2023-03-24 02:29:25] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:29:25] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:29:26] [INFO ] Deduced a trap composed of 255 places in 220 ms of which 0 ms to minimize.
[2023-03-24 02:29:26] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:29:26] [INFO ] Deduced a trap composed of 230 places in 206 ms of which 0 ms to minimize.
[2023-03-24 02:29:27] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 1 ms to minimize.
[2023-03-24 02:29:28] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:29:28] [INFO ] Deduced a trap composed of 245 places in 223 ms of which 0 ms to minimize.
[2023-03-24 02:29:28] [INFO ] Deduced a trap composed of 231 places in 217 ms of which 0 ms to minimize.
[2023-03-24 02:29:28] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 0 ms to minimize.
[2023-03-24 02:29:29] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 1 ms to minimize.
[2023-03-24 02:29:29] [INFO ] Deduced a trap composed of 248 places in 211 ms of which 1 ms to minimize.
[2023-03-24 02:29:30] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 2 ms to minimize.
[2023-03-24 02:29:30] [INFO ] Deduced a trap composed of 248 places in 216 ms of which 0 ms to minimize.
[2023-03-24 02:29:30] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 0 ms to minimize.
[2023-03-24 02:29:31] [INFO ] Deduced a trap composed of 239 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:29:32] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 0 ms to minimize.
[2023-03-24 02:29:33] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:29:36] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 14397 ms
Current structural bounds on expressions (after SMT) : [4, 10, 4] Max seen :[4, 3, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 47 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:29:36] [INFO ] Computed 137 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47141 resets, run finished after 4463 ms. (steps per millisecond=224 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3384 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3362 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 2) seen :6
[2023-03-24 02:29:43] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:29:43] [INFO ] Computed 137 place invariants in 18 ms
[2023-03-24 02:29:43] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:29:43] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-24 02:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:44] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-24 02:29:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:29:44] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:29:44] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 02:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:44] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-24 02:29:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:29:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2023-03-24 02:29:45] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 3 ms to minimize.
[2023-03-24 02:29:45] [INFO ] Deduced a trap composed of 233 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:29:45] [INFO ] Deduced a trap composed of 242 places in 208 ms of which 1 ms to minimize.
[2023-03-24 02:29:45] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 1 ms to minimize.
[2023-03-24 02:29:46] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 0 ms to minimize.
[2023-03-24 02:29:46] [INFO ] Deduced a trap composed of 245 places in 207 ms of which 0 ms to minimize.
[2023-03-24 02:29:46] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2023-03-24 02:29:47] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:29:47] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:29:48] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 2 ms to minimize.
[2023-03-24 02:29:48] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:29:49] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:29:50] [INFO ] Deduced a trap composed of 242 places in 208 ms of which 0 ms to minimize.
[2023-03-24 02:29:53] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8515 ms
[2023-03-24 02:29:53] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-24 02:29:53] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-24 02:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:53] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-24 02:29:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:29:54] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:29:54] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-24 02:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:29:54] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-24 02:29:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 264 ms returned sat
[2023-03-24 02:29:54] [INFO ] Deduced a trap composed of 251 places in 220 ms of which 2 ms to minimize.
[2023-03-24 02:29:55] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2023-03-24 02:29:55] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:29:55] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 0 ms to minimize.
[2023-03-24 02:29:56] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:29:56] [INFO ] Deduced a trap composed of 245 places in 206 ms of which 0 ms to minimize.
[2023-03-24 02:29:56] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:29:57] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:29:57] [INFO ] Deduced a trap composed of 224 places in 211 ms of which 1 ms to minimize.
[2023-03-24 02:29:57] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 0 ms to minimize.
[2023-03-24 02:29:58] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:29:58] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:29:58] [INFO ] Deduced a trap composed of 255 places in 225 ms of which 0 ms to minimize.
[2023-03-24 02:29:59] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 1 ms to minimize.
[2023-03-24 02:29:59] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2023-03-24 02:29:59] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2023-03-24 02:30:00] [INFO ] Deduced a trap composed of 245 places in 223 ms of which 1 ms to minimize.
[2023-03-24 02:30:00] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 0 ms to minimize.
[2023-03-24 02:30:01] [INFO ] Deduced a trap composed of 231 places in 207 ms of which 1 ms to minimize.
[2023-03-24 02:30:01] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:30:01] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 1 ms to minimize.
[2023-03-24 02:30:02] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:30:02] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 1 ms to minimize.
[2023-03-24 02:30:03] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:30:03] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 0 ms to minimize.
[2023-03-24 02:30:03] [INFO ] Deduced a trap composed of 239 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:30:05] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 0 ms to minimize.
[2023-03-24 02:30:06] [INFO ] Deduced a trap composed of 233 places in 224 ms of which 1 ms to minimize.
[2023-03-24 02:30:09] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 14384 ms
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-24 02:30:09] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:09] [INFO ] Invariant cache hit.
[2023-03-24 02:30:09] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-24 02:30:09] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:09] [INFO ] Invariant cache hit.
[2023-03-24 02:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:14] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 5006 ms to find 0 implicit places.
[2023-03-24 02:30:14] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-24 02:30:14] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:14] [INFO ] Invariant cache hit.
[2023-03-24 02:30:14] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5774 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:14] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 473 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2023-03-24 02:30:14] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:14] [INFO ] Computed 137 place invariants in 27 ms
[2023-03-24 02:30:15] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:30:15] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 02:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:15] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-24 02:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:30:15] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-24 02:30:15] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 02:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:15] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-24 02:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 238 ms returned sat
[2023-03-24 02:30:16] [INFO ] Deduced a trap composed of 239 places in 220 ms of which 0 ms to minimize.
[2023-03-24 02:30:16] [INFO ] Deduced a trap composed of 233 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:30:17] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 1 ms to minimize.
[2023-03-24 02:30:17] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 0 ms to minimize.
[2023-03-24 02:30:17] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:30:17] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 0 ms to minimize.
[2023-03-24 02:30:18] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:30:18] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:30:18] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 1 ms to minimize.
[2023-03-24 02:30:19] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:30:19] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:30:20] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 4337 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 26 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-24 02:30:20] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:20] [INFO ] Invariant cache hit.
[2023-03-24 02:30:21] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:21] [INFO ] Computed 137 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 47364 resets, run finished after 4456 ms. (steps per millisecond=224 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3421 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties (out of 1) seen :3
[2023-03-24 02:30:27] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:27] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-24 02:30:27] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-24 02:30:27] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 02:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:27] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-24 02:30:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:30:27] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:30:27] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 02:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:28] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-24 02:30:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 237 ms returned sat
[2023-03-24 02:30:28] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 0 ms to minimize.
[2023-03-24 02:30:28] [INFO ] Deduced a trap composed of 233 places in 216 ms of which 1 ms to minimize.
[2023-03-24 02:30:29] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:30:29] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2023-03-24 02:30:29] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:30:30] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:30:30] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 1 ms to minimize.
[2023-03-24 02:30:30] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:30:31] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:30:31] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:30:31] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:30:32] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:30:33] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:30:36] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8473 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 34 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 24 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-24 02:30:36] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:36] [INFO ] Invariant cache hit.
[2023-03-24 02:30:37] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-24 02:30:37] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:37] [INFO ] Invariant cache hit.
[2023-03-24 02:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:42] [INFO ] Implicit Places using invariants and state equation in 4809 ms returned []
Implicit Place search using SMT with State Equation took 5632 ms to find 0 implicit places.
[2023-03-24 02:30:42] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 02:30:42] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 02:30:42] [INFO ] Invariant cache hit.
[2023-03-24 02:30:43] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6342 ms. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12 in 28333 ms.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:43] [INFO ] Computed 137 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 473 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-24 02:30:43] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 02:30:43] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-24 02:30:43] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-24 02:30:43] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 02:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:43] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-24 02:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:30:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-24 02:30:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 02:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:44] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2023-03-24 02:30:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2023-03-24 02:30:44] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 0 ms to minimize.
[2023-03-24 02:30:44] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:30:45] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 1 ms to minimize.
[2023-03-24 02:30:45] [INFO ] Deduced a trap composed of 239 places in 208 ms of which 0 ms to minimize.
[2023-03-24 02:30:45] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 1 ms to minimize.
[2023-03-24 02:30:46] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2023-03-24 02:30:46] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:30:47] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 0 ms to minimize.
[2023-03-24 02:30:47] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:30:47] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:30:47] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 1 ms to minimize.
[2023-03-24 02:30:48] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 0 ms to minimize.
[2023-03-24 02:30:48] [INFO ] Deduced a trap composed of 255 places in 231 ms of which 1 ms to minimize.
[2023-03-24 02:30:48] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 1 ms to minimize.
[2023-03-24 02:30:48] [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) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 27 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2023-03-24 02:30:48] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-24 02:30:48] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-24 02:30:49] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2023-03-24 02:30:49] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 52018 resets, run finished after 4711 ms. (steps per millisecond=212 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3432 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 1) seen :3
[2023-03-24 02:30:55] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-24 02:30:55] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-24 02:30:55] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-24 02:30:55] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-24 02:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:56] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-24 02:30:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 02:30:56] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-24 02:30:56] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-24 02:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 02:30:56] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-24 02:30:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:30:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2023-03-24 02:30:57] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:30:57] [INFO ] Deduced a trap composed of 248 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:30:57] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:30:57] [INFO ] Deduced a trap composed of 221 places in 220 ms of which 1 ms to minimize.
[2023-03-24 02:30:58] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:30:58] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 1 ms to minimize.
[2023-03-24 02:30:58] [INFO ] Deduced a trap composed of 251 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:30:59] [INFO ] Deduced a trap composed of 251 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:30:59] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:30:59] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 0 ms to minimize.
[2023-03-24 02:31:00] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 1 ms to minimize.
[2023-03-24 02:31:00] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2023-03-24 02:31:01] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:31:01] [INFO ] Deduced a trap composed of 245 places in 211 ms of which 0 ms to minimize.
[2023-03-24 02:31:02] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:31:02] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 1 ms to minimize.
[2023-03-24 02:31:03] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 1 ms to minimize.
[2023-03-24 02:31:03] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 1 ms to minimize.
[2023-03-24 02:31:04] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 0 ms to minimize.
[2023-03-24 02:31:04] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 1 ms to minimize.
[2023-03-24 02:31:04] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 0 ms to minimize.
[2023-03-24 02:31:04] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 1 ms to minimize.
[2023-03-24 02:31:05] [INFO ] Deduced a trap composed of 233 places in 208 ms of which 1 ms to minimize.
[2023-03-24 02:31:05] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2023-03-24 02:31:06] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 0 ms to minimize.
[2023-03-24 02:31:06] [INFO ] Deduced a trap composed of 233 places in 213 ms of which 1 ms to minimize.
[2023-03-24 02:31:06] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 1 ms to minimize.
[2023-03-24 02:31:07] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 0 ms to minimize.
[2023-03-24 02:31:09] [INFO ] Deduced a trap composed of 239 places in 207 ms of which 1 ms to minimize.
[2023-03-24 02:31:10] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 1 ms to minimize.
[2023-03-24 02:31:11] [INFO ] Deduced a trap composed of 254 places in 210 ms of which 0 ms to minimize.
[2023-03-24 02:31:14] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 17520 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-24 02:31:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 02:31:14] [INFO ] Invariant cache hit.
[2023-03-24 02:31:15] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-24 02:31:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 02:31:15] [INFO ] Invariant cache hit.
[2023-03-24 02:31:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:31:18] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 3718 ms to find 0 implicit places.
[2023-03-24 02:31:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-24 02:31:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 02:31:18] [INFO ] Invariant cache hit.
[2023-03-24 02:31:18] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4402 ms. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14 in 35568 ms.
[2023-03-24 02:31:18] [INFO ] Flatten gal took : 137 ms
[2023-03-24 02:31:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 02:31:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 771 places, 1087 transitions and 5511 arcs took 7 ms.
Total runtime 169649 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_S05J60_unf
(NrP: 771 NrTr: 1087 NrArc: 5511)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.077sec
net check time: 0m 0.000sec
init dd package: 0m 2.703sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9702884 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094720 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
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.004sec
6433344
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-S05J60"
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-S05J60, 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-167873952000661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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 ;