Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is QuasiCertifProtocol-COL-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r051-smll-149440918100196
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-02-ReachabilityCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494664643502

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Unfolding complete |P|=86|T|=56|A|=223
Time for unfolding: 0m 2.573sec

Net: QuasiCertifProtocol_COL_02
(NrP: 86 NrTr: 56 NrArc: 223)

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

net check time: 0m 0.000sec

init dd package: 0m 1.170sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 900 (9.0e+02) #states 1,029 (3)



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

checking: AG [~ [3<=a4_dot]]
normalized: ~ [E [true U 3<=a4_dot]]

abstracting: (3<=a4_dot)
states: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=Astart_dot & 2<=a1_dot]]
normalized: E [true U [3<=Astart_dot & 2<=a1_dot]]

abstracting: (2<=a1_dot)
states: 0
abstracting: (3<=Astart_dot)
states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & ~ [~ [3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]]]
normalized: E [true U [3<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & 3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]

abstracting: (3<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 8
abstracting: (3<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0))
states: 60
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AG [~ [[~ [2<=sum(s4_tsid2, s4_tsid1, s4_tsid0)] & [3<=a2_dot | 3<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)]]]]
normalized: ~ [E [true U [~ [2<=sum(s4_tsid2, s4_tsid1, s4_tsid0)] & [3<=a2_dot | 3<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)]]]]

abstracting: (3<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0))
states: 3
abstracting: (3<=a2_dot)
states: 0
abstracting: (2<=sum(s4_tsid2, s4_tsid1, s4_tsid0))
states: 42
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AG [[sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0) | ~ [[2<=Astart_dot & 1<=sum(n6_tsid2, n6_tsid1, n6_tsid0)]]]]
normalized: ~ [E [true U ~ [[~ [[2<=Astart_dot & 1<=sum(n6_tsid2, n6_tsid1, n6_tsid0)]] | sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0)]]]]

abstracting: (sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0))
states: 540
abstracting: (1<=sum(n6_tsid2, n6_tsid1, n6_tsid0))
states: 630
abstracting: (2<=Astart_dot)
states: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [~ [[~ [2<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)] | [a4_dot<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & sum(c1_tsid2, c1_tsid1, c1_tsid0)<=a3_dot]]]]
normalized: E [true U ~ [[[a4_dot<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & sum(c1_tsid2, c1_tsid1, c1_tsid0)<=a3_dot] | ~ [2<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)]]]]

abstracting: (2<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0))
states: 24
abstracting: (sum(c1_tsid2, c1_tsid1, c1_tsid0)<=a3_dot)
states: 417
abstracting: (a4_dot<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0))
states: 1,029 (3)
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [~ [[[sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) | sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0)] | ~ [2<=a5_dot]]]]
normalized: E [true U ~ [[~ [2<=a5_dot] | [sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) | sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0)]]]]

abstracting: (sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0))
states: 459
abstracting: (sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0))
states: 973
abstracting: (2<=a5_dot)
states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [[[[2<=sum(s6_tsid2, s6_tsid1, s6_tsid0) & 3<=sum(n6_tsid2, n6_tsid1, n6_tsid0)] & ~ [a2_dot<=malicious_reservoir_dot]] | [3<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0) & 3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]]
normalized: E [true U [[3<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0) & 3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)] | [~ [a2_dot<=malicious_reservoir_dot] & [2<=sum(s6_tsid2, s6_tsid1, s6_tsid0) & 3<=sum(n6_tsid2, n6_tsid1, n6_tsid0)]]]]

abstracting: (3<=sum(n6_tsid2, n6_tsid1, n6_tsid0))
states: 486
abstracting: (2<=sum(s6_tsid2, s6_tsid1, s6_tsid0))
states: 102
abstracting: (a2_dot<=malicious_reservoir_dot)
states: 1,026 (3)
abstracting: (3<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 8
abstracting: (3<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0))
states: 3
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [~ [[[sum(s5_tsid2, s5_tsid1, s5_tsid0)<=a2_dot | sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(n4_tsid2, n4_tsid1, n4_tsid0)] | [AstopOK_dot<=sum(n5_tsid2, n5_tsid1, n5_tsid0) | a1_dot<=a3_dot]]]]
normalized: E [true U ~ [[[AstopOK_dot<=sum(n5_tsid2, n5_tsid1, n5_tsid0) | a1_dot<=a3_dot] | [sum(s5_tsid2, s5_tsid1, s5_tsid0)<=a2_dot | sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(n4_tsid2, n4_tsid1, n4_tsid0)]]]]

