fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Marcie+red for PolyORBLF-COL-S06J04T06

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6476.859 3600000.00 3703613.00 8078.00 4 1 1 2 1 1 1 1 1 10 3 1 1 3 ? 6 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-167873951700453.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 PolyORBLF-COL-S06J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951700453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679551735607

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=PolyORBLF-COL-S06J04T06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 06:08:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 06:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:08:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-23 06:08:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 06:08:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2023-03-23 06:08:58] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-23 06:08:58] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-23 06:08:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-23 06:08:58] [INFO ] Computed 26 place invariants in 10 ms
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 06:08:58] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-23 06:08:58] [INFO ] Computed 26 place invariants in 13 ms
[2023-03-23 06:08:58] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2023-03-23 06:08:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 24 ms returned sat
[2023-03-23 06:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:58] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-23 06:08:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:08:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-23 06:08:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2023-03-23 06:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:58] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-23 06:08:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-23 06:08:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-23 06:08:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-23 06:08:58] [INFO ] Added : 32 causal constraints over 7 iterations in 194 ms. Result :sat
Minimization took 96 ms.
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-23 06:08:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:08:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:59] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-23 06:08:59] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 7 ms to minimize.
[2023-03-23 06:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-23 06:08:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-23 06:08:59] [INFO ] Added : 37 causal constraints over 8 iterations in 132 ms. Result :sat
Minimization took 43 ms.
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using 11 positive place invariants in 83 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 38 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:59] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-23 06:08:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:08:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-23 06:09:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-23 06:09:00] [INFO ] Added : 59 causal constraints over 13 iterations in 157 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 06:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-23 06:09:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-23 06:09:00] [INFO ] Added : 6 causal constraints over 2 iterations in 46 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 06:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2023-03-23 06:09:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-23 06:09:00] [INFO ] Added : 50 causal constraints over 10 iterations in 89 ms. Result :sat
Minimization took 29 ms.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-23 06:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-23 06:09:01] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 06:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2023-03-23 06:09:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 06:09:01] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 06:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2023-03-23 06:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-23 06:09:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 06:09:01] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 4 ms to minimize.
[2023-03-23 06:09:01] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2023-03-23 06:09:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-23 06:09:01] [INFO ] Added : 53 causal constraints over 11 iterations in 202 ms. Result :sat
Minimization took 27 ms.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:01] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 06:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-23 06:09:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-23 06:09:02] [INFO ] Added : 55 causal constraints over 11 iterations in 112 ms. Result :sat
Minimization took 41 ms.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-23 06:09:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-23 06:09:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 06:09:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
[2023-03-23 06:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-23 06:09:02] [INFO ] Added : 54 causal constraints over 11 iterations in 140 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 06:09:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 06:09:02] [INFO ] Added : 31 causal constraints over 7 iterations in 62 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 06:09:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-23 06:09:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-23 06:09:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 06:09:03] [INFO ] Added : 30 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 89 ms.
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 06:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2023-03-23 06:09:03] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2023-03-23 06:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 06:09:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 06:09:03] [INFO ] Added : 22 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:03] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 06:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:03] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 06:09:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-23 06:09:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 06:09:03] [INFO ] Added : 52 causal constraints over 11 iterations in 108 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [41, 1, 1, 2, 1, 1, 1, 1, 10, 3, 6, 1, 3, 6, 6]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2023-03-23 06:09:03] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 244 ms.
[2023-03-23 06:09:03] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 14) seen :28
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :12
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :13
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :8
[2023-03-23 06:09:04] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2023-03-23 06:09:04] [INFO ] Computed 54 place invariants in 239 ms
[2023-03-23 06:09:04] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-23 06:09:04] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 58 ms returned unsat
[2023-03-23 06:09:05] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-23 06:09:05] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 40 ms returned unsat
[2023-03-23 06:09:05] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-23 06:09:05] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 80 ms returned sat
[2023-03-23 06:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:06] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-23 06:09:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-23 06:09:06] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 38 ms returned sat
[2023-03-23 06:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:07] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2023-03-23 06:09:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:09:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:09:11] [INFO ] [Nat]Added 168 Read/Feed constraints in 3684 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 1, 6] Max seen :[4, 1, 4]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 36 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 13 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 402 place count 428 transition count 2232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 428 transition count 2220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 416 transition count 2220
Applied a total of 426 rules in 587 ms. Remains 416 /632 variables (removed 216) and now considering 2220/2430 (removed 210) transitions.
[2023-03-23 06:09:11] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
// Phase 1: matrix 2184 rows 416 cols
[2023-03-23 06:09:11] [INFO ] Computed 48 place invariants in 46 ms
[2023-03-23 06:09:13] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 416/632 places, 1302/2430 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1987 ms. Remains : 416/632 places, 1302/2430 transitions.
Normalized transition count is 1266 out of 1302 initially.
// Phase 1: matrix 1266 rows 416 cols
[2023-03-23 06:09:13] [INFO ] Computed 48 place invariants in 39 ms
Incomplete random walk after 1000000 steps, including 11725 resets, run finished after 5269 ms. (steps per millisecond=189 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2102 resets, run finished after 2356 ms. (steps per millisecond=424 ) properties (out of 1) seen :4
[2023-03-23 06:09:20] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
// Phase 1: matrix 1266 rows 416 cols
[2023-03-23 06:09:20] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-23 06:09:21] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-23 06:09:21] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 15 ms returned sat
[2023-03-23 06:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:21] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-23 06:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-23 06:09:21] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 14 ms returned sat
[2023-03-23 06:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:21] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2023-03-23 06:09:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:09:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:09:27] [INFO ] [Nat]Added 168 Read/Feed constraints in 6016 ms returned unknown
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 24 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 416/416 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 37 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-23 06:09:27] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
[2023-03-23 06:09:28] [INFO ] Invariant cache hit.
[2023-03-23 06:09:28] [INFO ] Implicit Places using invariants in 774 ms returned [352, 353, 354, 355, 356, 357]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 781 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/416 places, 1302/1302 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 1296
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 1296
Applied a total of 12 rules in 63 ms. Remains 404 /410 variables (removed 6) and now considering 1296/1302 (removed 6) transitions.
[2023-03-23 06:09:28] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:09:28] [INFO ] Computed 42 place invariants in 21 ms
[2023-03-23 06:09:29] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-23 06:09:29] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:09:29] [INFO ] Invariant cache hit.
[2023-03-23 06:09:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:09:36] [INFO ] Implicit Places using invariants and state equation in 7414 ms returned []
Implicit Place search using SMT with State Equation took 7929 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 404/416 places, 1296/1302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8810 ms. Remains : 404/416 places, 1296/1302 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:09:36] [INFO ] Computed 42 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 11586 resets, run finished after 4816 ms. (steps per millisecond=207 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2041 resets, run finished after 2205 ms. (steps per millisecond=453 ) properties (out of 1) seen :4
[2023-03-23 06:09:43] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:09:43] [INFO ] Computed 42 place invariants in 22 ms
[2023-03-23 06:09:43] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:09:43] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-23 06:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:44] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-23 06:09:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:09:44] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-23 06:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:44] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-23 06:09:44] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:09:46] [INFO ] [Nat]Added 168 Read/Feed constraints in 1521 ms returned sat
[2023-03-23 06:09:46] [INFO ] Deduced a trap composed of 50 places in 323 ms of which 0 ms to minimize.
[2023-03-23 06:09:47] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 1 ms to minimize.
[2023-03-23 06:09:48] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 1 ms to minimize.
[2023-03-23 06:09:48] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 0 ms to minimize.
[2023-03-23 06:09:49] [INFO ] Deduced a trap composed of 182 places in 922 ms of which 0 ms to minimize.
[2023-03-23 06:09:51] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 0 ms to minimize.
[2023-03-23 06:09:52] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2023-03-23 06:09:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6022 ms
[2023-03-23 06:09:52] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 107 ms.
[2023-03-23 06:09:54] [INFO ] Added : 119 causal constraints over 24 iterations in 2252 ms. Result :sat
Minimization took 1784 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 48 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 37 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 06:09:58] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:09:58] [INFO ] Invariant cache hit.
[2023-03-23 06:09:59] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-23 06:09:59] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:09:59] [INFO ] Invariant cache hit.
[2023-03-23 06:09:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:10:10] [INFO ] Implicit Places using invariants and state equation in 10779 ms returned []
Implicit Place search using SMT with State Equation took 11496 ms to find 0 implicit places.
[2023-03-23 06:10:10] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-23 06:10:10] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:10:10] [INFO ] Invariant cache hit.
[2023-03-23 06:10:10] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12213 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:10:10] [INFO ] Computed 42 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 122 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :4
[2023-03-23 06:10:10] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:10:10] [INFO ] Computed 42 place invariants in 23 ms
[2023-03-23 06:10:11] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:10:11] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-23 06:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:11] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-23 06:10:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:10:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:10:11] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-23 06:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:11] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-23 06:10:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:10:13] [INFO ] [Nat]Added 168 Read/Feed constraints in 1545 ms returned sat
[2023-03-23 06:10:14] [INFO ] Deduced a trap composed of 50 places in 724 ms of which 0 ms to minimize.
[2023-03-23 06:10:15] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2023-03-23 06:10:15] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 0 ms to minimize.
[2023-03-23 06:10:16] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 0 ms to minimize.
[2023-03-23 06:10:16] [INFO ] Deduced a trap composed of 182 places in 237 ms of which 1 ms to minimize.
[2023-03-23 06:10:16] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3006 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 35 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 06:10:16] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:10:16] [INFO ] Invariant cache hit.
[2023-03-23 06:10:17] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1023 ms. Remains : 404/404 places, 1296/1296 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:10:17] [INFO ] Computed 42 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 11702 resets, run finished after 4766 ms. (steps per millisecond=209 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2204 resets, run finished after 2174 ms. (steps per millisecond=459 ) properties (out of 1) seen :4
[2023-03-23 06:10:24] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 06:10:24] [INFO ] Computed 42 place invariants in 26 ms
[2023-03-23 06:10:24] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:10:24] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-23 06:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:25] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-23 06:10:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:10:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 06:10:25] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-23 06:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:25] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2023-03-23 06:10:25] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:10:27] [INFO ] [Nat]Added 168 Read/Feed constraints in 1552 ms returned sat
[2023-03-23 06:10:27] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 0 ms to minimize.
[2023-03-23 06:10:28] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2023-03-23 06:10:29] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 0 ms to minimize.
[2023-03-23 06:10:29] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 4 ms to minimize.
[2023-03-23 06:10:29] [INFO ] Deduced a trap composed of 182 places in 239 ms of which 2 ms to minimize.
[2023-03-23 06:10:31] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 1 ms to minimize.
[2023-03-23 06:10:32] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2023-03-23 06:10:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5059 ms
[2023-03-23 06:10:32] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 107 ms.
[2023-03-23 06:10:34] [INFO ] Added : 119 causal constraints over 24 iterations in 2087 ms. Result :sat
Minimization took 1718 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 34 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 36 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 06:10:38] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:10:38] [INFO ] Invariant cache hit.
[2023-03-23 06:10:39] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-23 06:10:39] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:10:39] [INFO ] Invariant cache hit.
[2023-03-23 06:10:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 06:10:48] [INFO ] Implicit Places using invariants and state equation in 9442 ms returned []
Implicit Place search using SMT with State Equation took 9958 ms to find 0 implicit places.
[2023-03-23 06:10:48] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-23 06:10:48] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 06:10:48] [INFO ] Invariant cache hit.
[2023-03-23 06:10:49] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10641 ms. Remains : 404/404 places, 1296/1296 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14 in 38335 ms.
[2023-03-23 06:10:49] [INFO ] Flatten gal took : 262 ms
[2023-03-23 06:10:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2023-03-23 06:10:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 404 places, 1296 transitions and 7986 arcs took 35 ms.
Total runtime 112387 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: PolyORBLF_COL_S06J04T06_unf
(NrP: 404 NrTr: 1296 NrArc: 7986)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.072sec

net check time: 0m 0.000sec

init dd package: 0m 2.688sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9666692 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092684 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.006sec

50001 66505 77295 68700 73749 181422 215332 285372 295355 302536 827544 888064 935864 954252 1158646 1337486 1341534 1344943 1350427 1356634 1328622 1500743 1502707 1503431 1207721 994377

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="PolyORBLF-COL-S06J04T06"
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 PolyORBLF-COL-S06J04T06, 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-167873951700453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;