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-167814482700422.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-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 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 79K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678389364993

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:16:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 19:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:16:06] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 19:16:06] [INFO ] Transformed 320 places.
[2023-03-09 19:16:06] [INFO ] Transformed 271 transitions.
[2023-03-09 19:16:06] [INFO ] Found NUPN structural information;
[2023-03-09 19:16:06] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 12) seen :9
FORMULA DES-PT-10b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 19:16:07] [INFO ] Computed 65 place invariants in 26 ms
[2023-03-09 19:16:07] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 19:16:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 19:16:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-09 19:16:08] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 19:16:08] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 4 ms to minimize.
[2023-03-09 19:16:08] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2023-03-09 19:16:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-09 19:16:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2023-03-09 19:16:08] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-09 19:16:09] [INFO ] After 1598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 61 ms.
Support contains 50 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 311 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 311 transition count 260
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 303 transition count 254
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 297 transition count 254
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 29 place count 297 transition count 248
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 41 place count 291 transition count 248
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 58 place count 274 transition count 231
Iterating global reduction 3 with 17 rules applied. Total rules applied 75 place count 274 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 274 transition count 230
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 273 transition count 230
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 88 place count 262 transition count 219
Iterating global reduction 3 with 11 rules applied. Total rules applied 99 place count 262 transition count 219
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 110 place count 262 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 261 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 111 place count 261 transition count 207
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 260 transition count 207
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 215 place count 209 transition count 156
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 209 transition count 155
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 209 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 222 place count 206 transition count 152
Applied a total of 222 rules in 106 ms. Remains 206 /320 variables (removed 114) and now considering 152/271 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 206/320 places, 152/271 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1150599 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1150599 steps, saw 177257 distinct states, run finished after 3002 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 206 cols
[2023-03-09 19:16:12] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-09 19:16:12] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 19:16:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 19:16:12] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-09 19:16:12] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 19:16:12] [INFO ] After 97ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-09 19:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 19:16:13] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-09 19:16:13] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 50 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 19:16:13] [INFO ] Invariant cache hit.
[2023-03-09 19:16:13] [INFO ] Implicit Places using invariants in 115 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 131 ms. Remains : 205/206 places, 152/152 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1003533 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003533 steps, saw 155834 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 205 cols
[2023-03-09 19:16:16] [INFO ] Computed 58 place invariants in 12 ms
[2023-03-09 19:16:16] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 19:16:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-09 19:16:16] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-09 19:16:16] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 19:16:16] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-09 19:16:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-09 19:16:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-09 19:16:17] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-09 19:16:17] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-09 19:16:17] [INFO ] Invariant cache hit.
[2023-03-09 19:16:17] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-09 19:16:17] [INFO ] Invariant cache hit.
[2023-03-09 19:16:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 19:16:17] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-09 19:16:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 19:16:17] [INFO ] Invariant cache hit.
[2023-03-09 19:16:17] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 19:16:17] [INFO ] Invariant cache hit.
[2023-03-09 19:16:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 19:16:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-09 19:16:17] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 19:16:17] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-09 19:16:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 236 ms
[2023-03-09 19:16:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-09 19:16:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-09 19:16:18] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-09 19:16:18] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 19:16:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-09 19:16:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 152 transitions and 593 arcs took 1 ms.
[2023-03-09 19:16:18] [INFO ] Flatten gal took : 39 ms
Total runtime 12189 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_10b
(NrP: 205 NrTr: 152 NrArc: 593)

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

net check time: 0m 0.000sec

init dd package: 0m 2.704sec


RS generation: 0m49.902sec


-> reachability set: #nodes 379838 (3.8e+05) #states 3,203,223,736,758,426 (15)



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

checking: AG [[[0<=p28 & p28<=0] | [p70<=0 & 0<=p70]]]
normalized: ~ [E [true U ~ [[[p70<=0 & 0<=p70] | [0<=p28 & p28<=0]]]]]

abstracting: (p28<=0)
states: 2,849,020,735,032,152 (15)
abstracting: (0<=p28)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p70)
states: 3,203,223,736,758,426 (15)
abstracting: (p70<=0)
states: 2,852,716,420,950,735 (15)

before gc: list nodes free: 787349

after gc: idd nodes used:1133691, unused:62866309; list nodes free:280116568
-> the formula is FALSE

FORMULA DES-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m42.356sec

