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-177969914000211.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-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 107K Mar 8 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 392K Mar 8 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Mar 8 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 289K Mar 8 07:30 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 41K Mar 16 08:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 16 08:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Mar 16 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 119K Mar 16 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 274K Mar 8 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 900K Mar 8 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 199K Mar 8 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Mar 8 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 16 08:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 939K 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-3-LTLCardinality-00
FORMULA_NAME NeoElection-PT-3-LTLCardinality-01
FORMULA_NAME NeoElection-PT-3-LTLCardinality-02
FORMULA_NAME NeoElection-PT-3-LTLCardinality-03
FORMULA_NAME NeoElection-PT-3-LTLCardinality-04
FORMULA_NAME NeoElection-PT-3-LTLCardinality-05
FORMULA_NAME NeoElection-PT-3-LTLCardinality-06
FORMULA_NAME NeoElection-PT-3-LTLCardinality-07
FORMULA_NAME NeoElection-PT-3-LTLCardinality-08
FORMULA_NAME NeoElection-PT-3-LTLCardinality-09
FORMULA_NAME NeoElection-PT-3-LTLCardinality-10
FORMULA_NAME NeoElection-PT-3-LTLCardinality-11
FORMULA_NAME NeoElection-PT-3-LTLCardinality-12
FORMULA_NAME NeoElection-PT-3-LTLCardinality-13
FORMULA_NAME NeoElection-PT-3-LTLCardinality-14
FORMULA_NAME NeoElection-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779733343844

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 18:22:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:22:25] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2026-05-25 18:22:25] [INFO ] Transformed 972 places.
[2026-05-25 18:22:25] [INFO ] Transformed 1016 transitions.
[2026-05-25 18:22:25] [INFO ] Found NUPN structural information;
[2026-05-25 18:22:25] [INFO ] Completing missing partition info from NUPN : creating a component with [P_crashed_0, P_crashed_1, P_crashed_2, P_crashed_3, P_dead_0, P_dead_1, P_dead_2, P_dead_3, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_masterList_0_1_0, P_masterList_0_1_1, P_masterList_0_1_2, P_masterList_0_1_3, P_masterList_0_2_0, P_masterList_0_2_1, P_masterList_0_2_2, P_masterList_0_2_3, P_masterList_0_3_0, P_masterList_0_3_1, P_masterList_0_3_2, P_masterList_0_3_3, P_masterList_1_1_0, P_masterList_1_1_1, P_masterList_1_1_2, P_masterList_1_1_3, P_masterList_1_2_0, P_masterList_1_2_1, P_masterList_1_2_2, P_masterList_1_2_3, P_masterList_1_3_0, P_masterList_1_3_1, P_masterList_1_3_2, P_masterList_1_3_3, P_masterList_2_1_0, P_masterList_2_1_1, P_masterList_2_1_2, P_masterList_2_1_3, P_masterList_2_2_0, P_masterList_2_2_1, P_masterList_2_2_2, P_masterList_2_2_3, P_masterList_2_3_0, P_masterList_2_3_1, P_masterList_2_3_2, P_masterList_2_3_3, P_masterList_3_1_0, P_masterList_3_1_1, P_masterList_3_1_2, P_masterList_3_1_3, P_masterList_3_2_0, P_masterList_3_2_1, P_masterList_3_2_2, P_masterList_3_2_3, P_masterList_3_3_0, P_masterList_3_3_1, P_masterList_3_3_2, P_masterList_3_3_3, P_masterState_0_F_0, P_masterState_0_F_1, P_masterState_0_F_2, P_masterState_0_F_3, P_masterState_0_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_0_T_3, P_masterState_1_F_0, P_masterState_1_F_1, P_masterState_1_F_2, P_masterState_1_F_3, P_masterState_1_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_1_T_3, P_masterState_2_F_0, P_masterState_2_F_1, P_masterState_2_F_2, P_masterState_2_F_3, P_masterState_2_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_masterState_2_T_3, P_masterState_3_F_0, P_masterState_3_F_1, P_masterState_3_F_2, P_masterState_3_F_3, P_masterState_3_T_0, P_masterState_3_T_1, P_masterState_3_T_2, P_masterState_3_T_3, 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_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_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_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_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_AnsP_0, P_network_0_0_AnsP_1, P_network_0_0_AnsP_2, P_network_0_0_AnsP_3, 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_AI_0, P_network_0_0_AI_1, P_network_0_0_AI_2, P_network_0_0_AI_3, 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_RP_0, P_network_0_0_RP_1, P_network_0_0_RP_2, P_network_0_0_RP_3, 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_AnsP_0, P_network_0_1_AnsP_1, P_network_0_1_AnsP_2, P_network_0_1_AnsP_3, 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_AI_0, P_network_0_1_AI_1, P_network_0_1_AI_2, P_network_0_1_AI_3, 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_RP_0, P_network_0_1_RP_1, P_network_0_1_RP_2, P_network_0_1_RP_3, 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_AnsP_0, P_network_0_2_AnsP_1, P_network_0_2_AnsP_2, P_network_0_2_AnsP_3, 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_AI_0, P_network_0_2_AI_1, P_network_0_2_AI_2, P_network_0_2_AI_3, 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_RP_0, P_network_0_2_RP_1, P_network_0_2_RP_2, P_network_0_2_RP_3, 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_AnsP_0, P_network_0_3_AnsP_1, P_network_0_3_AnsP_2, P_network_0_3_AnsP_3, 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_AI_0, P_network_0_3_AI_1, P_network_0_3_AI_2, P_network_0_3_AI_3, 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_RP_0, P_network_0_3_RP_1, P_network_0_3_RP_2, P_network_0_3_RP_3, 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_AnsP_0, P_network_1_0_AnsP_1, P_network_1_0_AnsP_2, P_network_1_0_AnsP_3, 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_AI_0, P_network_1_0_AI_1, P_network_1_0_AI_2, P_network_1_0_AI_3, 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_RP_0, P_network_1_0_RP_1, P_network_1_0_RP_2, P_network_1_0_RP_3, 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_AnsP_0, P_network_1_1_AnsP_1, P_network_1_1_AnsP_2, P_network_1_1_AnsP_3, 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_AI_0, P_network_1_1_AI_1, P_network_1_1_AI_2, P_network_1_1_AI_3, 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_RP_0, P_network_1_1_RP_1, P_network_1_1_RP_2, P_network_1_1_RP_3, 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_AnsP_0, P_network_1_2_AnsP_1, P_network_1_2_AnsP_2, P_network_1_2_AnsP_3, 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_AI_0, P_network_1_2_AI_1, P_network_1_2_AI_2, P_network_1_2_AI_3, 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_RP_0, P_network_1_2_RP_1, P_network_1_2_RP_2, P_network_1_2_RP_3, 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_AnsP_0, P_network_1_3_AnsP_1, P_network_1_3_AnsP_2, P_network_1_3_AnsP_3, 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_AI_0, P_network_1_3_AI_1, P_network_1_3_AI_2, P_network_1_3_AI_3, 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_RP_0, P_network_1_3_RP_1, P_network_1_3_RP_2, P_network_1_3_RP_3, 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_AnsP_0, P_network_2_0_AnsP_1, P_network_2_0_AnsP_2, P_network_2_0_AnsP_3, 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_AI_0, P_network_2_0_AI_1, P_network_2_0_AI_2, P_network_2_0_AI_3, 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_RP_0, P_network_2_0_RP_1, P_network_2_0_RP_2, P_network_2_0_RP_3, 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_AnsP_0, P_network_2_1_AnsP_1, P_network_2_1_AnsP_2, P_network_2_1_AnsP_3, 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_AI_0, P_network_2_1_AI_1, P_network_2_1_AI_2, P_network_2_1_AI_3, 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_RP_0, P_network_2_1_RP_1, P_network_2_1_RP_2, P_network_2_1_RP_3, 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_AnsP_0, P_network_2_2_AnsP_1, P_network_2_2_AnsP_2, P_network_2_2_AnsP_3, 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_AI_0, P_network_2_2_AI_1, P_network_2_2_AI_2, P_network_2_2_AI_3, 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_RP_0, P_network_2_2_RP_1, P_network_2_2_RP_2, P_network_2_2_RP_3, 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_AnsP_0, P_network_2_3_AnsP_1, P_network_2_3_AnsP_2, P_network_2_3_AnsP_3, 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_AI_0, P_network_2_3_AI_1, P_network_2_3_AI_2, P_network_2_3_AI_3, 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_RP_0, P_network_2_3_RP_1, P_network_2_3_RP_2, P_network_2_3_RP_3, 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_AnsP_0, P_network_3_0_AnsP_1, P_network_3_0_AnsP_2, P_network_3_0_AnsP_3, 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_AI_0, P_network_3_0_AI_1, P_network_3_0_AI_2, P_network_3_0_AI_3, 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_RP_0, P_network_3_0_RP_1, P_network_3_0_RP_2, P_network_3_0_RP_3, 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_AnsP_0, P_network_3_1_AnsP_1, P_network_3_1_AnsP_2, P_network_3_1_AnsP_3, 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_AI_0, P_network_3_1_AI_1, P_network_3_1_AI_2, P_network_3_1_AI_3, 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_RP_0, P_network_3_1_RP_1, P_network_3_1_RP_2, P_network_3_1_RP_3, 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_AnsP_0, P_network_3_2_AnsP_1, P_network_3_2_AnsP_2, P_network_3_2_AnsP_3, 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_AI_0, P_network_3_2_AI_1, P_network_3_2_AI_2, P_network_3_2_AI_3, 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_RP_0, P_network_3_2_RP_1, P_network_3_2_RP_2, P_network_3_2_RP_3, 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_AnsP_0, P_network_3_3_AnsP_1, P_network_3_3_AnsP_2, P_network_3_3_AnsP_3, 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_AI_0, P_network_3_3_AI_1, P_network_3_3_AI_2, P_network_3_3_AI_3, 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_RP_0, P_network_3_3_RP_1, P_network_3_3_RP_2, P_network_3_3_RP_3, P_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, P_poll__handlingMessage_3, 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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__pollEnd_3, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_poll__waitingMessage_3, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_0_3, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_1_3, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, P_sendAnnPs__broadcasting_2_3, P_sendAnnPs__broadcasting_3_1, P_sendAnnPs__broadcasting_3_2, P_sendAnnPs__broadcasting_3_3, 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_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_0_3, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_1_3, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2, P_startNeg__broadcasting_2_3, P_startNeg__broadcasting_3_1, P_startNeg__broadcasting_3_2, P_startNeg__broadcasting_3_3]
[2026-05-25 18:22:25] [INFO ] Parsed PT model containing 972 places and 1016 transitions and 5840 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 898 places and 958 transitions.
Reduce places removed 7 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-PT-3-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 58 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 58 transition count 49
Applied a total of 12 rules in 15 ms. Remains 58 /67 variables (removed 9) and now considering 49/58 (removed 9) transitions.
[2026-05-25 18:22:25] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12507649989283153584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7555287322762857861.kers'
[2026-05-25 18:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12507649989283153584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7555287322762857861.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 56 cols 165 entries
Finished phase 1 with 33 SingleSign rule and 11 generalized
[2026-05-25 18:22:25] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7555287322762857861.kers
Total runtime 1 ms.
[2026-05-25 18:22:25] [INFO ] Implicit Places using invariants in 207 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 237 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/67 places, 49/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 49/67 places, 49/58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2026-05-25 18:22:25] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16120923531360143230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15423979850889486401.kers'
[2026-05-25 18:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16120923531360143230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15423979850889486401.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 47 cols 144 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 18:22:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15423979850889486401.kers
Total runtime 0 ms.
[2026-05-25 18:22:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 18:22:25] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2026-05-25 18:22:25] [INFO ] Invariant cache hit.
[2026-05-25 18:22:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 18:22:25] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2026-05-25 18:22:25] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2026-05-25 18:22:25] [INFO ] Invariant cache hit.
[2026-05-25 18:22:25] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 45/94 variables, 49/54 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 3/57 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 10/67 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 67 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 45/94 variables, 49/64 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 3/67 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 45/112 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/94 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 113 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3006ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 3019ms
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 : 49/49 places, 48/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3177 ms. Remains : 49/49 places, 48/49 transitions.
Support contains 33 out of 49 places after structural reductions.
[2026-05-25 18:22:29] [INFO ] Flatten gal took : 22 ms
[2026-05-25 18:22:29] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:22:29] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (452 resets) in 525 ms. (76 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (96 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2026-05-25 18:22:29] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4153338168832844934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11631368317533187344.kers'
[2026-05-25 18:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4153338168832844934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11631368317533187344.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 47 cols 141 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 18:22:29] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11631368317533187344.kers
Total runtime 0 ms.
[2026-05-25 18:22:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/33 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/69 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/89 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/93 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 93/93 variables, and 57 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
FORMULA NeoElection-PT-3-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 44 transition count 42
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 44 transition count 42
Applied a total of 10 rules in 2 ms. Remains 44 /49 variables (removed 5) and now considering 42/48 (removed 6) transitions.
[2026-05-25 18:22:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8393888968854263223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9687747284001517376.kers'
[2026-05-25 18:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8393888968854263223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9687747284001517376.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 38 rows 42 cols 125 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-25 18:22:29] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9687747284001517376.kers
Total runtime 1 ms.
[2026-05-25 18:22:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 18:22:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-05-25 18:22:29] [INFO ] Invariant cache hit.
[2026-05-25 18:22:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:22:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2026-05-25 18:22:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-05-25 18:22:29] [INFO ] Invariant cache hit.
[2026-05-25 18:22:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 38/82 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 58 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 38/82 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 39/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 98 constraints, problems are : Problem set: 0 solved, 39 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1901ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1902ms
Starting structural reductions in LTL mode, iteration 1 : 44/49 places, 42/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1991 ms. Remains : 44/49 places, 42/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLCardinality-01
Product exploration explored 100000 steps with 6771 reset in 232 ms.
Product exploration explored 100000 steps with 6789 reset in 141 ms.
Computed a total of 44 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 42
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 57 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2026-05-25 18:22:32] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-05-25 18:22:32] [INFO ] Invariant cache hit.
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 275 ms.
FORMULA NeoElection-PT-3-LTLCardinality-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property NeoElection-PT-3-LTLCardinality-01 finished in 2896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((p0&&X(!p0)))))))'
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 45
Applied a total of 4 rules in 5 ms. Remains 47 /49 variables (removed 2) and now considering 45/48 (removed 3) transitions.
[2026-05-25 18:22:32] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9209444884510052084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11216694345075096241.kers'
[2026-05-25 18:22:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9209444884510052084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11216694345075096241.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 41 rows 45 cols 131 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 18:22:32] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11216694345075096241.kers
Total runtime 1 ms.
[2026-05-25 18:22:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 18:22:32] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-25 18:22:32] [INFO ] Invariant cache hit.
[2026-05-25 18:22:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:22:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2026-05-25 18:22:32] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-25 18:22:32] [INFO ] Invariant cache hit.
[2026-05-25 18:22:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 41/88 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 41/88 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 106 constraints, problems are : Problem set: 0 solved, 42 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2155ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2156ms
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 45/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2263 ms. Remains : 47/49 places, 45/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((p0&&X(!p0)))))))'
Stuttering acceptance computed with spot in 149 ms :[true, true, true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-3-LTLCardinality-03 finished in 2441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 45
Applied a total of 4 rules in 1 ms. Remains 47 /49 variables (removed 2) and now considering 45/48 (removed 3) transitions.
[2026-05-25 18:22:34] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-25 18:22:34] [INFO ] Invariant cache hit.
[2026-05-25 18:22:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 18:22:34] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-25 18:22:34] [INFO ] Invariant cache hit.
[2026-05-25 18:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:22:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 45/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 47/49 places, 45/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-3-LTLCardinality-06 finished in 221 ms.
All properties solved by simple procedures.
Total runtime 10009 ms.

BK_STOP 1779733355355

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-3"
export BK_EXAMINATION="LTLCardinality"
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-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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