Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914000217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is NeoElection-PT-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 265K Mar 8 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 882K Mar 8 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 201K Mar 8 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 717K Mar 8 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 94K Mar 16 08:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 248K Mar 16 08:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Mar 16 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 160K Mar 16 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 376K Mar 8 07:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Mar 8 07:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127K Mar 8 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Mar 8 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 42K Mar 16 08:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 78K Mar 16 08:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-00
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-01
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-02
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-03
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-04
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-05
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-06
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-07
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-08
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-09
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-10
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-11
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-12
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-13
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-14
FORMULA_NAME NeoElection-PT-4-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779733445160

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 18:24:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:24:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:24:06] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-25 18:24:06] [INFO ] Transformed 1830 places.
[2026-05-25 18:24:06] [INFO ] Transformed 2340 transitions.
[2026-05-25 18:24:06] [INFO ] Found NUPN structural information;
[2026-05-25 18:24:06] [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]
[2026-05-25 18:24:06] [INFO ] Parsed PT model containing 1830 places and 2340 transitions and 13565 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 51 ms.
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.
FORMULA NeoElection-PT-4-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 102 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 102 transition count 91
Applied a total of 28 rules in 17 ms. Remains 102 /122 variables (removed 20) and now considering 91/127 (removed 36) transitions.
[2026-05-25 18:24:06] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4348158885915437889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8690855817895602298.kers'
[2026-05-25 18:24:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4348158885915437889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8690855817895602298.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 82 rows 99 cols 314 entries
Finished phase 1 with 58 SingleSign rule and 21 generalized
[2026-05-25 18:24:06] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8690855817895602298.kers
Total runtime 1 ms.
[2026-05-25 18:24:07] [INFO ] Implicit Places using invariants in 227 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 259 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/122 places, 91/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 86/122 places, 91/127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-25 18:24:07] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13795342788746259803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16487585850004192866.kers'
[2026-05-25 18:24:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13795342788746259803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16487585850004192866.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 82 rows 83 cols 272 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-25 18:24:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16487585850004192866.kers
Total runtime 1 ms.
[2026-05-25 18:24:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 18:24:07] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2026-05-25 18:24:07] [INFO ] Invariant cache hit.
[2026-05-25 18:24:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 18:24:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 18:24:07] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2026-05-25 18:24:07] [INFO ] Invariant cache hit.
[2026-05-25 18:24:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 4 (OVERLAPS) 82/168 variables, 86/93 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 6/99 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 2/116 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 116 constraints, problems are : Problem set: 1 solved, 86 unsolved in 4012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 4/86 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 17/24 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 82/168 variables, 86/110 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 6/116 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 86/202 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 3/205 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 206 constraints, problems are : Problem set: 1 solved, 86 unsolved in 5629 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 86/87 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9696ms problems are : Problem set: 1 solved, 86 unsolved
Search for dead transitions found 1 dead transitions in 9711ms
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 : 86/86 places, 90/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9878 ms. Remains : 86/86 places, 90/91 transitions.
Support contains 80 out of 86 places after structural reductions.
[2026-05-25 18:24:17] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-25 18:24:17] [INFO ] Flatten gal took : 28 ms
[2026-05-25 18:24:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-PT-4-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 18:24:17] [INFO ] Flatten gal took : 11 ms
[2026-05-25 18:24:17] [INFO ] Input system was already deterministic with 90 transitions.
Support contains 64 out of 86 places (down from 80) after GAL structural reductions.
FORMULA NeoElection-PT-4-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (236 resets) in 1210 ms. (33 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (47 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
[2026-05-25 18:24:17] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2448997014933197658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5220449373893637695.kers'
[2026-05-25 18:24:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2448997014933197658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5220449373893637695.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 81 rows 83 cols 269 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 18:24:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5220449373893637695.kers
Total runtime 0 ms.
[2026-05-25 18:24:17] [INFO ] State equation strengthened by 5 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/81 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 6/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 163/167 variables, and 94 constraints, problems are : Problem set: 3 solved, 0 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, State Equation: 82/86 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
FORMULA NeoElection-PT-4-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 18:24:18] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:24:18] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:24:18] [INFO ] Input system was already deterministic with 90 transitions.
Computed a total of 86 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 90/90 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 82 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 82 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 78 transition count 82
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 26 place count 68 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 68 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 36 place count 68 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 64 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 56 transition count 57
Applied a total of 60 rules in 19 ms. Remains 56 /86 variables (removed 30) and now considering 57/90 (removed 33) transitions.
[2026-05-25 18:24:18] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17845953199628413035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18088945124530611855.kers'
[2026-05-25 18:24:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17845953199628413035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18088945124530611855.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 48 rows 49 cols 99 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 18:24:18] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18088945124530611855.kers
Total runtime 0 ms.
[2026-05-25 18:24:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 18:24:18] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2026-05-25 18:24:18] [INFO ] Invariant cache hit.
[2026-05-25 18:24:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 18:24:18] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-25 18:24:18] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 18:24:18] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2026-05-25 18:24:18] [INFO ] Invariant cache hit.
[2026-05-25 18:24:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 5/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, 44/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 108 constraints, problems are : Problem set: 0 solved, 53 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 5/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, 44/108 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 161 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1925ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1926ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/86 places, 57/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2079 ms. Remains : 56/86 places, 57/90 transitions.
[2026-05-25 18:24:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:20] [INFO ] Input system was already deterministic with 57 transitions.
[2026-05-25 18:24:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:24:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:24:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6636049658724058058.gal : 2 ms
[2026-05-25 18:24:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1837607474088742099.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6636049658724058058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1837607474088742099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80691e+08,0.128581,9704,2,1590,5,33087,6,0,263,23560,0


Converting to forward existential form...Done !
original formula: AF((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))<=0))
=> equivalent forward existential formula: [FwdG(Init,!((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))<=0)))] = FALSE
dead was empty
(forward)formula 0,1,1.02515,44024,1,0,59,238565,13,2,1321,196373,57
FORMULA NeoElection-PT-4-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 90/90 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 73
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 36 place count 64 transition count 65
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 60 transition count 61
Applied a total of 40 rules in 14 ms. Remains 60 /86 variables (removed 26) and now considering 61/90 (removed 29) transitions.
[2026-05-25 18:24:21] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7195233640381613252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11223085310337309103.kers'
[2026-05-25 18:24:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7195233640381613252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11223085310337309103.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 52 rows 57 cols 187 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 18:24:21] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11223085310337309103.kers
Total runtime 0 ms.
[2026-05-25 18:24:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 18:24:21] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2026-05-25 18:24:21] [INFO ] Invariant cache hit.
[2026-05-25 18:24:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 18:24:21] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-25 18:24:21] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-25 18:24:21] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2026-05-25 18:24:21] [INFO ] Invariant cache hit.
[2026-05-25 18:24:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 52/112 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 70 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 52/112 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 127 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2426ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2427ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/86 places, 61/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2577 ms. Remains : 60/86 places, 61/90 transitions.
[2026-05-25 18:24:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:24:23] [INFO ] Input system was already deterministic with 61 transitions.
[2026-05-25 18:24:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:24:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:24:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15790501472329257476.gal : 2 ms
[2026-05-25 18:24:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7638639631410578074.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15790501472329257476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7638639631410578074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46313e+10,0.261947,15992,2,2042,5,69440,6,0,283,62261,0


Converting to forward existential form...Done !
original formula: AG(EF((((P_polling_1+P_polling_2)+(P_polling_3+P_polling_4))<=0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((P_polling_1+P_polling_2)+(P_polling_3+P_polling_4))<=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, Intersection ...239
(forward)formula 0,1,1.08101,45316,1,0,146,249971,143,64,2012,275055,132
FORMULA NeoElection-PT-4-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 90/90 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 77
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 77
Applied a total of 20 rules in 11 ms. Remains 76 /86 variables (removed 10) and now considering 77/90 (removed 13) transitions.
[2026-05-25 18:24:25] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2478570067559749452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16535583542700093515.kers'
[2026-05-25 18:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2478570067559749452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16535583542700093515.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 68 rows 73 cols 231 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-25 18:24:25] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16535583542700093515.kers
Total runtime 1 ms.
[2026-05-25 18:24:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 18:24:25] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2026-05-25 18:24:25] [INFO ] Invariant cache hit.
[2026-05-25 18:24:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 18:24:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2026-05-25 18:24:25] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2026-05-25 18:24:25] [INFO ] Invariant cache hit.
[2026-05-25 18:24:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 68/144 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 105 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 68/144 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 73/178 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 178 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5588ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 5590ms
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 77/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5793 ms. Remains : 76/86 places, 77/90 transitions.
[2026-05-25 18:24:30] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:24:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:30] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-25 18:24:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality14759942542283234017.gal : 2 ms
[2026-05-25 18:24:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17965118016291443801.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14759942542283234017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17965118016291443801.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46438e+10,0.819426,36480,2,11381,5,161814,6,0,371,164651,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.821217,36480,1,0,6,161814,7,1,517,164651,1
FORMULA NeoElection-PT-4-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 90/90 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 77
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 77
Applied a total of 20 rules in 3 ms. Remains 76 /86 variables (removed 10) and now considering 77/90 (removed 13) transitions.
[2026-05-25 18:24:31] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2026-05-25 18:24:31] [INFO ] Invariant cache hit.
[2026-05-25 18:24:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 18:24:31] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2026-05-25 18:24:31] [INFO ] Invariant cache hit.
[2026-05-25 18:24:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 18:24:31] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 77/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 76/86 places, 77/90 transitions.
[2026-05-25 18:24:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:24:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:24:31] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-25 18:24:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:24:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:24:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality396232567362592099.gal : 1 ms
[2026-05-25 18:24:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8099119791058720743.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality396232567362592099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8099119791058720743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46438e+10,0.817685,36480,2,11381,5,161814,6,0,371,164651,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.819429,36480,1,0,6,161814,7,1,517,164651,1
FORMULA NeoElection-PT-4-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-25 18:24:32] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:24:32] [INFO ] Flatten gal took : 5 ms
Total runtime 26447 ms.

BK_STOP 1779733472817

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-4"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is NeoElection-PT-4, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914000217"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;