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-167987247200310.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-COL-D3N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K 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-COL-D3N050-ReachabilityCardinality-00
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-COL-D3N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680889285784

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=Murphy-COL-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:41:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:41:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:41:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 17:41:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:41:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 393 ms
[2023-04-07 17:41:27] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 28.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 17:41:27] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 17:41:27] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-04-07 17:41:27] [INFO ] Flatten gal took : 12 ms
[2023-04-07 17:41:27] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:41:27] [INFO ] Unfolded HLPN to a Petri net with 24 places and 28 transitions 108 arcs in 6 ms.
[2023-04-07 17:41:27] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 11) seen :3
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 17:41:28] [INFO ] Computed 5 invariants in 6 ms
[2023-04-07 17:41:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:41:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:41:28] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 17:41:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:41:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:41:28] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-04-07 17:41:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:41:28] [INFO ] After 47ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-04-07 17:41:28] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-07 17:41:28] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Murphy-COL-D3N050-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:41:28] [INFO ] Invariant cache hit.
[2023-04-07 17:41:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 247679 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247679 steps, saw 168343 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 17:41:32] [INFO ] Invariant cache hit.
[2023-04-07 17:41:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:41:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:41:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:41:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:41:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 17:41:32] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 17:41:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:41:32] [INFO ] After 62ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:41:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-04-07 17:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 17:41:32] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 17:41:32] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 91 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:41:32] [INFO ] Invariant cache hit.
[2023-04-07 17:41:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 17:41:32] [INFO ] Invariant cache hit.
[2023-04-07 17:41:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:41:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 17:41:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:41:32] [INFO ] Invariant cache hit.
[2023-04-07 17:41:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 17:41:32] [INFO ] Invariant cache hit.
[2023-04-07 17:41:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:41:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 17:41:32] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:41:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:41:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 17:41:32] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 17:41:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:41:32] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:41:33] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-07 17:41:33] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:41:33] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-04-07 17:41:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
[2023-04-07 17:41:33] [INFO ] Flatten gal took : 5 ms
Total runtime 5970 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: Murphy_COL_D3N050_unf
(NrP: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.686sec


RS generation: 0m14.443sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: AG [sum(p15, p14, p13, p12)<=82]
normalized: ~ [E [true U ~ [sum(p15, p14, p13, p12)<=82]]]

abstracting: (sum(p15, p14, p13, p12)<=82)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-COL-D3N050-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AG [~ [38<=sum(p19, p18, p17, p16)]]
normalized: ~ [E [true U 38<=sum(p19, p18, p17, p16)]]

abstracting: (38<=sum(p19, p18, p17, p16))
states: 0
-> the formula is TRUE

FORMULA Murphy-COL-D3N050-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [~ [100<=sum(p19, p18, p17, p16)]]
normalized: ~ [E [true U 100<=sum(p19, p18, p17, p16)]]

abstracting: (100<=sum(p19, p18, p17, p16))
states: 0
-> the formula is TRUE

FORMULA Murphy-COL-D3N050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[[96<=sum(p19, p18, p17, p16) & sum(p11, p10, p9, p8)<=sum(p19, p18, p17, p16)] & [[sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20) | sum(p15, p14, p13, p12)<=69] & [[~ [100<=sum(p23, p22, p21, p20)] | [sum(p19, p18, p17, p16)<=sum(p11, p10, p9, p8) | ~ [sum(p23, p22, p21, p20)<=15]]] | [[~ [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)] | ~ [50<=sum(p15, p14, p13, p12)]] | [sum(p15, p14, p13, p12)<=99 | [~ [sum(p19, p18, p17, p16)<=50] & ~ [sum(p11, p10, p9, p8)<=24]]]]]]]]
normalized: E [true U [[[[[sum(p15, p14, p13, p12)<=99 | [~ [sum(p11, p10, p9, p8)<=24] & ~ [sum(p19, p18, p17, p16)<=50]]] | [~ [50<=sum(p15, p14, p13, p12)] | ~ [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]]] | [[sum(p19, p18, p17, p16)<=sum(p11, p10, p9, p8) | ~ [sum(p23, p22, p21, p20)<=15]] | ~ [100<=sum(p23, p22, p21, p20)]]] & [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20) | sum(p15, p14, p13, p12)<=69]] & [96<=sum(p19, p18, p17, p16) & sum(p11, p10, p9, p8)<=sum(p19, p18, p17, p16)]]]

abstracting: (sum(p11, p10, p9, p8)<=sum(p19, p18, p17, p16))
MC time: 19m55.024sec