abstracting: (sum(s5_tsid2, s5_tsid1, s5_tsid0)<=sum(n4_tsid2, n4_tsid1, n4_tsid0))
states: 459
abstracting: (sum(s5_tsid2, s5_tsid1, s5_tsid0)<=a2_dot)
states: 459
abstracting: (a1_dot<=a3_dot)
states: 997
abstracting: (AstopOK_dot<=sum(n5_tsid2, n5_tsid1, n5_tsid0))
states: 786
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AG [[[[2<=Astart_dot | 2<=sum(n2_tsid2, n2_tsid1, n2_tsid0)] | [3<=a4_dot | sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0)]] | ~ [[1<=sum(c1_tsid2, c1_tsid1, c1_tsid0) & sum(n4_tsid2, n4_tsid1, n4_tsid0)<=malicious_reservoir_dot]]]]
normalized: ~ [E [true U ~ [[[[3<=a4_dot | sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0)] | [2<=Astart_dot | 2<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]] | ~ [[1<=sum(c1_tsid2, c1_tsid1, c1_tsid0) & sum(n4_tsid2, n4_tsid1, n4_tsid0)<=malicious_reservoir_dot]]]]]]

abstracting: (sum(n4_tsid2, n4_tsid1, n4_tsid0)<=malicious_reservoir_dot)
states: 979
abstracting: (1<=sum(c1_tsid2, c1_tsid1, c1_tsid0))
states: 612
abstracting: (2<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 32
abstracting: (2<=Astart_dot)
states: 0
abstracting: (sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=sum(s2_tsid2, s2_tsid1, s2_tsid0))
states: 1,005 (3)
abstracting: (3<=a4_dot)
states: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AG [[~ [[3<=sum(n2_tsid2, n2_tsid1, n2_tsid0) & sum(s3_tsid2, s3_tsid1, s3_tsid0)<=a2_dot]] | sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0)]]
normalized: ~ [E [true U ~ [[sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) | ~ [[3<=sum(n2_tsid2, n2_tsid1, n2_tsid0) & sum(s3_tsid2, s3_tsid1, s3_tsid0)<=a2_dot]]]]]]

abstracting: (sum(s3_tsid2, s3_tsid1, s3_tsid0)<=a2_dot)
states: 843
abstracting: (3<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 8
abstracting: (sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0))
states: 750
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AG [[[~ [sum(s2_tsid2, s2_tsid1, s2_tsid0)<=a1_dot] | [a5_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0) | 1<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]] | AstopAbort_dot<=sum(c1_tsid2, c1_tsid1, c1_tsid0)]]
normalized: ~ [E [true U ~ [[[~ [sum(s2_tsid2, s2_tsid1, s2_tsid0)<=a1_dot] | [a5_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0) | 1<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]] | AstopAbort_dot<=sum(c1_tsid2, c1_tsid1, c1_tsid0)]]]]

abstracting: (AstopAbort_dot<=sum(c1_tsid2, c1_tsid1, c1_tsid0))
states: 842
abstracting: (1<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0))
states: 279
abstracting: (a5_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 710
abstracting: (sum(s2_tsid2, s2_tsid1, s2_tsid0)<=a1_dot)
states: 936
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: EF [[sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & [~ [sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0)] & [1<=sum(n6_tsid2, n6_tsid1, n6_tsid0) | 1<=AstopOK_dot]]]]
normalized: E [true U [sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & [[1<=sum(n6_tsid2, n6_tsid1, n6_tsid0) | 1<=AstopOK_dot] & ~ [sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0)]]]]

