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-167873951700445
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7783.239 3600000.00 3645245.00 8038.60 1 1 1 4 4 1 1 4 1 1 5 1 1 ? 2 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-167873951700445.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-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951700445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:51 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.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:04 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-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679549203874

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-S06J04T04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 05:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:26:45] [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 05:26:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 05:26:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-23 05:26:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-23 05:26:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-23 05:26:46] [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 05:26:46] [INFO ] Computed 26 place invariants in 15 ms
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 05:26:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-23 05:26:46] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-23 05:26:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 05:26:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-23 05:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-23 05:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 05:26:46] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 05:26:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 05:26:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-23 05:26:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-23 05:26:46] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 3 ms to minimize.
[2023-03-23 05:26:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-23 05:26:46] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2023-03-23 05:26:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2023-03-23 05:26:46] [INFO ] Added : 57 causal constraints over 12 iterations in 316 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 22 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-23 05:26:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 05:26:47] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 05:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 27 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-23 05:26:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 05:26:47] [INFO ] Added : 27 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 96 ms.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 05:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 05:26:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-23 05:26:47] [INFO ] Added : 60 causal constraints over 12 iterations in 112 ms. Result :sat
Minimization took 22 ms.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 05:26:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-23 05:26:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 05:26:47] [INFO ] Added : 28 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 05:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-23 05:26:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 05:26:48] [INFO ] Added : 10 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 21 ms.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 05:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-23 05:26:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-23 05:26:48] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 05:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-23 05:26:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 05:26:48] [INFO ] Added : 60 causal constraints over 12 iterations in 101 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 05:26:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 05:26:48] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 05:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:48] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-23 05:26:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-23 05:26:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-23 05:26:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2023-03-23 05:26:49] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2023-03-23 05:26:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-23 05:26:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2023-03-23 05:26:49] [INFO ] Added : 59 causal constraints over 14 iterations in 267 ms. Result :sat
Minimization took 24 ms.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 05:26:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2023-03-23 05:26:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-23 05:26:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-23 05:26:49] [INFO ] Added : 23 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 35 ms.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 05:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-23 05:26:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 05:26:49] [INFO ] Added : 10 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 05:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 05:26:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-23 05:26:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 05:26:49] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2023-03-23 05:26:50] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2023-03-23 05:26:50] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2023-03-23 05:26:50] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2023-03-23 05:26:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2023-03-23 05:26:50] [INFO ] Added : 57 causal constraints over 12 iterations in 281 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 33, 5, 4, 4, 33, 1, 1, 87, 4, 4, 5, 4]
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
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2023-03-23 05:26:50] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 125 ms.
[2023-03-23 05:26:50] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :29
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :25
[2023-03-23 05:26:50] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2023-03-23 05:26:50] [INFO ] Computed 50 place invariants in 67 ms
[2023-03-23 05:26:50] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2023-03-23 05:26:50] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-23 05:26:50] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-23 05:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:51] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-23 05:26:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:52] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2023-03-23 05:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:52] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-23 05:26:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:26:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 1817 ms returned sat
[2023-03-23 05:26:54] [INFO ] Deduced a trap composed of 190 places in 314 ms of which 0 ms to minimize.
[2023-03-23 05:26:55] [INFO ] Deduced a trap composed of 85 places in 303 ms of which 1 ms to minimize.
[2023-03-23 05:26:56] [INFO ] Deduced a trap composed of 85 places in 306 ms of which 1 ms to minimize.
[2023-03-23 05:26:56] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2745 ms
[2023-03-23 05:26:57] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:57] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-23 05:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:26:57] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-23 05:26:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:26:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:57] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2023-03-23 05:26:57] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 05:26:57] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 4, 1, 1, 4, 5, 1, 4, 2, 1] Max seen :[1, 4, 4, 1, 1, 4, 5, 1, 2, 2, 1]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 215 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
[2023-03-23 05:26:58] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2023-03-23 05:26:58] [INFO ] Computed 44 place invariants in 41 ms
[2023-03-23 05:26:58] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/454 places, 862/1614 transitions.
Applied a total of 0 rules in 20 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 815 ms. Remains : 308/454 places, 862/1614 transitions.
Normalized transition count is 838 out of 862 initially.
// Phase 1: matrix 838 rows 308 cols
[2023-03-23 05:26:58] [INFO ] Computed 44 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 11005 resets, run finished after 3706 ms. (steps per millisecond=269 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 401 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 1) seen :2
[2023-03-23 05:27:04] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 308 cols
[2023-03-23 05:27:04] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-23 05:27:04] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 05:27:04] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-23 05:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:04] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2023-03-23 05:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:27:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:04] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-23 05:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:04] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-23 05:27:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 739 ms returned sat
[2023-03-23 05:27:05] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 1 ms to minimize.
[2023-03-23 05:27:05] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 1 ms to minimize.
[2023-03-23 05:27:06] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2023-03-23 05:27:06] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2023-03-23 05:27:06] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 0 ms to minimize.
[2023-03-23 05:27:07] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 0 ms to minimize.
[2023-03-23 05:27:07] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 1 ms to minimize.
[2023-03-23 05:27:07] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 1 ms to minimize.
[2023-03-23 05:27:07] [INFO ] Deduced a trap composed of 152 places in 190 ms of which 1 ms to minimize.
[2023-03-23 05:27:08] [INFO ] Deduced a trap composed of 140 places in 186 ms of which 0 ms to minimize.
[2023-03-23 05:27:08] [INFO ] Deduced a trap composed of 132 places in 185 ms of which 0 ms to minimize.
[2023-03-23 05:27:08] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 1 ms to minimize.
[2023-03-23 05:27:09] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 0 ms to minimize.
[2023-03-23 05:27:09] [INFO ] Deduced a trap composed of 147 places in 187 ms of which 0 ms to minimize.
[2023-03-23 05:27:09] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 0 ms to minimize.
[2023-03-23 05:27:10] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 0 ms to minimize.
[2023-03-23 05:27:10] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 0 ms to minimize.
[2023-03-23 05:27:11] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 0 ms to minimize.
[2023-03-23 05:27:14] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 9111 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 17 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 308/308 places, 862/862 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 17 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2023-03-23 05:27:14] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
[2023-03-23 05:27:14] [INFO ] Invariant cache hit.
[2023-03-23 05:27:15] [INFO ] Implicit Places using invariants in 264 ms returned [262, 263, 264, 265]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 268 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 862/862 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 300 transition count 858
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 300 transition count 858
Applied a total of 8 rules in 23 ms. Remains 300 /304 variables (removed 4) and now considering 858/862 (removed 4) transitions.
[2023-03-23 05:27:15] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:15] [INFO ] Computed 40 place invariants in 10 ms
[2023-03-23 05:27:15] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-23 05:27:15] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:15] [INFO ] Invariant cache hit.
[2023-03-23 05:27:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:19] [INFO ] Implicit Places using invariants and state equation in 4462 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/308 places, 858/862 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5036 ms. Remains : 300/308 places, 858/862 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:19] [INFO ] Computed 40 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 10972 resets, run finished after 3711 ms. (steps per millisecond=269 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 540 resets, run finished after 1776 ms. (steps per millisecond=563 ) properties (out of 1) seen :2
[2023-03-23 05:27:25] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:25] [INFO ] Computed 40 place invariants in 24 ms
[2023-03-23 05:27:25] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:25] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-23 05:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:25] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-23 05:27:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:27:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 05:27:25] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 11 ms returned sat
[2023-03-23 05:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:26] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-23 05:27:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 537 ms returned sat
[2023-03-23 05:27:26] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 1 ms to minimize.
[2023-03-23 05:27:27] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 0 ms to minimize.
[2023-03-23 05:27:27] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 4 ms to minimize.
[2023-03-23 05:27:27] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2023-03-23 05:27:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 958 ms
[2023-03-23 05:27:27] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 63 ms.
[2023-03-23 05:27:28] [INFO ] Added : 69 causal constraints over 14 iterations in 1153 ms. Result :sat
Minimization took 1093 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-23 05:27:30] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:30] [INFO ] Invariant cache hit.
[2023-03-23 05:27:30] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-23 05:27:30] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:30] [INFO ] Invariant cache hit.
[2023-03-23 05:27:31] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:34] [INFO ] Implicit Places using invariants and state equation in 3707 ms returned []
Implicit Place search using SMT with State Equation took 3970 ms to find 0 implicit places.
[2023-03-23 05:27:34] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-23 05:27:34] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:34] [INFO ] Invariant cache hit.
[2023-03-23 05:27:34] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4403 ms. Remains : 300/300 places, 858/858 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:34] [INFO ] Computed 40 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 100 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :2
[2023-03-23 05:27:34] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:34] [INFO ] Computed 40 place invariants in 21 ms
[2023-03-23 05:27:35] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:35] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-23 05:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:35] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-23 05:27:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:27:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:35] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-23 05:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:35] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-23 05:27:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 542 ms returned sat
[2023-03-23 05:27:36] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 1 ms to minimize.
[2023-03-23 05:27:36] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 1 ms to minimize.
[2023-03-23 05:27:36] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 0 ms to minimize.
[2023-03-23 05:27:37] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2023-03-23 05:27:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 955 ms
[2023-03-23 05:27:37] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 46 ms.
[2023-03-23 05:27:38] [INFO ] Added : 69 causal constraints over 14 iterations in 1116 ms. Result :sat
Minimization took 1081 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-23 05:27:39] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:39] [INFO ] Invariant cache hit.
[2023-03-23 05:27:40] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 300/300 places, 858/858 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:40] [INFO ] Computed 40 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 10862 resets, run finished after 3616 ms. (steps per millisecond=276 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 410 resets, run finished after 1820 ms. (steps per millisecond=549 ) properties (out of 1) seen :2
[2023-03-23 05:27:45] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-23 05:27:45] [INFO ] Computed 40 place invariants in 14 ms
[2023-03-23 05:27:45] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:45] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-23 05:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:46] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-03-23 05:27:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:27:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-23 05:27:46] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-23 05:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:46] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-23 05:27:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 523 ms returned sat
[2023-03-23 05:27:47] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 0 ms to minimize.
[2023-03-23 05:27:47] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 0 ms to minimize.
[2023-03-23 05:27:47] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 0 ms to minimize.
[2023-03-23 05:27:47] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 0 ms to minimize.
[2023-03-23 05:27:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 995 ms
[2023-03-23 05:27:48] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 51 ms.
[2023-03-23 05:27:49] [INFO ] Added : 69 causal constraints over 14 iterations in 1128 ms. Result :sat
Minimization took 1067 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-23 05:27:50] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:50] [INFO ] Invariant cache hit.
[2023-03-23 05:27:51] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-23 05:27:51] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:51] [INFO ] Invariant cache hit.
[2023-03-23 05:27:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-23 05:27:55] [INFO ] Implicit Places using invariants and state equation in 4858 ms returned []
Implicit Place search using SMT with State Equation took 5129 ms to find 0 implicit places.
[2023-03-23 05:27:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 05:27:55] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-23 05:27:55] [INFO ] Invariant cache hit.
[2023-03-23 05:27:56] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5554 ms. Remains : 300/300 places, 858/858 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13 in 21476 ms.
[2023-03-23 05:27:56] [INFO ] Flatten gal took : 119 ms
[2023-03-23 05:27:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 05:27:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 858 transitions and 5294 arcs took 5 ms.
Total runtime 71313 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_S06J04T04_unf
(NrP: 300 NrTr: 858 NrArc: 5294)

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

net check time: 0m 0.000sec

init dd package: 0m 2.755sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8360204 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097496 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

36831 63448 85545 265399 367033 397667 329034 759381 882008 918013 1280550 1321477 1679670 1518842 1471794 1731565 1199192 623484 1937381

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-S06J04T04"
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-S06J04T04, 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-167873951700445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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