checking: AG [[sum(p19, p18, p17, p16)<=96 & [[sum(p3, p2, p1, p0)<=24 | [~ [sum(p3, p2, p1, p0)<=2] | [[28<=sum(p19, p18, p17, p16) & ~ [sum(p3, p2, p1, p0)<=95]] & [~ [sum(p11, p10, p9, p8)<=21] & [sum(p15, p14, p13, p12)<=sum(p3, p2, p1, p0) & sum(p11, p10, p9, p8)<=14]]]]] | [[~ [sum(p23, p22, p21, p20)<=sum(p11, p10, p9, p8)] & [[~ [sum(p15, p14, p13, p12)<=sum(p3, p2, p1, p0)] | [~ [sum(p15, p14, p13, p12)<=32] & [~ [12<=sum(p7, p6, p5, p4)] & sum(p11, p10, p9, p8)<=sum(p23, p22, p21, p20)]]] & [~ [sum(p15, p14, p13, p12)<=98] | [[~ [95<=sum(p15, p14, p13, p12)] & ~ [12<=sum(p11, p10, p9, p8)]] & [~ [sum(p19, p18, p17, p16)<=81] & [~ [sum(p15, p14, p13, p12)<=8] & [~ [sum(p15, p14, p13, p12)<=sum(p19, p18, p17, p16)] | [~ [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] | [~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)] & ~ [15<=sum(p15, p14, p13, p12)]]]]]]]]]] | [[[sum(p15, p14, p13, p12)<=40 & 65<=sum(p11, p10, p9, p8)] & [65<=sum(p3, p2, p1, p0) & [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8) & ~ [sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12)]]]] | [~ [sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4)] & [~ [sum(p23, p22, p21, p20)<=sum(p3, p2, p1, p0)] | sum(p23, p22, p21, p20)<=24]]]]]]]
normalized: ~ [E [true U ~ [[sum(p19, p18, p17, p16)<=96 & [[[[[65<=sum(p3, p2, p1, p0) & [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8) & ~ [sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12)]]] & [sum(p15, p14, p13, p12)<=40 & 65<=sum(p11, p10, p9, p8)]] | [[sum(p23, p22, p21, p20)<=24 | ~ [sum(p23, p22, p21, p20)<=sum(p3, p2, p1, p0)]] & ~ [sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4)]]] | [[[[[[[[[~ [15<=sum(p15, p14, p13, p12)] & ~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]] | ~ [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)]] | ~ [sum(p15, p14, p13, p12)<=sum(p19, p18, p17, p16)]] & ~ [sum(p15, p14, p13, p12)<=8]] & ~ [sum(p19, p18, p17, p16)<=81]] & [~ [12<=sum(p11, p10, p9, p8)] & ~ [95<=sum(p15, p14, p13, p12)]]] | ~ [sum(p15, p14, p13, p12)<=98]] & [[[sum(p11, p10, p9, p8)<=sum(p23, p22, p21, p20) & ~ [12<=sum(p7, p6, p5, p4)]] & ~ [sum(p15, p14, p13, p12)<=32]] | ~ [sum(p15, p14, p13, p12)<=sum(p3, p2, p1, p0)]]] & ~ [sum(p23, p22, p21, p20)<=sum(p11, p10, p9, p8)]]] | [sum(p3, p2, p1, p0)<=24 | [[[[sum(p15, p14, p13, p12)<=sum(p3, p2, p1, p0) & sum(p11, p10, p9, p8)<=14] & ~ [sum(p11, p10, p9, p8)<=21]] & [28<=sum(p19, p18, p17, p16) & ~ [sum(p3, p2, p1, p0)<=95]]] | ~ [sum(p3, p2, p1, p0)<=2]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=2)
states: 2,159,784,000 (9)
abstracting: (sum(p3, p2, p1, p0)<=95)
states: 233,524,757,929,392 (14)
abstracting: (28<=sum(p19, p18, p17, p16))
states: 0
abstracting: (sum(p11, p10, p9, p8)<=21)
states: 2,308,390,512,624 (12)
abstracting: (sum(p11, p10, p9, p8)<=14)
states: 607,474,778,544 (11)
abstracting: (sum(p15, p14, p13, p12)<=sum(p3, p2, p1, p0))
MC time: 13m17.000sec

checking: EF [[[~ [sum(p23, p22, p21, p20)<=78] & [sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20) & [[sum(p3, p2, p1, p0)<=87 | sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] | [sum(p23, p22, p21, p20)<=4 | [24<=sum(p23, p22, p21, p20) | [42<=sum(p15, p14, p13, p12) & [[~ [sum(p15, p14, p13, p12)<=35] | ~ [sum(p3, p2, p1, p0)<=63]] | [~ [16<=sum(p7, p6, p5, p4)] | [~ [sum(p15, p14, p13, p12)<=23] & [~ [sum(p23, p22, p21, p20)<=13] | ~ [sum(p7, p6, p5, p4)<=86]]]]]]]]]]] | [[[[sum(p19, p18, p17, p16)<=sum(p15, p14, p13, p12) & 93<=sum(p19, p18, p17, p16)] & sum(p3, p2, p1, p0)<=30] & [[sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4) & sum(p3, p2, p1, p0)<=6] & [~ [93<=sum(p19, p18, p17, p16)] & sum(p7, p6, p5, p4)<=15]]] & [[[[sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) | 46<=sum(p7, p6, p5, p4)] | [9<=sum(p11, p10, p9, p8) | [~ [sum(p11, p10, p9, p8)<=sum(p19, p18, p17, p16)] | [~ [sum(p3, p2, p1, p0)<=21] & [~ [57<=sum(p7, p6, p5, p4)] & [~ [sum(p15, p14, p13, p12)<=78] | ~ [sum(p15, p14, p13, p12)<=65]]]]]]] & [[~ [100<=sum(p7, p6, p5, p4)] | [[79<=sum(p23, p22, p21, p20) & sum(p23, p22, p21, p20)<=66] & [~ [22<=sum(p11, p10, p9, p8)] & sum(p15, p14, p13, p12)<=71]]] & [~ [54<=sum(p11, p10, p9, p8)] | ~ [sum(p11, p10, p9, p8)<=45]]]] & [[[~ [33<=sum(p7, p6, p5, p4)] | [~ [sum(p11, p10, p9, p8)<=57] | sum(p3, p2, p1, p0)<=22]] & [73<=sum(p23, p22, p21, p20) | sum(p19, p18, p17, p16)<=27]] & [[[sum(p23, p22, p21, p20)<=sum(p11, p10, p9, p8) | 54<=sum(p7, p6, p5, p4)] | [74<=sum(p7, p6, p5, p4) | sum(p19, p18, p17, p16)<=5]] & [~ [78<=sum(p3, p2, p1, p0)] | [sum(p23, p22, p21, p20)<=57 & sum(p19, p18, p17, p16)<=31]]]]]]]]
normalized: E [true U [[[[[[~ [78<=sum(p3, p2, p1, p0)] | [sum(p23, p22, p21, p20)<=57 & sum(p19, p18, p17, p16)<=31]] & [[74<=sum(p7, p6, p5, p4) | sum(p19, p18, p17, p16)<=5] | [sum(p23, p22, p21, p20)<=sum(p11, p10, p9, p8) | 54<=sum(p7, p6, p5, p4)]]] & [[73<=sum(p23, p22, p21, p20) | sum(p19, p18, p17, p16)<=27] & [[sum(p3, p2, p1, p0)<=22 | ~ [sum(p11, p10, p9, p8)<=57]] | ~ [33<=sum(p7, p6, p5, p4)]]]] & [[[~ [sum(p11, p10, p9, p8)<=45] | ~ [54<=sum(p11, p10, p9, p8)]] & [[[sum(p15, p14, p13, p12)<=71 & ~ [22<=sum(p11, p10, p9, p8)]] & [79<=sum(p23, p22, p21, p20) & sum(p23, p22, p21, p20)<=66]] | ~ [100<=sum(p7, p6, p5, p4)]]] & [[9<=sum(p11, p10, p9, p8) | [[[[~ [sum(p15, p14, p13, p12)<=65] | ~ [sum(p15, p14, p13, p12)<=78]] & ~ [57<=sum(p7, p6, p5, p4)]] & ~ [sum(p3, p2, p1, p0)<=21]] | ~ [sum(p11, p10, p9, p8)<=sum(p19, p18, p17, p16)]]] | [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) | 46<=sum(p7, p6, p5, p4)]]]] & [[[sum(p7, p6, p5, p4)<=15 & ~ [93<=sum(p19, p18, p17, p16)]] & [sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4) & sum(p3, p2, p1, p0)<=6]] & [sum(p3, p2, p1, p0)<=30 & [sum(p19, p18, p17, p16)<=sum(p15, p14, p13, p12) & 93<=sum(p19, p18, p17, p16)]]]] | [[sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20) & [[sum(p23, p22, p21, p20)<=4 | [24<=sum(p23, p22, p21, p20) | [42<=sum(p15, p14, p13, p12) & [[[[~ [sum(p7, p6, p5, p4)<=86] | ~ [sum(p23, p22, p21, p20)<=13]] & ~ [sum(p15, p14, p13, p12)<=23]] | ~ [16<=sum(p7, p6, p5, p4)]] | [~ [sum(p3, p2, p1, p0)<=63] | ~ [sum(p15, p14, p13, p12)<=35]]]]]] | [sum(p3, p2, p1, p0)<=87 | sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)]]] & ~ [sum(p23, p22, p21, p20)<=78]]]]

abstracting: (sum(p23, p22, p21, p20)<=78)
states: 540,710,084,330,928 (14)
abstracting: (sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20))
states: 411,373,567,245,598 (14)
abstracting: (sum(p3, p2, p1, p0)<=87)
states: 189,459,840,003,696 (14)
abstracting: (sum(p15, p14, p13, p12)<=35)
states: 540,710,084,330,928 (14)
abstracting: (sum(p3, p2, p1, p0)<=63)
states: 78,993,215,387,568 (13)
abstracting: (16<=sum(p7, p6, p5, p4))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8697652 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101040 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 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


iterations count:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec


idd.h:1025: Timeout: after 1194 sec


idd.h:1025: Timeout: after 796 sec


idd.h:1025: Timeout: after 530 sec

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-COL-D3N050"
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 Murphy-COL-D3N050, 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 r522-tall-167987247200310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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