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 S_PolyORBLF-PT-S02J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r121-smll-149441672500430
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495041076749

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

Net: PolyORBLF_PT_S02J04T06
(NrP: 476 NrTr: 920 NrArc: 4242)

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

net check time: 0m 0.001sec

init dd package: 0m 1.174sec

parse successfull
net created successfully

Net: PolyORBLF_PT_S02J04T06
(NrP: 476 NrTr: 920 NrArc: 4242)

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

net check time: 0m 0.001sec

init dd package: 0m 3.929sec


RS generation: 16m40.991sec


-> reachability set: #nodes 211300 (2.1e+05) #states 140,754,672 (8)



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

checking: AG [~ [[~ [2<=ORB_Lock] & 3<=P_1097]]]
normalized: ~ [E [true U [3<=P_1097 & ~ [2<=ORB_Lock]]]]

abstracting: (2<=ORB_Lock)
states: 0
abstracting: (3<=P_1097)
states: 0
-> the formula is TRUE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: EF [~ [~ [2<=sum(AbourtToModifySrc_2, AbourtToModifySrc_1)]]]
normalized: E [true U 2<=sum(AbourtToModifySrc_2, AbourtToModifySrc_1)]

abstracting: (2<=sum(AbourtToModifySrc_2, AbourtToModifySrc_1))
states: 0
-> the formula is FALSE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.113sec

checking: EF [2<=sum(P_1617_6, P_1617_5, P_1617_4, P_1617_2, P_1617_3, P_1617_1)]
normalized: E [true U 2<=sum(P_1617_6, P_1617_5, P_1617_4, P_1617_2, P_1617_3, P_1617_1)]

abstracting: (2<=sum(P_1617_6, P_1617_5, P_1617_4, P_1617_2, P_1617_3, P_1617_1))
states: 0
-> the formula is FALSE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: EF [3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2)]
normalized: E [true U 3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2)]

abstracting: (3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2))
states: 0
-> the formula is FALSE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: EF [1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]
normalized: E [true U 1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]

abstracting: (1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3))
states: 102,749,028 (8)
MC time: 3m37.002sec

checking: EF [3<=sum(QueueJobE_3, QueueJobE_4, QueueJobE_5, QueueJobE_6, QueueJobE_1, QueueJobE_2)]
normalized: E [true U 3<=sum(QueueJobE_3, QueueJobE_4, QueueJobE_5, QueueJobE_6, QueueJobE_1, QueueJobE_2)]

abstracting: (3<=sum(QueueJobE_3, QueueJobE_4, QueueJobE_5, QueueJobE_6, QueueJobE_1, QueueJobE_2))
states: 0
-> the formula is FALSE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AG [[~ [~ [3<=P_1099]] | sum(Check_Sources_E_3, Check_Sources_E_1, Check_Sources_E_6, Check_Sources_E_4, Check_Sources_E_2, Check_Sources_E_5)<=IsMonitoring]]
normalized: ~ [E [true U ~ [[3<=P_1099 | sum(Check_Sources_E_3, Check_Sources_E_1, Check_Sources_E_6, Check_Sources_E_4, Check_Sources_E_2, Check_Sources_E_5)<=IsMonitoring]]]]

abstracting: (sum(Check_Sources_E_3, Check_Sources_E_1, Check_Sources_E_6, Check_Sources_E_4, Check_Sources_E_2, Check_Sources_E_5)<=IsMonitoring)
states: 140,754,672 (8)
abstracting: (3<=P_1099)
states: 0
-> the formula is TRUE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: EF [[MarkerRead<=PollingAbort & [~ [3<=cSources] | sum(ScheduleTaskE_Idle_6, ScheduleTaskE_Idle_1, ScheduleTaskE_Idle_2, ScheduleTaskE_Idle_3, ScheduleTaskE_Idle_5, ScheduleTaskE_Idle_4)<=MarkerRead]]]
normalized: E [true U [MarkerRead<=PollingAbort & [sum(ScheduleTaskE_Idle_6, ScheduleTaskE_Idle_1, ScheduleTaskE_Idle_2, ScheduleTaskE_Idle_3, ScheduleTaskE_Idle_5, ScheduleTaskE_Idle_4)<=MarkerRead | ~ [3<=cSources]]]]

abstracting: (3<=cSources)
states: 67,244,760 (7)
abstracting: (sum(ScheduleTaskE_Idle_6, ScheduleTaskE_Idle_1, ScheduleTaskE_Idle_2, ScheduleTaskE_Idle_3, ScheduleTaskE_Idle_5, ScheduleTaskE_Idle_4)<=MarkerRead)
states: 140,178,672 (8)
abstracting: (MarkerRead<=PollingAbort)
states: 98,215,812 (7)
MC time: 3m58.000sec