checking: EF [[[[[p7<=1 & 1<=p7] & [[p195<=0 & 0<=p195] | [[[p176<=0 & 0<=p176] | [p71<=1 & 1<=p71]] & [[[p78<=0 & 0<=p78] | [p136<=1 & 1<=p136]] | [[p45<=0 & 0<=p45] | [p101<=1 & 1<=p101]]]]]] | [[[p80<=1 & 1<=p80] & [[p182<=0 & 0<=p182] & [p174<=1 & 1<=p174]]] | [[[p76<=1 & 1<=p76] & [[p67<=0 & 0<=p67] & [p177<=1 & 1<=p177]]] & [[[[[p95<=0 & 0<=p95] & [p61<=1 & 1<=p61]] | [[p102<=0 & 0<=p102] & [p101<=1 & 1<=p101]]] & [[p1<=0 & 0<=p1] | [p58<=1 & 1<=p58]]] & [[[p148<=1 & 1<=p148] | [[p65<=1 & 1<=p65] | [[p72<=1 & 1<=p72] & [[p19<=0 & 0<=p19] & [p124<=0 & 0<=p124]]]]] & [[p198<=0 & 0<=p198] | [[p7<=1 & 1<=p7] | [[p45<=0 & 0<=p45] & [[[p155<=0 & 0<=p155] & [p74<=1 & 1<=p74]] | [[p84<=0 & 0<=p84] & [p71<=1 & 1<=p71]]]]]]]]]]] & [[p74<=1 & 1<=p74] | [[[[[[[[[p53<=0 & 0<=p53] & [p142<=1 & 1<=p142]] | [[[p94<=0 & 0<=p94] | [p51<=1 & 1<=p51]] & [[p180<=1 & 1<=p180] | [[p73<=0 & 0<=p73] | [p187<=1 & 1<=p187]]]]] | [p52<=1 & 1<=p52]] | [[p55<=0 & 0<=p55] | [[p196<=0 & 0<=p196] | [p28<=1 & 1<=p28]]]] & [[p110<=1 & 1<=p110] | [[p13<=0 & 0<=p13] & [p0<=1 & 1<=p0]]]] & [[p186<=0 & 0<=p186] | [p151<=1 & 1<=p151]]] & [[p139<=0 & 0<=p139] & [[p117<=1 & 1<=p117] & [p63<=0 & 0<=p63]]]] | [[[p128<=0 & 0<=p128] & [p164<=1 & 1<=p164]] & [[p13<=0 & 0<=p13] & [p76<=1 & 1<=p76]]]]]]]
normalized: E [true U [[[[[[p76<=1 & 1<=p76] & [p13<=0 & 0<=p13]] & [[p164<=1 & 1<=p164] & [p128<=0 & 0<=p128]]] | [[[[p63<=0 & 0<=p63] & [p117<=1 & 1<=p117]] & [p139<=0 & 0<=p139]] & [[[p151<=1 & 1<=p151] | [p186<=0 & 0<=p186]] & [[[[p0<=1 & 1<=p0] & [p13<=0 & 0<=p13]] | [p110<=1 & 1<=p110]] & [[[[p28<=1 & 1<=p28] | [p196<=0 & 0<=p196]] | [p55<=0 & 0<=p55]] | [[p52<=1 & 1<=p52] | [[[[[p187<=1 & 1<=p187] | [p73<=0 & 0<=p73]] | [p180<=1 & 1<=p180]] & [[p51<=1 & 1<=p51] | [p94<=0 & 0<=p94]]] | [[p142<=1 & 1<=p142] & [p53<=0 & 0<=p53]]]]]]]]] | [p74<=1 & 1<=p74]] & [[[[[[[[[[[p71<=1 & 1<=p71] & [p84<=0 & 0<=p84]] | [[p74<=1 & 1<=p74] & [p155<=0 & 0<=p155]]] & [p45<=0 & 0<=p45]] | [p7<=1 & 1<=p7]] | [p198<=0 & 0<=p198]] & [[[[[p124<=0 & 0<=p124] & [p19<=0 & 0<=p19]] & [p72<=1 & 1<=p72]] | [p65<=1 & 1<=p65]] | [p148<=1 & 1<=p148]]] & [[[p58<=1 & 1<=p58] | [p1<=0 & 0<=p1]] & [[[p101<=1 & 1<=p101] & [p102<=0 & 0<=p102]] | [[p61<=1 & 1<=p61] & [p95<=0 & 0<=p95]]]]] & [[[p177<=1 & 1<=p177] & [p67<=0 & 0<=p67]] & [p76<=1 & 1<=p76]]] | [[[p174<=1 & 1<=p174] & [p182<=0 & 0<=p182]] & [p80<=1 & 1<=p80]]] | [[[[[[p101<=1 & 1<=p101] | [p45<=0 & 0<=p45]] | [[p136<=1 & 1<=p136] | [p78<=0 & 0<=p78]]] & [[p71<=1 & 1<=p71] | [p176<=0 & 0<=p176]]] | [p195<=0 & 0<=p195]] & [p7<=1 & 1<=p7]]]]]

