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)
................................................................
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is NeoElection-COL-2, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478200239
=====================================================================

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1527292175312


BK_STOP 1527292181633

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeoElection-COL-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'StateSpace', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 151, 'Memory': 100.05, 'Tool': 'tina'}, {'Time': 200, 'Memory': 100.88, 'Tool': 'tina'}, {'Time': 1077, 'Memory': 1174.39, 'Tool': 'tina'}, {'Time': 1093, 'Memory': 1113.26, 'Tool': 'tina'}, {'Time': 1204, 'Memory': 124.76, 'Tool': 'gspn'}, {'Time': 3077, 'Memory': 1441.36, 'Tool': 'marcie'}, {'Time': 3142, 'Memory': 2229.45, 'Tool': 'marcie'}, {'Time': 4394, 'Memory': 218.02, 'Tool': 'gspn'}, {'Time': 4846, 'Memory': 328.9, 'Tool': 'itstools'}, {'Time': 5115, 'Memory': 375.07, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'marcie'}].
Learned tool marcie is 20.37748344370861x far from the best tool tina.
StateSpace marcie NeoElection-COL-2...
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 --memory=6

parse successfull
net created successfully

Unfolding complete |P|=195|T|=375|A|=2106
Time for unfolding: 0m 1.155sec

Net: NeoElection_COL_2
(NrP: 195 NrTr: 375 NrArc: 2106)

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
P_masterList_C_M_0_C_POS_1_C_M_0
P_electionInit_C_M_0
P_electedSecondary_C_M_2
P_electedSecondary_C_M_1
P_electedSecondary_C_M_0
P_electedPrimary_C_M_2
P_electedPrimary_C_M_1
P_electedPrimary_C_M_0
P_masterList_C_M_1_C_POS_2_C_M_1
P_masterList_C_M_1_C_POS_2_C_M_0
P_masterList_C_M_1_C_POS_1_C_M_1
P_masterList_C_M_1_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_2
P_masterList_C_M_0_C_POS_2_C_M_1
P_masterState_C_M_2_C_BOOL_F_C_M_1
P_masterList_C_M_2_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_2
P_masterList_C_M_0_C_POS_1_C_M_1
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_DONE
P_masterList_C_M_1_C_POS_2_C_M_2
P_masterState_C_M_1_C_BOOL_F_C_M_1
P_masterState_C_M_1_C_BOOL_F_C_M_2
P_masterState_C_M_2_C_BOOL_F_C_M_2
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_CO
P_masterState_C_M_2_C_BOOL_T_C_M_2
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_NONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_NONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_DONE
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_CO
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_NONE
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_NONE
P_network_C_M_2_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_2_C_M_2_C_MT_AskP_C_M_0
P_network_C_M_2_C_M_2_C_MT_RI_C_M_0
P_network_C_M_2_C_M_2_C_MT_RP_C_M_0
P_poll__handlingMessage_C_M_0
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_NONE
P_network_C_M_0_C_M_0_C_MT_AI_C_M_0
P_network_C_M_0_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_2
P_network_C_M_0_C_M_0_C_MT_AskP_C_M_0
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_NONE
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_NONE
P_masterState_C_M_2_C_BOOL_F_C_M_0
P_masterState_C_M_2_C_BOOL_T_C_M_1
P_masterState_C_M_1_C_BOOL_T_C_M_2
P_masterState_C_M_0_C_BOOL_T_C_M_2
P_masterState_C_M_0_C_BOOL_T_C_M_1
P_masterState_C_M_0_C_BOOL_T_C_M_0
P_masterState_C_M_0_C_BOOL_F_C_M_2
P_masterState_C_M_1_C_BOOL_T_C_M_1
P_masterState_C_M_0_C_BOOL_F_C_M_1
P_masterState_C_M_0_C_BOOL_F_C_M_0
P_masterList_C_M_2_C_POS_2_C_M_2
P_masterList_C_M_2_C_POS_2_C_M_1
P_masterList_C_M_2_C_POS_2_C_M_0
P_masterList_C_M_2_C_POS_1_C_M_2
P_network_C_M_2_C_M_1_C_MT_AnnP_C_M_0
P_network_C_M_2_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_2_C_M_1_C_MT_RP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AI_C_M_0
P_network_C_M_0_C_M_0_C_MT_RI_C_M_0
P_network_C_M_0_C_M_0_C_MT_RP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AI_C_M_0
P_network_C_M_0_C_M_1_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_0_C_M_1_C_MT_AskP_C_M_0
P_network_C_M_0_C_M_1_C_MT_RI_C_M_0
P_network_C_M_0_C_M_1_C_MT_RP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AI_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_0_C_M_2_C_MT_AskP_C_M_0
P_network_C_M_0_C_M_2_C_MT_RI_C_M_0
P_network_C_M_0_C_M_2_C_MT_RP_C_M_0
P_network_C_M_1_C_M_0_C_MT_AI_C_M_0
P_network_C_M_1_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_0_C_MT_AskP_C_M_0
P_network_C_M_1_C_M_0_C_MT_RI_C_M_0
P_network_C_M_1_C_M_0_C_MT_RP_C_M_0
P_network_C_M_1_C_M_1_C_MT_AI_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnnP_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_1_C_MT_AskP_C_M_0
P_network_C_M_1_C_M_1_C_MT_RI_C_M_0
P_network_C_M_1_C_M_1_C_MT_RP_C_M_0
P_network_C_M_1_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_1_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_1_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_2_C_MT_RP_C_M_0
P_network_C_M_2_C_M_0_C_MT_AI_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_2
P_network_C_M_2_C_M_0_C_MT_AskP_C_M_0
P_network_C_M_2_C_M_0_C_MT_RI_C_M_0
P_network_C_M_2_C_M_0_C_MT_RP_C_M_0
P_poll__networl_C_M_0_C_M_0_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_0_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_0_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_2_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_0_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_2_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_0_C_MT_AnsP_C_M_1
P_poll__networl_C_M_2_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_2_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_2_C_M_2_C_MT_AnsP_C_M_2
P_poll__pollEnd_C_M_0
P_poll__waitingMessage_C_M_0
P_poll__waitingMessage_C_M_1
P_poll__waitingMessage_C_M_2
P_polling_C_M_0
P_sendAnnPs__broadcasting_C_M_0_C_POS_1
P_sendAnnPs__broadcasting_C_M_0_C_POS_2
P_sendAnnPs__broadcasting_C_M_1_C_POS_1
P_sendAnnPs__broadcasting_C_M_1_C_POS_2
P_sendAnnPs__broadcasting_C_M_2_C_POS_1
P_sendAnnPs__broadcasting_C_M_2_C_POS_2
P_stage_C_M_0_C_STAGE_NEG
P_stage_C_M_0_C_STAGE_PRIM
P_stage_C_M_0_C_STAGE_SEC
P_stage_C_M_1_C_STAGE_PRIM
P_stage_C_M_1_C_STAGE_SEC
P_stage_C_M_2_C_STAGE_PRIM
P_stage_C_M_2_C_STAGE_SEC
P_startNeg__broadcasting_C_M_0_C_POS_1
P_startNeg__broadcasting_C_M_0_C_POS_2