abstracting: (sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0))
states: 973
abstracting: (1<=AstopOK_dot)
states: 243
abstracting: (1<=sum(n6_tsid2, n6_tsid1, n6_tsid0))
states: 630
abstracting: (sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0))
states: 750
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[[sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0) | [3<=a2_dot | 2<=sum(s6_tsid2, s6_tsid1, s6_tsid0)]] & ~ [[sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) | SstopAbort_dot<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)]]]]
normalized: E [true U [~ [[sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) | SstopAbort_dot<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)]] & [sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0) | [3<=a2_dot | 2<=sum(s6_tsid2, s6_tsid1, s6_tsid0)]]]]

abstracting: (2<=sum(s6_tsid2, s6_tsid1, s6_tsid0))
states: 102
abstracting: (3<=a2_dot)
states: 0
abstracting: (sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0))
states: 636
abstracting: (SstopAbort_dot<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0))
states: 696
abstracting: (sum(n1_tsid2, n1_tsid1, n1_tsid0)<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0))
states: 973
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[[[1<=sum(n5_tsid2, n5_tsid1, n5_tsid0) | a2_dot<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)] | [sum(n4_tsid2, n4_tsid1, n4_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0) & 3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)]] | [[1<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & a1_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0)] | 1<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)]]]
normalized: ~ [E [true U ~ [[[1<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0) | [1<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & a1_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]] | [[sum(n4_tsid2, n4_tsid1, n4_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0) & 3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)] | [1<=sum(n5_tsid2, n5_tsid1, n5_tsid0) | a2_dot<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)]]]]]]

abstracting: (a2_dot<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0))
states: 1,025 (3)
abstracting: (1<=sum(n5_tsid2, n5_tsid1, n5_tsid0))
states: 152
abstracting: (3<=sum(n5_tsid2, n5_tsid1, n5_tsid0))
states: 8
abstracting: (sum(n4_tsid2, n4_tsid1, n4_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0))
states: 973
abstracting: (a1_dot<=sum(n2_tsid2, n2_tsid1, n2_tsid0))
states: 1,025 (3)
abstracting: (1<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0))
states: 495
abstracting: (1<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0))
states: 54
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: AG [[[[sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0) | 2<=sum(c1_tsid2, c1_tsid1, c1_tsid0)] | [sum(n4_tsid2, n4_tsid1, n4_tsid0)<=AstopAbort_dot | sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=malicious_reservoir_dot]] | ~ [~ [sum(n6_tsid2, n6_tsid1, n6_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0)]]]]
normalized: ~ [E [true U ~ [[sum(n6_tsid2, n6_tsid1, n6_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0) | [[sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0) | 2<=sum(c1_tsid2, c1_tsid1, c1_tsid0)] | [sum(n4_tsid2, n4_tsid1, n4_tsid0)<=AstopAbort_dot | sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=malicious_reservoir_dot]]]]]]

abstracting: (sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=malicious_reservoir_dot)
states: 750
abstracting: (sum(n4_tsid2, n4_tsid1, n4_tsid0)<=AstopAbort_dot)
states: 985
abstracting: (2<=sum(c1_tsid2, c1_tsid1, c1_tsid0))
states: 531
abstracting: (sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0))
states: 1,029 (3)
abstracting: (sum(n6_tsid2, n6_tsid1, n6_tsid0)<=sum(n3_tsid2, n3_tsid1, n3_tsid0))
states: 399
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

totally nodes used: 17948(1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7162 36892 44054
used/not used/entry size/cache size: 33251 67075613 16 1024MB
basic ops cache: hits/miss/sum: 12093 74925 87018
used/not used/entry size/cache size: 107470 16669746 12 192MB
unary ops cache: hits/miss/sum: 0 28 28
used/not used/entry size/cache size: 28 8388580 8 64MB
abstract ops cache: hits/miss/sum: 0 40456 40456
used/not used/entry size/cache size: 50 8388558 12 96MB
state nr cache: hits/miss/sum: 1981 4503 6484
used/not used/entry size/cache size: 4502 2092650 32 64MB
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 67090924
1 17932
2 8
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.287sec


BK_STOP 1494664648825

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

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


iterations count:899 (16), effective:56 (1)

initing FirstDep: 0m 0.001sec


iterations count:230 (4), effective:29 (0)

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="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is QuasiCertifProtocol-COL-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r051-smll-149440918100196"
echo "====================================================================="
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
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 ;