abstracting: (1<=p7)
states: 419,854,916,839,160 (14)
abstracting: (p7<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p195)
states: 3,203,223,736,758,426 (15)
abstracting: (p195<=0)
states: 3,021,354,714,881,054 (15)
abstracting: (0<=p176)
states: 3,203,223,736,758,426 (15)
abstracting: (p176<=0)
states: 2,844,483,467,597,814 (15)
abstracting: (1<=p71)
states: 350,507,315,807,691 (14)
abstracting: (p71<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p78)
states: 3,203,223,736,758,426 (15)
abstracting: (p78<=0)
states: 2,968,203,697,051,082 (15)
abstracting: (1<=p136)
states: 1,245,502,883,258,831 (15)
abstracting: (p136<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p45)
states: 3,203,223,736,758,426 (15)
abstracting: (p45<=0)
states: 2,164,456,202,559,626 (15)
abstracting: (1<=p101)
states: 60,070 (4)
abstracting: (p101<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p80)
states: 235,020,039,707,344 (14)
abstracting: (p80<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p182)
states: 3,203,223,736,758,426 (15)
abstracting: (p182<=0)
states: 3,168,519,496,241,134 (15)
abstracting: (1<=p174)
states: 122,592,559,634,272 (14)
abstracting: (p174<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p76)
states: 235,020,039,707,344 (14)
abstracting: (p76<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p67)
states: 3,203,223,736,758,426 (15)
abstracting: (p67<=0)
states: 3,203,223,732,965,055 (15)
abstracting: (1<=p177)
states: 190,427,123,552,920 (14)
abstracting: (p177<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p95)
states: 3,203,223,736,758,426 (15)
abstracting: (p95<=0)
states: 2,541,169,783,707,438 (15)
abstracting: (1<=p61)
states: 534,928,326,634,367 (14)
abstracting: (p61<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p102)
states: 3,203,223,736,758,426 (15)
abstracting: (p102<=0)
states: 3,203,223,732,697,888 (15)
abstracting: (1<=p101)
states: 60,070 (4)
abstracting: (p101<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p1)
states: 3,203,223,736,758,426 (15)
abstracting: (p1<=0)
states: 3,203,223,736,758,366 (15)
abstracting: (1<=p58)
states: 799,219,378,427,317 (14)
abstracting: (p58<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p148)
states: 3,488,622,603,360 (12)
abstracting: (p148<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p65)
states: 1,109,626,947,967,929 (15)
abstracting: (p65<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p72)
states: 350,507,315,807,691 (14)
abstracting: (p72<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p19)
states: 3,203,223,736,758,426 (15)
abstracting: (p19<=0)
states: 2,842,061,605,275,444 (15)
abstracting: (0<=p124)
states: 3,203,223,736,758,426 (15)
abstracting: (p124<=0)
states: 2,105,487,291,486,079 (15)
abstracting: (0<=p198)
states: 3,203,223,736,758,426 (15)
abstracting: (p198<=0)
states: 2,985,381,247,624,454 (15)
abstracting: (1<=p7)
states: 419,854,916,839,160 (14)
abstracting: (p7<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p45)
states: 3,203,223,736,758,426 (15)
abstracting: (p45<=0)
states: 2,164,456,202,559,626 (15)
abstracting: (0<=p155)
states: 3,203,223,736,758,426 (15)
abstracting: (p155<=0)
states: 2,093,633,779,375,115 (15)
abstracting: (1<=p74)
states: 377,188,354,582,822 (14)
abstracting: (p74<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p84)
states: 3,203,223,736,758,426 (15)
abstracting: (p84<=0)
states: 2,796,173,597,343,564 (15)
abstracting: (1<=p71)
states: 350,507,315,807,691 (14)
abstracting: (p71<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p74)
states: 377,188,354,582,822 (14)
abstracting: (p74<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p53)
states: 3,203,223,736,758,426 (15)
abstracting: (p53<=0)
states: 2,669,134,591,274,459 (15)
abstracting: (1<=p142)
states: 1,267,273,453,091,606 (15)
abstracting: (p142<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p94)
states: 3,203,223,736,758,426 (15)
abstracting: (p94<=0)
states: 1,690,162,619,235,567 (15)
abstracting: (1<=p51)
states: 534,089,145,483,967 (14)
abstracting: (p51<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p180)
states: 358,740,269,160,612 (14)
abstracting: (p180<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p73)
states: 3,203,223,736,758,426 (15)
abstracting: (p73<=0)
states: 2,852,716,420,950,735 (15)
abstracting: (1<=p187)
states: 670,048,548,988,749 (14)
abstracting: (p187<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p52)
states: 534,089,145,483,967 (14)
abstracting: (p52<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p55)
states: 3,203,223,736,758,426 (15)
abstracting: (p55<=0)
states: 1,868,365,772,935,521 (15)
abstracting: (0<=p196)
states: 3,203,223,736,758,426 (15)
abstracting: (p196<=0)
states: 2,669,499,365,119,415 (15)
abstracting: (1<=p28)
states: 354,203,001,726,274 (14)
abstracting: (p28<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (1<=p110)
states: 778,775,878,225,094 (14)
abstracting: (p110<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p13)
states: 3,203,223,736,758,426 (15)
abstracting: (p13<=0)
states: 3,203,223,722,736,972 (15)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p186)
states: 3,203,223,736,758,426 (15)
abstracting: (p186<=0)
states: 3,123,276,545,551,762 (15)
abstracting: (1<=p151)
states: 1,024,217,463,227,783 (15)
abstracting: (p151<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p139)
states: 3,203,223,736,758,426 (15)
abstracting: (p139<=0)
states: 1,935,950,283,666,820 (15)
abstracting: (1<=p117)
states: 1,688,305,787,329,740 (15)
abstracting: (p117<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p63)
states: 3,203,223,736,758,426 (15)
abstracting: (p63<=0)
states: 3,203,223,732,965,055 (15)
abstracting: (0<=p128)
states: 3,203,223,736,758,426 (15)
abstracting: (p128<=0)
states: 3,203,221,564,858,930 (15)
abstracting: (1<=p164)
states: 2,040,131,195,168,098 (15)
abstracting: (p164<=1)
states: 3,203,223,736,758,426 (15)
abstracting: (0<=p13)
states: 3,203,223,736,758,426 (15)
abstracting: (p13<=0)
states: 3,203,223,722,736,972 (15)
abstracting: (1<=p76)
states: 235,020,039,707,344 (14)
abstracting: (p76<=1)
states: 3,203,223,736,758,426 (15)