The net has transition(s) that can never fire:
T_poll__end_0
T_poll__handleAI1_0_0_0
T_poll__handleAI1_0_1_0
T_poll__handleAI1_1_1_1
T_poll__handleAI1_0_2_0
T_poll__handleAI1_1_0_0
T_poll__handleAI1_1_0_1
T_poll__handleAI1_1_1_0
T_poll__handleAI1_2_1_2
T_poll__handleAI1_2_2_0
T_poll__handleAI1_1_2_0
T_poll__handleAI1_1_2_1
T_poll__handleAI1_2_0_0
T_poll__handleAI1_2_0_1
T_poll__handleAI1_2_0_2
T_poll__handleAI2_0_0_0_1_2
T_poll__handleAI1_2_1_0
T_poll__handleAI2_0_0_2_0_2
T_poll__handleAI1_2_2_1
T_poll__handleAI2_0_0_1_2_1
T_poll__handleAI1_2_2_2
T_poll__handleAI2_0_0_0_0_1
T_poll__handleAI2_0_0_0_0_2
T_poll__handleAI2_0_0_0_1_1
T_poll__handleAI2_0_0_0_2_1
T_poll__handleAI2_0_0_0_2_2
T_poll__handleAI2_0_0_1_0_1
T_poll__handleAI2_0_0_1_0_2
T_poll__handleAI2_0_0_1_1_1
T_poll__handleAI2_0_0_1_1_2
T_poll__handleAI2_1_0_0_2_1
T_poll__handleAI2_1_0_0_2_2
T_poll__handleAI2_0_0_1_2_2
T_poll__handleAI2_1_0_2_2_2
T_poll__handleAI2_0_0_2_0_1
T_poll__handleAnsP2_0_0_1_1
T_poll__handleAI2_1_1_0_0_2
T_poll__handleAI2_0_0_2_1_1
T_poll__handleAI2_0_0_2_1_2
T_poll__handleAI2_0_0_2_2_1
T_poll__handleAI2_0_0_2_2_2
T_poll__handleAI2_0_1_0_0_2
T_poll__handleAI2_0_1_0_1_2
T_poll__handleAI2_1_1_2_1_2
T_poll__handleAI2_0_1_1_0_2
T_poll__handleAI2_0_1_1_1_2
T_poll__handleAI2_0_1_1_2_2
T_poll__handleAI2_0_1_2_0_2
T_poll__handleAI2_0_1_2_1_2
T_poll__handleAI2_0_1_2_2_2
T_poll__handleAI2_1_0_0_0_1
T_poll__handleAI2_1_0_0_0_2
T_poll__handleAI2_1_0_0_1_1
T_poll__handleAI2_1_0_0_1_2
T_poll__handleAnnP1_1_2_0_0
T_poll__handleAI2_1_0_1_0_1
T_poll__handleAI2_1_0_1_0_2
T_poll__handleAI2_1_0_1_1_1
T_poll__handleAI2_1_0_1_1_2
T_poll__handleAI2_1_0_1_2_1
T_poll__handleAI2_1_0_1_2_2
T_poll__handleAI2_1_0_2_0_1
T_poll__handleAI2_1_0_2_0_2
T_poll__handleAnsP2_1_0_2_1
T_poll__handleAnsP2_1_0_2_0
T_poll__handleAI2_1_0_2_1_1
T_poll__handleAI2_1_0_2_1_2
T_poll__handleAI2_1_0_2_2_1
T_poll__handleAskP_0_2_0_2
T_poll__handleAnsP2_0_0_1_2
T_poll__handleAnsP2_0_0_2_0
T_poll__handleAI2_1_1_0_1_2
T_poll__handleAI2_1_1_1_0_2
T_poll__handleAI2_1_1_1_1_2
T_poll__handleAI2_1_1_1_2_2
T_poll__handleAI2_1_1_2_0_2
T_poll__handleAnsP2_1_2_1_0
T_poll__handleAnsP2_1_2_1_1
T_poll__handleAI2_1_1_2_2_2
T_poll__handleAnnP1_0_0_1_0
T_poll__handleAnnP1_0_0_1_1
T_poll__handleAnnP1_0_0_1_2
T_poll__handleAnnP1_0_0_2_0
T_poll__handleAnnP1_0_0_2_1
T_poll__handleAnnP1_0_0_2_2
T_poll__handleAnnP1_0_1_0_0
T_poll__handleAnnP1_0_1_0_1
T_poll__handleAnnP1_0_1_0_2
T_poll__handleAnnP1_0_1_2_0
T_poll__handleAnnP1_0_1_2_1
T_poll__handleAnnP1_0_1_2_2
T_poll__handleAnnP1_0_2_0_0
T_poll__handleAnnP1_0_2_0_1
T_poll__handleAnnP1_0_2_0_2
T_poll__handleAnnP1_0_2_1_0
T_poll__handleAnnP1_0_2_1_1
T_poll__handleAnnP1_0_2_1_2
T_poll__handleAnnP1_1_0_1_0
T_poll__handleAnnP1_1_0_1_1
T_poll__handleAnnP1_1_0_1_2
T_poll__handleAnnP1_1_0_2_0
T_poll__handleAnnP1_1_0_2_1
T_poll__handleAnnP1_1_0_2_2
T_poll__handleAnnP1_1_1_0_0
T_poll__handleAnnP1_1_1_0_1
T_poll__handleAnnP1_1_1_0_2
T_poll__handleAnnP1_1_1_2_0
T_poll__handleAnnP1_1_1_2_1
T_poll__handleAnsP3_1_2_1_2_1
T_poll__handleAnsP3_1_2_1_2_0
T_poll__handleAnnP1_1_1_2_2
T_poll__handleAnsP4_0_1_2_0
T_poll__handleAnsP4_0_1_2_1
T_poll__handleAnsP4_0_1_2_2
T_poll__handleAnnP1_1_2_0_1
T_poll__handleAnnP1_1_2_0_2
T_poll__handleAnnP1_1_2_1_0
T_poll__handleAnnP1_1_2_1_1
T_poll__handleAnnP1_1_2_1_2
T_poll__handleAnnP2_0_0
T_poll__handleAnnP2_0_1
T_poll__handleAnnP2_0_2
T_poll__handleAnnP2_1_0
T_poll__handleAnnP2_1_1
T_poll__handleAnnP2_1_2
T_poll__handleAnnP2_2_0
T_poll__handleAnnP2_2_1
T_poll__handleAnnP2_2_2
T_poll__handleAnsP1_0_0
T_poll__handleAnsP1_0_1
T_poll__handleAnsP1_0_2
T_poll__handleAnsP1_1_0
T_poll__handleAnsP1_1_1
T_poll__handleAnsP1_2_0
T_poll__handleAnsP1_2_2
T_poll__handleAnsP2_0_0_1_0
T_poll__handleAskP_0_2_1_2
T_poll__handleAskP_0_2_2_0
T_poll__handleAskP_0_2_2_1
T_poll__handleAnsP2_0_0_2_1
T_poll__handleAnsP2_0_0_2_2
T_poll__handleAnsP2_0_1_1_0
T_poll__handleAnsP2_0_1_1_1
T_poll__handleAnsP2_0_1_1_2
T_poll__handleAnsP2_0_1_2_0
T_poll__handleAnsP2_0_1_2_1
T_poll__handleAnsP2_0_1_2_2
T_poll__handleAnsP2_0_2_1_0
T_poll__handleAnsP2_0_2_1_1
T_poll__handleAnsP2_0_2_1_2
T_poll__handleAnsP2_0_2_2_0
T_poll__handleAnsP2_0_2_2_1
T_poll__handleAnsP2_0_2_2_2
T_poll__handleAnsP2_1_0_1_0
T_poll__handleAnsP2_1_0_1_1
T_poll__handleAskP_0_2_1_1
T_poll__handleAskP_0_2_1_0
T_poll__handleAnsP2_1_0_1_2
T_poll__handleAnsP2_1_0_2_2
T_poll__handleAnsP2_1_1_1_0
T_poll__handleAnsP2_1_1_1_1
T_poll__handleAnsP2_1_1_1_2
T_poll__handleAnsP2_1_1_2_0
T_poll__handleAnsP2_1_1_2_1
T_poll__handleAnsP2_1_1_2_2
T_sendAnnPs__send_0_2_2
T_sendAnnPs__send_1_0_0
T_sendAnnPs__send_1_0_1
T_poll__handleAnsP2_1_2_1_2
T_poll__handleAnsP2_1_2_2_0
T_poll__handleAnsP2_1_2_2_1
T_poll__handleAnsP2_1_2_2_2
T_poll__handleAnsP3_0_0_1_2_0
T_poll__handleAnsP3_0_0_1_2_1
T_poll__handleAnsP3_0_0_1_2_2
T_poll__handleAnsP3_0_0_2_1_0
T_poll__handleAnsP3_0_0_2_1_1
T_poll__handleAnsP3_0_0_2_1_2
T_poll__handleAnsP3_0_1_1_2_0
T_poll__handleAnsP3_0_1_1_2_1
T_poll__handleAnsP3_0_1_1_2_2
T_poll__handleAnsP3_0_1_2_1_0
T_poll__handleAnsP3_0_1_2_1_1
T_poll__handleAnsP3_0_1_2_1_2
T_poll__handleAnsP3_0_2_1_2_0
T_poll__handleAnsP3_0_2_1_2_1
T_poll__handleAnsP3_0_2_1_2_2
T_poll__handleAnsP3_0_2_2_1_0
T_poll__handleAnsP3_0_2_2_1_1
T_poll__handleAnsP3_0_2_2_1_2
T_poll__handleAnsP3_1_0_1_2_0
T_poll__handleAnsP3_1_0_1_2_1
T_poll__handleAnsP3_1_0_1_2_2
T_poll__handleAnsP3_1_0_2_1_0
T_poll__handleAnsP3_1_0_2_1_1
T_poll__handleAnsP3_1_0_2_1_2
T_poll__handleAnsP3_1_1_1_2_0
T_poll__handleAnsP3_1_1_1_2_1
T_poll__handleAnsP3_1_1_1_2_2
T_poll__handleAnsP3_1_1_2_1_0
T_poll__handleAnsP3_1_1_2_1_1
T_poll__handleAnsP3_1_1_2_1_2
T_poll__handleAnsP3_1_2_1_2_2
T_poll__handleAnsP3_1_2_2_1_0
T_poll__handleAnsP3_1_2_2_1_1
T_poll__handleAnsP3_1_2_2_1_2
T_poll__handleAnsP4_0_0_1_0
T_poll__handleAnsP4_0_0_1_1
T_poll__handleAnsP4_0_0_1_2
T_poll__handleAnsP4_0_0_2_0
T_poll__handleAnsP4_0_0_2_1
T_poll__handleAnsP4_0_0_2_2
T_poll__handleAnsP4_0_1_1_0
T_poll__handleAnsP4_0_1_1_1
T_poll__handleAnsP4_0_1_1_2
T_poll__handleAnsP4_0_2_1_0
T_poll__handleAnsP4_0_2_1_1
T_poll__handleAnsP4_0_2_1_2
T_poll__handleAnsP4_0_2_2_0
T_poll__handleAnsP4_0_2_2_1
T_poll__handleAnsP4_0_2_2_2
T_poll__handleAnsP4_1_0_1_0
T_poll__handleAnsP4_1_0_1_1
T_poll__handleAnsP4_1_0_1_2
T_poll__handleAnsP4_1_0_2_0
T_poll__handleAnsP4_1_0_2_1
T_poll__handleAnsP4_1_0_2_2
T_poll__handleAnsP4_1_1_1_0
T_poll__handleAnsP4_1_1_1_1
T_poll__handleAnsP4_1_1_1_2
T_poll__handleAnsP4_1_1_2_0
T_poll__handleAnsP4_1_1_2_1
T_poll__handleAnsP4_1_1_2_2
T_poll__handleAnsP4_1_2_1_0
T_poll__handleAnsP4_1_2_1_1
T_poll__handleAnsP4_1_2_1_2
T_poll__handleAnsP4_1_2_2_0
T_poll__handleAnsP4_1_2_2_1
T_poll__handleAnsP4_1_2_2_2
T_poll__handleAskP_0_0_0_0
T_poll__handleAskP_0_0_0_1
T_poll__handleAskP_0_0_0_2
T_poll__handleAskP_0_0_1_0
T_poll__handleAskP_0_0_1_1
T_poll__handleAskP_0_0_1_2
T_poll__handleAskP_0_0_2_0
T_poll__handleAskP_0_0_2_1
T_poll__handleAskP_0_0_2_2
T_poll__handleAskP_0_1_0_0
T_poll__handleAskP_0_1_0_1
T_poll__handleAskP_0_1_1_0
T_poll__handleAskP_0_1_1_1
T_poll__handleAskP_0_1_1_2
T_poll__handleAskP_0_1_2_0
T_poll__handleAskP_0_1_2_1
T_poll__handleAskP_0_1_2_2
T_poll__handleAskP_0_2_0_0
T_poll__handleAskP_0_2_0_1
T_poll__handleAskP_0_2_2_2
T_poll__handleAskP_1_0_0_0
T_poll__handleAskP_1_0_0_1
T_poll__handleAskP_1_0_0_2
T_poll__handleAskP_1_0_1_0
T_poll__handleAskP_1_0_1_1
T_poll__handleAskP_1_0_1_2
T_poll__handleAskP_1_0_2_0
T_poll__handleAskP_1_0_2_1
T_poll__handleAskP_1_0_2_2
T_poll__handleAskP_1_1_0_0
T_poll__handleAskP_1_1_0_1
T_poll__handleAskP_1_1_1_0
T_poll__handleAskP_1_1_1_1
T_poll__handleAskP_1_1_1_2
T_poll__handleAskP_1_1_2_0
T_poll__handleAskP_1_1_2_1
T_poll__handleAskP_1_1_2_2
T_poll__handleAskP_1_2_0_0
T_poll__handleAskP_1_2_0_2
T_poll__handleAskP_1_2_1_0
T_poll__handleAskP_1_2_1_1
T_poll__handleAskP_1_2_1_2
T_poll__handleAskP_1_2_2_0
T_poll__handleAskP_1_2_2_1
T_poll__handleAskP_1_2_2_2
T_poll__handleRI_0_0
T_poll__handleRI_0_1
T_poll__handleRI_0_2
T_poll__handleRI_1_0
T_poll__handleRI_1_1
T_poll__handleRI_2_0
T_poll__handleRI_2_2
T_poll__handleRP_0_0
T_poll__handleRP_0_1
T_poll__handleRP_0_2
T_poll__handleRP_1_0
T_poll__handleRP_1_1
T_poll__handleRP_1_2
T_poll__handleRP_2_0
T_poll__handleRP_2_1
T_poll__handleRP_2_2
T_poll__iAmPrimary_0
T_poll__iAmPrimary_1
T_poll__iAmPrimary_2
T_poll__iAmSecondary_0_0
T_poll__iAmSecondary_0_1
T_poll__iAmSecondary_0_2
T_poll__iAmSecondary_1_0
T_poll__iAmSecondary_1_1
T_poll__iAmSecondary_1_2
T_poll__iAmSecondary_2_0
T_poll__iAmSecondary_2_1
T_poll__iAmSecondary_2_2
T_poll__start_0
T_sendAnnPs__end_0
T_sendAnnPs__end_1
T_sendAnnPs__end_2
T_sendAnnPs__send_0_0_0
T_sendAnnPs__send_0_0_1
T_sendAnnPs__send_0_0_2
T_sendAnnPs__send_0_1_0
T_sendAnnPs__send_0_1_1
T_sendAnnPs__send_0_1_2
T_sendAnnPs__send_0_2_0
T_sendAnnPs__send_0_2_1
T_sendAnnPs__send_1_0_2
T_sendAnnPs__send_1_1_0
T_sendAnnPs__send_1_1_1
T_sendAnnPs__send_1_1_2
T_sendAnnPs__send_1_2_0
T_sendAnnPs__send_1_2_1
T_sendAnnPs__send_1_2_2
T_sendAnnPs__start_0
T_sendAnnPs__start_1
T_sendAnnPs__start_2
T_startNeg__end_0
T_startNeg__send_0_0_0
T_startNeg__send_0_0_1
T_startNeg__send_0_0_2
T_startNeg__send_0_1_0
T_startNeg__send_0_1_1
T_startNeg__send_0_2_0
T_startNeg__send_0_2_2
T_startNeg__send_1_0_0
T_startNeg__send_1_0_1
T_startNeg__send_1_0_2
T_startNeg__send_1_1_0
T_startNeg__send_1_1_1
T_startNeg__send_1_1_2
T_startNeg__send_1_2_0
T_startNeg__send_1_2_1
T_startNeg__send_1_2_2
T_startNeg__start_0
T_startSec_0
T_startSec_1
T_startSec_2