checking: EF [[1<=sum(P_1712_4, P_1712_3, P_1712_2, P_1712_1, P_1712_0) & 1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]]
normalized: E [true U [1<=sum(P_1712_4, P_1712_3, P_1712_2, P_1712_1, P_1712_0) & 1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]]

abstracting: (1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3))
states: 102,749,028 (8)
abstracting: (1<=sum(P_1712_4, P_1712_3, P_1712_2, P_1712_1, P_1712_0))
states: 60,295,440 (7)

before gc: list nodes free: 225182

after gc: idd nodes used:575279, unused:63424721; list nodes free:278597478
MC time: 3m34.001sec

checking: AG [sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3)<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]
normalized: ~ [E [true U ~ [sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3)<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]]]

abstracting: (sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3)<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3))
states: 138,418,272 (8)
MC time: 3m13.007sec

checking: AG [~ [~ [sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3)]]]
normalized: ~ [E [true U ~ [sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3)]]]

abstracting: (sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3))
states: 140,336,640 (8)
MC time: 2m54.003sec

checking: AG [[sum(Insert_Source_E_1, Insert_Source_E_6, Insert_Source_E_4, Insert_Source_E_5, Insert_Source_E_2, Insert_Source_E_3)<=cBlockedTasks | 3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2)]]
normalized: ~ [E [true U ~ [[sum(Insert_Source_E_1, Insert_Source_E_6, Insert_Source_E_4, Insert_Source_E_5, Insert_Source_E_2, Insert_Source_E_3)<=cBlockedTasks | 3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2)]]]]

abstracting: (3<=sum(Abort_Check_Sources_E_3, Abort_Check_Sources_E_4, Abort_Check_Sources_E_6, Abort_Check_Sources_E_5, Abort_Check_Sources_E_1, Abort_Check_Sources_E_2))
states: 0
abstracting: (sum(Insert_Source_E_1, Insert_Source_E_6, Insert_Source_E_4, Insert_Source_E_5, Insert_Source_E_2, Insert_Source_E_3)<=cBlockedTasks)
states: 140,754,672 (8)
-> the formula is TRUE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.311sec

checking: EF [[sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(Perform_Work_E_6, Perform_Work_E_5, Perform_Work_E_4, Perform_Work_E_3, Perform_Work_E_2, Perform_Work_E_1) & 1<=sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6)]]
normalized: E [true U [sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(Perform_Work_E_6, Perform_Work_E_5, Perform_Work_E_4, Perform_Work_E_3, Perform_Work_E_2, Perform_Work_E_1) & 1<=sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6)]]

abstracting: (1<=sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6))
states: 2,679,624 (6)
abstracting: (sum(NotifyEventSourceAddedE_4, NotifyEventSourceAddedE_3, NotifyEventSourceAddedE_5, NotifyEventSourceAddedE_6, NotifyEventSourceAddedE_2, NotifyEventSourceAddedE_1)<=sum(Perform_Work_E_6, Perform_Work_E_5, Perform_Work_E_4, Perform_Work_E_3, Perform_Work_E_2, Perform_Work_E_1))
states: 140,336,640 (8)

before gc: list nodes free: 12687526

after gc: idd nodes used:521613, unused:63478387; list nodes free:278806653
MC time: 2m53.005sec

checking: EF [~ [~ [[sum(ScheduleTaskE_Check_1, ScheduleTaskE_Check_6, ScheduleTaskE_Check_4, ScheduleTaskE_Check_5, ScheduleTaskE_Check_2, ScheduleTaskE_Check_3)<=sum(IdleTasks_6, IdleTasks_5, IdleTasks_2, IdleTasks_1, IdleTasks_4, IdleTasks_3) & 1<=sum(P_1159_2, P_1159_5, P_1159_6, P_1159_3, P_1159_4, P_1159_1)]]]]
normalized: E [true U [sum(ScheduleTaskE_Check_1, ScheduleTaskE_Check_6, ScheduleTaskE_Check_4, ScheduleTaskE_Check_5, ScheduleTaskE_Check_2, ScheduleTaskE_Check_3)<=sum(IdleTasks_6, IdleTasks_5, IdleTasks_2, IdleTasks_1, IdleTasks_4, IdleTasks_3) & 1<=sum(P_1159_2, P_1159_5, P_1159_6, P_1159_3, P_1159_4, P_1159_1)]]

abstracting: (1<=sum(P_1159_2, P_1159_5, P_1159_6, P_1159_3, P_1159_4, P_1159_1))
states: 0
abstracting: (sum(ScheduleTaskE_Check_1, ScheduleTaskE_Check_6, ScheduleTaskE_Check_4, ScheduleTaskE_Check_5, ScheduleTaskE_Check_2, ScheduleTaskE_Check_3)<=sum(IdleTasks_6, IdleTasks_5, IdleTasks_2, IdleTasks_1, IdleTasks_4, IdleTasks_3))
states: 140,092,740 (8)
-> the formula is FALSE

FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.503sec

checking: AG [~ [~ [[sum(P_2579_5_2, P_2579_4_1, P_2579_5_1, P_2579_6_2, P_2579_6_1, P_2579_1_2, P_2579_2_2, P_2579_3_1, P_2579_3_2, P_2579_2_1, P_2579_1_1, P_2579_4_2)<=P_1095 | 3<=sum(NotifyEventJobCompletedB_6, NotifyEventJobCompletedB_1, NotifyEventJobCompletedB_2, NotifyEventJobCompletedB_3, NotifyEventJobCompletedB_4, NotifyEventJobCompletedB_5)]]]]
normalized: ~ [E [true U ~ [[sum(P_2579_5_2, P_2579_4_1, P_2579_5_1, P_2579_6_2, P_2579_6_1, P_2579_1_2, P_2579_2_2, P_2579_3_1, P_2579_3_2, P_2579_2_1, P_2579_1_1, P_2579_4_2)<=P_1095 | 3<=sum(NotifyEventJobCompletedB_6, NotifyEventJobCompletedB_1, NotifyEventJobCompletedB_2, NotifyEventJobCompletedB_3, NotifyEventJobCompletedB_4, NotifyEventJobCompletedB_5)]]]]

abstracting: (3<=sum(NotifyEventJobCompletedB_6, NotifyEventJobCompletedB_1, NotifyEventJobCompletedB_2, NotifyEventJobCompletedB_3, NotifyEventJobCompletedB_4, NotifyEventJobCompletedB_5))
states: 0
abstracting: (sum(P_2579_5_2, P_2579_4_1, P_2579_5_1, P_2579_6_2, P_2579_6_1, P_2579_1_2, P_2579_2_2, P_2579_3_1, P_2579_3_2, P_2579_2_1, P_2579_1_1, P_2579_4_2)<=P_1095)
states: 132,191,352 (8)
MC time: 2m53.007sec

checking: EF [[sum(IdleTasks_6, IdleTasks_5, IdleTasks_2, IdleTasks_1, IdleTasks_4, IdleTasks_3)<=CanInjectEvent & [[sum(NotifyEventJobQueuedB_5_2, NotifyEventJobQueuedB_4_4, NotifyEventJobQueuedB_1_4, NotifyEventJobQueuedB_1_0, NotifyEventJobQueuedB_2_3, NotifyEventJobQueuedB_5_1, NotifyEventJobQueuedB_2_4, NotifyEventJobQueuedB_1_3, NotifyEventJobQueuedB_6_1, NotifyEventJobQueuedB_2_2, NotifyEventJobQueuedB_5_3, NotifyEventJobQueuedB_1_2, NotifyEventJobQueuedB_6_0, NotifyEventJobQueuedB_4_2, NotifyEventJobQueuedB_6_3, NotifyEventJobQueuedB_5_0, NotifyEventJobQueuedB_6_4, NotifyEventJobQueuedB_3_3, NotifyEventJobQueuedB_1_1, NotifyEventJobQueuedB_2_1, NotifyEventJobQueuedB_5_4, NotifyEventJobQueuedB_4_0, NotifyEventJobQueuedB_4_3, NotifyEventJobQueuedB_3_2, NotifyEventJobQueuedB_3_4, NotifyEventJobQueuedB_3_0, NotifyEventJobQueuedB_2_0, NotifyEventJobQueuedB_3_1, NotifyEventJobQueuedB_4_1, NotifyEventJobQueuedB_6_2)<=P_1717 | sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6)<=sum(P_1158_6, P_1158_1, P_1158_3, P_1158_2, P_1158_5, P_1158_4)] | [sum(P_1155_2, P_1155_5, P_1155_4, P_1155_1, P_1155_6, P_1155_3)<=sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3) | 2<=MarkerRead]]]]
normalized: E [true U [sum(IdleTasks_6, IdleTasks_5, IdleTasks_2, IdleTasks_1, IdleTasks_4, IdleTasks_3)<=CanInjectEvent & [[sum(P_1155_2, P_1155_5, P_1155_4, P_1155_1, P_1155_6, P_1155_3)<=sum(ScheduleTaskB_4, ScheduleTaskB_5, ScheduleTaskB_1, ScheduleTaskB_6, ScheduleTaskB_2, ScheduleTaskB_3) | 2<=MarkerRead] | [sum(NotifyEventJobQueuedB_5_2, NotifyEventJobQueuedB_4_4, NotifyEventJobQueuedB_1_4, NotifyEventJobQueuedB_1_0, NotifyEventJobQueuedB_2_3, NotifyEventJobQueuedB_5_1, NotifyEventJobQueuedB_2_4, NotifyEventJobQueuedB_1_3, NotifyEventJobQueuedB_6_1, NotifyEventJobQueuedB_2_2, NotifyEventJobQueuedB_5_3, NotifyEventJobQueuedB_1_2, NotifyEventJobQueuedB_6_0, NotifyEventJobQueuedB_4_2, NotifyEventJobQueuedB_6_3, NotifyEventJobQueuedB_5_0, NotifyEventJobQueuedB_6_4, NotifyEventJobQueuedB_3_3, NotifyEventJobQueuedB_1_1, NotifyEventJobQueuedB_2_1, NotifyEventJobQueuedB_5_4, NotifyEventJobQueuedB_4_0, NotifyEventJobQueuedB_4_3, NotifyEventJobQueuedB_3_2, NotifyEventJobQueuedB_3_4, NotifyEventJobQueuedB_3_0, NotifyEventJobQueuedB_2_0, NotifyEventJobQueuedB_3_1, NotifyEventJobQueuedB_4_1, NotifyEventJobQueuedB_6_2)<=P_1717 | sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6)<=sum(P_1158_6, P_1158_1, P_1158_3, P_1158_2, P_1158_5, P_1158_4)]]]]

