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

About the Execution of Marcie+red for Murphy-PT-D2N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7100.155 34449.00 42849.00 375.90 FFFFTTTTTFFFFFFF 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.r522-tall-167987247200351.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 Murphy-PT-D2N100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N100-ReachabilityFireability-00
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-01
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-02
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-03
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-04
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-05
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-06
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-07
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-08
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-09
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-10
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-11
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-12
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-13
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-14
FORMULA_NAME Murphy-PT-D2N100-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680892976897

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=Murphy-PT-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:42:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:42:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:42:58] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:42:58] [INFO ] Transformed 18 places.
[2023-04-07 18:42:58] [INFO ] Transformed 21 transitions.
[2023-04-07 18:42:58] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-PT-D2N100-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10008 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :3
FORMULA Murphy-PT-D2N100-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N100-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:42:59] [INFO ] Computed 4 invariants in 7 ms
[2023-04-07 18:42:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:42:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:42:59] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-04-07 18:42:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:42:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:42:59] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-04-07 18:42:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:42:59] [INFO ] After 97ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-04-07 18:42:59] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 18:42:59] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA Murphy-PT-D2N100-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Murphy-PT-D2N100-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Murphy-PT-D2N100-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 23 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:42:59] [INFO ] Invariant cache hit.
[2023-04-07 18:42:59] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 480574 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 480574 steps, saw 311260 distinct states, run finished after 3002 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:43:02] [INFO ] Invariant cache hit.
[2023-04-07 18:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:43:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:43:02] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:43:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:43:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:43:02] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:43:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:43:02] [INFO ] After 35ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:43:02] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 18:43:02] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:43:03] [INFO ] Invariant cache hit.
[2023-04-07 18:43:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 18:43:03] [INFO ] Invariant cache hit.
[2023-04-07 18:43:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:43:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 18:43:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:43:03] [INFO ] Invariant cache hit.
[2023-04-07 18:43:03] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 18:43:03] [INFO ] Invariant cache hit.
[2023-04-07 18:43:03] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:43:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:43:03] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:43:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:43:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:43:03] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:43:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:43:03] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:43:03] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 18:43:03] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:43:03] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-04-07 18:43:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
[2023-04-07 18:43:03] [INFO ] Flatten gal took : 19 ms
Total runtime 5227 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: Murphy_PT_D2N100
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.731sec


RS generation: 0m20.595sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



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

checking: EF [[2<=p11 & 1<=p14]]
normalized: E [true U [2<=p11 & 1<=p14]]

abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p9 & 1<=p12]]
normalized: E [true U [2<=p9 & 1<=p12]]

abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: EF [[2<=p11 & 1<=p14]]
normalized: E [true U [2<=p11 & 1<=p14]]

abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p10<=1 | [p13<=0 | 1<=p14]]]
normalized: ~ [E [true U ~ [[p10<=1 | [p13<=0 | 1<=p14]]]]]

abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p10<=1)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p2<=2 | p8<=0] | [p14<=0 | [1<=p10 | p9<=1]]] | [[p12<=0 | [[2<=p10 & 1<=p13] | [2<=p11 & 1<=p14]]] | [[1<=p2 & 1<=p5] | [[3<=p16 & [1<=p0 & 1<=p3]] | [[p17<=2 & p13<=0] & [2<=p9 & 1<=p12]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[2<=p9 & 1<=p12] & [p17<=2 & p13<=0]] | [3<=p16 & [1<=p0 & 1<=p3]]] | [1<=p2 & 1<=p5]] | [p12<=0 | [[2<=p11 & 1<=p14] | [2<=p10 & 1<=p13]]]] | [[p14<=0 | [1<=p10 | p9<=1]] | [p2<=2 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 19,460,988,936 (10)
abstracting: (p2<=2)
states: 57,889,909,008 (10)
abstracting: (p9<=1)
states: 1,207,044,185,616 (12)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
abstracting: (p12<=0)
states: 402,348,061,872 (11)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p17<=2)
states: 1,005,870,154,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.608sec

checking: EF [[[[[[[1<=p1 & 3<=p15] & [1<=p4 & 1<=p7]] & [[1<=p13 & 1<=p12] & [3<=p0 & [1<=p6 & p11<=0]]]] & [[[1<=p14 & 1<=p10] & [2<=p9 & [[2<=p10 | 2<=p11] | [[1<=p0 & 1<=p3] | [3<=p2 & 1<=p8]]]]] & [[[p11<=1 | p14<=0] & [p0<=0 | p3<=0]] & [[[p0<=0 | p3<=0] | [p6<=0 | [p1<=0 | p4<=0]]] & [[p11<=1 | p14<=0] & [p1<=2 | [p7<=0 | p13<=0]]]]]]] | [[1<=p14 & 2<=p10] & [1<=p13 & [[p1<=2 | [p7<=0 | p13<=0]] & [[[[1<=p0 & 1<=p3] & [1<=p6 & [[3<=p2 & 1<=p8] | [3<=p0 & [1<=p12 & 2<=p11]]]]] | [[2<=p11 | [1<=p2 & [1<=p5 & 1<=p8]]] & [[1<=p1 & 1<=p4] | [[1<=p1 & [1<=p4 & 1<=p7]] & [3<=p0 & [1<=p6 & 1<=p12]]]]]] | [[[[1<=p2 & 1<=p5] & [1<=p8 & 2<=p11]] & [[3<=p2 & 3<=p0] & [1<=p6 & 1<=p12]]] | [1<=p1 & [1<=p4 & 1<=p11]]]]]]]] & [[1<=p0 & [1<=p3 & 1<=p6]] | [[p15<=2 & 3<=p17] & [3<=p1 & [1<=p7 & 1<=p13]]]]]]
normalized: E [true U [[[1<=p0 & [1<=p3 & 1<=p6]] | [[3<=p1 & [1<=p7 & 1<=p13]] & [p15<=2 & 3<=p17]]] & [[[1<=p13 & [[[[[[3<=p2 & 3<=p0] & [1<=p6 & 1<=p12]] & [[1<=p8 & 2<=p11] & [1<=p2 & 1<=p5]]] | [1<=p1 & [1<=p4 & 1<=p11]]] | [[[[[3<=p0 & [1<=p6 & 1<=p12]] & [1<=p1 & [1<=p4 & 1<=p7]]] | [1<=p1 & 1<=p4]] & [2<=p11 | [1<=p2 & [1<=p5 & 1<=p8]]]] | [[1<=p6 & [[3<=p0 & [1<=p12 & 2<=p11]] | [3<=p2 & 1<=p8]]] & [1<=p0 & 1<=p3]]]] & [p1<=2 | [p7<=0 | p13<=0]]]] & [1<=p14 & 2<=p10]] | [[[[[[p1<=2 | [p7<=0 | p13<=0]] & [p11<=1 | p14<=0]] & [[p6<=0 | [p1<=0 | p4<=0]] | [p0<=0 | p3<=0]]] & [[p0<=0 | p3<=0] & [p11<=1 | p14<=0]]] & [[2<=p9 & [[[3<=p2 & 1<=p8] | [1<=p0 & 1<=p3]] | [2<=p10 | 2<=p11]]] & [1<=p14 & 1<=p10]]] & [[[3<=p0 & [1<=p6 & p11<=0]] & [1<=p13 & 1<=p12]] & [[1<=p4 & 1<=p7] & [1<=p1 & 3<=p15]]]]]]]

abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (p11<=0)
states: 603,522,092,808 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
abstracting: (2<=p10)
states: 0
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (2<=p9)
states: 0
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p11<=1)
states: 1,207,044,185,616 (12)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p4<=0)
states: 19,468,488,888 (10)
abstracting: (p1<=0)
states: 19,460,988,936 (10)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p11<=1)
states: 1,207,044,185,616 (12)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p7<=0)
states: 19,460,988,936 (10)
abstracting: (p1<=2)
states: 57,889,909,008 (10)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p7<=0)
states: 19,460,988,936 (10)
abstracting: (p1<=2)
states: 57,889,909,008 (10)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p11)
states: 603,522,092,808 (11)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (3<=p17)
states: 201,174,030,936 (11)
abstracting: (p15<=2)
states: 1,005,870,154,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.922sec

totally nodes used: 1362346 (1.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 216310976 6443604 222754580
used/not used/entry size/cache size: 6883594 60225270 16 1024MB
basic ops cache: hits/miss/sum: 6685217 1149060 7834277
used/not used/entry size/cache size: 2151721 14625495 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: 1998139 311335 2309474
used/not used/entry size/cache size: 304782 8083826 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 65975824
1 942430
2 163157
3 17163
4 9378
5 875
6 33
7 4
8 0
9 0
>= 10 0

Total processing time: 0m26.801sec


BK_STOP 1680893011346

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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


iterations count:14959 (712), effective:3586 (170)

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="Murphy-PT-D2N100"
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 Murphy-PT-D2N100, 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 r522-tall-167987247200351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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