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.r245-tall-171654350100516.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 greatspnxred
Input is NeoElection-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350100516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.2M
-rw-r--r-- 1 mcc users 256K Apr 11 18:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 819K Apr 11 18:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 484K Apr 11 18:23 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 162K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 392K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 427K Apr 11 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 43K Apr 23 07:40 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 2.1M 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-4-LTLFireability-00
FORMULA_NAME NeoElection-PT-4-LTLFireability-01
FORMULA_NAME NeoElection-PT-4-LTLFireability-02
FORMULA_NAME NeoElection-PT-4-LTLFireability-03
FORMULA_NAME NeoElection-PT-4-LTLFireability-04
FORMULA_NAME NeoElection-PT-4-LTLFireability-05
FORMULA_NAME NeoElection-PT-4-LTLFireability-06
FORMULA_NAME NeoElection-PT-4-LTLFireability-07
FORMULA_NAME NeoElection-PT-4-LTLFireability-08
FORMULA_NAME NeoElection-PT-4-LTLFireability-09
FORMULA_NAME NeoElection-PT-4-LTLFireability-10
FORMULA_NAME NeoElection-PT-4-LTLFireability-11
FORMULA_NAME NeoElection-PT-4-LTLFireability-12
FORMULA_NAME NeoElection-PT-4-LTLFireability-13
FORMULA_NAME NeoElection-PT-4-LTLFireability-14
FORMULA_NAME NeoElection-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716674442040

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 22:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 22:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:00:43] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-05-25 22:00:43] [INFO ] Transformed 1830 places.
[2024-05-25 22:00:43] [INFO ] Transformed 2340 transitions.
[2024-05-25 22:00:43] [INFO ] Found NUPN structural information;
[2024-05-25 22:00: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_dead_0, P_dead_1, P_dead_2, P_dead_3, P_dead_4, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedPrimary_4, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electedSecondary_4, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionFailed_4, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_electionInit_4, 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_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_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_4_0, P_masterList_0_4_1, P_masterList_0_4_2, P_masterList_0_4_3, P_masterList_0_4_4, 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_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_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_4_0, P_masterList_1_4_1, P_masterList_1_4_2, P_masterList_1_4_3, P_masterList_1_4_4, 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_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_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_4_0, P_masterList_2_4_1, P_masterList_2_4_2, P_masterList_2_4_3, P_masterList_2_4_4, 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_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_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_4_0, P_masterList_3_4_1, P_masterList_3_4_2, P_masterList_3_4_3, P_masterList_3_4_4, 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_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_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_4_0, P_masterList_4_4_1, P_masterList_4_4_2, P_masterList_4_4_3, P_masterList_4_4_4, 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_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_0_T_3, P_masterState_0_T_4, 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_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_1_T_3, P_masterState_1_T_4, 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_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_masterState_2_T_3, P_masterState_2_T_4, 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_T_0, P_masterState_3_T_1, P_masterState_3_T_2, P_masterState_3_T_3, P_masterState_3_T_4, 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_T_0, P_masterState_4_T_1, P_masterState_4_T_2, P_masterState_4_T_3, P_masterState_4_T_4, 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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, P_poll__handlingMessage_3, P_poll__handlingMessage_4, 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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__pollEnd_3, P_poll__pollEnd_4, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_poll__waitingMessage_3, P_poll__waitingMessage_4, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_polling_4, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_0_3, P_sendAnnPs__broadcasting_0_4, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_1_3, P_sendAnnPs__broadcasting_1_4, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, P_sendAnnPs__broadcasting_2_3, P_sendAnnPs__broadcasting_2_4, P_sendAnnPs__broadcasting_3_1, P_sendAnnPs__broadcasting_3_2, P_sendAnnPs__broadcasting_3_3, P_sendAnnPs__broadcasting_3_4, P_sendAnnPs__broadcasting_4_1, P_sendAnnPs__broadcasting_4_2, P_sendAnnPs__broadcasting_4_3, P_sendAnnPs__broadcasting_4_4, 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_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_0_3, P_startNeg__broadcasting_0_4, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_1_3, P_startNeg__broadcasting_1_4, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2, P_startNeg__broadcasting_2_3, P_startNeg__broadcasting_2_4, P_startNeg__broadcasting_3_1, P_startNeg__broadcasting_3_2, P_startNeg__broadcasting_3_3, P_startNeg__broadcasting_3_4, P_startNeg__broadcasting_4_1, P_startNeg__broadcasting_4_2, P_startNeg__broadcasting_4_3, P_startNeg__broadcasting_4_4]
[2024-05-25 22:00:43] [INFO ] Parsed PT model containing 1830 places and 2340 transitions and 13565 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1687 places in 8 ms
Reduce places removed 1699 places and 2213 transitions.
Reduce places removed 9 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-PT-4-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 26 place count 96 transition count 82
Iterating global reduction 1 with 14 rules applied. Total rules applied 40 place count 96 transition count 82
Applied a total of 40 rules in 22 ms. Remains 96 /122 variables (removed 26) and now considering 82/127 (removed 45) transitions.
[2024-05-25 22:00:43] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 96 cols
[2024-05-25 22:00:43] [INFO ] Computed 23 invariants in 17 ms
[2024-05-25 22:00:44] [INFO ] Implicit Places using invariants in 235 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 263 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/122 places, 82/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 301 ms. Remains : 80/122 places, 82/127 transitions.
Support contains 46 out of 80 places after structural reductions.
[2024-05-25 22:00:44] [INFO ] Flatten gal took : 27 ms
[2024-05-25 22:00:44] [INFO ] Flatten gal took : 12 ms
[2024-05-25 22:00:44] [INFO ] Input system was already deterministic with 82 transitions.
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 163 steps (0 resets) in 26 ms. (6 steps per ms) remains 0/7 properties
Computed a total of 80 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 82
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((F(p0)&&X(F(p1)))))'
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 5 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-25 22:00:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-25 22:00:44] [INFO ] Computed 7 invariants in 5 ms
[2024-05-25 22:00:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-25 22:00:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 22:00:44] [INFO ] Invariant cache hit.
[2024-05-25 22:00:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:00:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-25 22:00:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 22:00:44] [INFO ] Invariant cache hit.
[2024-05-25 22:00:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 9 ms to minimize.
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-25 22:00:45] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 22:00:46] [INFO ] Deduced a trap composed of 6 places in 842 ms of which 29 ms to minimize.
[2024-05-25 22:00:46] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 22:00:46] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-25 22:00:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 5 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 15/101 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-25 22:00:47] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 104 constraints, problems are : Problem set: 1 solved, 73 unsolved in 3848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 18/25 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/101 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/177 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:00:50] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/145 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 178 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2915 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 19/19 constraints]
After SMT, in 6818ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 6832ms
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 : 76/80 places, 77/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7040 ms. Remains : 76/80 places, 77/82 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-02
Product exploration explored 100000 steps with 16160 reset in 234 ms.
Product exploration explored 100000 steps with 16281 reset in 154 ms.
Computed a total of 76 stabilizing places and 77 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 77
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) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-4-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-4-LTLFireability-02 finished in 7847 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))'
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 76 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 70
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 25 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-25 22:00:52] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-25 22:00:52] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 22:00:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 22:00:52] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 22:00:52] [INFO ] Invariant cache hit.
[2024-05-25 22:00:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:00:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-25 22:00:52] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-25 22:00:52] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 22:00:52] [INFO ] Invariant cache hit.
[2024-05-25 22:00:52] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 66 constraints, problems are : Problem set: 1 solved, 53 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 53/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 119 constraints, problems are : Problem set: 1 solved, 53 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1449ms problems are : Problem set: 1 solved, 53 unsolved
Search for dead transitions found 1 dead transitions in 1451ms
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 : 56/80 places, 57/82 transitions.
Applied a total of 0 rules in 13 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 22:00:53] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1627 ms. Remains : 56/80 places, 57/82 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 6577 reset in 360 ms.
Product exploration explored 100000 steps with 6577 reset in 234 ms.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
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 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 53 steps (0 resets) in 8 ms. (5 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)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0)]
[2024-05-25 22:00:55] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 56 cols
[2024-05-25 22:00:55] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 22:00:55] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-25 22:00:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-25 22:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 22:00:55] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 22:00:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 22:00:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2024-05-25 22:00:55] [INFO ] Computed and/alt/rep : 53/105/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 22:00:55] [INFO ] Added : 25 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 57/57 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 22:00:55] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:55] [INFO ] Invariant cache hit.
[2024-05-25 22:00:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 22:00:55] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:55] [INFO ] Invariant cache hit.
[2024-05-25 22:00:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 22:00:55] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-25 22:00:55] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-25 22:00:55] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:55] [INFO ] Invariant cache hit.
[2024-05-25 22:00:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 66 constraints, problems are : Problem set: 0 solved, 53 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 119 constraints, problems are : Problem set: 0 solved, 53 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1329ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1330ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1438 ms. Remains : 56/56 places, 57/57 transitions.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
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 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 58 steps (0 resets) in 7 ms. (7 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)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-25 22:00:57] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:57] [INFO ] Invariant cache hit.
[2024-05-25 22:00:57] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 22:00:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 22:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 22:00:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 22:00:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 22:00:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 22:00:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-25 22:00:57] [INFO ] Computed and/alt/rep : 53/105/44 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 22:00:57] [INFO ] Added : 26 causal constraints over 6 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6603 reset in 218 ms.
Product exploration explored 100000 steps with 6586 reset in 265 ms.
Support contains 16 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 22:00:58] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:58] [INFO ] Invariant cache hit.
[2024-05-25 22:00:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 22:00:58] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:58] [INFO ] Invariant cache hit.
[2024-05-25 22:00:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 22:00:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-25 22:00:58] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-25 22:00:58] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 22:00:58] [INFO ] Invariant cache hit.
[2024-05-25 22:00:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 66 constraints, problems are : Problem set: 0 solved, 53 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 119 constraints, problems are : Problem set: 0 solved, 53 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1430 ms. Remains : 56/56 places, 57/57 transitions.
Treatment of property NeoElection-PT-4-LTLFireability-03 finished in 7159 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(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 3 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-25 22:00:59] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-25 22:00:59] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:00:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 22:00:59] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 22:00:59] [INFO ] Invariant cache hit.
[2024-05-25 22:00:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:00:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-25 22:00:59] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 22:00:59] [INFO ] Invariant cache hit.
[2024-05-25 22:00:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-25 22:01:00] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 15/101 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:01:01] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 22:01:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 22:01:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 104 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 18/25 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/101 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/177 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 22:01:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/145 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 178 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 19/19 constraints]
After SMT, in 4728ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 4729ms
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 : 76/80 places, 77/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4842 ms. Remains : 76/80 places, 77/82 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Product exploration explored 100000 steps with 25000 reset in 78 ms.
Computed a total of 76 stabilizing places and 77 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 77
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 p1 p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-4-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-4-LTLFireability-04 finished in 5327 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)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 76 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 14 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-25 22:01:04] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-25 22:01:04] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 22:01:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 22:01:04] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 22:01:04] [INFO ] Invariant cache hit.
[2024-05-25 22:01:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:01:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-25 22:01:04] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-25 22:01:04] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 22:01:04] [INFO ] Invariant cache hit.
[2024-05-25 22:01:04] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/102 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD34 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 66 constraints, problems are : Problem set: 1 solved, 45 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 49/102 variables, 53/60 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/63 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 3/105 variables, 3/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 111 constraints, problems are : Problem set: 1 solved, 45 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1358ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 1360ms
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 : 56/80 places, 57/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 22:01:06] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1509 ms. Remains : 56/80 places, 57/82 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-05
Product exploration explored 100000 steps with 1030 reset in 329 ms.
Product exploration explored 100000 steps with 1030 reset in 314 ms.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-4-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-4-LTLFireability-05 finished in 2257 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)))'
Support contains 26 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 74
Applied a total of 8 rules in 11 ms. Remains 72 /80 variables (removed 8) and now considering 74/82 (removed 8) transitions.
[2024-05-25 22:01:07] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 72 cols
[2024-05-25 22:01:07] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 22:01:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 22:01:07] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-25 22:01:07] [INFO ] Invariant cache hit.
[2024-05-25 22:01:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:01:07] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-25 22:01:07] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-25 22:01:07] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-25 22:01:07] [INFO ] Invariant cache hit.
[2024-05-25 22:01:07] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 65/137 variables, 72/79 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-25 22:01:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 15/97 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 2/100 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 22:01:08] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 101 constraints, problems are : Problem set: 1 solved, 69 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 1 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 19/26 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 65/137 variables, 72/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/101 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 69/170 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 170 constraints, problems are : Problem set: 1 solved, 69 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 69/70 constraints, Known Traps: 19/19 constraints]
After SMT, in 3775ms problems are : Problem set: 1 solved, 69 unsolved
Search for dead transitions found 1 dead transitions in 3776ms
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 : 72/80 places, 73/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-05-25 22:01:11] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3912 ms. Remains : 72/80 places, 73/82 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-06
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-4-LTLFireability-06 finished in 3965 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(X(G(p0))))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 79
Applied a total of 6 rules in 6 ms. Remains 77 /80 variables (removed 3) and now considering 79/82 (removed 3) transitions.
[2024-05-25 22:01:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 77 cols
[2024-05-25 22:01:11] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 22:01:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 22:01:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-25 22:01:11] [INFO ] Invariant cache hit.
[2024-05-25 22:01:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 22:01:11] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-25 22:01:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-25 22:01:11] [INFO ] Invariant cache hit.
[2024-05-25 22:01:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/147 variables, 77/84 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 3/87 constraints. Problems are: Problem set: 1 solved, 74 unsolved
[2024-05-25 22:01:11] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-25 22:01:11] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-25 22:01:11] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 22:01:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 15/102 constraints. Problems are: Problem set: 1 solved, 74 unsolved
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 74 unsolved
[2024-05-25 22:01:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 74 unsolved
[2024-05-25 22:01:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 105 constraints, problems are : Problem set: 1 solved, 74 unsolved in 2499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 1 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 18/25 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 70/147 variables, 77/102 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 3/105 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 74/179 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 179 constraints, problems are : Problem set: 1 solved, 74 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/75 constraints, Known Traps: 18/18 constraints]
After SMT, in 3986ms problems are : Problem set: 1 solved, 74 unsolved
Search for dead transitions found 1 dead transitions in 3988ms
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 : 77/80 places, 78/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4116 ms. Remains : 77/80 places, 78/82 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-4-LTLFireability-15 finished in 4247 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))'
[2024-05-25 22:01:15] [INFO ] Flatten gal took : 11 ms
[2024-05-25 22:01:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 22:01:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 82 transitions and 323 arcs took 4 ms.
Total runtime 32284 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NeoElection-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 80
TRANSITIONS: 82
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1073
MODEL NAME: /home/mcc/execution/412/model
80 places, 82 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NeoElection-PT-4-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716674700594

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-4.tgz
mv NeoElection-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;