abstracting: (sum(Try_Check_Sources_B_2, Try_Check_Sources_B_1, Try_Check_Sources_B_3, Try_Check_Sources_B_4, Try_Check_Sources_B_5, Try_Check_Sources_B_6)<=sum(P_1158_6, P_1158_1, P_1158_3, P_1158_2, P_1158_5, P_1158_4))
states: 138,075,048 (8)
abstracting: (sum(NotifyEventJobQueuedB_5_2, NotifyEventJobQueuedB_4_4, NotifyEventJobQueuedB_1_4, NotifyEventJobQueuedB_1_0, NotifyEventJobQueuedB_2_3, NotifyEventJobQueuedB_5_1, NotifyEventJobQueuedB_2_4, NotifyEventJobQueuedB_1_3, NotifyEventJobQueuedB_6_1, NotifyEventJobQueuedB_2_2, NotifyEventJobQueuedB_5_3, NotifyEventJobQueuedB_1_2, NotifyEventJobQueuedB_6_0, NotifyEventJobQueuedB_4_2, NotifyEventJobQueuedB_6_3, NotifyEventJobQueuedB_5_0, NotifyEventJobQueuedB_6_4, NotifyEventJobQueuedB_3_3, NotifyEventJobQueuedB_1_1, NotifyEventJobQueuedB_2_1, NotifyEventJobQueuedB_5_4, NotifyEventJobQueuedB_4_0, NotifyEventJobQueuedB_4_3, NotifyEventJobQueuedB_3_2, NotifyEventJobQueuedB_3_4, NotifyEventJobQueuedB_3_0, NotifyEventJobQueuedB_2_0, NotifyEventJobQueuedB_3_1, NotifyEventJobQueuedB_4_1, NotifyEventJobQueuedB_6_2)<=P_1717)
MC time: 2m32.000sec

checking: EF [1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]
normalized: E [true U 1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3)]

abstracting: (1<=sum(RunE_1, RunE_2, RunE_5, RunE_6, RunE_4, RunE_3))
states: 102,749,028 (8)

BK_TIME_CONFINEMENT_REACHED

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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

42259 83532 124587 148239 142795 103495 82479 96452 92934 85414 94698 109064 125942 146954 156533 142924 160005 157034 160699 145461 157726 153551 160359 158833 171938 172336 165287 171546 159829 174571 170043 172715 169005 185128 195774 195719 186033 189249 186899 182384 172576 173056 190970 189421 197874 184609 181136 178727 162409 175976 177042 172440 177746 180455 177631 174857 170233 171860 168818 169223 177168 189944 199392 207442 225192 224974 222459 219818 218625 220260 222619 217889 213483 207796 211475
iterations count:7533830 (8188), effective:92607 (100)

initing FirstDep: 0m 0.011sec

251292
sat_reach.icc:161: Timeout: after 216 sec

239854
sat_reach.icc:161: Timeout: after 237 sec

186754 204653
sat_reach.icc:161: Timeout: after 213 sec


sat_reach.icc:161: Timeout: after 192 sec

102044
sat_reach.icc:161: Timeout: after 173 sec

110893 124055
sat_reach.icc:161: Timeout: after 172 sec

116225
sat_reach.icc:161: Timeout: after 172 sec


idd.h:1025: Timeout: after 151 sec

251292 266384

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="S_PolyORBLF-PT-S02J04T06"
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/S_PolyORBLF-PT-S02J04T06.tgz
mv S_PolyORBLF-PT-S02J04T06 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 S_PolyORBLF-PT-S02J04T06, 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 r121-smll-149441672500430"
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 ;