place and transition orderings generation:0m 0.005sec

check for constant places
P_masterList_C_M_0_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_1
P_masterList_C_M_0_C_POS_1_C_M_2
P_masterList_C_M_0_C_POS_2_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_1
P_masterList_C_M_0_C_POS_2_C_M_2
P_masterList_C_M_1_C_POS_1_C_M_0
P_masterList_C_M_1_C_POS_1_C_M_1
P_masterList_C_M_1_C_POS_1_C_M_2
P_masterList_C_M_1_C_POS_2_C_M_0
P_masterList_C_M_1_C_POS_2_C_M_1
P_masterList_C_M_1_C_POS_2_C_M_2
P_masterList_C_M_2_C_POS_1_C_M_0
P_masterList_C_M_2_C_POS_1_C_M_1
P_masterList_C_M_2_C_POS_1_C_M_2
P_masterList_C_M_2_C_POS_2_C_M_0
P_masterList_C_M_2_C_POS_2_C_M_1
P_masterList_C_M_2_C_POS_2_C_M_2
found 18 constant places
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

net check time: 0m 0.000sec

init dd package: 0m 1.641sec


initing FirstDep: 0m 0.000sec


iterations count:594 (1), effective:32 (0)

RS generation: 0m 0.008sec


-> reachability set: #nodes 230 (2.3e+02) #states 241



STATE_SPACE STATES 241 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

STATE_SPACE MAX_TOKEN_PER_MARKING 14 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

STATE_SPACE TRANSITIONS 448 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
totally nodes used: 6691(6.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 46742 124929 171671
used/not used/entry size/cache size: 112984 66995880 16 1024MB
basic ops cache: hits/miss/sum: 2557 7342 9899
used/not used/entry size/cache size: 9213 16768003 12 192MB
unary ops cache: hits/miss/sum: 0 66 66
used/not used/entry size/cache size: 66 8388542 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 295 652 947
used/not used/entry size/cache size: 652 2096500 32 64MB
max state cache: hits/miss/sum: 97 230 327
used/not used/entry size/cache size: 230 8388378 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67102174
1 6689
2 1
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.457sec

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="NeoElection-COL-2"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="mcc4mcc-full"
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/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is NeoElection-COL-2, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478200239"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.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 ;