Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900383.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679351291647

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:28:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:28:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:28:13] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-20 22:28:13] [INFO ] Transformed 262 places.
[2023-03-20 22:28:13] [INFO ] Transformed 73 transitions.
[2023-03-20 22:28:13] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 10) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 409 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 22:28:15] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-20 22:28:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 22:28:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:15] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-20 22:28:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:15] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-20 22:28:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:28:15] [INFO ] After 113ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-20 22:28:15] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 22:28:15] [INFO ] After 452ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 63 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 63 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 62 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 61 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 62
Applied a total of 20 rules in 26 ms. Remains 61 /72 variables (removed 11) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 61/72 places, 62/73 transitions.
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1053690 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 1053690 steps, saw 497964 distinct states, run finished after 3003 ms. (steps per millisecond=350 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 61 cols
[2023-03-20 22:28:19] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 22:28:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:28:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:19] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:19] [INFO ] After 18ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:19] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 22:28:19] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 14 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 61/61 places, 62/62 transitions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3237518 steps, run timeout after 3001 ms. (steps per millisecond=1078 ) properties seen :{}
Probabilistic random walk after 3237518 steps, saw 1413522 distinct states, run finished after 3002 ms. (steps per millisecond=1078 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 22:28:22] [INFO ] Invariant cache hit.
[2023-03-20 22:28:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:28:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:22] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:23] [INFO ] After 21ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:23] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-20 22:28:23] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 14 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 22:28:23] [INFO ] Invariant cache hit.
[2023-03-20 22:28:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 22:28:23] [INFO ] Invariant cache hit.
[2023-03-20 22:28:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:23] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-20 22:28:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:28:23] [INFO ] Invariant cache hit.
[2023-03-20 22:28:23] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 61/61 places, 62/62 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 1 place count 61 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 11 place count 56 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 55 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 54 transition count 55
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 54 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 53 transition count 54
Applied a total of 17 rules in 15 ms. Remains 53 /61 variables (removed 8) and now considering 54/62 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 53 cols
[2023-03-20 22:28:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 22:28:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:23] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:28:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 22:28:23] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:23] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 22:28:23] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 22:28:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 62 transitions and 246 arcs took 1 ms.
[2023-03-20 22:28:23] [INFO ] Flatten gal took : 27 ms
Total runtime 10167 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d0m36
(NrP: 61 NrTr: 62 NrArc: 246)

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

net check time: 0m 0.000sec

init dd package: 0m 3.051sec


RS generation: 1m36.330sec


-> reachability set: #nodes 62137 (6.2e+04) #states 19,464,022,269 (10)



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

checking: EF [[[[[[[[1<=p39 & [p1<=0 | [p24<=0 | [[p1<=0 | p41<=0] & [[p1<=0 | p60<=0] & [p10<=0 | p18<=0]]]]]] | 1<=p33] | [p18<=0 | 1<=p52]] | [p1<=0 | [p27<=0 | p2<=0]]] & [p1<=0 | p48<=0]] & 1<=p55] & [1<=p38 & 1<=p1]]]
normalized: E [true U [[1<=p38 & 1<=p1] & [1<=p55 & [[p1<=0 | p48<=0] & [[[p27<=0 | p2<=0] | p1<=0] | [[p18<=0 | 1<=p52] | [1<=p33 | [1<=p39 & [p1<=0 | [p24<=0 | [[[p10<=0 | p18<=0] & [p1<=0 | p60<=0]] & [p1<=0 | p41<=0]]]]]]]]]]]]

abstracting: (p41<=0)
states: 18,866,490,899 (10)
abstracting: (p1<=0)
states: 16,340,879,509 (10)
abstracting: (p60<=0)
states: 3,491,068,701 (9)
abstracting: (p1<=0)
states: 16,340,879,509 (10)
abstracting: (p18<=0)
states: 356,665,542 (8)
abstracting: (p10<=0)
states: 19,403,864,025 (10)
abstracting: (p24<=0)
states: 19,425,492,456 (10)
abstracting: (p1<=0)
states: 16,340,879,509 (10)
abstracting: (1<=p39)
states: 508,735,659 (8)
abstracting: (1<=p33)
states: 597,531,370 (8)
abstracting: (1<=p52)
states: 910,114,176 (8)
abstracting: (p18<=0)
states: 356,665,542 (8)
abstracting: (p1<=0)
states: 16,340,879,509 (10)
abstracting: (p2<=0)
states: 19,464,022,268 (10)
abstracting: (p27<=0)
states: 10,551,326,648 (10)
abstracting: (p48<=0)
states: 13,999,173,656 (10)
abstracting: (p1<=0)
states: 16,340,879,509 (10)
abstracting: (1<=p55)
states: 910,114,176 (8)
abstracting: (1<=p1)
states: 3,123,142,760 (9)
abstracting: (1<=p38)
states: 15,991,481,868 (10)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.176sec

totally nodes used: 9084960 (9.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1197201919 213662490 1410864409
used/not used/entry size/cache size: 64247415 2861449 16 1024MB
basic ops cache: hits/miss/sum: 19126824 3185751 22312575
used/not used/entry size/cache size: 5044077 11733139 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: 1547581 281200 1828781
used/not used/entry size/cache size: 277166 8111442 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 59420854
1 6935313
2 632995
3 75483
4 12696
5 3682
6 3381
7 3374
8 2482
9 2245
>= 10 16359

Total processing time: 1m52.946sec


BK_STOP 1679351416737

--------------------
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 ReachabilityFireability -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

69957 64482
iterations count:201809 (3254), effective:6697 (108)

initing FirstDep: 0m 0.000sec


iterations count:4456 (71), effective:137 (2)

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="SieveSingleMsgMbox-PT-d0m36"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d0m36, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978900383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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