Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654351800531.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NeoElection-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351800531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 420K Apr 11 19:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 19:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 812K Apr 11 19:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 11 19:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 236K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 585K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 164K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 447K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Apr 11 21:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 11 21:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 514K Apr 11 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 62K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 109K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.5M May 18 16:43 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-6-LTLCardinality-00
FORMULA_NAME NeoElection-PT-6-LTLCardinality-01
FORMULA_NAME NeoElection-PT-6-LTLCardinality-02
FORMULA_NAME NeoElection-PT-6-LTLCardinality-03
FORMULA_NAME NeoElection-PT-6-LTLCardinality-04
FORMULA_NAME NeoElection-PT-6-LTLCardinality-05
FORMULA_NAME NeoElection-PT-6-LTLCardinality-06
FORMULA_NAME NeoElection-PT-6-LTLCardinality-07
FORMULA_NAME NeoElection-PT-6-LTLCardinality-08
FORMULA_NAME NeoElection-PT-6-LTLCardinality-09
FORMULA_NAME NeoElection-PT-6-LTLCardinality-10
FORMULA_NAME NeoElection-PT-6-LTLCardinality-11
FORMULA_NAME NeoElection-PT-6-LTLCardinality-12
FORMULA_NAME NeoElection-PT-6-LTLCardinality-13
FORMULA_NAME NeoElection-PT-6-LTLCardinality-14
FORMULA_NAME NeoElection-PT-6-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717239461339

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:57:43] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2024-06-01 10:57:43] [INFO ] Transformed 4830 places.
[2024-06-01 10:57:43] [INFO ] Transformed 8435 transitions.
[2024-06-01 10:57:43] [INFO ] Found NUPN structural information;
[2024-06-01 10:57:43] [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_crashed_6, P_dead_0, P_dead_1, P_dead_2, P_dead_3, P_dead_4, P_dead_5, P_dead_6, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedPrimary_4, P_electedPrimary_5, P_electedPrimary_6, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electedSecondary_4, P_electedSecondary_5, P_electedSecondary_6, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionFailed_4, P_electionFailed_5, P_electionFailed_6, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_electionInit_4, P_electionInit_5, P_electionInit_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_0_5_6, P_masterList_0_6_0, P_masterList_0_6_1, P_masterList_0_6_2, P_masterList_0_6_3, P_masterList_0_6_4, P_masterList_0_6_5, P_masterList_0_6_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_1_5_6, P_masterList_1_6_0, P_masterList_1_6_1, P_masterList_1_6_2, P_masterList_1_6_3, P_masterList_1_6_4, P_masterList_1_6_5, P_masterList_1_6_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_2_5_6, P_masterList_2_6_0, P_masterList_2_6_1, P_masterList_2_6_2, P_masterList_2_6_3, P_masterList_2_6_4, P_masterList_2_6_5, P_masterList_2_6_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_3_5_6, P_masterList_3_6_0, P_masterList_3_6_1, P_masterList_3_6_2, P_masterList_3_6_3, P_masterList_3_6_4, P_masterList_3_6_5, P_masterList_3_6_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_4_5_6, P_masterList_4_6_0, P_masterList_4_6_1, P_masterList_4_6_2, P_masterList_4_6_3, P_masterList_4_6_4, P_masterList_4_6_5, P_masterList_4_6_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_masterList_5_5_6, P_masterList_5_6_0, P_masterList_5_6_1, P_masterList_5_6_2, P_masterList_5_6_3, P_masterList_5_6_4, P_masterList_5_6_5, P_masterList_5_6_6, P_masterList_6_1_0, P_masterList_6_1_1, P_masterList_6_1_2, P_masterList_6_1_3, P_masterList_6_1_4, P_masterList_6_1_5, P_masterList_6_1_6, P_masterList_6_2_0, P_masterList_6_2_1, P_masterList_6_2_2, P_masterList_6_2_3, P_masterList_6_2_4, P_masterList_6_2_5, P_masterList_6_2_6, P_masterList_6_3_0, P_masterList_6_3_1, P_masterList_6_3_2, P_masterList_6_3_3, P_masterList_6_3_4, P_masterList_6_3_5, P_masterList_6_3_6, P_masterList_6_4_0, P_masterList_6_4_1, P_masterList_6_4_2, P_masterList_6_4_3, P_masterList_6_4_4, P_masterList_6_4_5, P_masterList_6_4_6, P_masterList_6_5_0, P_masterList_6_5_1, P_masterList_6_5_2, P_masterList_6_5_3, P_masterList_6_5_4, P_masterList_6_5_5, P_masterList_6_5_6, P_masterList_6_6_0, P_masterList_6_6_1, P_masterList_6_6_2, P_masterList_6_6_3, P_masterList_6_6_4, P_masterList_6_6_5, P_masterList_6_6_6, 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_F_6, 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_0_T_6, 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_F_6, 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_1_T_6, 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_F_6, 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_2_T_6, 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_F_6, 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_3_T_6, 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_F_6, 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_4_T_6, 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_F_6, 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_masterState_5_T_6, P_masterState_6_F_0, P_masterState_6_F_1, P_masterState_6_F_2, P_masterState_6_F_3, P_masterState_6_F_4, P_masterState_6_F_5, P_masterState_6_F_6, P_masterState_6_T_0, P_masterState_6_T_1, P_masterState_6_T_2, P_masterState_6_T_3, P_masterState_6_T_4, P_masterState_6_T_5, P_masterState_6_T_6, 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_0_6_NONE, P_negotiation_0_6_CO, P_negotiation_0_6_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_1_6_NONE, P_negotiation_1_6_CO, P_negotiation_1_6_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_2_6_NONE, P_negotiation_2_6_CO, P_negotiation_2_6_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_3_6_NONE, P_negotiation_3_6_CO, P_negotiation_3_6_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_4_6_NONE, P_negotiation_4_6_CO, P_negotiation_4_6_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_negotiation_5_6_NONE, P_negotiation_5_6_CO, P_negotiation_5_6_DONE, P_negotiation_6_0_NONE, P_negotiation_6_0_CO, P_negotiation_6_0_DONE, P_negotiation_6_1_NONE, P_negotiation_6_1_CO, P_negotiation_6_1_DONE, P_negotiation_6_2_NONE, P_negotiation_6_2_CO, P_negotiation_6_2_DONE, P_negotiation_6_3_NONE, P_negotiation_6_3_CO, P_negotiation_6_3_DONE, P_negotiation_6_4_NONE, P_negotiation_6_4_CO, P_negotiation_6_4_DONE, P_negotiation_6_5_NONE, P_negotiation_6_5_CO, P_negotiation_6_5_DONE, P_negotiation_6_6_NONE, P_negotiation_6_6_CO, P_negotiation_6_6_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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_5_RP_6, P_network_0_6_AskP_0, P_network_0_6_AskP_1, P_network_0_6_AskP_2, P_network_0_6_AskP_3, P_network_0_6_AskP_4, P_network_0_6_AskP_5, P_network_0_6_AskP_6, P_network_0_6_AnsP_0, P_network_0_6_AnsP_1, P_network_0_6_AnsP_2, P_network_0_6_AnsP_3, P_network_0_6_AnsP_4, P_network_0_6_AnsP_5, P_network_0_6_AnsP_6, P_network_0_6_RI_0, P_network_0_6_RI_1, P_network_0_6_RI_2, P_network_0_6_RI_3, P_network_0_6_RI_4, P_network_0_6_RI_5, P_network_0_6_RI_6, P_network_0_6_AI_0, P_network_0_6_AI_1, P_network_0_6_AI_2, P_network_0_6_AI_3, P_network_0_6_AI_4, P_network_0_6_AI_5, P_network_0_6_AI_6, P_network_0_6_AnnP_0, P_network_0_6_AnnP_1, P_network_0_6_AnnP_2, P_network_0_6_AnnP_3, P_network_0_6_AnnP_4, P_network_0_6_AnnP_5, P_network_0_6_AnnP_6, P_network_0_6_RP_0, P_network_0_6_RP_1, P_network_0_6_RP_2, P_network_0_6_RP_3, P_network_0_6_RP_4, P_network_0_6_RP_5, P_network_0_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_5_RP_6, P_network_1_6_AskP_0, P_network_1_6_AskP_1, P_network_1_6_AskP_2, P_network_1_6_AskP_3, P_network_1_6_AskP_4, P_network_1_6_AskP_5, P_network_1_6_AskP_6, P_network_1_6_AnsP_0, P_network_1_6_AnsP_1, P_network_1_6_AnsP_2, P_network_1_6_AnsP_3, P_network_1_6_AnsP_4, P_network_1_6_AnsP_5, P_network_1_6_AnsP_6, P_network_1_6_RI_0, P_network_1_6_RI_1, P_network_1_6_RI_2, P_network_1_6_RI_3, P_network_1_6_RI_4, P_network_1_6_RI_5, P_network_1_6_RI_6, P_network_1_6_AI_0, P_network_1_6_AI_1, P_network_1_6_AI_2, P_network_1_6_AI_3, P_network_1_6_AI_4, P_network_1_6_AI_5, P_network_1_6_AI_6, P_network_1_6_AnnP_0, P_network_1_6_AnnP_1, P_network_1_6_AnnP_2, P_network_1_6_AnnP_3, P_network_1_6_AnnP_4, P_network_1_6_AnnP_5, P_network_1_6_AnnP_6, P_network_1_6_RP_0, P_network_1_6_RP_1, P_network_1_6_RP_2, P_network_1_6_RP_3, P_network_1_6_RP_4, P_network_1_6_RP_5, P_network_1_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_5_RP_6, P_network_2_6_AskP_0, P_network_2_6_AskP_1, P_network_2_6_AskP_2, P_network_2_6_AskP_3, P_network_2_6_AskP_4, P_network_2_6_AskP_5, P_network_2_6_AskP_6, P_network_2_6_AnsP_0, P_network_2_6_AnsP_1, P_network_2_6_AnsP_2, P_network_2_6_AnsP_3, P_network_2_6_AnsP_4, P_network_2_6_AnsP_5, P_network_2_6_AnsP_6, P_network_2_6_RI_0, P_network_2_6_RI_1, P_network_2_6_RI_2, P_network_2_6_RI_3, P_network_2_6_RI_4, P_network_2_6_RI_5, P_network_2_6_RI_6, P_network_2_6_AI_0, P_network_2_6_AI_1, P_network_2_6_AI_2, P_network_2_6_AI_3, P_network_2_6_AI_4, P_network_2_6_AI_5, P_network_2_6_AI_6, P_network_2_6_AnnP_0, P_network_2_6_AnnP_1, P_network_2_6_AnnP_2, P_network_2_6_AnnP_3, P_network_2_6_AnnP_4, P_network_2_6_AnnP_5, P_network_2_6_AnnP_6, P_network_2_6_RP_0, P_network_2_6_RP_1, P_network_2_6_RP_2, P_network_2_6_RP_3, P_network_2_6_RP_4, P_network_2_6_RP_5, P_network_2_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_5_RP_6, P_network_3_6_AskP_0, P_network_3_6_AskP_1, P_network_3_6_AskP_2, P_network_3_6_AskP_3, P_network_3_6_AskP_4, P_network_3_6_AskP_5, P_network_3_6_AskP_6, P_network_3_6_AnsP_0, P_network_3_6_AnsP_1, P_network_3_6_AnsP_2, P_network_3_6_AnsP_3, P_network_3_6_AnsP_4, P_network_3_6_AnsP_5, P_network_3_6_AnsP_6, P_network_3_6_RI_0, P_network_3_6_RI_1, P_network_3_6_RI_2, P_network_3_6_RI_3, P_network_3_6_RI_4, P_network_3_6_RI_5, P_network_3_6_RI_6, P_network_3_6_AI_0, P_network_3_6_AI_1, P_network_3_6_AI_2, P_network_3_6_AI_3, P_network_3_6_AI_4, P_network_3_6_AI_5, P_network_3_6_AI_6, P_network_3_6_AnnP_0, P_network_3_6_AnnP_1, P_network_3_6_AnnP_2, P_network_3_6_AnnP_3, P_network_3_6_AnnP_4, P_network_3_6_AnnP_5, P_network_3_6_AnnP_6, P_network_3_6_RP_0, P_network_3_6_RP_1, P_network_3_6_RP_2, P_network_3_6_RP_3, P_network_3_6_RP_4, P_network_3_6_RP_5, P_network_3_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_5_RP_6, P_network_4_6_AskP_0, P_network_4_6_AskP_1, P_network_4_6_AskP_2, P_network_4_6_AskP_3, P_network_4_6_AskP_4, P_network_4_6_AskP_5, P_network_4_6_AskP_6, P_network_4_6_AnsP_0, P_network_4_6_AnsP_1, P_network_4_6_AnsP_2, P_network_4_6_AnsP_3, P_network_4_6_AnsP_4, P_network_4_6_AnsP_5, P_network_4_6_AnsP_6, P_network_4_6_RI_0, P_network_4_6_RI_1, P_network_4_6_RI_2, P_network_4_6_RI_3, P_network_4_6_RI_4, P_network_4_6_RI_5, P_network_4_6_RI_6, P_network_4_6_AI_0, P_network_4_6_AI_1, P_network_4_6_AI_2, P_network_4_6_AI_3, P_network_4_6_AI_4, P_network_4_6_AI_5, P_network_4_6_AI_6, P_network_4_6_AnnP_0, P_network_4_6_AnnP_1, P_network_4_6_AnnP_2, P_network_4_6_AnnP_3, P_network_4_6_AnnP_4, P_network_4_6_AnnP_5, P_network_4_6_AnnP_6, P_network_4_6_RP_0, P_network_4_6_RP_1, P_network_4_6_RP_2, P_network_4_6_RP_3, P_network_4_6_RP_4, P_network_4_6_RP_5, P_network_4_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_network_5_5_RP_6, P_network_5_6_AskP_0, P_network_5_6_AskP_1, P_network_5_6_AskP_2, P_network_5_6_AskP_3, P_network_5_6_AskP_4, P_network_5_6_AskP_5, P_network_5_6_AskP_6, P_network_5_6_AnsP_0, P_network_5_6_AnsP_1, P_network_5_6_AnsP_2, P_network_5_6_AnsP_3, P_network_5_6_AnsP_4, P_network_5_6_AnsP_5, P_network_5_6_AnsP_6, P_network_5_6_RI_0, P_network_5_6_RI_1, P_network_5_6_RI_2, P_network_5_6_RI_3, P_network_5_6_RI_4, P_network_5_6_RI_5, P_network_5_6_RI_6, P_network_5_6_AI_0, P_network_5_6_AI_1, P_network_5_6_AI_2, P_network_5_6_AI_3, P_network_5_6_AI_4, P_network_5_6_AI_5, P_network_5_6_AI_6, P_network_5_6_AnnP_0, P_network_5_6_AnnP_1, P_network_5_6_AnnP_2, P_network_5_6_AnnP_3, P_network_5_6_AnnP_4, P_network_5_6_AnnP_5, P_network_5_6_AnnP_6, P_network_5_6_RP_0, P_network_5_6_RP_1, P_network_5_6_RP_2, P_network_5_6_RP_3, P_network_5_6_RP_4, P_network_5_6_RP_5, P_network_5_6_RP_6, P_network_6_0_AskP_0, P_network_6_0_AskP_1, P_network_6_0_AskP_2, P_network_6_0_AskP_3, P_network_6_0_AskP_4, P_network_6_0_AskP_5, P_network_6_0_AskP_6, P_network_6_0_AnsP_0, P_network_6_0_AnsP_1, P_network_6_0_AnsP_2, P_network_6_0_AnsP_3, P_network_6_0_AnsP_4, P_network_6_0_AnsP_5, P_network_6_0_AnsP_6, P_network_6_0_RI_0, P_network_6_0_RI_1, P_network_6_0_RI_2, P_network_6_0_RI_3, P_network_6_0_RI_4, P_network_6_0_RI_5, P_network_6_0_RI_6, P_network_6_0_AI_0, P_network_6_0_AI_1, P_network_6_0_AI_2, P_network_6_0_AI_3, P_network_6_0_AI_4, P_network_6_0_AI_5, P_network_6_0_AI_6, P_network_6_0_AnnP_0, P_network_6_0_AnnP_1, P_network_6_0_AnnP_2, P_network_6_0_AnnP_3, P_network_6_0_AnnP_4, P_network_6_0_AnnP_5, P_network_6_0_AnnP_6, P_network_6_0_RP_0, P_network_6_0_RP_1, P_network_6_0_RP_2, P_network_6_0_RP_3, P_network_6_0_RP_4, P_network_6_0_RP_5, P_network_6_0_RP_6, P_network_6_1_AskP_0, P_network_6_1_AskP_1, P_network_6_1_AskP_2, P_network_6_1_AskP_3, P_network_6_1_AskP_4, P_network_6_1_AskP_5, P_network_6_1_AskP_6, P_network_6_1_AnsP_0, P_network_6_1_AnsP_1, P_network_6_1_AnsP_2, P_network_6_1_AnsP_3, P_network_6_1_AnsP_4, P_network_6_1_AnsP_5, P_network_6_1_AnsP_6, P_network_6_1_RI_0, P_network_6_1_RI_1, P_network_6_1_RI_2, P_network_6_1_RI_3, P_network_6_1_RI_4, P_network_6_1_RI_5, P_network_6_1_RI_6, P_network_6_1_AI_0, P_network_6_1_AI_1, P_network_6_1_AI_2, P_network_6_1_AI_3, P_network_6_1_AI_4, P_network_6_1_AI_5, P_network_6_1_AI_6, P_network_6_1_AnnP_0, P_network_6_1_AnnP_1, P_network_6_1_AnnP_2, P_network_6_1_AnnP_3, P_network_6_1_AnnP_4, P_network_6_1_AnnP_5, P_network_6_1_AnnP_6, P_network_6_1_RP_0, P_network_6_1_RP_1, P_network_6_1_RP_2, P_network_6_1_RP_3, P_network_6_1_RP_4, P_network_6_1_RP_5, P_network_6_1_RP_6, P_network_6_2_AskP_0, P_network_6_2_AskP_1, P_network_6_2_AskP_2, P_network_6_2_AskP_3, P_network_6_2_AskP_4, P_network_6_2_AskP_5, P_network_6_2_AskP_6, P_network_6_2_AnsP_0, P_network_6_2_AnsP_1, P_network_6_2_AnsP_2, P_network_6_2_AnsP_3, P_network_6_2_AnsP_4, P_network_6_2_AnsP_5, P_network_6_2_AnsP_6, P_network_6_2_RI_0, P_network_6_2_RI_1, P_network_6_2_RI_2, P_network_6_2_RI_3, P_network_6_2_RI_4, P_network_6_2_RI_5, P_network_6_2_RI_6, P_network_6_2_AI_0, P_network_6_2_AI_1, P_network_6_2_AI_2, P_network_6_2_AI_3, P_network_6_2_AI_4, P_network_6_2_AI_5, P_network_6_2_AI_6, P_network_6_2_AnnP_0, P_network_6_2_AnnP_1, P_network_6_2_AnnP_2, P_network_6_2_AnnP_3, P_network_6_2_AnnP_4, P_network_6_2_AnnP_5, P_network_6_2_AnnP_6, P_network_6_2_RP_0, P_network_6_2_RP_1, P_network_6_2_RP_2, P_network_6_2_RP_3, P_network_6_2_RP_4, P_network_6_2_RP_5, P_network_6_2_RP_6, P_network_6_3_AskP_0, P_network_6_3_AskP_1, P_network_6_3_AskP_2, P_network_6_3_AskP_3, P_network_6_3_AskP_4, P_network_6_3_AskP_5, P_network_6_3_AskP_6, P_network_6_3_AnsP_0, P_network_6_3_AnsP_1, P_network_6_3_AnsP_2, P_network_6_3_AnsP_3, P_network_6_3_AnsP_4, P_network_6_3_AnsP_5, P_network_6_3_AnsP_6, P_network_6_3_RI_0, P_network_6_3_RI_1, P_network_6_3_RI_2, P_network_6_3_RI_3, P_network_6_3_RI_4, P_network_6_3_RI_5, P_network_6_3_RI_6, P_network_6_3_AI_0, P_network_6_3_AI_1, P_network_6_3_AI_2, P_network_6_3_AI_3, P_network_6_3_AI_4, P_network_6_3_AI_5, P_network_6_3_AI_6, P_network_6_3_AnnP_0, P_network_6_3_AnnP_1, P_network_6_3_AnnP_2, P_network_6_3_AnnP_3, P_network_6_3_AnnP_4, P_network_6_3_AnnP_5, P_network_6_3_AnnP_6, P_network_6_3_RP_0, P_network_6_3_RP_1, P_network_6_3_RP_2, P_network_6_3_RP_3, P_network_6_3_RP_4, P_network_6_3_RP_5, P_network_6_3_RP_6, P_network_6_4_AskP_0, P_network_6_4_AskP_1, P_network_6_4_AskP_2, P_network_6_4_AskP_3, P_network_6_4_AskP_4, P_network_6_4_AskP_5, P_network_6_4_AskP_6, P_network_6_4_AnsP_0, P_network_6_4_AnsP_1, P_network_6_4_AnsP_2, P_network_6_4_AnsP_3, P_network_6_4_AnsP_4, P_network_6_4_AnsP_5, P_network_6_4_AnsP_6, P_network_6_4_RI_0, P_network_6_4_RI_1, P_network_6_4_RI_2, P_network_6_4_RI_3, P_network_6_4_RI_4, P_network_6_4_RI_5, P_network_6_4_RI_6, P_network_6_4_AI_0, P_network_6_4_AI_1, P_network_6_4_AI_2, P_network_6_4_AI_3, P_network_6_4_AI_4, P_network_6_4_AI_5, P_network_6_4_AI_6, P_network_6_4_AnnP_0, P_network_6_4_AnnP_1, P_network_6_4_AnnP_2, P_network_6_4_AnnP_3, P_network_6_4_AnnP_4, P_network_6_4_AnnP_5, P_network_6_4_AnnP_6, P_network_6_4_RP_0, P_network_6_4_RP_1, P_network_6_4_RP_2, P_network_6_4_RP_3, P_network_6_4_RP_4, P_network_6_4_RP_5, P_network_6_4_RP_6, P_network_6_5_AskP_0, P_network_6_5_AskP_1, P_network_6_5_AskP_2, P_network_6_5_AskP_3, P_network_6_5_AskP_4, P_network_6_5_AskP_5, P_network_6_5_AskP_6, P_network_6_5_AnsP_0, P_network_6_5_AnsP_1, P_network_6_5_AnsP_2, P_network_6_5_AnsP_3, P_network_6_5_AnsP_4, P_network_6_5_AnsP_5, P_network_6_5_AnsP_6, P_network_6_5_RI_0, P_network_6_5_RI_1, P_network_6_5_RI_2, P_network_6_5_RI_3, P_network_6_5_RI_4, P_network_6_5_RI_5, P_network_6_5_RI_6, P_network_6_5_AI_0, P_network_6_5_AI_1, P_network_6_5_AI_2, P_network_6_5_AI_3, P_network_6_5_AI_4, P_network_6_5_AI_5, P_network_6_5_AI_6, P_network_6_5_AnnP_0, P_network_6_5_AnnP_1, P_network_6_5_AnnP_2, P_network_6_5_AnnP_3, P_network_6_5_AnnP_4, P_network_6_5_AnnP_5, P_network_6_5_AnnP_6, P_network_6_5_RP_0, P_network_6_5_RP_1, P_network_6_5_RP_2, P_network_6_5_RP_3, P_network_6_5_RP_4, P_network_6_5_RP_5, P_network_6_5_RP_6, P_network_6_6_AskP_0, P_network_6_6_AskP_1, P_network_6_6_AskP_2, P_network_6_6_AskP_3, P_network_6_6_AskP_4, P_network_6_6_AskP_5, P_network_6_6_AskP_6, P_network_6_6_AnsP_0, P_network_6_6_AnsP_1, P_network_6_6_AnsP_2, P_network_6_6_AnsP_3, P_network_6_6_AnsP_4, P_network_6_6_AnsP_5, P_network_6_6_AnsP_6, P_network_6_6_RI_0, P_network_6_6_RI_1, P_network_6_6_RI_2, P_network_6_6_RI_3, P_network_6_6_RI_4, P_network_6_6_RI_5, P_network_6_6_RI_6, P_network_6_6_AI_0, P_network_6_6_AI_1, P_network_6_6_AI_2, P_network_6_6_AI_3, P_network_6_6_AI_4, P_network_6_6_AI_5, P_network_6_6_AI_6, P_network_6_6_AnnP_0, P_network_6_6_AnnP_1, P_network_6_6_AnnP_2, P_network_6_6_AnnP_3, P_network_6_6_AnnP_4, P_network_6_6_AnnP_5, P_network_6_6_AnnP_6, P_network_6_6_RP_0, P_network_6_6_RP_1, P_network_6_6_RP_2, P_network_6_6_RP_3, P_network_6_6_RP_4, P_network_6_6_RP_5, P_network_6_6_RP_6, 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__handlingMessage_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_5_RP_6, P_poll__networl_0_6_AskP_0, P_poll__networl_0_6_AskP_1, P_poll__networl_0_6_AskP_2, P_poll__networl_0_6_AskP_3, P_poll__networl_0_6_AskP_4, P_poll__networl_0_6_AskP_5, P_poll__networl_0_6_AskP_6, P_poll__networl_0_6_AnsP_0, P_poll__networl_0_6_AnsP_1, P_poll__networl_0_6_AnsP_2, P_poll__networl_0_6_AnsP_3, P_poll__networl_0_6_AnsP_4, P_poll__networl_0_6_AnsP_5, P_poll__networl_0_6_AnsP_6, P_poll__networl_0_6_RI_0, P_poll__networl_0_6_RI_1, P_poll__networl_0_6_RI_2, P_poll__networl_0_6_RI_3, P_poll__networl_0_6_RI_4, P_poll__networl_0_6_RI_5, P_poll__networl_0_6_RI_6, P_poll__networl_0_6_AI_0, P_poll__networl_0_6_AI_1, P_poll__networl_0_6_AI_2, P_poll__networl_0_6_AI_3, P_poll__networl_0_6_AI_4, P_poll__networl_0_6_AI_5, P_poll__networl_0_6_AI_6, P_poll__networl_0_6_AnnP_0, P_poll__networl_0_6_AnnP_1, P_poll__networl_0_6_AnnP_2, P_poll__networl_0_6_AnnP_3, P_poll__networl_0_6_AnnP_4, P_poll__networl_0_6_AnnP_5, P_poll__networl_0_6_AnnP_6, P_poll__networl_0_6_RP_0, P_poll__networl_0_6_RP_1, P_poll__networl_0_6_RP_2, P_poll__networl_0_6_RP_3, P_poll__networl_0_6_RP_4, P_poll__networl_0_6_RP_5, P_poll__networl_0_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_5_RP_6, P_poll__networl_1_6_AskP_0, P_poll__networl_1_6_AskP_1, P_poll__networl_1_6_AskP_2, P_poll__networl_1_6_AskP_3, P_poll__networl_1_6_AskP_4, P_poll__networl_1_6_AskP_5, P_poll__networl_1_6_AskP_6, P_poll__networl_1_6_AnsP_0, P_poll__networl_1_6_AnsP_1, P_poll__networl_1_6_AnsP_2, P_poll__networl_1_6_AnsP_3, P_poll__networl_1_6_AnsP_4, P_poll__networl_1_6_AnsP_5, P_poll__networl_1_6_AnsP_6, P_poll__networl_1_6_RI_0, P_poll__networl_1_6_RI_1, P_poll__networl_1_6_RI_2, P_poll__networl_1_6_RI_3, P_poll__networl_1_6_RI_4, P_poll__networl_1_6_RI_5, P_poll__networl_1_6_RI_6, P_poll__networl_1_6_AI_0, P_poll__networl_1_6_AI_1, P_poll__networl_1_6_AI_2, P_poll__networl_1_6_AI_3, P_poll__networl_1_6_AI_4, P_poll__networl_1_6_AI_5, P_poll__networl_1_6_AI_6, P_poll__networl_1_6_AnnP_0, P_poll__networl_1_6_AnnP_1, P_poll__networl_1_6_AnnP_2, P_poll__networl_1_6_AnnP_3, P_poll__networl_1_6_AnnP_4, P_poll__networl_1_6_AnnP_5, P_poll__networl_1_6_AnnP_6, P_poll__networl_1_6_RP_0, P_poll__networl_1_6_RP_1, P_poll__networl_1_6_RP_2, P_poll__networl_1_6_RP_3, P_poll__networl_1_6_RP_4, P_poll__networl_1_6_RP_5, P_poll__networl_1_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_5_RP_6, P_poll__networl_2_6_AskP_0, P_poll__networl_2_6_AskP_1, P_poll__networl_2_6_AskP_2, P_poll__networl_2_6_AskP_3, P_poll__networl_2_6_AskP_4, P_poll__networl_2_6_AskP_5, P_poll__networl_2_6_AskP_6, P_poll__networl_2_6_AnsP_0, P_poll__networl_2_6_AnsP_1, P_poll__networl_2_6_AnsP_2, P_poll__networl_2_6_AnsP_3, P_poll__networl_2_6_AnsP_4, P_poll__networl_2_6_AnsP_5, P_poll__networl_2_6_AnsP_6, P_poll__networl_2_6_RI_0, P_poll__networl_2_6_RI_1, P_poll__networl_2_6_RI_2, P_poll__networl_2_6_RI_3, P_poll__networl_2_6_RI_4, P_poll__networl_2_6_RI_5, P_poll__networl_2_6_RI_6, P_poll__networl_2_6_AI_0, P_poll__networl_2_6_AI_1, P_poll__networl_2_6_AI_2, P_poll__networl_2_6_AI_3, P_poll__networl_2_6_AI_4, P_poll__networl_2_6_AI_5, P_poll__networl_2_6_AI_6, P_poll__networl_2_6_AnnP_0, P_poll__networl_2_6_AnnP_1, P_poll__networl_2_6_AnnP_2, P_poll__networl_2_6_AnnP_3, P_poll__networl_2_6_AnnP_4, P_poll__networl_2_6_AnnP_5, P_poll__networl_2_6_AnnP_6, P_poll__networl_2_6_RP_0, P_poll__networl_2_6_RP_1, P_poll__networl_2_6_RP_2, P_poll__networl_2_6_RP_3, P_poll__networl_2_6_RP_4, P_poll__networl_2_6_RP_5, P_poll__networl_2_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_5_RP_6, P_poll__networl_3_6_AskP_0, P_poll__networl_3_6_AskP_1, P_poll__networl_3_6_AskP_2, P_poll__networl_3_6_AskP_3, P_poll__networl_3_6_AskP_4, P_poll__networl_3_6_AskP_5, P_poll__networl_3_6_AskP_6, P_poll__networl_3_6_AnsP_0, P_poll__networl_3_6_AnsP_1, P_poll__networl_3_6_AnsP_2, P_poll__networl_3_6_AnsP_3, P_poll__networl_3_6_AnsP_4, P_poll__networl_3_6_AnsP_5, P_poll__networl_3_6_AnsP_6, P_poll__networl_3_6_RI_0, P_poll__networl_3_6_RI_1, P_poll__networl_3_6_RI_2, P_poll__networl_3_6_RI_3, P_poll__networl_3_6_RI_4, P_poll__networl_3_6_RI_5, P_poll__networl_3_6_RI_6, P_poll__networl_3_6_AI_0, P_poll__networl_3_6_AI_1, P_poll__networl_3_6_AI_2, P_poll__networl_3_6_AI_3, P_poll__networl_3_6_AI_4, P_poll__networl_3_6_AI_5, P_poll__networl_3_6_AI_6, P_poll__networl_3_6_AnnP_0, P_poll__networl_3_6_AnnP_1, P_poll__networl_3_6_AnnP_2, P_poll__networl_3_6_AnnP_3, P_poll__networl_3_6_AnnP_4, P_poll__networl_3_6_AnnP_5, P_poll__networl_3_6_AnnP_6, P_poll__networl_3_6_RP_0, P_poll__networl_3_6_RP_1, P_poll__networl_3_6_RP_2, P_poll__networl_3_6_RP_3, P_poll__networl_3_6_RP_4, P_poll__networl_3_6_RP_5, P_poll__networl_3_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_5_RP_6, P_poll__networl_4_6_AskP_0, P_poll__networl_4_6_AskP_1, P_poll__networl_4_6_AskP_2, P_poll__networl_4_6_AskP_3, P_poll__networl_4_6_AskP_4, P_poll__networl_4_6_AskP_5, P_poll__networl_4_6_AskP_6, P_poll__networl_4_6_AnsP_0, P_poll__networl_4_6_AnsP_1, P_poll__networl_4_6_AnsP_2, P_poll__networl_4_6_AnsP_3, P_poll__networl_4_6_AnsP_4, P_poll__networl_4_6_AnsP_5, P_poll__networl_4_6_AnsP_6, P_poll__networl_4_6_RI_0, P_poll__networl_4_6_RI_1, P_poll__networl_4_6_RI_2, P_poll__networl_4_6_RI_3, P_poll__networl_4_6_RI_4, P_poll__networl_4_6_RI_5, P_poll__networl_4_6_RI_6, P_poll__networl_4_6_AI_0, P_poll__networl_4_6_AI_1, P_poll__networl_4_6_AI_2, P_poll__networl_4_6_AI_3, P_poll__networl_4_6_AI_4, P_poll__networl_4_6_AI_5, P_poll__networl_4_6_AI_6, P_poll__networl_4_6_AnnP_0, P_poll__networl_4_6_AnnP_1, P_poll__networl_4_6_AnnP_2, P_poll__networl_4_6_AnnP_3, P_poll__networl_4_6_AnnP_4, P_poll__networl_4_6_AnnP_5, P_poll__networl_4_6_AnnP_6, P_poll__networl_4_6_RP_0, P_poll__networl_4_6_RP_1, P_poll__networl_4_6_RP_2, P_poll__networl_4_6_RP_3, P_poll__networl_4_6_RP_4, P_poll__networl_4_6_RP_5, P_poll__networl_4_6_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_0_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_1_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_2_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_3_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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_4_RP_6, 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_AskP_6, 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_AnsP_6, 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_RI_6, 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_AI_6, 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_AnnP_6, 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__networl_5_5_RP_6, P_poll__networl_5_6_AskP_0, P_poll__networl_5_6_AskP_1, P_poll__networl_5_6_AskP_2, P_poll__networl_5_6_AskP_3, P_poll__networl_5_6_AskP_4, P_poll__networl_5_6_AskP_5, P_poll__networl_5_6_AskP_6, P_poll__networl_5_6_AnsP_0, P_poll__networl_5_6_AnsP_1, P_poll__networl_5_6_AnsP_2, P_poll__networl_5_6_AnsP_3, P_poll__networl_5_6_AnsP_4, P_poll__networl_5_6_AnsP_5, P_poll__networl_5_6_AnsP_6, P_poll__networl_5_6_RI_0, P_poll__networl_5_6_RI_1, P_poll__networl_5_6_RI_2, P_poll__networl_5_6_RI_3, P_poll__networl_5_6_RI_4, P_poll__networl_5_6_RI_5, P_poll__networl_5_6_RI_6, P_poll__networl_5_6_AI_0, P_poll__networl_5_6_AI_1, P_poll__networl_5_6_AI_2, P_poll__networl_5_6_AI_3, P_poll__networl_5_6_AI_4, P_poll__networl_5_6_AI_5, P_poll__networl_5_6_AI_6, P_poll__networl_5_6_AnnP_0, P_poll__networl_5_6_AnnP_1, P_poll__networl_5_6_AnnP_2, P_poll__networl_5_6_AnnP_3, P_poll__networl_5_6_AnnP_4, P_poll__networl_5_6_AnnP_5, P_poll__networl_5_6_AnnP_6, P_poll__networl_5_6_RP_0, P_poll__networl_5_6_RP_1, P_poll__networl_5_6_RP_2, P_poll__networl_5_6_RP_3, P_poll__networl_5_6_RP_4, P_poll__networl_5_6_RP_5, P_poll__networl_5_6_RP_6, P_poll__networl_6_0_AskP_0, P_poll__networl_6_0_AskP_1, P_poll__networl_6_0_AskP_2, P_poll__networl_6_0_AskP_3, P_poll__networl_6_0_AskP_4, P_poll__networl_6_0_AskP_5, P_poll__networl_6_0_AskP_6, P_poll__networl_6_0_AnsP_0, P_poll__networl_6_0_AnsP_1, P_poll__networl_6_0_AnsP_2, P_poll__networl_6_0_AnsP_3, P_poll__networl_6_0_AnsP_4, P_poll__networl_6_0_AnsP_5, P_poll__networl_6_0_AnsP_6, P_poll__networl_6_0_RI_0, P_poll__networl_6_0_RI_1, P_poll__networl_6_0_RI_2, P_poll__networl_6_0_RI_3, P_poll__networl_6_0_RI_4, P_poll__networl_6_0_RI_5, P_poll__networl_6_0_RI_6, P_poll__networl_6_0_AI_0, P_poll__networl_6_0_AI_1, P_poll__networl_6_0_AI_2, P_poll__networl_6_0_AI_3, P_poll__networl_6_0_AI_4, P_poll__networl_6_0_AI_5, P_poll__networl_6_0_AI_6, P_poll__networl_6_0_AnnP_0, P_poll__networl_6_0_AnnP_1, P_poll__networl_6_0_AnnP_2, P_poll__networl_6_0_AnnP_3, P_poll__networl_6_0_AnnP_4, P_poll__networl_6_0_AnnP_5, P_poll__networl_6_0_AnnP_6, P_poll__networl_6_0_RP_0, P_poll__networl_6_0_RP_1, P_poll__networl_6_0_RP_2, P_poll__networl_6_0_RP_3, P_poll__networl_6_0_RP_4, P_poll__networl_6_0_RP_5, P_poll__networl_6_0_RP_6, P_poll__networl_6_1_AskP_0, P_poll__networl_6_1_AskP_1, P_poll__networl_6_1_AskP_2, P_poll__networl_6_1_AskP_3, P_poll__networl_6_1_AskP_4, P_poll__networl_6_1_AskP_5, P_poll__networl_6_1_AskP_6, P_poll__networl_6_1_AnsP_0, P_poll__networl_6_1_AnsP_1, P_poll__networl_6_1_AnsP_2, P_poll__networl_6_1_AnsP_3, P_poll__networl_6_1_AnsP_4, P_poll__networl_6_1_AnsP_5, P_poll__networl_6_1_AnsP_6, P_poll__networl_6_1_RI_0, P_poll__networl_6_1_RI_1, P_poll__networl_6_1_RI_2, P_poll__networl_6_1_RI_3, P_poll__networl_6_1_RI_4, P_poll__networl_6_1_RI_5, P_poll__networl_6_1_RI_6, P_poll__networl_6_1_AI_0, P_poll__networl_6_1_AI_1, P_poll__networl_6_1_AI_2, P_poll__networl_6_1_AI_3, P_poll__networl_6_1_AI_4, P_poll__networl_6_1_AI_5, P_poll__networl_6_1_AI_6, P_poll__networl_6_1_AnnP_0, P_poll__networl_6_1_AnnP_1, P_poll__networl_6_1_AnnP_2, P_poll__networl_6_1_AnnP_3, P_poll__networl_6_1_AnnP_4, P_poll__networl_6_1_AnnP_5, P_poll__networl_6_1_AnnP_6, P_poll__networl_6_1_RP_0, P_poll__networl_6_1_RP_1, P_poll__networl_6_1_RP_2, P_poll__networl_6_1_RP_3, P_poll__networl_6_1_RP_4, P_poll__networl_6_1_RP_5, P_poll__networl_6_1_RP_6, P_poll__networl_6_2_AskP_0, P_poll__networl_6_2_AskP_1, P_poll__networl_6_2_AskP_2, P_poll__networl_6_2_AskP_3, P_poll__networl_6_2_AskP_4, P_poll__networl_6_2_AskP_5, P_poll__networl_6_2_AskP_6, P_poll__networl_6_2_AnsP_0, P_poll__networl_6_2_AnsP_1, P_poll__networl_6_2_AnsP_2, P_poll__networl_6_2_AnsP_3, P_poll__networl_6_2_AnsP_4, P_poll__networl_6_2_AnsP_5, P_poll__networl_6_2_AnsP_6, P_poll__networl_6_2_RI_0, P_poll__networl_6_2_RI_1, P_poll__networl_6_2_RI_2, P_poll__networl_6_2_RI_3, P_poll__networl_6_2_RI_4, P_poll__networl_6_2_RI_5, P_poll__networl_6_2_RI_6, P_poll__networl_6_2_AI_0, P_poll__networl_6_2_AI_1, P_poll__networl_6_2_AI_2, P_poll__networl_6_2_AI_3, P_poll__networl_6_2_AI_4, P_poll__networl_6_2_AI_5, P_poll__networl_6_2_AI_6, P_poll__networl_6_2_AnnP_0, P_poll__networl_6_2_AnnP_1, P_poll__networl_6_2_AnnP_2, P_poll__networl_6_2_AnnP_3, P_poll__networl_6_2_AnnP_4, P_poll__networl_6_2_AnnP_5, P_poll__networl_6_2_AnnP_6, P_poll__networl_6_2_RP_0, P_poll__networl_6_2_RP_1, P_poll__networl_6_2_RP_2, P_poll__networl_6_2_RP_3, P_poll__networl_6_2_RP_4, P_poll__networl_6_2_RP_5, P_poll__networl_6_2_RP_6, P_poll__networl_6_3_AskP_0, P_poll__networl_6_3_AskP_1, P_poll__networl_6_3_AskP_2, P_poll__networl_6_3_AskP_3, P_poll__networl_6_3_AskP_4, P_poll__networl_6_3_AskP_5, P_poll__networl_6_3_AskP_6, P_poll__networl_6_3_AnsP_0, P_poll__networl_6_3_AnsP_1, P_poll__networl_6_3_AnsP_2, P_poll__networl_6_3_AnsP_3, P_poll__networl_6_3_AnsP_4, P_poll__networl_6_3_AnsP_5, P_poll__networl_6_3_AnsP_6, P_poll__networl_6_3_RI_0, P_poll__networl_6_3_RI_1, P_poll__networl_6_3_RI_2, P_poll__networl_6_3_RI_3, P_poll__networl_6_3_RI_4, P_poll__networl_6_3_RI_5, P_poll__networl_6_3_RI_6, P_poll__networl_6_3_AI_0, P_poll__networl_6_3_AI_1, P_poll__networl_6_3_AI_2, P_poll__networl_6_3_AI_3, P_poll__networl_6_3_AI_4, P_poll__networl_6_3_AI_5, P_poll__networl_6_3_AI_6, P_poll__networl_6_3_AnnP_0, P_poll__networl_6_3_AnnP_1, P_poll__networl_6_3_AnnP_2, P_poll__networl_6_3_AnnP_3, P_poll__networl_6_3_AnnP_4, P_poll__networl_6_3_AnnP_5, P_poll__networl_6_3_AnnP_6, P_poll__networl_6_3_RP_0, P_poll__networl_6_3_RP_1, P_poll__networl_6_3_RP_2, P_poll__networl_6_3_RP_3, P_poll__networl_6_3_RP_4, P_poll__networl_6_3_RP_5, P_poll__networl_6_3_RP_6, P_poll__networl_6_4_AskP_0, P_poll__networl_6_4_AskP_1, P_poll__networl_6_4_AskP_2, P_poll__networl_6_4_AskP_3, P_poll__networl_6_4_AskP_4, P_poll__networl_6_4_AskP_5, P_poll__networl_6_4_AskP_6, P_poll__networl_6_4_AnsP_0, P_poll__networl_6_4_AnsP_1, P_poll__networl_6_4_AnsP_2, P_poll__networl_6_4_AnsP_3, P_poll__networl_6_4_AnsP_4, P_poll__networl_6_4_AnsP_5, P_poll__networl_6_4_AnsP_6, P_poll__networl_6_4_RI_0, P_poll__networl_6_4_RI_1, P_poll__networl_6_4_RI_2, P_poll__networl_6_4_RI_3, P_poll__networl_6_4_RI_4, P_poll__networl_6_4_RI_5, P_poll__networl_6_4_RI_6, P_poll__networl_6_4_AI_0, P_poll__networl_6_4_AI_1, P_poll__networl_6_4_AI_2, P_poll__networl_6_4_AI_3, P_poll__networl_6_4_AI_4, P_poll__networl_6_4_AI_5, P_poll__networl_6_4_AI_6, P_poll__networl_6_4_AnnP_0, P_poll__networl_6_4_AnnP_1, P_poll__networl_6_4_AnnP_2, P_poll__networl_6_4_AnnP_3, P_poll__networl_6_4_AnnP_4, P_poll__networl_6_4_AnnP_5, P_poll__networl_6_4_AnnP_6, P_poll__networl_6_4_RP_0, P_poll__networl_6_4_RP_1, P_poll__networl_6_4_RP_2, P_poll__networl_6_4_RP_3, P_poll__networl_6_4_RP_4, P_poll__networl_6_4_RP_5, P_poll__networl_6_4_RP_6, P_poll__networl_6_5_AskP_0, P_poll__networl_6_5_AskP_1, P_poll__networl_6_5_AskP_2, P_poll__networl_6_5_AskP_3, P_poll__networl_6_5_AskP_4, P_poll__networl_6_5_AskP_5, P_poll__networl_6_5_AskP_6, P_poll__networl_6_5_AnsP_0, P_poll__networl_6_5_AnsP_1, P_poll__networl_6_5_AnsP_2, P_poll__networl_6_5_AnsP_3, P_poll__networl_6_5_AnsP_4, P_poll__networl_6_5_AnsP_5, P_poll__networl_6_5_AnsP_6, P_poll__networl_6_5_RI_0, P_poll__networl_6_5_RI_1, P_poll__networl_6_5_RI_2, P_poll__networl_6_5_RI_3, P_poll__networl_6_5_RI_4, P_poll__networl_6_5_RI_5, P_poll__networl_6_5_RI_6, P_poll__networl_6_5_AI_0, P_poll__networl_6_5_AI_1, P_poll__networl_6_5_AI_2, P_poll__networl_6_5_AI_3, P_poll__networl_6_5_AI_4, P_poll__networl_6_5_AI_5, P_poll__networl_6_5_AI_6, P_poll__networl_6_5_AnnP_0, P_poll__networl_6_5_AnnP_1, P_poll__networl_6_5_AnnP_2, P_poll__networl_6_5_AnnP_3, P_poll__networl_6_5_AnnP_4, P_poll__networl_6_5_AnnP_5, P_poll__networl_6_5_AnnP_6, P_poll__networl_6_5_RP_0, P_poll__networl_6_5_RP_1, P_poll__networl_6_5_RP_2, P_poll__networl_6_5_RP_3, P_poll__networl_6_5_RP_4, P_poll__networl_6_5_RP_5, P_poll__networl_6_5_RP_6, P_poll__networl_6_6_AskP_0, P_poll__networl_6_6_AskP_1, P_poll__networl_6_6_AskP_2, P_poll__networl_6_6_AskP_3, P_poll__networl_6_6_AskP_4, P_poll__networl_6_6_AskP_5, P_poll__networl_6_6_AskP_6, P_poll__networl_6_6_AnsP_0, P_poll__networl_6_6_AnsP_1, P_poll__networl_6_6_AnsP_2, P_poll__networl_6_6_AnsP_3, P_poll__networl_6_6_AnsP_4, P_poll__networl_6_6_AnsP_5, P_poll__networl_6_6_AnsP_6, P_poll__networl_6_6_RI_0, P_poll__networl_6_6_RI_1, P_poll__networl_6_6_RI_2, P_poll__networl_6_6_RI_3, P_poll__networl_6_6_RI_4, P_poll__networl_6_6_RI_5, P_poll__networl_6_6_RI_6, P_poll__networl_6_6_AI_0, P_poll__networl_6_6_AI_1, P_poll__networl_6_6_AI_2, P_poll__networl_6_6_AI_3, P_poll__networl_6_6_AI_4, P_poll__networl_6_6_AI_5, P_poll__networl_6_6_AI_6, P_poll__networl_6_6_AnnP_0, P_poll__networl_6_6_AnnP_1, P_poll__networl_6_6_AnnP_2, P_poll__networl_6_6_AnnP_3, P_poll__networl_6_6_AnnP_4, P_poll__networl_6_6_AnnP_5, P_poll__networl_6_6_AnnP_6, P_poll__networl_6_6_RP_0, P_poll__networl_6_6_RP_1, P_poll__networl_6_6_RP_2, P_poll__networl_6_6_RP_3, P_poll__networl_6_6_RP_4, P_poll__networl_6_6_RP_5, P_poll__networl_6_6_RP_6, 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__pollEnd_6, 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_poll__waitingMessage_6, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_polling_4, P_polling_5, P_polling_6, 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_0_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_sendAnnPs__broadcasting_5_6, P_sendAnnPs__broadcasting_6_1, P_sendAnnPs__broadcasting_6_2, P_sendAnnPs__broadcasting_6_3, P_sendAnnPs__broadcasting_6_4, P_sendAnnPs__broadcasting_6_5, P_sendAnnPs__broadcasting_6_6, 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_stage_6_NEG, P_stage_6_PRIM, P_stage_6_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_0_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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, P_startNeg__broadcasting_5_6, P_startNeg__broadcasting_6_1, P_startNeg__broadcasting_6_2, P_startNeg__broadcasting_6_3, P_startNeg__broadcasting_6_4, P_startNeg__broadcasting_6_5, P_startNeg__broadcasting_6_6]
[2024-06-01 10:57:43] [INFO ] Parsed PT model containing 4830 places and 8435 transitions and 49028 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4507 places in 25 ms
Reduce places removed 4537 places and 8041 transitions.
Reduce places removed 13 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-PT-6-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-6-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 181 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 54 place count 226 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 78 place count 226 transition count 214
Applied a total of 78 rules in 24 ms. Remains 226 /280 variables (removed 54) and now considering 214/394 (removed 180) transitions.
[2024-06-01 10:57:43] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 226 cols
[2024-06-01 10:57:43] [INFO ] Computed 47 invariants in 24 ms
[2024-06-01 10:57:43] [INFO ] Implicit Places using invariants in 249 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 279 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/280 places, 214/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 190/280 places, 214/394 transitions.
Support contains 181 out of 190 places after structural reductions.
[2024-06-01 10:57:43] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:57:43] [INFO ] Flatten gal took : 20 ms
[2024-06-01 10:57:44] [INFO ] Input system was already deterministic with 214 transitions.
RANDOM walk for 40000 steps (96 resets) in 864 ms. (46 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (16 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
[2024-06-01 10:57:44] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-06-01 10:57:44] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 10:57:44] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 60/379 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, State Equation: 0/190 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA NeoElection-PT-6-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 190 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 214
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 164 transition count 178
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 164 transition count 178
Applied a total of 52 rules in 15 ms. Remains 164 /190 variables (removed 26) and now considering 178/214 (removed 36) transitions.
[2024-06-01 10:57:44] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2024-06-01 10:57:44] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 10:57:44] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 10:57:44] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-06-01 10:57:44] [INFO ] Invariant cache hit.
[2024-06-01 10:57:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 10:57:45] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-06-01 10:57:45] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-06-01 10:57:45] [INFO ] Invariant cache hit.
[2024-06-01 10:57:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:47] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 10 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:57:48] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 10/210 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:57:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:57:51] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:57:52] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 16/226 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:52] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:57:52] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 2/228 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:57:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:57:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 3/232 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 10:57:55] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 233 constraints, problems are : Problem set: 1 solved, 171 unsolved in 13573 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 53/64 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/228 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 404 constraints, problems are : Problem set: 1 solved, 171 unsolved in 7438 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 53/53 constraints]
After SMT, in 21121ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 21130ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 177/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21409 ms. Remains : 164/190 places, 177/214 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NeoElection-PT-6-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-6-LTLCardinality-00 finished in 21640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(((p1 U p0)||G(F(p2))))))))'
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-01 10:58:06] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-06-01 10:58:06] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 10:58:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 10:58:06] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 10:58:06] [INFO ] Invariant cache hit.
[2024-06-01 10:58:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 10:58:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:58:06] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 10:58:06] [INFO ] Invariant cache hit.
[2024-06-01 10:58:06] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/379 variables, 190/201 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 15/216 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:58:09] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:58:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:58:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:58:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:58:11] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:58:12] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:58:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:58:13] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 20/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:58:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:58:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:58:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:58:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 5/261 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:16] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:58:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 2/263 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:17] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-06-01 10:58:17] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:58:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:58:17] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:58:18] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 5/268 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 10:58:19] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:58:19] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:58:19] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:58:20] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 272 constraints, problems are : Problem set: 1 solved, 207 unsolved in 16996 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 56/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 189/379 variables, 190/257 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 15/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 207/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 479 constraints, problems are : Problem set: 1 solved, 207 unsolved in 10229 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 56/56 constraints]
After SMT, in 27308ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 27311ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/190 places, 213/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27461 ms. Remains : 190/190 places, 213/214 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 20953 reset in 424 ms.
Product exploration explored 100000 steps with 20945 reset in 357 ms.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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 : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 209 steps (0 resets) in 8 ms. (23 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 485 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-06-01 10:58:36] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
// Phase 1: matrix 188 rows 190 cols
[2024-06-01 10:58:36] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 10:58:36] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 10:58:36] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 10:58:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:58:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 10:58:37] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 10:58:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 10:58:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:37] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:58:38] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:58:38] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:58:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 957 ms
[2024-06-01 10:58:38] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 11 ms.
[2024-06-01 10:58:38] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-06-01 10:58:38] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 10:58:38] [INFO ] Invariant cache hit.
[2024-06-01 10:58:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 10:58:38] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 10:58:38] [INFO ] Invariant cache hit.
[2024-06-01 10:58:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 10:58:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 10:58:38] [INFO ] Redundant transitions in 10 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-01 10:58:38] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 10:58:38] [INFO ] Invariant cache hit.
[2024-06-01 10:58:38] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:39] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:58:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/204 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:42] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:58:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:58:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:58:45] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:58:45] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:58:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:58:45] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:58:45] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:58:46] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:58:47] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:49] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:58:49] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:58:51] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:52] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:54] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:58:54] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:58:54] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:58:54] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/378 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:58:56] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 17 (OVERLAPS) 0/378 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 273 constraints, problems are : Problem set: 0 solved, 207 unsolved in 22267 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/259 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 207/480 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 10:59:04] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:59:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 482 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13939 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 59/59 constraints]
After SMT, in 36304ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 36306ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36473 ms. Remains : 190/190 places, 213/213 transitions.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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 : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 442 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 164 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 773 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-06-01 10:59:16] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 10:59:16] [INFO ] Invariant cache hit.
[2024-06-01 10:59:16] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 10:59:17] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-01 10:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:59:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 10:59:17] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 10:59:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 10:59:17] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:59:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:59:18] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 961 ms
[2024-06-01 10:59:18] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 12 ms.
[2024-06-01 10:59:18] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 20972 reset in 388 ms.
Product exploration explored 100000 steps with 20930 reset in 397 ms.
Support contains 126 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 213/213 transitions.
Reduce places removed 6 places and 6 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 178 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 178 transition count 201
Applied a total of 12 rules in 9 ms. Remains 178 /190 variables (removed 12) and now considering 201/213 (removed 12) transitions.
[2024-06-01 10:59:19] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
// Phase 1: matrix 176 rows 178 cols
[2024-06-01 10:59:19] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 10:59:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 10:59:19] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
[2024-06-01 10:59:19] [INFO ] Invariant cache hit.
[2024-06-01 10:59:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 10:59:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 10:59:19] [INFO ] Redundant transitions in 5 ms returned []
Running 195 sub problems to find dead transitions.
[2024-06-01 10:59:19] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
[2024-06-01 10:59:19] [INFO ] Invariant cache hit.
[2024-06-01 10:59:19] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 6/178 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 176/354 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:24] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/354 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:59:25] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 211 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9152 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 6/178 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 176/354 variables, 178/197 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 195/406 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:59:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:59:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:59:31] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:59:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:59:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 19/425 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:59:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 9/435 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:43] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 10:59:47] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/354 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 0/354 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 437 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 38/38 constraints]
After SMT, in 39232ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 39234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/190 places, 201/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39413 ms. Remains : 178/190 places, 201/213 transitions.
Treatment of property NeoElection-PT-6-LTLCardinality-01 finished in 112394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(G(p0)||F(p1))))))'
Support contains 162 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-01 10:59:58] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-06-01 10:59:58] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 10:59:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 10:59:58] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 10:59:58] [INFO ] Invariant cache hit.
[2024-06-01 10:59:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 10:59:58] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 10:59:58] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 10:59:58] [INFO ] Invariant cache hit.
[2024-06-01 10:59:58] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/379 variables, 190/201 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 15/216 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:01] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:00:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:00:01] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:02] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:00:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:00:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 20/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:00:06] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:07] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:00:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 5/261 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:09] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:00:09] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 2/263 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:10] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:00:10] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:00:10] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:00:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:00:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 5/268 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:00:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:00:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:00:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:00:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 272 constraints, problems are : Problem set: 1 solved, 207 unsolved in 17881 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 56/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 189/379 variables, 190/257 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 15/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 207/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 479 constraints, problems are : Problem set: 1 solved, 207 unsolved in 10955 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 56/56 constraints]
After SMT, in 28921ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 28924ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/190 places, 213/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29083 ms. Remains : 190/190 places, 213/214 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-6-LTLCardinality-05 finished in 29396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 6 places and 6 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 184 transition count 202
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 178 transition count 202
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 32 place count 158 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 52 place count 158 transition count 172
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 112 place count 128 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 122 transition count 136
Applied a total of 118 rules in 30 ms. Remains 122 /190 variables (removed 68) and now considering 136/214 (removed 78) transitions.
[2024-06-01 11:00:28] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2024-06-01 11:00:28] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 11:00:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 11:00:28] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-06-01 11:00:28] [INFO ] Invariant cache hit.
[2024-06-01 11:00:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 11:00:28] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 11:00:28] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 11:00:28] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-06-01 11:00:28] [INFO ] Invariant cache hit.
[2024-06-01 11:00:28] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/228 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD98 is UNSAT
At refinement iteration 5 (OVERLAPS) 5/233 variables, 5/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 138 constraints, problems are : Problem set: 1 solved, 105 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 111/228 variables, 117/128 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 5/133 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 105/238 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 5/233 variables, 5/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 243 constraints, problems are : Problem set: 1 solved, 105 unsolved in 3105 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 105/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5237ms problems are : Problem set: 1 solved, 105 unsolved
Search for dead transitions found 1 dead transitions in 5238ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/190 places, 135/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-06-01 11:00:33] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 5475 ms. Remains : 122/190 places, 135/214 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-06
Product exploration explored 100000 steps with 8804 reset in 423 ms.
Product exploration explored 100000 steps with 8843 reset in 387 ms.
Computed a total of 122 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 135
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 104 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-6-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-6-LTLCardinality-06 finished in 6746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 164 transition count 178
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 164 transition count 178
Applied a total of 52 rules in 7 ms. Remains 164 /190 variables (removed 26) and now considering 178/214 (removed 36) transitions.
[2024-06-01 11:00:34] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2024-06-01 11:00:34] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 11:00:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 11:00:35] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-06-01 11:00:35] [INFO ] Invariant cache hit.
[2024-06-01 11:00:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 11:00:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-06-01 11:00:35] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-06-01 11:00:35] [INFO ] Invariant cache hit.
[2024-06-01 11:00:35] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:39] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:39] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 10/210 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 16/226 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:00:42] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 2/228 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:43] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:00:44] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:00:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 3/232 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-06-01 11:00:45] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 233 constraints, problems are : Problem set: 1 solved, 171 unsolved in 13378 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 53/64 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/228 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/233 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 404 constraints, problems are : Problem set: 1 solved, 171 unsolved in 7686 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 53/53 constraints]
After SMT, in 21117ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 21119ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 177/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21328 ms. Remains : 164/190 places, 177/214 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-13
Product exploration explored 100000 steps with 14316 reset in 122 ms.
Product exploration explored 100000 steps with 14186 reset in 132 ms.
Computed a total of 164 stabilizing places and 177 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 177
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 : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-6-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-6-LTLCardinality-13 finished in 21756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 185 transition count 209
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 185 transition count 203
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 179 transition count 203
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 40 place count 153 transition count 167
Iterating global reduction 2 with 26 rules applied. Total rules applied 66 place count 153 transition count 167
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 66 place count 153 transition count 161
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 147 transition count 161
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 126 place count 123 transition count 137
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 119 transition count 133
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 296 edges and 115 vertex of which 99 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 144 place count 99 transition count 108
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 153 place count 90 transition count 108
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 153 place count 90 transition count 97
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 175 place count 79 transition count 97
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 191 place count 63 transition count 78
Iterating global reduction 4 with 16 rules applied. Total rules applied 207 place count 63 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 63 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 62 transition count 77
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 218 place count 53 transition count 64
Iterating global reduction 4 with 9 rules applied. Total rules applied 227 place count 53 transition count 64
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 4 with 4 rules applied. Total rules applied 231 place count 51 transition count 62
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 4 with 4 rules applied. Total rules applied 235 place count 49 transition count 60
Applied a total of 235 rules in 42 ms. Remains 49 /190 variables (removed 141) and now considering 60/214 (removed 154) transitions.
[2024-06-01 11:00:56] [INFO ] Flow matrix only has 42 transitions (discarded 18 similar events)
// Phase 1: matrix 42 rows 49 cols
[2024-06-01 11:00:56] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 11:00:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 11:00:56] [INFO ] Flow matrix only has 42 transitions (discarded 18 similar events)
[2024-06-01 11:00:56] [INFO ] Invariant cache hit.
[2024-06-01 11:00:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 11:00:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-06-01 11:00:56] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 11:00:56] [INFO ] Flow matrix only has 42 transitions (discarded 18 similar events)
[2024-06-01 11:00:56] [INFO ] Invariant cache hit.
[2024-06-01 11:00:56] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/49 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 42/91 variables, 49/56 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 24/80 constraints. Problems are: Problem set: 1 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 80 constraints, problems are : Problem set: 1 solved, 48 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/48 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 41/89 variables, 48/55 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 23/78 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 48/126 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 2/91 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 128 constraints, problems are : Problem set: 1 solved, 48 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 48/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1141ms problems are : Problem set: 1 solved, 48 unsolved
Search for dead transitions found 1 dead transitions in 1142ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/190 places, 59/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 49 /49 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:00:58] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1301 ms. Remains : 49/190 places, 59/214 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-14
Product exploration explored 100000 steps with 2174 reset in 232 ms.
Product exploration explored 100000 steps with 2220 reset in 209 ms.
Computed a total of 49 stabilizing places and 59 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 59
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 : [(AND p0 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-6-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-6-LTLCardinality-14 finished in 1881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(((p1 U p0)||G(F(p2))))))))'
Found a Shortening insensitive property : NeoElection-PT-6-LTLCardinality-01
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-01 11:00:58] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-06-01 11:00:58] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 11:00:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:00:58] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 11:00:58] [INFO ] Invariant cache hit.
[2024-06-01 11:00:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 11:00:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-01 11:00:59] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-06-01 11:00:59] [INFO ] Invariant cache hit.
[2024-06-01 11:00:59] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/379 variables, 190/201 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 15/216 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:01] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:01:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:01:01] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:02] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:01:02] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:01:02] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:01:02] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:01:02] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:01:03] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:05] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 20/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:01:06] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:01:07] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:01:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 5/261 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:09] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:01:09] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 2/263 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:10] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:01:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:01:10] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:01:10] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 5/268 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-06-01 11:01:11] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:01:11] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:01:11] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:01:12] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 4/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 272 constraints, problems are : Problem set: 1 solved, 207 unsolved in 17379 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 56/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 189/379 variables, 190/257 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 15/272 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 207/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 479 constraints, problems are : Problem set: 1 solved, 207 unsolved in 10384 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 56/56 constraints]
After SMT, in 27831ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 27834ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 190/190 places, 213/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 27994 ms. Remains : 190/190 places, 213/214 transitions.
Running random walk in product with property : NeoElection-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 20961 reset in 286 ms.
Product exploration explored 100000 steps with 20864 reset in 299 ms.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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 : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 175 steps (0 resets) in 8 ms. (19 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 526 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-06-01 11:01:28] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
// Phase 1: matrix 188 rows 190 cols
[2024-06-01 11:01:29] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 11:01:29] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 11:01:29] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-06-01 11:01:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 11:01:29] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 11:01:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 11:01:29] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:01:29] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:01:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 900 ms
[2024-06-01 11:01:30] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 12 ms.
[2024-06-01 11:01:30] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-06-01 11:01:30] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 11:01:30] [INFO ] Invariant cache hit.
[2024-06-01 11:01:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 11:01:30] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 11:01:30] [INFO ] Invariant cache hit.
[2024-06-01 11:01:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 11:01:30] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-01 11:01:30] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-06-01 11:01:30] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 11:01:30] [INFO ] Invariant cache hit.
[2024-06-01 11:01:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:32] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:01:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/204 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:01:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:01:36] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:01:36] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:01:39] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:01:40] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:42] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:01:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:43] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:01:44] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:01:47] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:01:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:01:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/378 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:48] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 17 (OVERLAPS) 0/378 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 273 constraints, problems are : Problem set: 0 solved, 207 unsolved in 22490 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/259 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/273 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 207/480 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-06-01 11:01:58] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:01:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 482 constraints, problems are : Problem set: 0 solved, 207 unsolved in 15219 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 59/59 constraints]
After SMT, in 37776ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 37779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37943 ms. Remains : 190/190 places, 213/213 transitions.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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 : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 593 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 169 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 742 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-06-01 11:02:10] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-06-01 11:02:10] [INFO ] Invariant cache hit.
[2024-06-01 11:02:11] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 11:02:11] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 11:02:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:02:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 11:02:11] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 11:02:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 11:02:11] [INFO ] [Nat]Added 14 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:02:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:02:11] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:02:11] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:02:11] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:02:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:02:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 978 ms
[2024-06-01 11:02:12] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 12 ms.
[2024-06-01 11:02:12] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 21002 reset in 374 ms.
Product exploration explored 100000 steps with 20927 reset in 382 ms.
Support contains 126 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 213/213 transitions.
Reduce places removed 6 places and 6 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 178 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 178 transition count 201
Applied a total of 12 rules in 8 ms. Remains 178 /190 variables (removed 12) and now considering 201/213 (removed 12) transitions.
[2024-06-01 11:02:13] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
// Phase 1: matrix 176 rows 178 cols
[2024-06-01 11:02:13] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 11:02:13] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 11:02:13] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
[2024-06-01 11:02:13] [INFO ] Invariant cache hit.
[2024-06-01 11:02:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 11:02:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 11:02:13] [INFO ] Redundant transitions in 0 ms returned []
Running 195 sub problems to find dead transitions.
[2024-06-01 11:02:13] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
[2024-06-01 11:02:13] [INFO ] Invariant cache hit.
[2024-06-01 11:02:13] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 6/178 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 176/354 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:18] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/354 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:02:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:02:19] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:02:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:02:20] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:02:20] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 211 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9483 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 6/178 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 176/354 variables, 178/197 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 195/406 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:02:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:02:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:02:25] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:02:27] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:02:28] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 19/425 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:29] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:02:34] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:02:35] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 9/435 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:38] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 11:02:43] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/354 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 0/354 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 437 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 38/38 constraints]
After SMT, in 39569ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 39571ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/190 places, 201/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39735 ms. Remains : 178/190 places, 201/213 transitions.
Treatment of property NeoElection-PT-6-LTLCardinality-01 finished in 114827 ms.
[2024-06-01 11:02:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 11:02:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:02:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 214 transitions and 893 arcs took 5 ms.
Total runtime 310957 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is NeoElection-PT-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351800531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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