fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Marcie+red for DES-PT-20b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8550.063 264217.00 279484.00 449.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482700437.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 DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 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 DES-PT-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678391904091

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=DES-PT-20b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 19:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:58:25] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-09 19:58:25] [INFO ] Transformed 360 places.
[2023-03-09 19:58:25] [INFO ] Transformed 311 transitions.
[2023-03-09 19:58:25] [INFO ] Found NUPN structural information;
[2023-03-09 19:58:25] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 311 rows 360 cols
[2023-03-09 19:58:25] [INFO ] Computed 65 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :13
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
[2023-03-09 19:58:26] [INFO ] Invariant cache hit.
[2023-03-09 19:58:26] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2023-03-09 19:58:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-09 19:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:26] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-09 19:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2023-03-09 19:58:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2023-03-09 19:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:26] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-09 19:58:26] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 17 ms to minimize.
[2023-03-09 19:58:26] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-09 19:58:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-03-09 19:58:27] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 19:58:28] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-09 19:58:29] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2023-03-09 19:58:29] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2023-03-09 19:58:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2023-03-09 19:58:29] [INFO ] Added : 276 causal constraints over 56 iterations in 2187 ms. Result :sat
Minimization took 146 ms.
[2023-03-09 19:58:29] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 19:58:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-09 19:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:29] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-09 19:58:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 19:58:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 19:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:29] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-09 19:58:29] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-09 19:58:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-09 19:58:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-09 19:58:29] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-03-09 19:58:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 643 ms
[2023-03-09 19:58:31] [INFO ] Added : 235 causal constraints over 48 iterations in 1976 ms. Result :sat
Minimization took 190 ms.
[2023-03-09 19:58:32] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 19:58:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-09 19:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:32] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-09 19:58:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 19:58:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-09 19:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:32] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-09 19:58:32] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2023-03-09 19:58:32] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2023-03-09 19:58:32] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-09 19:58:33] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-09 19:58:33] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-03-09 19:58:33] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-09 19:58:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 601 ms
[2023-03-09 19:58:33] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 17 ms.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 0 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-09 19:58:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 819 ms
[2023-03-09 19:58:35] [INFO ] Added : 286 causal constraints over 58 iterations in 2698 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 349 transition count 283
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 328 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 328 transition count 274
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 300 transition count 255
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 300 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 300 transition count 254
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 299 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 284 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 284 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 284 transition count 224
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 282 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 279 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 202 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 200 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 200 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 199 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 199 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 198 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 197 transition count 143
Applied a total of 320 rules in 132 ms. Remains 197 /360 variables (removed 163) and now considering 143/311 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 197/360 places, 143/311 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-09 19:58:37] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 48012 resets, run finished after 1764 ms. (steps per millisecond=566 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9156 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9150 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9155 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 3) seen :0
[2023-03-09 19:58:41] [INFO ] Invariant cache hit.
[2023-03-09 19:58:41] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:42] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-09 19:58:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 231 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 19:58:42] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 19:58:42] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-03-09 19:58:42] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2023-03-09 19:58:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-09 19:58:42] [INFO ] Added : 116 causal constraints over 24 iterations in 361 ms. Result :sat
Minimization took 38 ms.
[2023-03-09 19:58:42] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:42] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 19:58:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 72 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:43] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-09 19:58:43] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 19:58:43] [INFO ] Added : 101 causal constraints over 21 iterations in 218 ms. Result :sat
Minimization took 50 ms.
[2023-03-09 19:58:43] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 19:58:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-09 19:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:43] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-09 19:58:43] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 19:58:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2023-03-09 19:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 19:58:44] [INFO ] Added : 119 causal constraints over 24 iterations in 328 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 19:58:44] [INFO ] Invariant cache hit.
[2023-03-09 19:58:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-09 19:58:44] [INFO ] Invariant cache hit.
[2023-03-09 19:58:44] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 19:58:44] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 19:58:44] [INFO ] Invariant cache hit.
[2023-03-09 19:58:44] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 197/197 places, 143/143 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-00
[2023-03-09 19:58:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 493 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 19:58:45] [INFO ] Invariant cache hit.
[2023-03-09 19:58:45] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 19:58:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 19:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:45] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 19:58:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 231 ms returned sat
[2023-03-09 19:58:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-09 19:58:45] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 19:58:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-09 19:58:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2023-03-09 19:58:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-09 19:58:45] [INFO ] Added : 116 causal constraints over 24 iterations in 378 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 19:58:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47840 resets, run finished after 1716 ms. (steps per millisecond=582 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9143 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
[2023-03-09 19:58:48] [INFO ] Invariant cache hit.
[2023-03-09 19:58:48] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 19:58:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:48] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-09 19:58:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 233 ms returned sat
[2023-03-09 19:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:48] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-09 19:58:49] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 19:58:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-09 19:58:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 4 ms to minimize.
[2023-03-09 19:58:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-09 19:58:49] [INFO ] Added : 116 causal constraints over 24 iterations in 374 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 19:58:49] [INFO ] Invariant cache hit.
[2023-03-09 19:58:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 19:58:49] [INFO ] Invariant cache hit.
[2023-03-09 19:58:49] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-09 19:58:49] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 19:58:49] [INFO ] Invariant cache hit.
[2023-03-09 19:58:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-00 in 5001 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-04
[2023-03-09 19:58:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 19:58:50] [INFO ] Invariant cache hit.
[2023-03-09 19:58:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:50] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-09 19:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 71 ms returned sat
[2023-03-09 19:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:50] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-09 19:58:50] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 19:58:50] [INFO ] Added : 101 causal constraints over 21 iterations in 234 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 19:58:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47753 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9184 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 1) seen :0
[2023-03-09 19:58:53] [INFO ] Invariant cache hit.
[2023-03-09 19:58:53] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:53] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 19:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-09 19:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:53] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 19:58:53] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 19:58:53] [INFO ] Added : 101 causal constraints over 21 iterations in 226 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 19:58:53] [INFO ] Invariant cache hit.
[2023-03-09 19:58:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 19:58:53] [INFO ] Invariant cache hit.
[2023-03-09 19:58:54] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-09 19:58:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 19:58:54] [INFO ] Invariant cache hit.
[2023-03-09 19:58:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-04 in 4237 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-11
[2023-03-09 19:58:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 464 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 19:58:54] [INFO ] Invariant cache hit.
[2023-03-09 19:58:54] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 19:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:54] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 19:58:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-09 19:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:54] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-09 19:58:54] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 19:58:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2023-03-09 19:58:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-09 19:58:54] [INFO ] Added : 119 causal constraints over 24 iterations in 336 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 19:58:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47817 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9046 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :0
[2023-03-09 19:58:57] [INFO ] Invariant cache hit.
[2023-03-09 19:58:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 19:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:57] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-09 19:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 19:58:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:58:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-09 19:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 19:58:57] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-09 19:58:57] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 19:58:58] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2023-03-09 19:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 19:58:58] [INFO ] Added : 119 causal constraints over 24 iterations in 327 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 19:58:58] [INFO ] Invariant cache hit.
[2023-03-09 19:58:58] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-09 19:58:58] [INFO ] Invariant cache hit.
[2023-03-09 19:58:58] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 19:58:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 19:58:58] [INFO ] Invariant cache hit.
[2023-03-09 19:58:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-11 in 4669 ms.
[2023-03-09 19:58:59] [INFO ] Flatten gal took : 58 ms
[2023-03-09 19:58:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 32 ms.
[2023-03-09 19:58:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 143 transitions and 711 arcs took 3 ms.
Total runtime 33629 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: DES_PT_20b
(NrP: 197 NrTr: 143 NrArc: 711)

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

net check time: 0m 0.000sec

init dd package: 0m 2.735sec


RS generation: 3m40.451sec


-> reachability set: #nodes 487818 (4.9e+05) #states 9,638,559,829,248 (12)



starting MCC model checker
--------------------------

checking: place_bound(p4)
normalized: place_bound(p4)

-> the formula is 1

FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p42)
normalized: place_bound(p42)

-> the formula is 1

FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p63)
normalized: place_bound(p63)

-> the formula is 1

FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 43651807 (4.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 112488790 672073526 784562316
used/not used/entry size/cache size: 67107249 1615 16 1024MB
basic ops cache: hits/miss/sum: 1577032 7783705 9360737
used/not used/entry size/cache size: 7223455 9553761 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 83619 487874 571493
used/not used/entry size/cache size: 474669 7913939 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 35944954
1 21485060
2 7387787
3 1854501
4 366339
5 60414
6 8568
7 1102
8 131
9 6
>= 10 2

Total processing time: 3m48.136sec


BK_STOP 1678392168308

--------------------
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.000sec

571319 611059 499078 486237 485957 631292
iterations count:625333 (4372), effective:55521 (388)

initing FirstDep: 0m 0.000sec

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="DES-PT-20b"
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 DES-PT-20b, 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 r106-tall-167814482700437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 ;