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.r261-smll-167863536000196.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 itstools
Input is NeoElection-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 441K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 305K Feb 26 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 161K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 399K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 168K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 460K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 534K Feb 26 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 26 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 395K Feb 26 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:23 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 NeoElection-PT-5-LTLFireability-00
FORMULA_NAME NeoElection-PT-5-LTLFireability-01
FORMULA_NAME NeoElection-PT-5-LTLFireability-02
FORMULA_NAME NeoElection-PT-5-LTLFireability-03
FORMULA_NAME NeoElection-PT-5-LTLFireability-04
FORMULA_NAME NeoElection-PT-5-LTLFireability-05
FORMULA_NAME NeoElection-PT-5-LTLFireability-06
FORMULA_NAME NeoElection-PT-5-LTLFireability-07
FORMULA_NAME NeoElection-PT-5-LTLFireability-08
FORMULA_NAME NeoElection-PT-5-LTLFireability-09
FORMULA_NAME NeoElection-PT-5-LTLFireability-10
FORMULA_NAME NeoElection-PT-5-LTLFireability-11
FORMULA_NAME NeoElection-PT-5-LTLFireability-12
FORMULA_NAME NeoElection-PT-5-LTLFireability-13
FORMULA_NAME NeoElection-PT-5-LTLFireability-14
FORMULA_NAME NeoElection-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678777847380

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-5
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 07:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 07:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:10:51] [INFO ] Load time of PNML (sax parser for PT used): 628 ms
[2023-03-14 07:10:51] [INFO ] Transformed 3090 places.
[2023-03-14 07:10:51] [INFO ] Transformed 4674 transitions.
[2023-03-14 07:10:51] [INFO ] Found NUPN structural information;
[2023-03-14 07:10:51] [INFO ] Completing missing partition info from NUPN : creating a component with [P_crashed_0, P_crashed_1, P_crashed_2, P_crashed_3, P_crashed_4, P_crashed_5, P_dead_0, P_dead_1, P_dead_2, P_dead_3, P_dead_4, P_dead_5, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedPrimary_4, P_electedPrimary_5, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electedSecondary_4, P_electedSecondary_5, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionFailed_4, P_electionFailed_5, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_electionInit_4, P_electionInit_5, P_masterList_0_1_0, P_masterList_0_1_1, P_masterList_0_1_2, P_masterList_0_1_3, P_masterList_0_1_4, P_masterList_0_1_5, P_masterList_0_2_0, P_masterList_0_2_1, P_masterList_0_2_2, P_masterList_0_2_3, P_masterList_0_2_4, P_masterList_0_2_5, P_masterList_0_3_0, P_masterList_0_3_1, P_masterList_0_3_2, P_masterList_0_3_3, P_masterList_0_3_4, P_masterList_0_3_5, P_masterList_0_4_0, P_masterList_0_4_1, P_masterList_0_4_2, P_masterList_0_4_3, P_masterList_0_4_4, P_masterList_0_4_5, P_masterList_0_5_0, P_masterList_0_5_1, P_masterList_0_5_2, P_masterList_0_5_3, P_masterList_0_5_4, P_masterList_0_5_5, P_masterList_1_1_0, P_masterList_1_1_1, P_masterList_1_1_2, P_masterList_1_1_3, P_masterList_1_1_4, P_masterList_1_1_5, P_masterList_1_2_0, P_masterList_1_2_1, P_masterList_1_2_2, P_masterList_1_2_3, P_masterList_1_2_4, P_masterList_1_2_5, P_masterList_1_3_0, P_masterList_1_3_1, P_masterList_1_3_2, P_masterList_1_3_3, P_masterList_1_3_4, P_masterList_1_3_5, P_masterList_1_4_0, P_masterList_1_4_1, P_masterList_1_4_2, P_masterList_1_4_3, P_masterList_1_4_4, P_masterList_1_4_5, P_masterList_1_5_0, P_masterList_1_5_1, P_masterList_1_5_2, P_masterList_1_5_3, P_masterList_1_5_4, P_masterList_1_5_5, P_masterList_2_1_0, P_masterList_2_1_1, P_masterList_2_1_2, P_masterList_2_1_3, P_masterList_2_1_4, P_masterList_2_1_5, P_masterList_2_2_0, P_masterList_2_2_1, P_masterList_2_2_2, P_masterList_2_2_3, P_masterList_2_2_4, P_masterList_2_2_5, P_masterList_2_3_0, P_masterList_2_3_1, P_masterList_2_3_2, P_masterList_2_3_3, P_masterList_2_3_4, P_masterList_2_3_5, P_masterList_2_4_0, P_masterList_2_4_1, P_masterList_2_4_2, P_masterList_2_4_3, P_masterList_2_4_4, P_masterList_2_4_5, P_masterList_2_5_0, P_masterList_2_5_1, P_masterList_2_5_2, P_masterList_2_5_3, P_masterList_2_5_4, P_masterList_2_5_5, P_masterList_3_1_0, P_masterList_3_1_1, P_masterList_3_1_2, P_masterList_3_1_3, P_masterList_3_1_4, P_masterList_3_1_5, P_masterList_3_2_0, P_masterList_3_2_1, P_masterList_3_2_2, P_masterList_3_2_3, P_masterList_3_2_4, P_masterList_3_2_5, P_masterList_3_3_0, P_masterList_3_3_1, P_masterList_3_3_2, P_masterList_3_3_3, P_masterList_3_3_4, P_masterList_3_3_5, P_masterList_3_4_0, P_masterList_3_4_1, P_masterList_3_4_2, P_masterList_3_4_3, P_masterList_3_4_4, P_masterList_3_4_5, P_masterList_3_5_0, P_masterList_3_5_1, P_masterList_3_5_2, P_masterList_3_5_3, P_masterList_3_5_4, P_masterList_3_5_5, P_masterList_4_1_0, P_masterList_4_1_1, P_masterList_4_1_2, P_masterList_4_1_3, P_masterList_4_1_4, P_masterList_4_1_5, P_masterList_4_2_0, P_masterList_4_2_1, P_masterList_4_2_2, P_masterList_4_2_3, P_masterList_4_2_4, P_masterList_4_2_5, P_masterList_4_3_0, P_masterList_4_3_1, P_masterList_4_3_2, P_masterList_4_3_3, P_masterList_4_3_4, P_masterList_4_3_5, P_masterList_4_4_0, P_masterList_4_4_1, P_masterList_4_4_2, P_masterList_4_4_3, P_masterList_4_4_4, P_masterList_4_4_5, P_masterList_4_5_0, P_masterList_4_5_1, P_masterList_4_5_2, P_masterList_4_5_3, P_masterList_4_5_4, P_masterList_4_5_5, P_masterList_5_1_0, P_masterList_5_1_1, P_masterList_5_1_2, P_masterList_5_1_3, P_masterList_5_1_4, P_masterList_5_1_5, P_masterList_5_2_0, P_masterList_5_2_1, P_masterList_5_2_2, P_masterList_5_2_3, P_masterList_5_2_4, P_masterList_5_2_5, P_masterList_5_3_0, P_masterList_5_3_1, P_masterList_5_3_2, P_masterList_5_3_3, P_masterList_5_3_4, P_masterList_5_3_5, P_masterList_5_4_0, P_masterList_5_4_1, P_masterList_5_4_2, P_masterList_5_4_3, P_masterList_5_4_4, P_masterList_5_4_5, P_masterList_5_5_0, P_masterList_5_5_1, P_masterList_5_5_2, P_masterList_5_5_3, P_masterList_5_5_4, P_masterList_5_5_5, P_masterState_0_F_0, P_masterState_0_F_1, P_masterState_0_F_2, P_masterState_0_F_3, P_masterState_0_F_4, P_masterState_0_F_5, P_masterState_0_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_0_T_3, P_masterState_0_T_4, P_masterState_0_T_5, P_masterState_1_F_0, P_masterState_1_F_1, P_masterState_1_F_2, P_masterState_1_F_3, P_masterState_1_F_4, P_masterState_1_F_5, P_masterState_1_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_1_T_3, P_masterState_1_T_4, P_masterState_1_T_5, P_masterState_2_F_0, P_masterState_2_F_1, P_masterState_2_F_2, P_masterState_2_F_3, P_masterState_2_F_4, P_masterState_2_F_5, P_masterState_2_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_masterState_2_T_3, P_masterState_2_T_4, P_masterState_2_T_5, P_masterState_3_F_0, P_masterState_3_F_1, P_masterState_3_F_2, P_masterState_3_F_3, P_masterState_3_F_4, P_masterState_3_F_5, P_masterState_3_T_0, P_masterState_3_T_1, P_masterState_3_T_2, P_masterState_3_T_3, P_masterState_3_T_4, P_masterState_3_T_5, P_masterState_4_F_0, P_masterState_4_F_1, P_masterState_4_F_2, P_masterState_4_F_3, P_masterState_4_F_4, P_masterState_4_F_5, P_masterState_4_T_0, P_masterState_4_T_1, P_masterState_4_T_2, P_masterState_4_T_3, P_masterState_4_T_4, P_masterState_4_T_5, P_masterState_5_F_0, P_masterState_5_F_1, P_masterState_5_F_2, P_masterState_5_F_3, P_masterState_5_F_4, P_masterState_5_F_5, P_masterState_5_T_0, P_masterState_5_T_1, P_masterState_5_T_2, P_masterState_5_T_3, P_masterState_5_T_4, P_masterState_5_T_5, P_negotiation_0_0_NONE, P_negotiation_0_0_CO, P_negotiation_0_0_DONE, P_negotiation_0_1_NONE, P_negotiation_0_1_CO, P_negotiation_0_1_DONE, P_negotiation_0_2_NONE, P_negotiation_0_2_CO, P_negotiation_0_2_DONE, P_negotiation_0_3_NONE, P_negotiation_0_3_CO, P_negotiation_0_3_DONE, P_negotiation_0_4_NONE, P_negotiation_0_4_CO, P_negotiation_0_4_DONE, P_negotiation_0_5_NONE, P_negotiation_0_5_CO, P_negotiation_0_5_DONE, P_negotiation_1_0_NONE, P_negotiation_1_0_CO, P_negotiation_1_0_DONE, P_negotiation_1_1_NONE, P_negotiation_1_1_CO, P_negotiation_1_1_DONE, P_negotiation_1_2_NONE, P_negotiation_1_2_CO, P_negotiation_1_2_DONE, P_negotiation_1_3_NONE, P_negotiation_1_3_CO, P_negotiation_1_3_DONE, P_negotiation_1_4_NONE, P_negotiation_1_4_CO, P_negotiation_1_4_DONE, P_negotiation_1_5_NONE, P_negotiation_1_5_CO, P_negotiation_1_5_DONE, P_negotiation_2_0_NONE, P_negotiation_2_0_CO, P_negotiation_2_0_DONE, P_negotiation_2_1_NONE, P_negotiation_2_1_CO, P_negotiation_2_1_DONE, P_negotiation_2_2_NONE, P_negotiation_2_2_CO, P_negotiation_2_2_DONE, P_negotiation_2_3_NONE, P_negotiation_2_3_CO, P_negotiation_2_3_DONE, P_negotiation_2_4_NONE, P_negotiation_2_4_CO, P_negotiation_2_4_DONE, P_negotiation_2_5_NONE, P_negotiation_2_5_CO, P_negotiation_2_5_DONE, P_negotiation_3_0_NONE, P_negotiation_3_0_CO, P_negotiation_3_0_DONE, P_negotiation_3_1_NONE, P_negotiation_3_1_CO, P_negotiation_3_1_DONE, P_negotiation_3_2_NONE, P_negotiation_3_2_CO, P_negotiation_3_2_DONE, P_negotiation_3_3_NONE, P_negotiation_3_3_CO, P_negotiation_3_3_DONE, P_negotiation_3_4_NONE, P_negotiation_3_4_CO, P_negotiation_3_4_DONE, P_negotiation_3_5_NONE, P_negotiation_3_5_CO, P_negotiation_3_5_DONE, P_negotiation_4_0_NONE, P_negotiation_4_0_CO, P_negotiation_4_0_DONE, P_negotiation_4_1_NONE, P_negotiation_4_1_CO, P_negotiation_4_1_DONE, P_negotiation_4_2_NONE, P_negotiation_4_2_CO, P_negotiation_4_2_DONE, P_negotiation_4_3_NONE, P_negotiation_4_3_CO, P_negotiation_4_3_DONE, P_negotiation_4_4_NONE, P_negotiation_4_4_CO, P_negotiation_4_4_DONE, P_negotiation_4_5_NONE, P_negotiation_4_5_CO, P_negotiation_4_5_DONE, P_negotiation_5_0_NONE, P_negotiation_5_0_CO, P_negotiation_5_0_DONE, P_negotiation_5_1_NONE, P_negotiation_5_1_CO, P_negotiation_5_1_DONE, P_negotiation_5_2_NONE, P_negotiation_5_2_CO, P_negotiation_5_2_DONE, P_negotiation_5_3_NONE, P_negotiation_5_3_CO, P_negotiation_5_3_DONE, P_negotiation_5_4_NONE, P_negotiation_5_4_CO, P_negotiation_5_4_DONE, P_negotiation_5_5_NONE, P_negotiation_5_5_CO, P_negotiation_5_5_DONE, P_network_0_0_AskP_0, P_network_0_0_AskP_1, P_network_0_0_AskP_2, P_network_0_0_AskP_3, P_network_0_0_AskP_4, P_network_0_0_AskP_5, P_network_0_0_AnsP_0, P_network_0_0_AnsP_1, P_network_0_0_AnsP_2, P_network_0_0_AnsP_3, P_network_0_0_AnsP_4, P_network_0_0_AnsP_5, P_network_0_0_RI_0, P_network_0_0_RI_1, P_network_0_0_RI_2, P_network_0_0_RI_3, P_network_0_0_RI_4, P_network_0_0_RI_5, P_network_0_0_AI_0, P_network_0_0_AI_1, P_network_0_0_AI_2, P_network_0_0_AI_3, P_network_0_0_AI_4, P_network_0_0_AI_5, P_network_0_0_AnnP_0, P_network_0_0_AnnP_1, P_network_0_0_AnnP_2, P_network_0_0_AnnP_3, P_network_0_0_AnnP_4, P_network_0_0_AnnP_5, P_network_0_0_RP_0, P_network_0_0_RP_1, P_network_0_0_RP_2, P_network_0_0_RP_3, P_network_0_0_RP_4, P_network_0_0_RP_5, P_network_0_1_AskP_0, P_network_0_1_AskP_1, P_network_0_1_AskP_2, P_network_0_1_AskP_3, P_network_0_1_AskP_4, P_network_0_1_AskP_5, P_network_0_1_AnsP_0, P_network_0_1_AnsP_1, P_network_0_1_AnsP_2, P_network_0_1_AnsP_3, P_network_0_1_AnsP_4, P_network_0_1_AnsP_5, P_network_0_1_RI_0, P_network_0_1_RI_1, P_network_0_1_RI_2, P_network_0_1_RI_3, P_network_0_1_RI_4, P_network_0_1_RI_5, P_network_0_1_AI_0, P_network_0_1_AI_1, P_network_0_1_AI_2, P_network_0_1_AI_3, P_network_0_1_AI_4, P_network_0_1_AI_5, P_network_0_1_AnnP_0, P_network_0_1_AnnP_1, P_network_0_1_AnnP_2, P_network_0_1_AnnP_3, P_network_0_1_AnnP_4, P_network_0_1_AnnP_5, P_network_0_1_RP_0, P_network_0_1_RP_1, P_network_0_1_RP_2, P_network_0_1_RP_3, P_network_0_1_RP_4, P_network_0_1_RP_5, P_network_0_2_AskP_0, P_network_0_2_AskP_1, P_network_0_2_AskP_2, P_network_0_2_AskP_3, P_network_0_2_AskP_4, P_network_0_2_AskP_5, P_network_0_2_AnsP_0, P_network_0_2_AnsP_1, P_network_0_2_AnsP_2, P_network_0_2_AnsP_3, P_network_0_2_AnsP_4, P_network_0_2_AnsP_5, P_network_0_2_RI_0, P_network_0_2_RI_1, P_network_0_2_RI_2, P_network_0_2_RI_3, P_network_0_2_RI_4, P_network_0_2_RI_5, P_network_0_2_AI_0, P_network_0_2_AI_1, P_network_0_2_AI_2, P_network_0_2_AI_3, P_network_0_2_AI_4, P_network_0_2_AI_5, P_network_0_2_AnnP_0, P_network_0_2_AnnP_1, P_network_0_2_AnnP_2, P_network_0_2_AnnP_3, P_network_0_2_AnnP_4, P_network_0_2_AnnP_5, P_network_0_2_RP_0, P_network_0_2_RP_1, P_network_0_2_RP_2, P_network_0_2_RP_3, P_network_0_2_RP_4, P_network_0_2_RP_5, P_network_0_3_AskP_0, P_network_0_3_AskP_1, P_network_0_3_AskP_2, P_network_0_3_AskP_3, P_network_0_3_AskP_4, P_network_0_3_AskP_5, P_network_0_3_AnsP_0, P_network_0_3_AnsP_1, P_network_0_3_AnsP_2, P_network_0_3_AnsP_3, P_network_0_3_AnsP_4, P_network_0_3_AnsP_5, P_network_0_3_RI_0, P_network_0_3_RI_1, P_network_0_3_RI_2, P_network_0_3_RI_3, P_network_0_3_RI_4, P_network_0_3_RI_5, P_network_0_3_AI_0, P_network_0_3_AI_1, P_network_0_3_AI_2, P_network_0_3_AI_3, P_network_0_3_AI_4, P_network_0_3_AI_5, P_network_0_3_AnnP_0, P_network_0_3_AnnP_1, P_network_0_3_AnnP_2, P_network_0_3_AnnP_3, P_network_0_3_AnnP_4, P_network_0_3_AnnP_5, P_network_0_3_RP_0, P_network_0_3_RP_1, P_network_0_3_RP_2, P_network_0_3_RP_3, P_network_0_3_RP_4, P_network_0_3_RP_5, P_network_0_4_AskP_0, P_network_0_4_AskP_1, P_network_0_4_AskP_2, P_network_0_4_AskP_3, P_network_0_4_AskP_4, P_network_0_4_AskP_5, P_network_0_4_AnsP_0, P_network_0_4_AnsP_1, P_network_0_4_AnsP_2, P_network_0_4_AnsP_3, P_network_0_4_AnsP_4, P_network_0_4_AnsP_5, P_network_0_4_RI_0, P_network_0_4_RI_1, P_network_0_4_RI_2, P_network_0_4_RI_3, P_network_0_4_RI_4, P_network_0_4_RI_5, P_network_0_4_AI_0, P_network_0_4_AI_1, P_network_0_4_AI_2, P_network_0_4_AI_3, P_network_0_4_AI_4, P_network_0_4_AI_5, P_network_0_4_AnnP_0, P_network_0_4_AnnP_1, P_network_0_4_AnnP_2, P_network_0_4_AnnP_3, P_network_0_4_AnnP_4, P_network_0_4_AnnP_5, P_network_0_4_RP_0, P_network_0_4_RP_1, P_network_0_4_RP_2, P_network_0_4_RP_3, P_network_0_4_RP_4, P_network_0_4_RP_5, P_network_0_5_AskP_0, P_network_0_5_AskP_1, P_network_0_5_AskP_2, P_network_0_5_AskP_3, P_network_0_5_AskP_4, P_network_0_5_AskP_5, P_network_0_5_AnsP_0, P_network_0_5_AnsP_1, P_network_0_5_AnsP_2, P_network_0_5_AnsP_3, P_network_0_5_AnsP_4, P_network_0_5_AnsP_5, P_network_0_5_RI_0, P_network_0_5_RI_1, P_network_0_5_RI_2, P_network_0_5_RI_3, P_network_0_5_RI_4, P_network_0_5_RI_5, P_network_0_5_AI_0, P_network_0_5_AI_1, P_network_0_5_AI_2, P_network_0_5_AI_3, P_network_0_5_AI_4, P_network_0_5_AI_5, P_network_0_5_AnnP_0, P_network_0_5_AnnP_1, P_network_0_5_AnnP_2, P_network_0_5_AnnP_3, P_network_0_5_AnnP_4, P_network_0_5_AnnP_5, P_network_0_5_RP_0, P_network_0_5_RP_1, P_network_0_5_RP_2, P_network_0_5_RP_3, P_network_0_5_RP_4, P_network_0_5_RP_5, P_network_1_0_AskP_0, P_network_1_0_AskP_1, P_network_1_0_AskP_2, P_network_1_0_AskP_3, P_network_1_0_AskP_4, P_network_1_0_AskP_5, P_network_1_0_AnsP_0, P_network_1_0_AnsP_1, P_network_1_0_AnsP_2, P_network_1_0_AnsP_3, P_network_1_0_AnsP_4, P_network_1_0_AnsP_5, P_network_1_0_RI_0, P_network_1_0_RI_1, P_network_1_0_RI_2, P_network_1_0_RI_3, P_network_1_0_RI_4, P_network_1_0_RI_5, P_network_1_0_AI_0, P_network_1_0_AI_1, P_network_1_0_AI_2, P_network_1_0_AI_3, P_network_1_0_AI_4, P_network_1_0_AI_5, P_network_1_0_AnnP_0, P_network_1_0_AnnP_1, P_network_1_0_AnnP_2, P_network_1_0_AnnP_3, P_network_1_0_AnnP_4, P_network_1_0_AnnP_5, P_network_1_0_RP_0, P_network_1_0_RP_1, P_network_1_0_RP_2, P_network_1_0_RP_3, P_network_1_0_RP_4, P_network_1_0_RP_5, P_network_1_1_AskP_0, P_network_1_1_AskP_1, P_network_1_1_AskP_2, P_network_1_1_AskP_3, P_network_1_1_AskP_4, P_network_1_1_AskP_5, P_network_1_1_AnsP_0, P_network_1_1_AnsP_1, P_network_1_1_AnsP_2, P_network_1_1_AnsP_3, P_network_1_1_AnsP_4, P_network_1_1_AnsP_5, P_network_1_1_RI_0, P_network_1_1_RI_1, P_network_1_1_RI_2, P_network_1_1_RI_3, P_network_1_1_RI_4, P_network_1_1_RI_5, P_network_1_1_AI_0, P_network_1_1_AI_1, P_network_1_1_AI_2, P_network_1_1_AI_3, P_network_1_1_AI_4, P_network_1_1_AI_5, P_network_1_1_AnnP_0, P_network_1_1_AnnP_1, P_network_1_1_AnnP_2, P_network_1_1_AnnP_3, P_network_1_1_AnnP_4, P_network_1_1_AnnP_5, P_network_1_1_RP_0, P_network_1_1_RP_1, P_network_1_1_RP_2, P_network_1_1_RP_3, P_network_1_1_RP_4, P_network_1_1_RP_5, P_network_1_2_AskP_0, P_network_1_2_AskP_1, P_network_1_2_AskP_2, P_network_1_2_AskP_3, P_network_1_2_AskP_4, P_network_1_2_AskP_5, P_network_1_2_AnsP_0, P_network_1_2_AnsP_1, P_network_1_2_AnsP_2, P_network_1_2_AnsP_3, P_network_1_2_AnsP_4, P_network_1_2_AnsP_5, P_network_1_2_RI_0, P_network_1_2_RI_1, P_network_1_2_RI_2, P_network_1_2_RI_3, P_network_1_2_RI_4, P_network_1_2_RI_5, P_network_1_2_AI_0, P_network_1_2_AI_1, P_network_1_2_AI_2, P_network_1_2_AI_3, P_network_1_2_AI_4, P_network_1_2_AI_5, P_network_1_2_AnnP_0, P_network_1_2_AnnP_1, P_network_1_2_AnnP_2, P_network_1_2_AnnP_3, P_network_1_2_AnnP_4, P_network_1_2_AnnP_5, P_network_1_2_RP_0, P_network_1_2_RP_1, P_network_1_2_RP_2, P_network_1_2_RP_3, P_network_1_2_RP_4, P_network_1_2_RP_5, P_network_1_3_AskP_0, P_network_1_3_AskP_1, P_network_1_3_AskP_2, P_network_1_3_AskP_3, P_network_1_3_AskP_4, P_network_1_3_AskP_5, P_network_1_3_AnsP_0, P_network_1_3_AnsP_1, P_network_1_3_AnsP_2, P_network_1_3_AnsP_3, P_network_1_3_AnsP_4, P_network_1_3_AnsP_5, P_network_1_3_RI_0, P_network_1_3_RI_1, P_network_1_3_RI_2, P_network_1_3_RI_3, P_network_1_3_RI_4, P_network_1_3_RI_5, P_network_1_3_AI_0, P_network_1_3_AI_1, P_network_1_3_AI_2, P_network_1_3_AI_3, P_network_1_3_AI_4, P_network_1_3_AI_5, P_network_1_3_AnnP_0, P_network_1_3_AnnP_1, P_network_1_3_AnnP_2, P_network_1_3_AnnP_3, P_network_1_3_AnnP_4, P_network_1_3_AnnP_5, P_network_1_3_RP_0, P_network_1_3_RP_1, P_network_1_3_RP_2, P_network_1_3_RP_3, P_network_1_3_RP_4, P_network_1_3_RP_5, P_network_1_4_AskP_0, P_network_1_4_AskP_1, P_network_1_4_AskP_2, P_network_1_4_AskP_3, P_network_1_4_AskP_4, P_network_1_4_AskP_5, P_network_1_4_AnsP_0, P_network_1_4_AnsP_1, P_network_1_4_AnsP_2, P_network_1_4_AnsP_3, P_network_1_4_AnsP_4, P_network_1_4_AnsP_5, P_network_1_4_RI_0, P_network_1_4_RI_1, P_network_1_4_RI_2, P_network_1_4_RI_3, P_network_1_4_RI_4, P_network_1_4_RI_5, P_network_1_4_AI_0, P_network_1_4_AI_1, P_network_1_4_AI_2, P_network_1_4_AI_3, P_network_1_4_AI_4, P_network_1_4_AI_5, P_network_1_4_AnnP_0, P_network_1_4_AnnP_1, P_network_1_4_AnnP_2, P_network_1_4_AnnP_3, P_network_1_4_AnnP_4, P_network_1_4_AnnP_5, P_network_1_4_RP_0, P_network_1_4_RP_1, P_network_1_4_RP_2, P_network_1_4_RP_3, P_network_1_4_RP_4, P_network_1_4_RP_5, P_network_1_5_AskP_0, P_network_1_5_AskP_1, P_network_1_5_AskP_2, P_network_1_5_AskP_3, P_network_1_5_AskP_4, P_network_1_5_AskP_5, P_network_1_5_AnsP_0, P_network_1_5_AnsP_1, P_network_1_5_AnsP_2, P_network_1_5_AnsP_3, P_network_1_5_AnsP_4, P_network_1_5_AnsP_5, P_network_1_5_RI_0, P_network_1_5_RI_1, P_network_1_5_RI_2, P_network_1_5_RI_3, P_network_1_5_RI_4, P_network_1_5_RI_5, P_network_1_5_AI_0, P_network_1_5_AI_1, P_network_1_5_AI_2, P_network_1_5_AI_3, P_network_1_5_AI_4, P_network_1_5_AI_5, P_network_1_5_AnnP_0, P_network_1_5_AnnP_1, P_network_1_5_AnnP_2, P_network_1_5_AnnP_3, P_network_1_5_AnnP_4, P_network_1_5_AnnP_5, P_network_1_5_RP_0, P_network_1_5_RP_1, P_network_1_5_RP_2, P_network_1_5_RP_3, P_network_1_5_RP_4, P_network_1_5_RP_5, P_network_2_0_AskP_0, P_network_2_0_AskP_1, P_network_2_0_AskP_2, P_network_2_0_AskP_3, P_network_2_0_AskP_4, P_network_2_0_AskP_5, P_network_2_0_AnsP_0, P_network_2_0_AnsP_1, P_network_2_0_AnsP_2, P_network_2_0_AnsP_3, P_network_2_0_AnsP_4, P_network_2_0_AnsP_5, P_network_2_0_RI_0, P_network_2_0_RI_1, P_network_2_0_RI_2, P_network_2_0_RI_3, P_network_2_0_RI_4, P_network_2_0_RI_5, P_network_2_0_AI_0, P_network_2_0_AI_1, P_network_2_0_AI_2, P_network_2_0_AI_3, P_network_2_0_AI_4, P_network_2_0_AI_5, P_network_2_0_AnnP_0, P_network_2_0_AnnP_1, P_network_2_0_AnnP_2, P_network_2_0_AnnP_3, P_network_2_0_AnnP_4, P_network_2_0_AnnP_5, P_network_2_0_RP_0, P_network_2_0_RP_1, P_network_2_0_RP_2, P_network_2_0_RP_3, P_network_2_0_RP_4, P_network_2_0_RP_5, P_network_2_1_AskP_0, P_network_2_1_AskP_1, P_network_2_1_AskP_2, P_network_2_1_AskP_3, P_network_2_1_AskP_4, P_network_2_1_AskP_5, P_network_2_1_AnsP_0, P_network_2_1_AnsP_1, P_network_2_1_AnsP_2, P_network_2_1_AnsP_3, P_network_2_1_AnsP_4, P_network_2_1_AnsP_5, P_network_2_1_RI_0, P_network_2_1_RI_1, P_network_2_1_RI_2, P_network_2_1_RI_3, P_network_2_1_RI_4, P_network_2_1_RI_5, P_network_2_1_AI_0, P_network_2_1_AI_1, P_network_2_1_AI_2, P_network_2_1_AI_3, P_network_2_1_AI_4, P_network_2_1_AI_5, P_network_2_1_AnnP_0, P_network_2_1_AnnP_1, P_network_2_1_AnnP_2, P_network_2_1_AnnP_3, P_network_2_1_AnnP_4, P_network_2_1_AnnP_5, P_network_2_1_RP_0, P_network_2_1_RP_1, P_network_2_1_RP_2, P_network_2_1_RP_3, P_network_2_1_RP_4, P_network_2_1_RP_5, P_network_2_2_AskP_0, P_network_2_2_AskP_1, P_network_2_2_AskP_2, P_network_2_2_AskP_3, P_network_2_2_AskP_4, P_network_2_2_AskP_5, P_network_2_2_AnsP_0, P_network_2_2_AnsP_1, P_network_2_2_AnsP_2, P_network_2_2_AnsP_3, P_network_2_2_AnsP_4, P_network_2_2_AnsP_5, P_network_2_2_RI_0, P_network_2_2_RI_1, P_network_2_2_RI_2, P_network_2_2_RI_3, P_network_2_2_RI_4, P_network_2_2_RI_5, P_network_2_2_AI_0, P_network_2_2_AI_1, P_network_2_2_AI_2, P_network_2_2_AI_3, P_network_2_2_AI_4, P_network_2_2_AI_5, P_network_2_2_AnnP_0, P_network_2_2_AnnP_1, P_network_2_2_AnnP_2, P_network_2_2_AnnP_3, P_network_2_2_AnnP_4, P_network_2_2_AnnP_5, P_network_2_2_RP_0, P_network_2_2_RP_1, P_network_2_2_RP_2, P_network_2_2_RP_3, P_network_2_2_RP_4, P_network_2_2_RP_5, P_network_2_3_AskP_0, P_network_2_3_AskP_1, P_network_2_3_AskP_2, P_network_2_3_AskP_3, P_network_2_3_AskP_4, P_network_2_3_AskP_5, P_network_2_3_AnsP_0, P_network_2_3_AnsP_1, P_network_2_3_AnsP_2, P_network_2_3_AnsP_3, P_network_2_3_AnsP_4, P_network_2_3_AnsP_5, P_network_2_3_RI_0, P_network_2_3_RI_1, P_network_2_3_RI_2, P_network_2_3_RI_3, P_network_2_3_RI_4, P_network_2_3_RI_5, P_network_2_3_AI_0, P_network_2_3_AI_1, P_network_2_3_AI_2, P_network_2_3_AI_3, P_network_2_3_AI_4, P_network_2_3_AI_5, P_network_2_3_AnnP_0, P_network_2_3_AnnP_1, P_network_2_3_AnnP_2, P_network_2_3_AnnP_3, P_network_2_3_AnnP_4, P_network_2_3_AnnP_5, P_network_2_3_RP_0, P_network_2_3_RP_1, P_network_2_3_RP_2, P_network_2_3_RP_3, P_network_2_3_RP_4, P_network_2_3_RP_5, P_network_2_4_AskP_0, P_network_2_4_AskP_1, P_network_2_4_AskP_2, P_network_2_4_AskP_3, P_network_2_4_AskP_4, P_network_2_4_AskP_5, P_network_2_4_AnsP_0, P_network_2_4_AnsP_1, P_network_2_4_AnsP_2, P_network_2_4_AnsP_3, P_network_2_4_AnsP_4, P_network_2_4_AnsP_5, P_network_2_4_RI_0, P_network_2_4_RI_1, P_network_2_4_RI_2, P_network_2_4_RI_3, P_network_2_4_RI_4, P_network_2_4_RI_5, P_network_2_4_AI_0, P_network_2_4_AI_1, P_network_2_4_AI_2, P_network_2_4_AI_3, P_network_2_4_AI_4, P_network_2_4_AI_5, P_network_2_4_AnnP_0, P_network_2_4_AnnP_1, P_network_2_4_AnnP_2, P_network_2_4_AnnP_3, P_network_2_4_AnnP_4, P_network_2_4_AnnP_5, P_network_2_4_RP_0, P_network_2_4_RP_1, P_network_2_4_RP_2, P_network_2_4_RP_3, P_network_2_4_RP_4, P_network_2_4_RP_5, P_network_2_5_AskP_0, P_network_2_5_AskP_1, P_network_2_5_AskP_2, P_network_2_5_AskP_3, P_network_2_5_AskP_4, P_network_2_5_AskP_5, P_network_2_5_AnsP_0, P_network_2_5_AnsP_1, P_network_2_5_AnsP_2, P_network_2_5_AnsP_3, P_network_2_5_AnsP_4, P_network_2_5_AnsP_5, P_network_2_5_RI_0, P_network_2_5_RI_1, P_network_2_5_RI_2, P_network_2_5_RI_3, P_network_2_5_RI_4, P_network_2_5_RI_5, P_network_2_5_AI_0, P_network_2_5_AI_1, P_network_2_5_AI_2, P_network_2_5_AI_3, P_network_2_5_AI_4, P_network_2_5_AI_5, P_network_2_5_AnnP_0, P_network_2_5_AnnP_1, P_network_2_5_AnnP_2, P_network_2_5_AnnP_3, P_network_2_5_AnnP_4, P_network_2_5_AnnP_5, P_network_2_5_RP_0, P_network_2_5_RP_1, P_network_2_5_RP_2, P_network_2_5_RP_3, P_network_2_5_RP_4, P_network_2_5_RP_5, P_network_3_0_AskP_0, P_network_3_0_AskP_1, P_network_3_0_AskP_2, P_network_3_0_AskP_3, P_network_3_0_AskP_4, P_network_3_0_AskP_5, P_network_3_0_AnsP_0, P_network_3_0_AnsP_1, P_network_3_0_AnsP_2, P_network_3_0_AnsP_3, P_network_3_0_AnsP_4, P_network_3_0_AnsP_5, P_network_3_0_RI_0, P_network_3_0_RI_1, P_network_3_0_RI_2, P_network_3_0_RI_3, P_network_3_0_RI_4, P_network_3_0_RI_5, P_network_3_0_AI_0, P_network_3_0_AI_1, P_network_3_0_AI_2, P_network_3_0_AI_3, P_network_3_0_AI_4, P_network_3_0_AI_5, P_network_3_0_AnnP_0, P_network_3_0_AnnP_1, P_network_3_0_AnnP_2, P_network_3_0_AnnP_3, P_network_3_0_AnnP_4, P_network_3_0_AnnP_5, P_network_3_0_RP_0, P_network_3_0_RP_1, P_network_3_0_RP_2, P_network_3_0_RP_3, P_network_3_0_RP_4, P_network_3_0_RP_5, P_network_3_1_AskP_0, P_network_3_1_AskP_1, P_network_3_1_AskP_2, P_network_3_1_AskP_3, P_network_3_1_AskP_4, P_network_3_1_AskP_5, P_network_3_1_AnsP_0, P_network_3_1_AnsP_1, P_network_3_1_AnsP_2, P_network_3_1_AnsP_3, P_network_3_1_AnsP_4, P_network_3_1_AnsP_5, P_network_3_1_RI_0, P_network_3_1_RI_1, P_network_3_1_RI_2, P_network_3_1_RI_3, P_network_3_1_RI_4, P_network_3_1_RI_5, P_network_3_1_AI_0, P_network_3_1_AI_1, P_network_3_1_AI_2, P_network_3_1_AI_3, P_network_3_1_AI_4, P_network_3_1_AI_5, P_network_3_1_AnnP_0, P_network_3_1_AnnP_1, P_network_3_1_AnnP_2, P_network_3_1_AnnP_3, P_network_3_1_AnnP_4, P_network_3_1_AnnP_5, P_network_3_1_RP_0, P_network_3_1_RP_1, P_network_3_1_RP_2, P_network_3_1_RP_3, P_network_3_1_RP_4, P_network_3_1_RP_5, P_network_3_2_AskP_0, P_network_3_2_AskP_1, P_network_3_2_AskP_2, P_network_3_2_AskP_3, P_network_3_2_AskP_4, P_network_3_2_AskP_5, P_network_3_2_AnsP_0, P_network_3_2_AnsP_1, P_network_3_2_AnsP_2, P_network_3_2_AnsP_3, P_network_3_2_AnsP_4, P_network_3_2_AnsP_5, P_network_3_2_RI_0, P_network_3_2_RI_1, P_network_3_2_RI_2, P_network_3_2_RI_3, P_network_3_2_RI_4, P_network_3_2_RI_5, P_network_3_2_AI_0, P_network_3_2_AI_1, P_network_3_2_AI_2, P_network_3_2_AI_3, P_network_3_2_AI_4, P_network_3_2_AI_5, P_network_3_2_AnnP_0, P_network_3_2_AnnP_1, P_network_3_2_AnnP_2, P_network_3_2_AnnP_3, P_network_3_2_AnnP_4, P_network_3_2_AnnP_5, P_network_3_2_RP_0, P_network_3_2_RP_1, P_network_3_2_RP_2, P_network_3_2_RP_3, P_network_3_2_RP_4, P_network_3_2_RP_5, P_network_3_3_AskP_0, P_network_3_3_AskP_1, P_network_3_3_AskP_2, P_network_3_3_AskP_3, P_network_3_3_AskP_4, P_network_3_3_AskP_5, P_network_3_3_AnsP_0, P_network_3_3_AnsP_1, P_network_3_3_AnsP_2, P_network_3_3_AnsP_3, P_network_3_3_AnsP_4, P_network_3_3_AnsP_5, P_network_3_3_RI_0, P_network_3_3_RI_1, P_network_3_3_RI_2, P_network_3_3_RI_3, P_network_3_3_RI_4, P_network_3_3_RI_5, P_network_3_3_AI_0, P_network_3_3_AI_1, P_network_3_3_AI_2, P_network_3_3_AI_3, P_network_3_3_AI_4, P_network_3_3_AI_5, P_network_3_3_AnnP_0, P_network_3_3_AnnP_1, P_network_3_3_AnnP_2, P_network_3_3_AnnP_3, P_network_3_3_AnnP_4, P_network_3_3_AnnP_5, P_network_3_3_RP_0, P_network_3_3_RP_1, P_network_3_3_RP_2, P_network_3_3_RP_3, P_network_3_3_RP_4, P_network_3_3_RP_5, P_network_3_4_AskP_0, P_network_3_4_AskP_1, P_network_3_4_AskP_2, P_network_3_4_AskP_3, P_network_3_4_AskP_4, P_network_3_4_AskP_5, P_network_3_4_AnsP_0, P_network_3_4_AnsP_1, P_network_3_4_AnsP_2, P_network_3_4_AnsP_3, P_network_3_4_AnsP_4, P_network_3_4_AnsP_5, P_network_3_4_RI_0, P_network_3_4_RI_1, P_network_3_4_RI_2, P_network_3_4_RI_3, P_network_3_4_RI_4, P_network_3_4_RI_5, P_network_3_4_AI_0, P_network_3_4_AI_1, P_network_3_4_AI_2, P_network_3_4_AI_3, P_network_3_4_AI_4, P_network_3_4_AI_5, P_network_3_4_AnnP_0, P_network_3_4_AnnP_1, P_network_3_4_AnnP_2, P_network_3_4_AnnP_3, P_network_3_4_AnnP_4, P_network_3_4_AnnP_5, P_network_3_4_RP_0, P_network_3_4_RP_1, P_network_3_4_RP_2, P_network_3_4_RP_3, P_network_3_4_RP_4, P_network_3_4_RP_5, P_network_3_5_AskP_0, P_network_3_5_AskP_1, P_network_3_5_AskP_2, P_network_3_5_AskP_3, P_network_3_5_AskP_4, P_network_3_5_AskP_5, P_network_3_5_AnsP_0, P_network_3_5_AnsP_1, P_network_3_5_AnsP_2, P_network_3_5_AnsP_3, P_network_3_5_AnsP_4, P_network_3_5_AnsP_5, P_network_3_5_RI_0, P_network_3_5_RI_1, P_network_3_5_RI_2, P_network_3_5_RI_3, P_network_3_5_RI_4, P_network_3_5_RI_5, P_network_3_5_AI_0, P_network_3_5_AI_1, P_network_3_5_AI_2, P_network_3_5_AI_3, P_network_3_5_AI_4, P_network_3_5_AI_5, P_network_3_5_AnnP_0, P_network_3_5_AnnP_1, P_network_3_5_AnnP_2, P_network_3_5_AnnP_3, P_network_3_5_AnnP_4, P_network_3_5_AnnP_5, P_network_3_5_RP_0, P_network_3_5_RP_1, P_network_3_5_RP_2, P_network_3_5_RP_3, P_network_3_5_RP_4, P_network_3_5_RP_5, P_network_4_0_AskP_0, P_network_4_0_AskP_1, P_network_4_0_AskP_2, P_network_4_0_AskP_3, P_network_4_0_AskP_4, P_network_4_0_AskP_5, P_network_4_0_AnsP_0, P_network_4_0_AnsP_1, P_network_4_0_AnsP_2, P_network_4_0_AnsP_3, P_network_4_0_AnsP_4, P_network_4_0_AnsP_5, P_network_4_0_RI_0, P_network_4_0_RI_1, P_network_4_0_RI_2, P_network_4_0_RI_3, P_network_4_0_RI_4, P_network_4_0_RI_5, P_network_4_0_AI_0, P_network_4_0_AI_1, P_network_4_0_AI_2, P_network_4_0_AI_3, P_network_4_0_AI_4, P_network_4_0_AI_5, P_network_4_0_AnnP_0, P_network_4_0_AnnP_1, P_network_4_0_AnnP_2, P_network_4_0_AnnP_3, P_network_4_0_AnnP_4, P_network_4_0_AnnP_5, P_network_4_0_RP_0, P_network_4_0_RP_1, P_network_4_0_RP_2, P_network_4_0_RP_3, P_network_4_0_RP_4, P_network_4_0_RP_5, P_network_4_1_AskP_0, P_network_4_1_AskP_1, P_network_4_1_AskP_2, P_network_4_1_AskP_3, P_network_4_1_AskP_4, P_network_4_1_AskP_5, P_network_4_1_AnsP_0, P_network_4_1_AnsP_1, P_network_4_1_AnsP_2, P_network_4_1_AnsP_3, P_network_4_1_AnsP_4, P_network_4_1_AnsP_5, P_network_4_1_RI_0, P_network_4_1_RI_1, P_network_4_1_RI_2, P_network_4_1_RI_3, P_network_4_1_RI_4, P_network_4_1_RI_5, P_network_4_1_AI_0, P_network_4_1_AI_1, P_network_4_1_AI_2, P_network_4_1_AI_3, P_network_4_1_AI_4, P_network_4_1_AI_5, P_network_4_1_AnnP_0, P_network_4_1_AnnP_1, P_network_4_1_AnnP_2, P_network_4_1_AnnP_3, P_network_4_1_AnnP_4, P_network_4_1_AnnP_5, P_network_4_1_RP_0, P_network_4_1_RP_1, P_network_4_1_RP_2, P_network_4_1_RP_3, P_network_4_1_RP_4, P_network_4_1_RP_5, P_network_4_2_AskP_0, P_network_4_2_AskP_1, P_network_4_2_AskP_2, P_network_4_2_AskP_3, P_network_4_2_AskP_4, P_network_4_2_AskP_5, P_network_4_2_AnsP_0, P_network_4_2_AnsP_1, P_network_4_2_AnsP_2, P_network_4_2_AnsP_3, P_network_4_2_AnsP_4, P_network_4_2_AnsP_5, P_network_4_2_RI_0, P_network_4_2_RI_1, P_network_4_2_RI_2, P_network_4_2_RI_3, P_network_4_2_RI_4, P_network_4_2_RI_5, P_network_4_2_AI_0, P_network_4_2_AI_1, P_network_4_2_AI_2, P_network_4_2_AI_3, P_network_4_2_AI_4, P_network_4_2_AI_5, P_network_4_2_AnnP_0, P_network_4_2_AnnP_1, P_network_4_2_AnnP_2, P_network_4_2_AnnP_3, P_network_4_2_AnnP_4, P_network_4_2_AnnP_5, P_network_4_2_RP_0, P_network_4_2_RP_1, P_network_4_2_RP_2, P_network_4_2_RP_3, P_network_4_2_RP_4, P_network_4_2_RP_5, P_network_4_3_AskP_0, P_network_4_3_AskP_1, P_network_4_3_AskP_2, P_network_4_3_AskP_3, P_network_4_3_AskP_4, P_network_4_3_AskP_5, P_network_4_3_AnsP_0, P_network_4_3_AnsP_1, P_network_4_3_AnsP_2, P_network_4_3_AnsP_3, P_network_4_3_AnsP_4, P_network_4_3_AnsP_5, P_network_4_3_RI_0, P_network_4_3_RI_1, P_network_4_3_RI_2, P_network_4_3_RI_3, P_network_4_3_RI_4, P_network_4_3_RI_5, P_network_4_3_AI_0, P_network_4_3_AI_1, P_network_4_3_AI_2, P_network_4_3_AI_3, P_network_4_3_AI_4, P_network_4_3_AI_5, P_network_4_3_AnnP_0, P_network_4_3_AnnP_1, P_network_4_3_AnnP_2, P_network_4_3_AnnP_3, P_network_4_3_AnnP_4, P_network_4_3_AnnP_5, P_network_4_3_RP_0, P_network_4_3_RP_1, P_network_4_3_RP_2, P_network_4_3_RP_3, P_network_4_3_RP_4, P_network_4_3_RP_5, P_network_4_4_AskP_0, P_network_4_4_AskP_1, P_network_4_4_AskP_2, P_network_4_4_AskP_3, P_network_4_4_AskP_4, P_network_4_4_AskP_5, P_network_4_4_AnsP_0, P_network_4_4_AnsP_1, P_network_4_4_AnsP_2, P_network_4_4_AnsP_3, P_network_4_4_AnsP_4, P_network_4_4_AnsP_5, P_network_4_4_RI_0, P_network_4_4_RI_1, P_network_4_4_RI_2, P_network_4_4_RI_3, P_network_4_4_RI_4, P_network_4_4_RI_5, P_network_4_4_AI_0, P_network_4_4_AI_1, P_network_4_4_AI_2, P_network_4_4_AI_3, P_network_4_4_AI_4, P_network_4_4_AI_5, P_network_4_4_AnnP_0, P_network_4_4_AnnP_1, P_network_4_4_AnnP_2, P_network_4_4_AnnP_3, P_network_4_4_AnnP_4, P_network_4_4_AnnP_5, P_network_4_4_RP_0, P_network_4_4_RP_1, P_network_4_4_RP_2, P_network_4_4_RP_3, P_network_4_4_RP_4, P_network_4_4_RP_5, P_network_4_5_AskP_0, P_network_4_5_AskP_1, P_network_4_5_AskP_2, P_network_4_5_AskP_3, P_network_4_5_AskP_4, P_network_4_5_AskP_5, P_network_4_5_AnsP_0, P_network_4_5_AnsP_1, P_network_4_5_AnsP_2, P_network_4_5_AnsP_3, P_network_4_5_AnsP_4, P_network_4_5_AnsP_5, P_network_4_5_RI_0, P_network_4_5_RI_1, P_network_4_5_RI_2, P_network_4_5_RI_3, P_network_4_5_RI_4, P_network_4_5_RI_5, P_network_4_5_AI_0, P_network_4_5_AI_1, P_network_4_5_AI_2, P_network_4_5_AI_3, P_network_4_5_AI_4, P_network_4_5_AI_5, P_network_4_5_AnnP_0, P_network_4_5_AnnP_1, P_network_4_5_AnnP_2, P_network_4_5_AnnP_3, P_network_4_5_AnnP_4, P_network_4_5_AnnP_5, P_network_4_5_RP_0, P_network_4_5_RP_1, P_network_4_5_RP_2, P_network_4_5_RP_3, P_network_4_5_RP_4, P_network_4_5_RP_5, P_network_5_0_AskP_0, P_network_5_0_AskP_1, P_network_5_0_AskP_2, P_network_5_0_AskP_3, P_network_5_0_AskP_4, P_network_5_0_AskP_5, P_network_5_0_AnsP_0, P_network_5_0_AnsP_1, P_network_5_0_AnsP_2, P_network_5_0_AnsP_3, P_network_5_0_AnsP_4, P_network_5_0_AnsP_5, P_network_5_0_RI_0, P_network_5_0_RI_1, P_network_5_0_RI_2, P_network_5_0_RI_3, P_network_5_0_RI_4, P_network_5_0_RI_5, P_network_5_0_AI_0, P_network_5_0_AI_1, P_network_5_0_AI_2, P_network_5_0_AI_3, P_network_5_0_AI_4, P_network_5_0_AI_5, P_network_5_0_AnnP_0, P_network_5_0_AnnP_1, P_network_5_0_AnnP_2, P_network_5_0_AnnP_3, P_network_5_0_AnnP_4, P_network_5_0_AnnP_5, P_network_5_0_RP_0, P_network_5_0_RP_1, P_network_5_0_RP_2, P_network_5_0_RP_3, P_network_5_0_RP_4, P_network_5_0_RP_5, P_network_5_1_AskP_0, P_network_5_1_AskP_1, P_network_5_1_AskP_2, P_network_5_1_AskP_3, P_network_5_1_AskP_4, P_network_5_1_AskP_5, P_network_5_1_AnsP_0, P_network_5_1_AnsP_1, P_network_5_1_AnsP_2, P_network_5_1_AnsP_3, P_network_5_1_AnsP_4, P_network_5_1_AnsP_5, P_network_5_1_RI_0, P_network_5_1_RI_1, P_network_5_1_RI_2, P_network_5_1_RI_3, P_network_5_1_RI_4, P_network_5_1_RI_5, P_network_5_1_AI_0, P_network_5_1_AI_1, P_network_5_1_AI_2, P_network_5_1_AI_3, P_network_5_1_AI_4, P_network_5_1_AI_5, P_network_5_1_AnnP_0, P_network_5_1_AnnP_1, P_network_5_1_AnnP_2, P_network_5_1_AnnP_3, P_network_5_1_AnnP_4, P_network_5_1_AnnP_5, P_network_5_1_RP_0, P_network_5_1_RP_1, P_network_5_1_RP_2, P_network_5_1_RP_3, P_network_5_1_RP_4, P_network_5_1_RP_5, P_network_5_2_AskP_0, P_network_5_2_AskP_1, P_network_5_2_AskP_2, P_network_5_2_AskP_3, P_network_5_2_AskP_4, P_network_5_2_AskP_5, P_network_5_2_AnsP_0, P_network_5_2_AnsP_1, P_network_5_2_AnsP_2, P_network_5_2_AnsP_3, P_network_5_2_AnsP_4, P_network_5_2_AnsP_5, P_network_5_2_RI_0, P_network_5_2_RI_1, P_network_5_2_RI_2, P_network_5_2_RI_3, P_network_5_2_RI_4, P_network_5_2_RI_5, P_network_5_2_AI_0, P_network_5_2_AI_1, P_network_5_2_AI_2, P_network_5_2_AI_3, P_network_5_2_AI_4, P_network_5_2_AI_5, P_network_5_2_AnnP_0, P_network_5_2_AnnP_1, P_network_5_2_AnnP_2, P_network_5_2_AnnP_3, P_network_5_2_AnnP_4, P_network_5_2_AnnP_5, P_network_5_2_RP_0, P_network_5_2_RP_1, P_network_5_2_RP_2, P_network_5_2_RP_3, P_network_5_2_RP_4, P_network_5_2_RP_5, P_network_5_3_AskP_0, P_network_5_3_AskP_1, P_network_5_3_AskP_2, P_network_5_3_AskP_3, P_network_5_3_AskP_4, P_network_5_3_AskP_5, P_network_5_3_AnsP_0, P_network_5_3_AnsP_1, P_network_5_3_AnsP_2, P_network_5_3_AnsP_3, P_network_5_3_AnsP_4, P_network_5_3_AnsP_5, P_network_5_3_RI_0, P_network_5_3_RI_1, P_network_5_3_RI_2, P_network_5_3_RI_3, P_network_5_3_RI_4, P_network_5_3_RI_5, P_network_5_3_AI_0, P_network_5_3_AI_1, P_network_5_3_AI_2, P_network_5_3_AI_3, P_network_5_3_AI_4, P_network_5_3_AI_5, P_network_5_3_AnnP_0, P_network_5_3_AnnP_1, P_network_5_3_AnnP_2, P_network_5_3_AnnP_3, P_network_5_3_AnnP_4, P_network_5_3_AnnP_5, P_network_5_3_RP_0, P_network_5_3_RP_1, P_network_5_3_RP_2, P_network_5_3_RP_3, P_network_5_3_RP_4, P_network_5_3_RP_5, P_network_5_4_AskP_0, P_network_5_4_AskP_1, P_network_5_4_AskP_2, P_network_5_4_AskP_3, P_network_5_4_AskP_4, P_network_5_4_AskP_5, P_network_5_4_AnsP_0, P_network_5_4_AnsP_1, P_network_5_4_AnsP_2, P_network_5_4_AnsP_3, P_network_5_4_AnsP_4, P_network_5_4_AnsP_5, P_network_5_4_RI_0, P_network_5_4_RI_1, P_network_5_4_RI_2, P_network_5_4_RI_3, P_network_5_4_RI_4, P_network_5_4_RI_5, P_network_5_4_AI_0, P_network_5_4_AI_1, P_network_5_4_AI_2, P_network_5_4_AI_3, P_network_5_4_AI_4, P_network_5_4_AI_5, P_network_5_4_AnnP_0, P_network_5_4_AnnP_1, P_network_5_4_AnnP_2, P_network_5_4_AnnP_3, P_network_5_4_AnnP_4, P_network_5_4_AnnP_5, P_network_5_4_RP_0, P_network_5_4_RP_1, P_network_5_4_RP_2, P_network_5_4_RP_3, P_network_5_4_RP_4, P_network_5_4_RP_5, P_network_5_5_AskP_0, P_network_5_5_AskP_1, P_network_5_5_AskP_2, P_network_5_5_AskP_3, P_network_5_5_AskP_4, P_network_5_5_AskP_5, P_network_5_5_AnsP_0, P_network_5_5_AnsP_1, P_network_5_5_AnsP_2, P_network_5_5_AnsP_3, P_network_5_5_AnsP_4, P_network_5_5_AnsP_5, P_network_5_5_RI_0, P_network_5_5_RI_1, P_network_5_5_RI_2, P_network_5_5_RI_3, P_network_5_5_RI_4, P_network_5_5_RI_5, P_network_5_5_AI_0, P_network_5_5_AI_1, P_network_5_5_AI_2, P_network_5_5_AI_3, P_network_5_5_AI_4, P_network_5_5_AI_5, P_network_5_5_AnnP_0, P_network_5_5_AnnP_1, P_network_5_5_AnnP_2, P_network_5_5_AnnP_3, P_network_5_5_AnnP_4, P_network_5_5_AnnP_5, P_network_5_5_RP_0, P_network_5_5_RP_1, P_network_5_5_RP_2, P_network_5_5_RP_3, P_network_5_5_RP_4, P_network_5_5_RP_5, P_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, P_poll__handlingMessage_3, P_poll__handlingMessage_4, P_poll__handlingMessage_5, P_poll__networl_0_0_AskP_0, P_poll__networl_0_0_AskP_1, P_poll__networl_0_0_AskP_2, P_poll__networl_0_0_AskP_3, P_poll__networl_0_0_AskP_4, P_poll__networl_0_0_AskP_5, P_poll__networl_0_0_AnsP_0, P_poll__networl_0_0_AnsP_1, P_poll__networl_0_0_AnsP_2, P_poll__networl_0_0_AnsP_3, P_poll__networl_0_0_AnsP_4, P_poll__networl_0_0_AnsP_5, P_poll__networl_0_0_RI_0, P_poll__networl_0_0_RI_1, P_poll__networl_0_0_RI_2, P_poll__networl_0_0_RI_3, P_poll__networl_0_0_RI_4, P_poll__networl_0_0_RI_5, P_poll__networl_0_0_AI_0, P_poll__networl_0_0_AI_1, P_poll__networl_0_0_AI_2, P_poll__networl_0_0_AI_3, P_poll__networl_0_0_AI_4, P_poll__networl_0_0_AI_5, P_poll__networl_0_0_AnnP_0, P_poll__networl_0_0_AnnP_1, P_poll__networl_0_0_AnnP_2, P_poll__networl_0_0_AnnP_3, P_poll__networl_0_0_AnnP_4, P_poll__networl_0_0_AnnP_5, P_poll__networl_0_0_RP_0, P_poll__networl_0_0_RP_1, P_poll__networl_0_0_RP_2, P_poll__networl_0_0_RP_3, P_poll__networl_0_0_RP_4, P_poll__networl_0_0_RP_5, P_poll__networl_0_1_AskP_0, P_poll__networl_0_1_AskP_1, P_poll__networl_0_1_AskP_2, P_poll__networl_0_1_AskP_3, P_poll__networl_0_1_AskP_4, P_poll__networl_0_1_AskP_5, P_poll__networl_0_1_AnsP_0, P_poll__networl_0_1_AnsP_1, P_poll__networl_0_1_AnsP_2, P_poll__networl_0_1_AnsP_3, P_poll__networl_0_1_AnsP_4, P_poll__networl_0_1_AnsP_5, P_poll__networl_0_1_RI_0, P_poll__networl_0_1_RI_1, P_poll__networl_0_1_RI_2, P_poll__networl_0_1_RI_3, P_poll__networl_0_1_RI_4, P_poll__networl_0_1_RI_5, P_poll__networl_0_1_AI_0, P_poll__networl_0_1_AI_1, P_poll__networl_0_1_AI_2, P_poll__networl_0_1_AI_3, P_poll__networl_0_1_AI_4, P_poll__networl_0_1_AI_5, P_poll__networl_0_1_AnnP_0, P_poll__networl_0_1_AnnP_1, P_poll__networl_0_1_AnnP_2, P_poll__networl_0_1_AnnP_3, P_poll__networl_0_1_AnnP_4, P_poll__networl_0_1_AnnP_5, P_poll__networl_0_1_RP_0, P_poll__networl_0_1_RP_1, P_poll__networl_0_1_RP_2, P_poll__networl_0_1_RP_3, P_poll__networl_0_1_RP_4, P_poll__networl_0_1_RP_5, P_poll__networl_0_2_AskP_0, P_poll__networl_0_2_AskP_1, P_poll__networl_0_2_AskP_2, P_poll__networl_0_2_AskP_3, P_poll__networl_0_2_AskP_4, P_poll__networl_0_2_AskP_5, P_poll__networl_0_2_AnsP_0, P_poll__networl_0_2_AnsP_1, P_poll__networl_0_2_AnsP_2, P_poll__networl_0_2_AnsP_3, P_poll__networl_0_2_AnsP_4, P_poll__networl_0_2_AnsP_5, P_poll__networl_0_2_RI_0, P_poll__networl_0_2_RI_1, P_poll__networl_0_2_RI_2, P_poll__networl_0_2_RI_3, P_poll__networl_0_2_RI_4, P_poll__networl_0_2_RI_5, P_poll__networl_0_2_AI_0, P_poll__networl_0_2_AI_1, P_poll__networl_0_2_AI_2, P_poll__networl_0_2_AI_3, P_poll__networl_0_2_AI_4, P_poll__networl_0_2_AI_5, P_poll__networl_0_2_AnnP_0, P_poll__networl_0_2_AnnP_1, P_poll__networl_0_2_AnnP_2, P_poll__networl_0_2_AnnP_3, P_poll__networl_0_2_AnnP_4, P_poll__networl_0_2_AnnP_5, P_poll__networl_0_2_RP_0, P_poll__networl_0_2_RP_1, P_poll__networl_0_2_RP_2, P_poll__networl_0_2_RP_3, P_poll__networl_0_2_RP_4, P_poll__networl_0_2_RP_5, P_poll__networl_0_3_AskP_0, P_poll__networl_0_3_AskP_1, P_poll__networl_0_3_AskP_2, P_poll__networl_0_3_AskP_3, P_poll__networl_0_3_AskP_4, P_poll__networl_0_3_AskP_5, P_poll__networl_0_3_AnsP_0, P_poll__networl_0_3_AnsP_1, P_poll__networl_0_3_AnsP_2, P_poll__networl_0_3_AnsP_3, P_poll__networl_0_3_AnsP_4, P_poll__networl_0_3_AnsP_5, P_poll__networl_0_3_RI_0, P_poll__networl_0_3_RI_1, P_poll__networl_0_3_RI_2, P_poll__networl_0_3_RI_3, P_poll__networl_0_3_RI_4, P_poll__networl_0_3_RI_5, P_poll__networl_0_3_AI_0, P_poll__networl_0_3_AI_1, P_poll__networl_0_3_AI_2, P_poll__networl_0_3_AI_3, P_poll__networl_0_3_AI_4, P_poll__networl_0_3_AI_5, P_poll__networl_0_3_AnnP_0, P_poll__networl_0_3_AnnP_1, P_poll__networl_0_3_AnnP_2, P_poll__networl_0_3_AnnP_3, P_poll__networl_0_3_AnnP_4, P_poll__networl_0_3_AnnP_5, P_poll__networl_0_3_RP_0, P_poll__networl_0_3_RP_1, P_poll__networl_0_3_RP_2, P_poll__networl_0_3_RP_3, P_poll__networl_0_3_RP_4, P_poll__networl_0_3_RP_5, P_poll__networl_0_4_AskP_0, P_poll__networl_0_4_AskP_1, P_poll__networl_0_4_AskP_2, P_poll__networl_0_4_AskP_3, P_poll__networl_0_4_AskP_4, P_poll__networl_0_4_AskP_5, P_poll__networl_0_4_AnsP_0, P_poll__networl_0_4_AnsP_1, P_poll__networl_0_4_AnsP_2, P_poll__networl_0_4_AnsP_3, P_poll__networl_0_4_AnsP_4, P_poll__networl_0_4_AnsP_5, P_poll__networl_0_4_RI_0, P_poll__networl_0_4_RI_1, P_poll__networl_0_4_RI_2, P_poll__networl_0_4_RI_3, P_poll__networl_0_4_RI_4, P_poll__networl_0_4_RI_5, P_poll__networl_0_4_AI_0, P_poll__networl_0_4_AI_1, P_poll__networl_0_4_AI_2, P_poll__networl_0_4_AI_3, P_poll__networl_0_4_AI_4, P_poll__networl_0_4_AI_5, P_poll__networl_0_4_AnnP_0, P_poll__networl_0_4_AnnP_1, P_poll__networl_0_4_AnnP_2, P_poll__networl_0_4_AnnP_3, P_poll__networl_0_4_AnnP_4, P_poll__networl_0_4_AnnP_5, P_poll__networl_0_4_RP_0, P_poll__networl_0_4_RP_1, P_poll__networl_0_4_RP_2, P_poll__networl_0_4_RP_3, P_poll__networl_0_4_RP_4, P_poll__networl_0_4_RP_5, P_poll__networl_0_5_AskP_0, P_poll__networl_0_5_AskP_1, P_poll__networl_0_5_AskP_2, P_poll__networl_0_5_AskP_3, P_poll__networl_0_5_AskP_4, P_poll__networl_0_5_AskP_5, P_poll__networl_0_5_AnsP_0, P_poll__networl_0_5_AnsP_1, P_poll__networl_0_5_AnsP_2, P_poll__networl_0_5_AnsP_3, P_poll__networl_0_5_AnsP_4, P_poll__networl_0_5_AnsP_5, P_poll__networl_0_5_RI_0, P_poll__networl_0_5_RI_1, P_poll__networl_0_5_RI_2, P_poll__networl_0_5_RI_3, P_poll__networl_0_5_RI_4, P_poll__networl_0_5_RI_5, P_poll__networl_0_5_AI_0, P_poll__networl_0_5_AI_1, P_poll__networl_0_5_AI_2, P_poll__networl_0_5_AI_3, P_poll__networl_0_5_AI_4, P_poll__networl_0_5_AI_5, P_poll__networl_0_5_AnnP_0, P_poll__networl_0_5_AnnP_1, P_poll__networl_0_5_AnnP_2, P_poll__networl_0_5_AnnP_3, P_poll__networl_0_5_AnnP_4, P_poll__networl_0_5_AnnP_5, P_poll__networl_0_5_RP_0, P_poll__networl_0_5_RP_1, P_poll__networl_0_5_RP_2, P_poll__networl_0_5_RP_3, P_poll__networl_0_5_RP_4, P_poll__networl_0_5_RP_5, P_poll__networl_1_0_AskP_0, P_poll__networl_1_0_AskP_1, P_poll__networl_1_0_AskP_2, P_poll__networl_1_0_AskP_3, P_poll__networl_1_0_AskP_4, P_poll__networl_1_0_AskP_5, P_poll__networl_1_0_AnsP_0, P_poll__networl_1_0_AnsP_1, P_poll__networl_1_0_AnsP_2, P_poll__networl_1_0_AnsP_3, P_poll__networl_1_0_AnsP_4, P_poll__networl_1_0_AnsP_5, P_poll__networl_1_0_RI_0, P_poll__networl_1_0_RI_1, P_poll__networl_1_0_RI_2, P_poll__networl_1_0_RI_3, P_poll__networl_1_0_RI_4, P_poll__networl_1_0_RI_5, P_poll__networl_1_0_AI_0, P_poll__networl_1_0_AI_1, P_poll__networl_1_0_AI_2, P_poll__networl_1_0_AI_3, P_poll__networl_1_0_AI_4, P_poll__networl_1_0_AI_5, P_poll__networl_1_0_AnnP_0, P_poll__networl_1_0_AnnP_1, P_poll__networl_1_0_AnnP_2, P_poll__networl_1_0_AnnP_3, P_poll__networl_1_0_AnnP_4, P_poll__networl_1_0_AnnP_5, P_poll__networl_1_0_RP_0, P_poll__networl_1_0_RP_1, P_poll__networl_1_0_RP_2, P_poll__networl_1_0_RP_3, P_poll__networl_1_0_RP_4, P_poll__networl_1_0_RP_5, P_poll__networl_1_1_AskP_0, P_poll__networl_1_1_AskP_1, P_poll__networl_1_1_AskP_2, P_poll__networl_1_1_AskP_3, P_poll__networl_1_1_AskP_4, P_poll__networl_1_1_AskP_5, P_poll__networl_1_1_AnsP_0, P_poll__networl_1_1_AnsP_1, P_poll__networl_1_1_AnsP_2, P_poll__networl_1_1_AnsP_3, P_poll__networl_1_1_AnsP_4, P_poll__networl_1_1_AnsP_5, P_poll__networl_1_1_RI_0, P_poll__networl_1_1_RI_1, P_poll__networl_1_1_RI_2, P_poll__networl_1_1_RI_3, P_poll__networl_1_1_RI_4, P_poll__networl_1_1_RI_5, P_poll__networl_1_1_AI_0, P_poll__networl_1_1_AI_1, P_poll__networl_1_1_AI_2, P_poll__networl_1_1_AI_3, P_poll__networl_1_1_AI_4, P_poll__networl_1_1_AI_5, P_poll__networl_1_1_AnnP_0, P_poll__networl_1_1_AnnP_1, P_poll__networl_1_1_AnnP_2, P_poll__networl_1_1_AnnP_3, P_poll__networl_1_1_AnnP_4, P_poll__networl_1_1_AnnP_5, P_poll__networl_1_1_RP_0, P_poll__networl_1_1_RP_1, P_poll__networl_1_1_RP_2, P_poll__networl_1_1_RP_3, P_poll__networl_1_1_RP_4, P_poll__networl_1_1_RP_5, P_poll__networl_1_2_AskP_0, P_poll__networl_1_2_AskP_1, P_poll__networl_1_2_AskP_2, P_poll__networl_1_2_AskP_3, P_poll__networl_1_2_AskP_4, P_poll__networl_1_2_AskP_5, P_poll__networl_1_2_AnsP_0, P_poll__networl_1_2_AnsP_1, P_poll__networl_1_2_AnsP_2, P_poll__networl_1_2_AnsP_3, P_poll__networl_1_2_AnsP_4, P_poll__networl_1_2_AnsP_5, P_poll__networl_1_2_RI_0, P_poll__networl_1_2_RI_1, P_poll__networl_1_2_RI_2, P_poll__networl_1_2_RI_3, P_poll__networl_1_2_RI_4, P_poll__networl_1_2_RI_5, P_poll__networl_1_2_AI_0, P_poll__networl_1_2_AI_1, P_poll__networl_1_2_AI_2, P_poll__networl_1_2_AI_3, P_poll__networl_1_2_AI_4, P_poll__networl_1_2_AI_5, P_poll__networl_1_2_AnnP_0, P_poll__networl_1_2_AnnP_1, P_poll__networl_1_2_AnnP_2, P_poll__networl_1_2_AnnP_3, P_poll__networl_1_2_AnnP_4, P_poll__networl_1_2_AnnP_5, P_poll__networl_1_2_RP_0, P_poll__networl_1_2_RP_1, P_poll__networl_1_2_RP_2, P_poll__networl_1_2_RP_3, P_poll__networl_1_2_RP_4, P_poll__networl_1_2_RP_5, P_poll__networl_1_3_AskP_0, P_poll__networl_1_3_AskP_1, P_poll__networl_1_3_AskP_2, P_poll__networl_1_3_AskP_3, P_poll__networl_1_3_AskP_4, P_poll__networl_1_3_AskP_5, P_poll__networl_1_3_AnsP_0, P_poll__networl_1_3_AnsP_1, P_poll__networl_1_3_AnsP_2, P_poll__networl_1_3_AnsP_3, P_poll__networl_1_3_AnsP_4, P_poll__networl_1_3_AnsP_5, P_poll__networl_1_3_RI_0, P_poll__networl_1_3_RI_1, P_poll__networl_1_3_RI_2, P_poll__networl_1_3_RI_3, P_poll__networl_1_3_RI_4, P_poll__networl_1_3_RI_5, P_poll__networl_1_3_AI_0, P_poll__networl_1_3_AI_1, P_poll__networl_1_3_AI_2, P_poll__networl_1_3_AI_3, P_poll__networl_1_3_AI_4, P_poll__networl_1_3_AI_5, P_poll__networl_1_3_AnnP_0, P_poll__networl_1_3_AnnP_1, P_poll__networl_1_3_AnnP_2, P_poll__networl_1_3_AnnP_3, P_poll__networl_1_3_AnnP_4, P_poll__networl_1_3_AnnP_5, P_poll__networl_1_3_RP_0, P_poll__networl_1_3_RP_1, P_poll__networl_1_3_RP_2, P_poll__networl_1_3_RP_3, P_poll__networl_1_3_RP_4, P_poll__networl_1_3_RP_5, P_poll__networl_1_4_AskP_0, P_poll__networl_1_4_AskP_1, P_poll__networl_1_4_AskP_2, P_poll__networl_1_4_AskP_3, P_poll__networl_1_4_AskP_4, P_poll__networl_1_4_AskP_5, P_poll__networl_1_4_AnsP_0, P_poll__networl_1_4_AnsP_1, P_poll__networl_1_4_AnsP_2, P_poll__networl_1_4_AnsP_3, P_poll__networl_1_4_AnsP_4, P_poll__networl_1_4_AnsP_5, P_poll__networl_1_4_RI_0, P_poll__networl_1_4_RI_1, P_poll__networl_1_4_RI_2, P_poll__networl_1_4_RI_3, P_poll__networl_1_4_RI_4, P_poll__networl_1_4_RI_5, P_poll__networl_1_4_AI_0, P_poll__networl_1_4_AI_1, P_poll__networl_1_4_AI_2, P_poll__networl_1_4_AI_3, P_poll__networl_1_4_AI_4, P_poll__networl_1_4_AI_5, P_poll__networl_1_4_AnnP_0, P_poll__networl_1_4_AnnP_1, P_poll__networl_1_4_AnnP_2, P_poll__networl_1_4_AnnP_3, P_poll__networl_1_4_AnnP_4, P_poll__networl_1_4_AnnP_5, P_poll__networl_1_4_RP_0, P_poll__networl_1_4_RP_1, P_poll__networl_1_4_RP_2, P_poll__networl_1_4_RP_3, P_poll__networl_1_4_RP_4, P_poll__networl_1_4_RP_5, P_poll__networl_1_5_AskP_0, P_poll__networl_1_5_AskP_1, P_poll__networl_1_5_AskP_2, P_poll__networl_1_5_AskP_3, P_poll__networl_1_5_AskP_4, P_poll__networl_1_5_AskP_5, P_poll__networl_1_5_AnsP_0, P_poll__networl_1_5_AnsP_1, P_poll__networl_1_5_AnsP_2, P_poll__networl_1_5_AnsP_3, P_poll__networl_1_5_AnsP_4, P_poll__networl_1_5_AnsP_5, P_poll__networl_1_5_RI_0, P_poll__networl_1_5_RI_1, P_poll__networl_1_5_RI_2, P_poll__networl_1_5_RI_3, P_poll__networl_1_5_RI_4, P_poll__networl_1_5_RI_5, P_poll__networl_1_5_AI_0, P_poll__networl_1_5_AI_1, P_poll__networl_1_5_AI_2, P_poll__networl_1_5_AI_3, P_poll__networl_1_5_AI_4, P_poll__networl_1_5_AI_5, P_poll__networl_1_5_AnnP_0, P_poll__networl_1_5_AnnP_1, P_poll__networl_1_5_AnnP_2, P_poll__networl_1_5_AnnP_3, P_poll__networl_1_5_AnnP_4, P_poll__networl_1_5_AnnP_5, P_poll__networl_1_5_RP_0, P_poll__networl_1_5_RP_1, P_poll__networl_1_5_RP_2, P_poll__networl_1_5_RP_3, P_poll__networl_1_5_RP_4, P_poll__networl_1_5_RP_5, P_poll__networl_2_0_AskP_0, P_poll__networl_2_0_AskP_1, P_poll__networl_2_0_AskP_2, P_poll__networl_2_0_AskP_3, P_poll__networl_2_0_AskP_4, P_poll__networl_2_0_AskP_5, P_poll__networl_2_0_AnsP_0, P_poll__networl_2_0_AnsP_1, P_poll__networl_2_0_AnsP_2, P_poll__networl_2_0_AnsP_3, P_poll__networl_2_0_AnsP_4, P_poll__networl_2_0_AnsP_5, P_poll__networl_2_0_RI_0, P_poll__networl_2_0_RI_1, P_poll__networl_2_0_RI_2, P_poll__networl_2_0_RI_3, P_poll__networl_2_0_RI_4, P_poll__networl_2_0_RI_5, P_poll__networl_2_0_AI_0, P_poll__networl_2_0_AI_1, P_poll__networl_2_0_AI_2, P_poll__networl_2_0_AI_3, P_poll__networl_2_0_AI_4, P_poll__networl_2_0_AI_5, P_poll__networl_2_0_AnnP_0, P_poll__networl_2_0_AnnP_1, P_poll__networl_2_0_AnnP_2, P_poll__networl_2_0_AnnP_3, P_poll__networl_2_0_AnnP_4, P_poll__networl_2_0_AnnP_5, P_poll__networl_2_0_RP_0, P_poll__networl_2_0_RP_1, P_poll__networl_2_0_RP_2, P_poll__networl_2_0_RP_3, P_poll__networl_2_0_RP_4, P_poll__networl_2_0_RP_5, P_poll__networl_2_1_AskP_0, P_poll__networl_2_1_AskP_1, P_poll__networl_2_1_AskP_2, P_poll__networl_2_1_AskP_3, P_poll__networl_2_1_AskP_4, P_poll__networl_2_1_AskP_5, P_poll__networl_2_1_AnsP_0, P_poll__networl_2_1_AnsP_1, P_poll__networl_2_1_AnsP_2, P_poll__networl_2_1_AnsP_3, P_poll__networl_2_1_AnsP_4, P_poll__networl_2_1_AnsP_5, P_poll__networl_2_1_RI_0, P_poll__networl_2_1_RI_1, P_poll__networl_2_1_RI_2, P_poll__networl_2_1_RI_3, P_poll__networl_2_1_RI_4, P_poll__networl_2_1_RI_5, P_poll__networl_2_1_AI_0, P_poll__networl_2_1_AI_1, P_poll__networl_2_1_AI_2, P_poll__networl_2_1_AI_3, P_poll__networl_2_1_AI_4, P_poll__networl_2_1_AI_5, P_poll__networl_2_1_AnnP_0, P_poll__networl_2_1_AnnP_1, P_poll__networl_2_1_AnnP_2, P_poll__networl_2_1_AnnP_3, P_poll__networl_2_1_AnnP_4, P_poll__networl_2_1_AnnP_5, P_poll__networl_2_1_RP_0, P_poll__networl_2_1_RP_1, P_poll__networl_2_1_RP_2, P_poll__networl_2_1_RP_3, P_poll__networl_2_1_RP_4, P_poll__networl_2_1_RP_5, P_poll__networl_2_2_AskP_0, P_poll__networl_2_2_AskP_1, P_poll__networl_2_2_AskP_2, P_poll__networl_2_2_AskP_3, P_poll__networl_2_2_AskP_4, P_poll__networl_2_2_AskP_5, P_poll__networl_2_2_AnsP_0, P_poll__networl_2_2_AnsP_1, P_poll__networl_2_2_AnsP_2, P_poll__networl_2_2_AnsP_3, P_poll__networl_2_2_AnsP_4, P_poll__networl_2_2_AnsP_5, P_poll__networl_2_2_RI_0, P_poll__networl_2_2_RI_1, P_poll__networl_2_2_RI_2, P_poll__networl_2_2_RI_3, P_poll__networl_2_2_RI_4, P_poll__networl_2_2_RI_5, P_poll__networl_2_2_AI_0, P_poll__networl_2_2_AI_1, P_poll__networl_2_2_AI_2, P_poll__networl_2_2_AI_3, P_poll__networl_2_2_AI_4, P_poll__networl_2_2_AI_5, P_poll__networl_2_2_AnnP_0, P_poll__networl_2_2_AnnP_1, P_poll__networl_2_2_AnnP_2, P_poll__networl_2_2_AnnP_3, P_poll__networl_2_2_AnnP_4, P_poll__networl_2_2_AnnP_5, P_poll__networl_2_2_RP_0, P_poll__networl_2_2_RP_1, P_poll__networl_2_2_RP_2, P_poll__networl_2_2_RP_3, P_poll__networl_2_2_RP_4, P_poll__networl_2_2_RP_5, P_poll__networl_2_3_AskP_0, P_poll__networl_2_3_AskP_1, P_poll__networl_2_3_AskP_2, P_poll__networl_2_3_AskP_3, P_poll__networl_2_3_AskP_4, P_poll__networl_2_3_AskP_5, P_poll__networl_2_3_AnsP_0, P_poll__networl_2_3_AnsP_1, P_poll__networl_2_3_AnsP_2, P_poll__networl_2_3_AnsP_3, P_poll__networl_2_3_AnsP_4, P_poll__networl_2_3_AnsP_5, P_poll__networl_2_3_RI_0, P_poll__networl_2_3_RI_1, P_poll__networl_2_3_RI_2, P_poll__networl_2_3_RI_3, P_poll__networl_2_3_RI_4, P_poll__networl_2_3_RI_5, P_poll__networl_2_3_AI_0, P_poll__networl_2_3_AI_1, P_poll__networl_2_3_AI_2, P_poll__networl_2_3_AI_3, P_poll__networl_2_3_AI_4, P_poll__networl_2_3_AI_5, P_poll__networl_2_3_AnnP_0, P_poll__networl_2_3_AnnP_1, P_poll__networl_2_3_AnnP_2, P_poll__networl_2_3_AnnP_3, P_poll__networl_2_3_AnnP_4, P_poll__networl_2_3_AnnP_5, P_poll__networl_2_3_RP_0, P_poll__networl_2_3_RP_1, P_poll__networl_2_3_RP_2, P_poll__networl_2_3_RP_3, P_poll__networl_2_3_RP_4, P_poll__networl_2_3_RP_5, P_poll__networl_2_4_AskP_0, P_poll__networl_2_4_AskP_1, P_poll__networl_2_4_AskP_2, P_poll__networl_2_4_AskP_3, P_poll__networl_2_4_AskP_4, P_poll__networl_2_4_AskP_5, P_poll__networl_2_4_AnsP_0, P_poll__networl_2_4_AnsP_1, P_poll__networl_2_4_AnsP_2, P_poll__networl_2_4_AnsP_3, P_poll__networl_2_4_AnsP_4, P_poll__networl_2_4_AnsP_5, P_poll__networl_2_4_RI_0, P_poll__networl_2_4_RI_1, P_poll__networl_2_4_RI_2, P_poll__networl_2_4_RI_3, P_poll__networl_2_4_RI_4, P_poll__networl_2_4_RI_5, P_poll__networl_2_4_AI_0, P_poll__networl_2_4_AI_1, P_poll__networl_2_4_AI_2, P_poll__networl_2_4_AI_3, P_poll__networl_2_4_AI_4, P_poll__networl_2_4_AI_5, P_poll__networl_2_4_AnnP_0, P_poll__networl_2_4_AnnP_1, P_poll__networl_2_4_AnnP_2, P_poll__networl_2_4_AnnP_3, P_poll__networl_2_4_AnnP_4, P_poll__networl_2_4_AnnP_5, P_poll__networl_2_4_RP_0, P_poll__networl_2_4_RP_1, P_poll__networl_2_4_RP_2, P_poll__networl_2_4_RP_3, P_poll__networl_2_4_RP_4, P_poll__networl_2_4_RP_5, P_poll__networl_2_5_AskP_0, P_poll__networl_2_5_AskP_1, P_poll__networl_2_5_AskP_2, P_poll__networl_2_5_AskP_3, P_poll__networl_2_5_AskP_4, P_poll__networl_2_5_AskP_5, P_poll__networl_2_5_AnsP_0, P_poll__networl_2_5_AnsP_1, P_poll__networl_2_5_AnsP_2, P_poll__networl_2_5_AnsP_3, P_poll__networl_2_5_AnsP_4, P_poll__networl_2_5_AnsP_5, P_poll__networl_2_5_RI_0, P_poll__networl_2_5_RI_1, P_poll__networl_2_5_RI_2, P_poll__networl_2_5_RI_3, P_poll__networl_2_5_RI_4, P_poll__networl_2_5_RI_5, P_poll__networl_2_5_AI_0, P_poll__networl_2_5_AI_1, P_poll__networl_2_5_AI_2, P_poll__networl_2_5_AI_3, P_poll__networl_2_5_AI_4, P_poll__networl_2_5_AI_5, P_poll__networl_2_5_AnnP_0, P_poll__networl_2_5_AnnP_1, P_poll__networl_2_5_AnnP_2, P_poll__networl_2_5_AnnP_3, P_poll__networl_2_5_AnnP_4, P_poll__networl_2_5_AnnP_5, P_poll__networl_2_5_RP_0, P_poll__networl_2_5_RP_1, P_poll__networl_2_5_RP_2, P_poll__networl_2_5_RP_3, P_poll__networl_2_5_RP_4, P_poll__networl_2_5_RP_5, P_poll__networl_3_0_AskP_0, P_poll__networl_3_0_AskP_1, P_poll__networl_3_0_AskP_2, P_poll__networl_3_0_AskP_3, P_poll__networl_3_0_AskP_4, P_poll__networl_3_0_AskP_5, P_poll__networl_3_0_AnsP_0, P_poll__networl_3_0_AnsP_1, P_poll__networl_3_0_AnsP_2, P_poll__networl_3_0_AnsP_3, P_poll__networl_3_0_AnsP_4, P_poll__networl_3_0_AnsP_5, P_poll__networl_3_0_RI_0, P_poll__networl_3_0_RI_1, P_poll__networl_3_0_RI_2, P_poll__networl_3_0_RI_3, P_poll__networl_3_0_RI_4, P_poll__networl_3_0_RI_5, P_poll__networl_3_0_AI_0, P_poll__networl_3_0_AI_1, P_poll__networl_3_0_AI_2, P_poll__networl_3_0_AI_3, P_poll__networl_3_0_AI_4, P_poll__networl_3_0_AI_5, P_poll__networl_3_0_AnnP_0, P_poll__networl_3_0_AnnP_1, P_poll__networl_3_0_AnnP_2, P_poll__networl_3_0_AnnP_3, P_poll__networl_3_0_AnnP_4, P_poll__networl_3_0_AnnP_5, P_poll__networl_3_0_RP_0, P_poll__networl_3_0_RP_1, P_poll__networl_3_0_RP_2, P_poll__networl_3_0_RP_3, P_poll__networl_3_0_RP_4, P_poll__networl_3_0_RP_5, P_poll__networl_3_1_AskP_0, P_poll__networl_3_1_AskP_1, P_poll__networl_3_1_AskP_2, P_poll__networl_3_1_AskP_3, P_poll__networl_3_1_AskP_4, P_poll__networl_3_1_AskP_5, P_poll__networl_3_1_AnsP_0, P_poll__networl_3_1_AnsP_1, P_poll__networl_3_1_AnsP_2, P_poll__networl_3_1_AnsP_3, P_poll__networl_3_1_AnsP_4, P_poll__networl_3_1_AnsP_5, P_poll__networl_3_1_RI_0, P_poll__networl_3_1_RI_1, P_poll__networl_3_1_RI_2, P_poll__networl_3_1_RI_3, P_poll__networl_3_1_RI_4, P_poll__networl_3_1_RI_5, P_poll__networl_3_1_AI_0, P_poll__networl_3_1_AI_1, P_poll__networl_3_1_AI_2, P_poll__networl_3_1_AI_3, P_poll__networl_3_1_AI_4, P_poll__networl_3_1_AI_5, P_poll__networl_3_1_AnnP_0, P_poll__networl_3_1_AnnP_1, P_poll__networl_3_1_AnnP_2, P_poll__networl_3_1_AnnP_3, P_poll__networl_3_1_AnnP_4, P_poll__networl_3_1_AnnP_5, P_poll__networl_3_1_RP_0, P_poll__networl_3_1_RP_1, P_poll__networl_3_1_RP_2, P_poll__networl_3_1_RP_3, P_poll__networl_3_1_RP_4, P_poll__networl_3_1_RP_5, P_poll__networl_3_2_AskP_0, P_poll__networl_3_2_AskP_1, P_poll__networl_3_2_AskP_2, P_poll__networl_3_2_AskP_3, P_poll__networl_3_2_AskP_4, P_poll__networl_3_2_AskP_5, P_poll__networl_3_2_AnsP_0, P_poll__networl_3_2_AnsP_1, P_poll__networl_3_2_AnsP_2, P_poll__networl_3_2_AnsP_3, P_poll__networl_3_2_AnsP_4, P_poll__networl_3_2_AnsP_5, P_poll__networl_3_2_RI_0, P_poll__networl_3_2_RI_1, P_poll__networl_3_2_RI_2, P_poll__networl_3_2_RI_3, P_poll__networl_3_2_RI_4, P_poll__networl_3_2_RI_5, P_poll__networl_3_2_AI_0, P_poll__networl_3_2_AI_1, P_poll__networl_3_2_AI_2, P_poll__networl_3_2_AI_3, P_poll__networl_3_2_AI_4, P_poll__networl_3_2_AI_5, P_poll__networl_3_2_AnnP_0, P_poll__networl_3_2_AnnP_1, P_poll__networl_3_2_AnnP_2, P_poll__networl_3_2_AnnP_3, P_poll__networl_3_2_AnnP_4, P_poll__networl_3_2_AnnP_5, P_poll__networl_3_2_RP_0, P_poll__networl_3_2_RP_1, P_poll__networl_3_2_RP_2, P_poll__networl_3_2_RP_3, P_poll__networl_3_2_RP_4, P_poll__networl_3_2_RP_5, P_poll__networl_3_3_AskP_0, P_poll__networl_3_3_AskP_1, P_poll__networl_3_3_AskP_2, P_poll__networl_3_3_AskP_3, P_poll__networl_3_3_AskP_4, P_poll__networl_3_3_AskP_5, P_poll__networl_3_3_AnsP_0, P_poll__networl_3_3_AnsP_1, P_poll__networl_3_3_AnsP_2, P_poll__networl_3_3_AnsP_3, P_poll__networl_3_3_AnsP_4, P_poll__networl_3_3_AnsP_5, P_poll__networl_3_3_RI_0, P_poll__networl_3_3_RI_1, P_poll__networl_3_3_RI_2, P_poll__networl_3_3_RI_3, P_poll__networl_3_3_RI_4, P_poll__networl_3_3_RI_5, P_poll__networl_3_3_AI_0, P_poll__networl_3_3_AI_1, P_poll__networl_3_3_AI_2, P_poll__networl_3_3_AI_3, P_poll__networl_3_3_AI_4, P_poll__networl_3_3_AI_5, P_poll__networl_3_3_AnnP_0, P_poll__networl_3_3_AnnP_1, P_poll__networl_3_3_AnnP_2, P_poll__networl_3_3_AnnP_3, P_poll__networl_3_3_AnnP_4, P_poll__networl_3_3_AnnP_5, P_poll__networl_3_3_RP_0, P_poll__networl_3_3_RP_1, P_poll__networl_3_3_RP_2, P_poll__networl_3_3_RP_3, P_poll__networl_3_3_RP_4, P_poll__networl_3_3_RP_5, P_poll__networl_3_4_AskP_0, P_poll__networl_3_4_AskP_1, P_poll__networl_3_4_AskP_2, P_poll__networl_3_4_AskP_3, P_poll__networl_3_4_AskP_4, P_poll__networl_3_4_AskP_5, P_poll__networl_3_4_AnsP_0, P_poll__networl_3_4_AnsP_1, P_poll__networl_3_4_AnsP_2, P_poll__networl_3_4_AnsP_3, P_poll__networl_3_4_AnsP_4, P_poll__networl_3_4_AnsP_5, P_poll__networl_3_4_RI_0, P_poll__networl_3_4_RI_1, P_poll__networl_3_4_RI_2, P_poll__networl_3_4_RI_3, P_poll__networl_3_4_RI_4, P_poll__networl_3_4_RI_5, P_poll__networl_3_4_AI_0, P_poll__networl_3_4_AI_1, P_poll__networl_3_4_AI_2, P_poll__networl_3_4_AI_3, P_poll__networl_3_4_AI_4, P_poll__networl_3_4_AI_5, P_poll__networl_3_4_AnnP_0, P_poll__networl_3_4_AnnP_1, P_poll__networl_3_4_AnnP_2, P_poll__networl_3_4_AnnP_3, P_poll__networl_3_4_AnnP_4, P_poll__networl_3_4_AnnP_5, P_poll__networl_3_4_RP_0, P_poll__networl_3_4_RP_1, P_poll__networl_3_4_RP_2, P_poll__networl_3_4_RP_3, P_poll__networl_3_4_RP_4, P_poll__networl_3_4_RP_5, P_poll__networl_3_5_AskP_0, P_poll__networl_3_5_AskP_1, P_poll__networl_3_5_AskP_2, P_poll__networl_3_5_AskP_3, P_poll__networl_3_5_AskP_4, P_poll__networl_3_5_AskP_5, P_poll__networl_3_5_AnsP_0, P_poll__networl_3_5_AnsP_1, P_poll__networl_3_5_AnsP_2, P_poll__networl_3_5_AnsP_3, P_poll__networl_3_5_AnsP_4, P_poll__networl_3_5_AnsP_5, P_poll__networl_3_5_RI_0, P_poll__networl_3_5_RI_1, P_poll__networl_3_5_RI_2, P_poll__networl_3_5_RI_3, P_poll__networl_3_5_RI_4, P_poll__networl_3_5_RI_5, P_poll__networl_3_5_AI_0, P_poll__networl_3_5_AI_1, P_poll__networl_3_5_AI_2, P_poll__networl_3_5_AI_3, P_poll__networl_3_5_AI_4, P_poll__networl_3_5_AI_5, P_poll__networl_3_5_AnnP_0, P_poll__networl_3_5_AnnP_1, P_poll__networl_3_5_AnnP_2, P_poll__networl_3_5_AnnP_3, P_poll__networl_3_5_AnnP_4, P_poll__networl_3_5_AnnP_5, P_poll__networl_3_5_RP_0, P_poll__networl_3_5_RP_1, P_poll__networl_3_5_RP_2, P_poll__networl_3_5_RP_3, P_poll__networl_3_5_RP_4, P_poll__networl_3_5_RP_5, P_poll__networl_4_0_AskP_0, P_poll__networl_4_0_AskP_1, P_poll__networl_4_0_AskP_2, P_poll__networl_4_0_AskP_3, P_poll__networl_4_0_AskP_4, P_poll__networl_4_0_AskP_5, P_poll__networl_4_0_AnsP_0, P_poll__networl_4_0_AnsP_1, P_poll__networl_4_0_AnsP_2, P_poll__networl_4_0_AnsP_3, P_poll__networl_4_0_AnsP_4, P_poll__networl_4_0_AnsP_5, P_poll__networl_4_0_RI_0, P_poll__networl_4_0_RI_1, P_poll__networl_4_0_RI_2, P_poll__networl_4_0_RI_3, P_poll__networl_4_0_RI_4, P_poll__networl_4_0_RI_5, P_poll__networl_4_0_AI_0, P_poll__networl_4_0_AI_1, P_poll__networl_4_0_AI_2, P_poll__networl_4_0_AI_3, P_poll__networl_4_0_AI_4, P_poll__networl_4_0_AI_5, P_poll__networl_4_0_AnnP_0, P_poll__networl_4_0_AnnP_1, P_poll__networl_4_0_AnnP_2, P_poll__networl_4_0_AnnP_3, P_poll__networl_4_0_AnnP_4, P_poll__networl_4_0_AnnP_5, P_poll__networl_4_0_RP_0, P_poll__networl_4_0_RP_1, P_poll__networl_4_0_RP_2, P_poll__networl_4_0_RP_3, P_poll__networl_4_0_RP_4, P_poll__networl_4_0_RP_5, P_poll__networl_4_1_AskP_0, P_poll__networl_4_1_AskP_1, P_poll__networl_4_1_AskP_2, P_poll__networl_4_1_AskP_3, P_poll__networl_4_1_AskP_4, P_poll__networl_4_1_AskP_5, P_poll__networl_4_1_AnsP_0, P_poll__networl_4_1_AnsP_1, P_poll__networl_4_1_AnsP_2, P_poll__networl_4_1_AnsP_3, P_poll__networl_4_1_AnsP_4, P_poll__networl_4_1_AnsP_5, P_poll__networl_4_1_RI_0, P_poll__networl_4_1_RI_1, P_poll__networl_4_1_RI_2, P_poll__networl_4_1_RI_3, P_poll__networl_4_1_RI_4, P_poll__networl_4_1_RI_5, P_poll__networl_4_1_AI_0, P_poll__networl_4_1_AI_1, P_poll__networl_4_1_AI_2, P_poll__networl_4_1_AI_3, P_poll__networl_4_1_AI_4, P_poll__networl_4_1_AI_5, P_poll__networl_4_1_AnnP_0, P_poll__networl_4_1_AnnP_1, P_poll__networl_4_1_AnnP_2, P_poll__networl_4_1_AnnP_3, P_poll__networl_4_1_AnnP_4, P_poll__networl_4_1_AnnP_5, P_poll__networl_4_1_RP_0, P_poll__networl_4_1_RP_1, P_poll__networl_4_1_RP_2, P_poll__networl_4_1_RP_3, P_poll__networl_4_1_RP_4, P_poll__networl_4_1_RP_5, P_poll__networl_4_2_AskP_0, P_poll__networl_4_2_AskP_1, P_poll__networl_4_2_AskP_2, P_poll__networl_4_2_AskP_3, P_poll__networl_4_2_AskP_4, P_poll__networl_4_2_AskP_5, P_poll__networl_4_2_AnsP_0, P_poll__networl_4_2_AnsP_1, P_poll__networl_4_2_AnsP_2, P_poll__networl_4_2_AnsP_3, P_poll__networl_4_2_AnsP_4, P_poll__networl_4_2_AnsP_5, P_poll__networl_4_2_RI_0, P_poll__networl_4_2_RI_1, P_poll__networl_4_2_RI_2, P_poll__networl_4_2_RI_3, P_poll__networl_4_2_RI_4, P_poll__networl_4_2_RI_5, P_poll__networl_4_2_AI_0, P_poll__networl_4_2_AI_1, P_poll__networl_4_2_AI_2, P_poll__networl_4_2_AI_3, P_poll__networl_4_2_AI_4, P_poll__networl_4_2_AI_5, P_poll__networl_4_2_AnnP_0, P_poll__networl_4_2_AnnP_1, P_poll__networl_4_2_AnnP_2, P_poll__networl_4_2_AnnP_3, P_poll__networl_4_2_AnnP_4, P_poll__networl_4_2_AnnP_5, P_poll__networl_4_2_RP_0, P_poll__networl_4_2_RP_1, P_poll__networl_4_2_RP_2, P_poll__networl_4_2_RP_3, P_poll__networl_4_2_RP_4, P_poll__networl_4_2_RP_5, P_poll__networl_4_3_AskP_0, P_poll__networl_4_3_AskP_1, P_poll__networl_4_3_AskP_2, P_poll__networl_4_3_AskP_3, P_poll__networl_4_3_AskP_4, P_poll__networl_4_3_AskP_5, P_poll__networl_4_3_AnsP_0, P_poll__networl_4_3_AnsP_1, P_poll__networl_4_3_AnsP_2, P_poll__networl_4_3_AnsP_3, P_poll__networl_4_3_AnsP_4, P_poll__networl_4_3_AnsP_5, P_poll__networl_4_3_RI_0, P_poll__networl_4_3_RI_1, P_poll__networl_4_3_RI_2, P_poll__networl_4_3_RI_3, P_poll__networl_4_3_RI_4, P_poll__networl_4_3_RI_5, P_poll__networl_4_3_AI_0, P_poll__networl_4_3_AI_1, P_poll__networl_4_3_AI_2, P_poll__networl_4_3_AI_3, P_poll__networl_4_3_AI_4, P_poll__networl_4_3_AI_5, P_poll__networl_4_3_AnnP_0, P_poll__networl_4_3_AnnP_1, P_poll__networl_4_3_AnnP_2, P_poll__networl_4_3_AnnP_3, P_poll__networl_4_3_AnnP_4, P_poll__networl_4_3_AnnP_5, P_poll__networl_4_3_RP_0, P_poll__networl_4_3_RP_1, P_poll__networl_4_3_RP_2, P_poll__networl_4_3_RP_3, P_poll__networl_4_3_RP_4, P_poll__networl_4_3_RP_5, P_poll__networl_4_4_AskP_0, P_poll__networl_4_4_AskP_1, P_poll__networl_4_4_AskP_2, P_poll__networl_4_4_AskP_3, P_poll__networl_4_4_AskP_4, P_poll__networl_4_4_AskP_5, P_poll__networl_4_4_AnsP_0, P_poll__networl_4_4_AnsP_1, P_poll__networl_4_4_AnsP_2, P_poll__networl_4_4_AnsP_3, P_poll__networl_4_4_AnsP_4, P_poll__networl_4_4_AnsP_5, P_poll__networl_4_4_RI_0, P_poll__networl_4_4_RI_1, P_poll__networl_4_4_RI_2, P_poll__networl_4_4_RI_3, P_poll__networl_4_4_RI_4, P_poll__networl_4_4_RI_5, P_poll__networl_4_4_AI_0, P_poll__networl_4_4_AI_1, P_poll__networl_4_4_AI_2, P_poll__networl_4_4_AI_3, P_poll__networl_4_4_AI_4, P_poll__networl_4_4_AI_5, P_poll__networl_4_4_AnnP_0, P_poll__networl_4_4_AnnP_1, P_poll__networl_4_4_AnnP_2, P_poll__networl_4_4_AnnP_3, P_poll__networl_4_4_AnnP_4, P_poll__networl_4_4_AnnP_5, P_poll__networl_4_4_RP_0, P_poll__networl_4_4_RP_1, P_poll__networl_4_4_RP_2, P_poll__networl_4_4_RP_3, P_poll__networl_4_4_RP_4, P_poll__networl_4_4_RP_5, P_poll__networl_4_5_AskP_0, P_poll__networl_4_5_AskP_1, P_poll__networl_4_5_AskP_2, P_poll__networl_4_5_AskP_3, P_poll__networl_4_5_AskP_4, P_poll__networl_4_5_AskP_5, P_poll__networl_4_5_AnsP_0, P_poll__networl_4_5_AnsP_1, P_poll__networl_4_5_AnsP_2, P_poll__networl_4_5_AnsP_3, P_poll__networl_4_5_AnsP_4, P_poll__networl_4_5_AnsP_5, P_poll__networl_4_5_RI_0, P_poll__networl_4_5_RI_1, P_poll__networl_4_5_RI_2, P_poll__networl_4_5_RI_3, P_poll__networl_4_5_RI_4, P_poll__networl_4_5_RI_5, P_poll__networl_4_5_AI_0, P_poll__networl_4_5_AI_1, P_poll__networl_4_5_AI_2, P_poll__networl_4_5_AI_3, P_poll__networl_4_5_AI_4, P_poll__networl_4_5_AI_5, P_poll__networl_4_5_AnnP_0, P_poll__networl_4_5_AnnP_1, P_poll__networl_4_5_AnnP_2, P_poll__networl_4_5_AnnP_3, P_poll__networl_4_5_AnnP_4, P_poll__networl_4_5_AnnP_5, P_poll__networl_4_5_RP_0, P_poll__networl_4_5_RP_1, P_poll__networl_4_5_RP_2, P_poll__networl_4_5_RP_3, P_poll__networl_4_5_RP_4, P_poll__networl_4_5_RP_5, P_poll__networl_5_0_AskP_0, P_poll__networl_5_0_AskP_1, P_poll__networl_5_0_AskP_2, P_poll__networl_5_0_AskP_3, P_poll__networl_5_0_AskP_4, P_poll__networl_5_0_AskP_5, P_poll__networl_5_0_AnsP_0, P_poll__networl_5_0_AnsP_1, P_poll__networl_5_0_AnsP_2, P_poll__networl_5_0_AnsP_3, P_poll__networl_5_0_AnsP_4, P_poll__networl_5_0_AnsP_5, P_poll__networl_5_0_RI_0, P_poll__networl_5_0_RI_1, P_poll__networl_5_0_RI_2, P_poll__networl_5_0_RI_3, P_poll__networl_5_0_RI_4, P_poll__networl_5_0_RI_5, P_poll__networl_5_0_AI_0, P_poll__networl_5_0_AI_1, P_poll__networl_5_0_AI_2, P_poll__networl_5_0_AI_3, P_poll__networl_5_0_AI_4, P_poll__networl_5_0_AI_5, P_poll__networl_5_0_AnnP_0, P_poll__networl_5_0_AnnP_1, P_poll__networl_5_0_AnnP_2, P_poll__networl_5_0_AnnP_3, P_poll__networl_5_0_AnnP_4, P_poll__networl_5_0_AnnP_5, P_poll__networl_5_0_RP_0, P_poll__networl_5_0_RP_1, P_poll__networl_5_0_RP_2, P_poll__networl_5_0_RP_3, P_poll__networl_5_0_RP_4, P_poll__networl_5_0_RP_5, P_poll__networl_5_1_AskP_0, P_poll__networl_5_1_AskP_1, P_poll__networl_5_1_AskP_2, P_poll__networl_5_1_AskP_3, P_poll__networl_5_1_AskP_4, P_poll__networl_5_1_AskP_5, P_poll__networl_5_1_AnsP_0, P_poll__networl_5_1_AnsP_1, P_poll__networl_5_1_AnsP_2, P_poll__networl_5_1_AnsP_3, P_poll__networl_5_1_AnsP_4, P_poll__networl_5_1_AnsP_5, P_poll__networl_5_1_RI_0, P_poll__networl_5_1_RI_1, P_poll__networl_5_1_RI_2, P_poll__networl_5_1_RI_3, P_poll__networl_5_1_RI_4, P_poll__networl_5_1_RI_5, P_poll__networl_5_1_AI_0, P_poll__networl_5_1_AI_1, P_poll__networl_5_1_AI_2, P_poll__networl_5_1_AI_3, P_poll__networl_5_1_AI_4, P_poll__networl_5_1_AI_5, P_poll__networl_5_1_AnnP_0, P_poll__networl_5_1_AnnP_1, P_poll__networl_5_1_AnnP_2, P_poll__networl_5_1_AnnP_3, P_poll__networl_5_1_AnnP_4, P_poll__networl_5_1_AnnP_5, P_poll__networl_5_1_RP_0, P_poll__networl_5_1_RP_1, P_poll__networl_5_1_RP_2, P_poll__networl_5_1_RP_3, P_poll__networl_5_1_RP_4, P_poll__networl_5_1_RP_5, P_poll__networl_5_2_AskP_0, P_poll__networl_5_2_AskP_1, P_poll__networl_5_2_AskP_2, P_poll__networl_5_2_AskP_3, P_poll__networl_5_2_AskP_4, P_poll__networl_5_2_AskP_5, P_poll__networl_5_2_AnsP_0, P_poll__networl_5_2_AnsP_1, P_poll__networl_5_2_AnsP_2, P_poll__networl_5_2_AnsP_3, P_poll__networl_5_2_AnsP_4, P_poll__networl_5_2_AnsP_5, P_poll__networl_5_2_RI_0, P_poll__networl_5_2_RI_1, P_poll__networl_5_2_RI_2, P_poll__networl_5_2_RI_3, P_poll__networl_5_2_RI_4, P_poll__networl_5_2_RI_5, P_poll__networl_5_2_AI_0, P_poll__networl_5_2_AI_1, P_poll__networl_5_2_AI_2, P_poll__networl_5_2_AI_3, P_poll__networl_5_2_AI_4, P_poll__networl_5_2_AI_5, P_poll__networl_5_2_AnnP_0, P_poll__networl_5_2_AnnP_1, P_poll__networl_5_2_AnnP_2, P_poll__networl_5_2_AnnP_3, P_poll__networl_5_2_AnnP_4, P_poll__networl_5_2_AnnP_5, P_poll__networl_5_2_RP_0, P_poll__networl_5_2_RP_1, P_poll__networl_5_2_RP_2, P_poll__networl_5_2_RP_3, P_poll__networl_5_2_RP_4, P_poll__networl_5_2_RP_5, P_poll__networl_5_3_AskP_0, P_poll__networl_5_3_AskP_1, P_poll__networl_5_3_AskP_2, P_poll__networl_5_3_AskP_3, P_poll__networl_5_3_AskP_4, P_poll__networl_5_3_AskP_5, P_poll__networl_5_3_AnsP_0, P_poll__networl_5_3_AnsP_1, P_poll__networl_5_3_AnsP_2, P_poll__networl_5_3_AnsP_3, P_poll__networl_5_3_AnsP_4, P_poll__networl_5_3_AnsP_5, P_poll__networl_5_3_RI_0, P_poll__networl_5_3_RI_1, P_poll__networl_5_3_RI_2, P_poll__networl_5_3_RI_3, P_poll__networl_5_3_RI_4, P_poll__networl_5_3_RI_5, P_poll__networl_5_3_AI_0, P_poll__networl_5_3_AI_1, P_poll__networl_5_3_AI_2, P_poll__networl_5_3_AI_3, P_poll__networl_5_3_AI_4, P_poll__networl_5_3_AI_5, P_poll__networl_5_3_AnnP_0, P_poll__networl_5_3_AnnP_1, P_poll__networl_5_3_AnnP_2, P_poll__networl_5_3_AnnP_3, P_poll__networl_5_3_AnnP_4, P_poll__networl_5_3_AnnP_5, P_poll__networl_5_3_RP_0, P_poll__networl_5_3_RP_1, P_poll__networl_5_3_RP_2, P_poll__networl_5_3_RP_3, P_poll__networl_5_3_RP_4, P_poll__networl_5_3_RP_5, P_poll__networl_5_4_AskP_0, P_poll__networl_5_4_AskP_1, P_poll__networl_5_4_AskP_2, P_poll__networl_5_4_AskP_3, P_poll__networl_5_4_AskP_4, P_poll__networl_5_4_AskP_5, P_poll__networl_5_4_AnsP_0, P_poll__networl_5_4_AnsP_1, P_poll__networl_5_4_AnsP_2, P_poll__networl_5_4_AnsP_3, P_poll__networl_5_4_AnsP_4, P_poll__networl_5_4_AnsP_5, P_poll__networl_5_4_RI_0, P_poll__networl_5_4_RI_1, P_poll__networl_5_4_RI_2, P_poll__networl_5_4_RI_3, P_poll__networl_5_4_RI_4, P_poll__networl_5_4_RI_5, P_poll__networl_5_4_AI_0, P_poll__networl_5_4_AI_1, P_poll__networl_5_4_AI_2, P_poll__networl_5_4_AI_3, P_poll__networl_5_4_AI_4, P_poll__networl_5_4_AI_5, P_poll__networl_5_4_AnnP_0, P_poll__networl_5_4_AnnP_1, P_poll__networl_5_4_AnnP_2, P_poll__networl_5_4_AnnP_3, P_poll__networl_5_4_AnnP_4, P_poll__networl_5_4_AnnP_5, P_poll__networl_5_4_RP_0, P_poll__networl_5_4_RP_1, P_poll__networl_5_4_RP_2, P_poll__networl_5_4_RP_3, P_poll__networl_5_4_RP_4, P_poll__networl_5_4_RP_5, P_poll__networl_5_5_AskP_0, P_poll__networl_5_5_AskP_1, P_poll__networl_5_5_AskP_2, P_poll__networl_5_5_AskP_3, P_poll__networl_5_5_AskP_4, P_poll__networl_5_5_AskP_5, P_poll__networl_5_5_AnsP_0, P_poll__networl_5_5_AnsP_1, P_poll__networl_5_5_AnsP_2, P_poll__networl_5_5_AnsP_3, P_poll__networl_5_5_AnsP_4, P_poll__networl_5_5_AnsP_5, P_poll__networl_5_5_RI_0, P_poll__networl_5_5_RI_1, P_poll__networl_5_5_RI_2, P_poll__networl_5_5_RI_3, P_poll__networl_5_5_RI_4, P_poll__networl_5_5_RI_5, P_poll__networl_5_5_AI_0, P_poll__networl_5_5_AI_1, P_poll__networl_5_5_AI_2, P_poll__networl_5_5_AI_3, P_poll__networl_5_5_AI_4, P_poll__networl_5_5_AI_5, P_poll__networl_5_5_AnnP_0, P_poll__networl_5_5_AnnP_1, P_poll__networl_5_5_AnnP_2, P_poll__networl_5_5_AnnP_3, P_poll__networl_5_5_AnnP_4, P_poll__networl_5_5_AnnP_5, P_poll__networl_5_5_RP_0, P_poll__networl_5_5_RP_1, P_poll__networl_5_5_RP_2, P_poll__networl_5_5_RP_3, P_poll__networl_5_5_RP_4, P_poll__networl_5_5_RP_5, P_poll__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__pollEnd_3, P_poll__pollEnd_4, P_poll__pollEnd_5, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_poll__waitingMessage_3, P_poll__waitingMessage_4, P_poll__waitingMessage_5, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_polling_4, P_polling_5, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_0_3, P_sendAnnPs__broadcasting_0_4, P_sendAnnPs__broadcasting_0_5, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_1_3, P_sendAnnPs__broadcasting_1_4, P_sendAnnPs__broadcasting_1_5, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, P_sendAnnPs__broadcasting_2_3, P_sendAnnPs__broadcasting_2_4, P_sendAnnPs__broadcasting_2_5, P_sendAnnPs__broadcasting_3_1, P_sendAnnPs__broadcasting_3_2, P_sendAnnPs__broadcasting_3_3, P_sendAnnPs__broadcasting_3_4, P_sendAnnPs__broadcasting_3_5, P_sendAnnPs__broadcasting_4_1, P_sendAnnPs__broadcasting_4_2, P_sendAnnPs__broadcasting_4_3, P_sendAnnPs__broadcasting_4_4, P_sendAnnPs__broadcasting_4_5, P_sendAnnPs__broadcasting_5_1, P_sendAnnPs__broadcasting_5_2, P_sendAnnPs__broadcasting_5_3, P_sendAnnPs__broadcasting_5_4, P_sendAnnPs__broadcasting_5_5, P_stage_0_NEG, P_stage_0_PRIM, P_stage_0_SEC, P_stage_1_NEG, P_stage_1_PRIM, P_stage_1_SEC, P_stage_2_NEG, P_stage_2_PRIM, P_stage_2_SEC, P_stage_3_NEG, P_stage_3_PRIM, P_stage_3_SEC, P_stage_4_NEG, P_stage_4_PRIM, P_stage_4_SEC, P_stage_5_NEG, P_stage_5_PRIM, P_stage_5_SEC, P_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_0_3, P_startNeg__broadcasting_0_4, P_startNeg__broadcasting_0_5, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_1_3, P_startNeg__broadcasting_1_4, P_startNeg__broadcasting_1_5, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2, P_startNeg__broadcasting_2_3, P_startNeg__broadcasting_2_4, P_startNeg__broadcasting_2_5, P_startNeg__broadcasting_3_1, P_startNeg__broadcasting_3_2, P_startNeg__broadcasting_3_3, P_startNeg__broadcasting_3_4, P_startNeg__broadcasting_3_5, P_startNeg__broadcasting_4_1, P_startNeg__broadcasting_4_2, P_startNeg__broadcasting_4_3, P_startNeg__broadcasting_4_4, P_startNeg__broadcasting_4_5, P_startNeg__broadcasting_5_1, P_startNeg__broadcasting_5_2, P_startNeg__broadcasting_5_3, P_startNeg__broadcasting_5_4, P_startNeg__broadcasting_5_5]
[2023-03-14 07:10:51] [INFO ] Parsed PT model containing 3090 places and 4674 transitions and 27162 arcs in 882 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2866 places in 36 ms
Reduce places removed 2886 places and 4438 transitions.
Reduce places removed 11 places and 0 transitions.
FORMULA NeoElection-PT-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-5-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 168 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 168 transition count 231
Applied a total of 30 rules in 55 ms. Remains 168 /193 variables (removed 25) and now considering 231/236 (removed 5) transitions.
[2023-03-14 07:10:52] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 168 cols
[2023-03-14 07:10:52] [INFO ] Computed 34 place invariants in 30 ms
[2023-03-14 07:10:52] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-14 07:10:52] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2023-03-14 07:10:52] [INFO ] Invariant cache hit.
[2023-03-14 07:10:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 07:10:53] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-14 07:10:53] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2023-03-14 07:10:53] [INFO ] Invariant cache hit.
[2023-03-14 07:10:53] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/193 places, 231/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1410 ms. Remains : 168/193 places, 231/236 transitions.
Support contains 104 out of 168 places after structural reductions.
[2023-03-14 07:10:54] [INFO ] Flatten gal took : 105 ms
[2023-03-14 07:10:54] [INFO ] Flatten gal took : 63 ms
[2023-03-14 07:10:54] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 100 out of 168 places (down from 104) after GAL structural reductions.
Finished random walk after 159 steps, including 0 resets, run visited all 7 properties in 33 ms. (steps per millisecond=4 )
Computed a total of 168 stabilizing places and 231 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 231
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 141 transition count 123
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 141 transition count 123
Applied a total of 54 rules in 13 ms. Remains 141 /168 variables (removed 27) and now considering 123/231 (removed 108) transitions.
[2023-03-14 07:10:54] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2023-03-14 07:10:54] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-14 07:10:54] [INFO ] Implicit Places using invariants in 124 ms returned [14, 19, 24, 29, 34]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 127 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/168 places, 123/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 136 /136 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 136/168 places, 123/231 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s23 1) (EQ s126 1)) (AND (EQ s15 1) (EQ s118 1)) (AND (EQ s28 1) (EQ s131 1)) (AND (EQ s22 1) (EQ s125 1)) (AND (EQ s30 1) (EQ s133 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 648 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Computed a total of 136 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-5-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-5-LTLFireability-00 finished in 1811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(!p0)))'
Support contains 38 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 158 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 157 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 157 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 152 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 26 place count 143 transition count 193
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 143 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 142 transition count 192
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 141 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 140 transition count 191
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 139 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 138 transition count 190
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 41 place count 137 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 42 place count 136 transition count 189
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 395 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 44 place count 133 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 44 place count 133 transition count 180
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 60 place count 125 transition count 180
Applied a total of 60 rules in 144 ms. Remains 125 /168 variables (removed 43) and now considering 180/231 (removed 51) transitions.
[2023-03-14 07:10:56] [INFO ] Flow matrix only has 164 transitions (discarded 16 similar events)
// Phase 1: matrix 164 rows 125 cols
[2023-03-14 07:10:56] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-14 07:10:56] [INFO ] Implicit Places using invariants in 161 ms returned [9, 11, 13, 16, 18, 20, 23, 25, 27, 30, 32, 34]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 171 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/168 places, 180/231 transitions.
Applied a total of 0 rules in 14 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 113/168 places, 180/231 transitions.
Stuttering acceptance computed with spot in 161 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (NEQ s3 1) (NEQ s12 1) (NEQ s51 1) (NEQ s90 1)) (OR (NEQ s5 1) (NEQ s16 1) (NEQ s64 1) (NEQ s91 1)) (OR (NEQ s5 1) (NEQ s19 1) (NEQ s62 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2429 reset in 1552 ms.
Product exploration explored 100000 steps with 2435 reset in 1379 ms.
Computed a total of 113 stabilizing places and 180 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113 transition count 180
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-5-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-5-LTLFireability-03 finished in 3786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 158 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 157 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 157 transition count 220
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 152 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 26 place count 143 transition count 166
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 143 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 142 transition count 165
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 141 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 140 transition count 164
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 139 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 138 transition count 163
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 41 place count 137 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 42 place count 136 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 43 place count 135 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 43 place count 135 transition count 158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 51 place count 131 transition count 158
Applied a total of 51 rules in 111 ms. Remains 131 /168 variables (removed 37) and now considering 158/231 (removed 73) transitions.
[2023-03-14 07:11:00] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 131 cols
[2023-03-14 07:11:00] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-14 07:11:00] [INFO ] Implicit Places using invariants in 211 ms returned [8, 10, 12, 14, 17, 19, 21, 24, 26, 28, 31, 33, 35]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 224 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/168 places, 158/231 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 118/168 places, 158/231 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s18 1) (EQ s74 1) (EQ s96 1)) (AND (EQ s23 1) (EQ s85 1) (EQ s97 1)) (AND (EQ s20 1) (EQ s89 1) (EQ s97 1)) (AND (EQ s22 1) (EQ s85 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2757 reset in 1014 ms.
Product exploration explored 100000 steps with 2766 reset in 673 ms.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2023-03-14 07:11:03] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2023-03-14 07:11:03] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-14 07:11:03] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-14 07:11:03] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-14 07:11:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:11:03] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-14 07:11:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:11:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 07:11:04] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-14 07:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:11:04] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-14 07:11:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-14 07:11:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2023-03-14 07:11:04] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 20 ms.
[2023-03-14 07:11:04] [INFO ] Added : 55 causal constraints over 11 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 158/158 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-14 07:11:04] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:04] [INFO ] Invariant cache hit.
[2023-03-14 07:11:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-14 07:11:05] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:05] [INFO ] Invariant cache hit.
[2023-03-14 07:11:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-14 07:11:05] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-14 07:11:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 07:11:05] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:05] [INFO ] Invariant cache hit.
[2023-03-14 07:11:05] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 118/118 places, 158/158 transitions.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
[2023-03-14 07:11:06] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:06] [INFO ] Invariant cache hit.
[2023-03-14 07:11:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 07:11:06] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-14 07:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:11:06] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-14 07:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:11:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-14 07:11:07] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-14 07:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:11:07] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-14 07:11:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-14 07:11:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2023-03-14 07:11:07] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 22 ms.
[2023-03-14 07:11:07] [INFO ] Added : 60 causal constraints over 12 iterations in 325 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2778 reset in 1102 ms.
Product exploration explored 100000 steps with 2781 reset in 743 ms.
Built C files in :
/tmp/ltsmin5641259156204681995
[2023-03-14 07:11:09] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2023-03-14 07:11:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:09] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2023-03-14 07:11:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:10] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2023-03-14 07:11:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:10] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5641259156204681995
Running compilation step : cd /tmp/ltsmin5641259156204681995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 847 ms.
Running link step : cd /tmp/ltsmin5641259156204681995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin5641259156204681995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6650993819934728630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 158/158 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-14 07:11:25] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:25] [INFO ] Invariant cache hit.
[2023-03-14 07:11:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-14 07:11:25] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:25] [INFO ] Invariant cache hit.
[2023-03-14 07:11:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-14 07:11:25] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-14 07:11:25] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 07:11:25] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-14 07:11:25] [INFO ] Invariant cache hit.
[2023-03-14 07:11:25] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 118/118 places, 158/158 transitions.
Built C files in :
/tmp/ltsmin16603896371670549184
[2023-03-14 07:11:25] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2023-03-14 07:11:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:25] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2023-03-14 07:11:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:25] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2023-03-14 07:11:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:11:25] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16603896371670549184
Running compilation step : cd /tmp/ltsmin16603896371670549184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin16603896371670549184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16603896371670549184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8526013565765700774.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-14 07:11:40] [INFO ] Flatten gal took : 19 ms
[2023-03-14 07:11:40] [INFO ] Flatten gal took : 17 ms
[2023-03-14 07:11:40] [INFO ] Time to serialize gal into /tmp/LTL8859147536593377377.gal : 4 ms
[2023-03-14 07:11:40] [INFO ] Time to serialize properties into /tmp/LTL15304583804360538772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8859147536593377377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15081344392684744582.hoa' '-atoms' '/tmp/LTL15304583804360538772.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15304583804360538772.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15081344392684744582.hoa
Detected timeout of ITS tools.
[2023-03-14 07:11:55] [INFO ] Flatten gal took : 16 ms
[2023-03-14 07:11:56] [INFO ] Flatten gal took : 16 ms
[2023-03-14 07:11:56] [INFO ] Time to serialize gal into /tmp/LTL15371346153303352920.gal : 7 ms
[2023-03-14 07:11:56] [INFO ] Time to serialize properties into /tmp/LTL9373780851140805418.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15371346153303352920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9373780851140805418.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((P_negotiation_4_3_CO==1)&&(P_network_4_3_AI_0==1))&&(P_poll__handlingMessage_4==1))||(((P_negotiation_5_4_CO==1)&&(P_...3630
Formula 0 simplified : FG!"(((((((((P_negotiation_4_3_CO==1)&&(P_network_4_3_AI_0==1))&&(P_poll__handlingMessage_4==1))||(((P_negotiation_5_4_CO==1)&&(P_ne...3624
Detected timeout of ITS tools.
[2023-03-14 07:12:11] [INFO ] Flatten gal took : 16 ms
[2023-03-14 07:12:11] [INFO ] Applying decomposition
[2023-03-14 07:12:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7489375651672879620.txt' '-o' '/tmp/graph7489375651672879620.bin' '-w' '/tmp/graph7489375651672879620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7489375651672879620.bin' '-l' '-1' '-v' '-w' '/tmp/graph7489375651672879620.weights' '-q' '0' '-e' '0.001'
[2023-03-14 07:12:11] [INFO ] Decomposing Gal with order
[2023-03-14 07:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 07:12:11] [INFO ] Removed a total of 29 redundant transitions.
[2023-03-14 07:12:11] [INFO ] Flatten gal took : 57 ms
[2023-03-14 07:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2023-03-14 07:12:11] [INFO ] Time to serialize gal into /tmp/LTL14468221522864806914.gal : 5 ms
[2023-03-14 07:12:11] [INFO ] Time to serialize properties into /tmp/LTL12237246179880265728.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14468221522864806914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12237246179880265728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((i3.u10.P_negotiation_4_3_CO==1)&&(i3.u10.P_network_4_3_AI_0==1))&&(i3.u10.P_poll__handlingMessage_4==1))||(((u11.P_ne...4254
Formula 0 simplified : FG!"(((((((((i3.u10.P_negotiation_4_3_CO==1)&&(i3.u10.P_network_4_3_AI_0==1))&&(i3.u10.P_poll__handlingMessage_4==1))||(((u11.P_nego...4248
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1486654098119286740
[2023-03-14 07:12:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1486654098119286740
Running compilation step : cd /tmp/ltsmin1486654098119286740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 403 ms.
Running link step : cd /tmp/ltsmin1486654098119286740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1486654098119286740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-PT-5-LTLFireability-04 finished in 101383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 35 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 159 transition count 177
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 159 transition count 177
Applied a total of 18 rules in 10 ms. Remains 159 /168 variables (removed 9) and now considering 177/231 (removed 54) transitions.
[2023-03-14 07:12:41] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 159 cols
[2023-03-14 07:12:41] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-14 07:12:41] [INFO ] Implicit Places using invariants in 153 ms returned [13, 14, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 155 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 177/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 138/168 places, 177/231 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s113 1) (EQ s114 1) (EQ s115 1) (EQ s116 1) (EQ s117 1)), p1:(OR (AND (EQ s23 1) (EQ s82 1) (EQ s106 1)) (AND (EQ s28 1) (EQ s94 1) (EQ s107 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-5-LTLFireability-06 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 141 transition count 123
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 141 transition count 123
Applied a total of 54 rules in 7 ms. Remains 141 /168 variables (removed 27) and now considering 123/231 (removed 108) transitions.
[2023-03-14 07:12:41] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2023-03-14 07:12:41] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 07:12:42] [INFO ] Implicit Places using invariants in 142 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 144 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/168 places, 123/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 116/168 places, 123/231 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s2 1), p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-5-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-5-LTLFireability-12 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 231/231 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 158 transition count 222
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 154 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 154 transition count 217
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 149 transition count 217
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 50 place count 122 transition count 109
Iterating global reduction 2 with 27 rules applied. Total rules applied 77 place count 122 transition count 109
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 117 transition count 104
Ensure Unique test removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 112 transition count 104
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 92 place count 107 transition count 99
Ensure Unique test removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 97 place count 102 transition count 99
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 102 place count 97 transition count 94
Ensure Unique test removed 5 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 107 place count 92 transition count 94
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 112 place count 87 transition count 89
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 177 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 5 with 17 rules applied. Total rules applied 129 place count 75 transition count 70
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 141 place count 63 transition count 70
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 141 place count 63 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 153 place count 57 transition count 64
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 159 place count 51 transition count 58
Iterating global reduction 7 with 6 rules applied. Total rules applied 165 place count 51 transition count 58
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 165 place count 51 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 169 place count 49 transition count 56
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 171 place count 47 transition count 54
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 47 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 177 place count 45 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 179 place count 44 transition count 51
Applied a total of 179 rules in 56 ms. Remains 44 /168 variables (removed 124) and now considering 51/231 (removed 180) transitions.
[2023-03-14 07:12:42] [INFO ] Flow matrix only has 35 transitions (discarded 16 similar events)
// Phase 1: matrix 35 rows 44 cols
[2023-03-14 07:12:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 07:12:42] [INFO ] Implicit Places using invariants in 62 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/168 places, 51/231 transitions.
Graph (complete) has 120 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 33 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 33 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 32 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 32 transition count 39
Applied a total of 13 rules in 5 ms. Remains 32 /40 variables (removed 8) and now considering 39/51 (removed 12) transitions.
[2023-03-14 07:12:42] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
// Phase 1: matrix 27 rows 32 cols
[2023-03-14 07:12:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-14 07:12:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-14 07:12:42] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:42] [INFO ] Invariant cache hit.
[2023-03-14 07:12:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 07:12:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/168 places, 39/231 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 32/168 places, 39/231 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3269 reset in 256 ms.
Product exploration explored 100000 steps with 3286 reset in 239 ms.
Computed a total of 32 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 39
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-14 07:12:43] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:43] [INFO ] Invariant cache hit.
[2023-03-14 07:12:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-14 07:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:12:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-14 07:12:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:12:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:12:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-14 07:12:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 07:12:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-14 07:12:43] [INFO ] Computed and/alt/rep : 17/28/14 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-14 07:12:43] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-14 07:12:43] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:43] [INFO ] Invariant cache hit.
[2023-03-14 07:12:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-14 07:12:43] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:43] [INFO ] Invariant cache hit.
[2023-03-14 07:12:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 07:12:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-14 07:12:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 07:12:43] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:43] [INFO ] Invariant cache hit.
[2023-03-14 07:12:43] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 32/32 places, 39/39 transitions.
Computed a total of 32 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 39
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-14 07:12:44] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2023-03-14 07:12:44] [INFO ] Invariant cache hit.
[2023-03-14 07:12:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:12:44] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-14 07:12:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:12:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-14 07:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:12:44] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-14 07:12:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 07:12:44] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-14 07:12:44] [INFO ] Computed and/alt/rep : 17/28/14 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 07:12:44] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3293 reset in 278 ms.
Product exploration explored 100000 steps with 3288 reset in 198 ms.
Built C files in :
/tmp/ltsmin2370870583863150602
[2023-03-14 07:12:45] [INFO ] Computing symmetric may disable matrix : 39 transitions.
[2023-03-14 07:12:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:45] [INFO ] Computing symmetric may enable matrix : 39 transitions.
[2023-03-14 07:12:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:45] [INFO ] Computing Do-Not-Accords matrix : 39 transitions.
[2023-03-14 07:12:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2370870583863150602
Running compilation step : cd /tmp/ltsmin2370870583863150602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin2370870583863150602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2370870583863150602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17255491685930714750.hoa' '--buchi-type=spotba'
LTSmin run took 695 ms.
FORMULA NeoElection-PT-5-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-PT-5-LTLFireability-14 finished in 4128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-14 07:12:46] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8210456510029565800
[2023-03-14 07:12:46] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2023-03-14 07:12:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:46] [INFO ] Applying decomposition
[2023-03-14 07:12:46] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2023-03-14 07:12:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:46] [INFO ] Flatten gal took : 19 ms
[2023-03-14 07:12:46] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2023-03-14 07:12:46] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-14 07:12:46] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8210456510029565800
Running compilation step : cd /tmp/ltsmin8210456510029565800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4982897891532085942.txt' '-o' '/tmp/graph4982897891532085942.bin' '-w' '/tmp/graph4982897891532085942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4982897891532085942.bin' '-l' '-1' '-v' '-w' '/tmp/graph4982897891532085942.weights' '-q' '0' '-e' '0.001'
[2023-03-14 07:12:46] [INFO ] Decomposing Gal with order
[2023-03-14 07:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 07:12:46] [INFO ] Removed a total of 19 redundant transitions.
[2023-03-14 07:12:46] [INFO ] Flatten gal took : 30 ms
[2023-03-14 07:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2023-03-14 07:12:46] [INFO ] Time to serialize gal into /tmp/LTLFireability2599181534804222809.gal : 6 ms
[2023-03-14 07:12:46] [INFO ] Time to serialize properties into /tmp/LTLFireability10626189337185554636.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2599181534804222809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10626189337185554636.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((u6.P_negotiation_4_3_CO==1)&&(u6.P_network_4_3_AI_0==1))&&(u6.P_poll__handlingMessage_4==1))||(((i4.u7.P_negotiation_...4194
Formula 0 simplified : FG!"(((((((((u6.P_negotiation_4_3_CO==1)&&(u6.P_network_4_3_AI_0==1))&&(u6.P_poll__handlingMessage_4==1))||(((i4.u7.P_negotiation_5_...4188
Compilation finished in 1031 ms.
Running link step : cd /tmp/ltsmin8210456510029565800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8210456510029565800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-14 07:33:26] [INFO ] Applying decomposition
[2023-03-14 07:33:26] [INFO ] Flatten gal took : 34 ms
[2023-03-14 07:33:26] [INFO ] Decomposing Gal with order
[2023-03-14 07:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 07:33:26] [INFO ] Flatten gal took : 73 ms
[2023-03-14 07:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-14 07:33:26] [INFO ] Time to serialize gal into /tmp/LTLFireability412434460281327756.gal : 7 ms
[2023-03-14 07:33:26] [INFO ] Time to serialize properties into /tmp/LTLFireability14379363755037991117.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability412434460281327756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14379363755037991117.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((missing.P_negotiation_4_3_CO==1)&&(missing.P_network_4_3_AI_0==1))&&(missing.P_poll__handlingMessage_4==1))||(((missi...4590
Formula 0 simplified : FG!"(((((((((missing.P_negotiation_4_3_CO==1)&&(missing.P_network_4_3_AI_0==1))&&(missing.P_poll__handlingMessage_4==1))||(((missing...4584
Reverse transition relation is NOT exact ! Due to transitions missing.t5, missing.t6, missing.t7, missing.t8, missing.t9, missing.t10, missing.t11, missing...1701
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2023-03-14 07:54:05] [INFO ] Flatten gal took : 42 ms
[2023-03-14 07:54:05] [INFO ] Input system was already deterministic with 231 transitions.
[2023-03-14 07:54:05] [INFO ] Transformed 168 places.
[2023-03-14 07:54:05] [INFO ] Transformed 231 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-14 07:54:05] [INFO ] Time to serialize gal into /tmp/LTLFireability2239789901352931547.gal : 3 ms
[2023-03-14 07:54:05] [INFO ] Time to serialize properties into /tmp/LTLFireability820372158991409064.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2239789901352931547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability820372158991409064.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((((P_negotiation_4_3_CO==1)&&(P_network_4_3_AI_0==1))&&(P_poll__handlingMessage_4==1))||(((P_negotiation_5_4_CO==1)&&(P_...3630
Formula 0 simplified : FG!"(((((((((P_negotiation_4_3_CO==1)&&(P_network_4_3_AI_0==1))&&(P_poll__handlingMessage_4==1))||(((P_negotiation_5_4_CO==1)&&(P_ne...3624
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8342600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16022132 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NeoElection-PT-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-5.tgz
mv NeoElection-PT-5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;