before gc: list nodes free: 1797557

after gc: idd nodes used:7804143, unused:56195857; list nodes free:254305110

before gc: list nodes free: 1895834

after gc: idd nodes used:8345783, unused:55654217; list nodes free:253947452

before gc: list nodes free: 1825517

after gc: idd nodes used:8875234, unused:55124766; list nodes free:253654187
-> the formula is TRUE

FORMULA DES-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 19m11.568sec

totally nodes used: 255920897 (2.6e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 1063914071 2950004032 4013918103
used/not used/entry size/cache size: 65598249 1510615 16 1024MB
basic ops cache: hits/miss/sum: 106728316 297647772 404376088
used/not used/entry size/cache size: 15017377 1759839 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: 2484559 7171517 9656076
used/not used/entry size/cache size: 0 8388608 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 46476209
1 16136380
2 3686102
3 687099
4 107408
5 13945
6 1555
7 150
8 14
9 2
>= 10 0

Total processing time: 25m51.595sec


BK_STOP 1678390931261

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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

259235 397079
iterations count:251914 (1657), effective:24231 (159)

initing FirstDep: 0m 0.000sec

958176
iterations count:113780 (748), effective:9811 (64)
1551470
iterations count:159443 (1048), effective:12933 (85)

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-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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-10b, examination is ReachabilityCardinality"
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-167814482700422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;