fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r110-oct2-155272242200074
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for NeoElection-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
206.880 12587.00 13170.00 14.90 TFFFFTTTTTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r110-oct2-155272242200074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is NeoElection-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242200074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 167K Feb 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 267K Feb 8 01:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 754K Feb 8 01:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 24K Feb 5 00:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 5 00:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 146K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 390K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 270K Feb 4 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 4 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 350K Feb 1 00:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 962K Feb 1 00:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 96K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 197K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1553035328013

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-6 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-PT-6 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ NeoElection-PT-6 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13265/65536 symbol table entries, 1397 collisions
lola: preprocessing...
lola: Size of bit vector: 4830
lola: finding significant places
lola: 4830 places, 8435 transitions, 1197 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2401 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-6-LTLCardinality.task
lola: LP says that atomic proposition is always true: (P-electedPrimary_6 + P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 <= P-poll__pollEnd_6 + P-poll__pollEnd_5 + P-poll__pollEnd_4 + P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)
lola: place invariant simplifies atomic proposition
lola: before: (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + P-electionFailed_3 + P-electionFailed_4 + P-electionFailed_5 + P-electionFailed_6 <= P-masterList_5_6_0 + P-masterList_5_6_1 + P-masterList_5_6_2 + P-masterList_5_6_3 + P-masterList_5_6_4 + P-masterList_5_6_5 + P-masterList_5_6_6 + P-masterList_3_2_0 + P-masterList_3_2_1 + P-masterList_3_2_2 + P-masterList_3_2_3 + P-masterList_3_2_4 + P-masterList_3_2_5 + P-masterList_3_2_6 + P-masterList_0_4_0 + P-masterList_0_4_1 + P-masterList_0_4_2 + P-masterList_0_4_3 + P-masterList_0_4_4 + P-masterList_0_4_5 + P-masterList_0_4_6 + P-masterList_0_3_6 + P-masterList_0_3_5 + P-masterList_0_3_4 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_6_1_0 + P-masterList_6_1_1 + P-masterList_6_1_2 + P-masterList_6_1_3 + P-masterList_6_1_4 + P-masterList_6_1_5 + P-masterList_6_1_6 + P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_3_4 + P-masterList_3_3_5 + P-masterList_3_3_6 + P-masterList_0_5_0 + P-masterList_0_5_1 + P-masterList_0_5_2 + P-masterList_0_5_3 + P-masterList_0_5_4 + P-masterList_0_5_5 + P-masterList_0_5_6 + P-masterList_3_1_6 + P-masterList_3_1_5 + P-masterList_3_1_4 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_6_2_0 + P-masterList_6_2_1 + P-masterList_6_2_2 + P-masterList_6_2_3 + P-masterList_6_2_4 + P-masterList_6_2_5 + P-masterList_6_2_6 + P-masterList_3_4_0 + P-masterList_3_4_1 + P-masterList_3_4_2 + P-masterList_3_4_3 + P-masterList_3_4_4 + P-masterList_3_4_5 + P-masterList_3_4_6 + P-masterList_0_6_0 + P-masterList_0_6_1 + P-masterList_0_6_2 + P-masterList_0_6_3 + P-masterList_0_6_4 + P-masterList_0_6_5 + P-masterList_0_6_6 + P-masterList_5_5_6 + P-masterList_5_5_5 + P-masterList_5_5_4 + P-masterList_5_5_3 + P-masterList_5_5_2 + P-masterList_5_5_1 + P-masterList_5_5_0 + P-masterList_6_3_0 + P-masterList_6_3_1 + P-masterList_6_3_2 + P-masterList_6_3_3 + P-masterList_6_3_4 + P-masterList_6_3_5 + P-masterList_6_3_6 + P-masterList_3_5_0 + P-masterList_3_5_1 + P-masterList_3_5_2 + P-masterList_3_5_3 + P-masterList_3_5_4 + P-masterList_3_5_5 + P-masterList_3_5_6 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_1_4 + P-masterList_1_1_5 + P-masterList_1_1_6 + P-masterList_0_2_6 + P-masterList_0_2_5 + P-masterList_0_2_4 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_6_4_0 + P-masterList_6_4_1 + P-masterList_6_4_2 + P-masterList_6_4_3 + P-masterList_6_4_4 + P-masterList_6_4_5 + P-masterList_6_4_6 + P-masterList_3_6_0 + P-masterList_3_6_1 + P-masterList_3_6_2 + P-masterList_3_6_3 + P-masterList_3_6_4 + P-masterList_3_6_5 + P-masterList_3_6_6 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_2_4 + P-masterList_1_2_5 + P-masterList_1_2_6 + P-masterList_6_5_0 + P-masterList_6_5_1 + P-masterList_6_5_2 + P-masterList_6_5_3 + P-masterList_6_5_4 + P-masterList_6_5_5 + P-masterList_6_5_6 + P-masterList_2_6_6 + P-masterList_2_6_5 + P-masterList_2_6_4 + P-masterList_2_6_3 + P-masterList_2_6_2 + P-masterList_2_6_1 + P-masterList_2_6_0 + P-masterList_5_4_6 + P-masterList_5_4_5 + P-masterList_5_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_1_5 + P-masterList_4_1_6 + P-masterList_5_4_3 + P-masterList_5_4_2 + P-masterList_5_4_1 + P-masterList_5_4_0 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_1_3_4 + P-masterList_1_3_5 + P-masterList_1_3_6 + P-masterList_6_6_0 + P-masterList_6_6_1 + P-masterList_6_6_2 + P-masterList_6_6_3 + P-masterList_6_6_4 + P-masterList_6_6_5 + P-masterList_6_6_6 + P-masterList_4_2_0 + P-masterList_4_2_1 + P-masterList_4_2_2 + P-masterList_4_2_3 + P-masterList_4_2_4 + P-masterList_4_2_5 + P-masterList_4_2_6 + P-masterList_1_4_0 + P-masterList_1_4_1 + P-masterList_1_4_2 + P-masterList_1_4_3 + P-masterList_1_4_4 + P-masterList_1_4_5 + P-masterList_1_4_6 + P-masterList_0_1_6 + P-masterList_0_1_5 + P-masterList_0_1_4 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_4_3_0 + P-masterList_4_3_1 + P-masterList_4_3_2 + P-masterList_4_3_3 + P-masterList_4_3_4 + P-masterList_4_3_5 + P-masterList_4_3_6 + P-masterList_2_5_6 + P-masterList_2_5_5 + P-masterList_2_5_4 + P-masterList_2_5_3 + P-masterList_2_5_2 + P-masterList_1_5_0 + P-masterList_1_5_1 + P-masterList_1_5_2 + P-masterList_1_5_3 + P-masterList_1_5_4 + P-masterList_1_5_5 + P-masterList_1_5_6 + P-masterList_2_5_1 + P-masterList_2_5_0 + P-masterList_5_3_6 + P-masterList_5_3_5 + P-masterList_5_3_4 + P-masterList_5_3_3 + P-masterList_5_3_2 + P-masterList_5_3_1 + P-masterList_5_3_0 + P-masterList_4_4_0 + P-masterList_4_4_1 + P-masterList_4_4_2 + P-masterList_4_4_3 + P-masterList_4_4_4 + P-masterList_4_4_5 + P-masterList_4_4_6 + P-masterList_1_6_0 + P-masterList_1_6_1 + P-masterList_1_6_2 + P-masterList_1_6_3 + P-masterList_1_6_4 + P-masterList_1_6_5 + P-masterList_1_6_6 + P-masterList_4_5_0 + P-masterList_4_5_1 + P-masterList_4_5_2 + P-masterList_4_5_3 + P-masterList_4_5_4 + P-masterList_4_5_5 + P-masterList_4_5_6 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_1_4 + P-masterList_2_1_5 + P-masterList_2_1_6 + P-masterList_4_6_0 + P-masterList_4_6_1 + P-masterList_4_6_2 + P-masterList_4_6_3 + P-masterList_4_6_4 + P-masterList_4_6_5 + P-masterList_4_6_6 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_2_4 + P-masterList_2_2_5 + P-masterList_2_2_6 + P-masterList_2_4_6 + P-masterList_2_4_5 + P-masterList_2_4_4 + P-masterList_2_4_3 + P-masterList_2_4_2 + P-masterList_2_4_1 + P-masterList_2_4_0 + P-masterList_5_2_6 + P-masterList_5_2_5 + P-masterList_5_2_4 + P-masterList_5_2_3 + P-masterList_5_2_2 + P-masterList_5_2_1 + P-masterList_5_2_0 + P-masterList_5_1_0 + P-masterList_5_1_1 + P-masterList_5_1_2 + P-masterList_5_1_3 + P-masterList_5_1_4 + P-masterList_5_1_5 + P-masterList_5_1_6 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3 + P-masterList_2_3_4 + P-masterList_2_3_5 + P-masterList_2_3_6)
lola: after: (0 <= 30)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-crashed_6 + P-crashed_5 + P-crashed_4 + P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-crashed_6 + P-crashed_5 + P-crashed_4 + P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_6_F_5 + P-masterState_6_F_4 + P-masterState_6_F_3 + P-masterState_6_F_2 + P-masterState_6_F_1 + P-masterState_6_F_0 + P-masterState_1_T_5 + P-masterState_1_T_4 + P-masterState_1_T_3 + P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_5 + P-masterState_3_F_4 + P-masterState_3_F_3 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_4_T_0 + P-masterState_4_T_1 + P-masterState_4_T_2 + P-masterState_4_T_3 + P-masterState_4_T_4 + P-masterState_4_T_5 + P-masterState_4_T_6 + P-masterState_6_T_6 + P-masterState_6_T_5 + P-masterState_6_T_4 + P-masterState_6_T_3 + P-masterState_6_T_2 + P-masterState_6_T_1 + P-masterState_6_T_0 + P-masterState_0_F_5 + P-masterState_0_F_4 + P-masterState_0_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_6 + P-masterState_3_T_5 + P-masterState_3_T_4 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_1_F_4 + P-masterState_1_F_5 + P-masterState_1_F_6 + P-masterState_5_F_5 + P-masterState_5_F_4 + P-masterState_5_F_3 + P-masterState_5_F_2 + P-masterState_5_F_1 + P-masterState_5_F_0 + P-masterState_0_T_6 + P-masterState_0_T_5 + P-masterState_0_T_4 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_5 + P-masterState_2_F_4 + P-masterState_2_F_3 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_5_T_6 + P-masterState_5_T_5 + P-masterState_5_T_4 + P-masterState_5_T_3 + P-masterState_5_T_2 + P-masterState_5_T_1 + P-masterState_5_T_0 + P-masterState_4_F_0 + P-masterState_4_F_1 + P-masterState_4_F_2 + P-masterState_4_F_3 + P-masterState_4_F_4 + P-masterState_4_F_5 + P-masterState_2_T_6 + P-masterState_2_T_5 + P-masterState_2_T_4 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_4_F_6 + P-masterState_2_F_6 + P-masterState_5_F_6 + P-masterState_0_F_6 + P-masterState_3_F_6 + P-masterState_1_T_6 + P-masterState_6_F_6 <= P-dead_6 + P-dead_5 + P-dead_4 + P-dead_3 + P-dead_2 + P-dead_1 + P-dead_0)
lola: after: (6 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= P-stage_2_SEC + P-stage_3_NEG + P-stage_5_SEC + P-stage_4_PRIM + P-stage_1_SEC + P-stage_6_SEC + P-stage_3_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_6_NEG + P-stage_4_NEG + P-stage_5_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_3_PRIM + P-stage_4_SEC + P-stage_5_NEG + P-stage_6_PRIM + P-stage_0_NEG + P-stage_1_PRIM)
lola: after: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= 6)
lola: LP says that atomic proposition is always true: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-masterList_5_6_0 + P-masterList_5_6_1 + P-masterList_5_6_2 + P-masterList_5_6_3 + P-masterList_5_6_4 + P-masterList_5_6_5 + P-masterList_5_6_6 + P-masterList_3_2_0 + P-masterList_3_2_1 + P-masterList_3_2_2 + P-masterList_3_2_3 + P-masterList_3_2_4 + P-masterList_3_2_5 + P-masterList_3_2_6 + P-masterList_0_4_0 + P-masterList_0_4_1 + P-masterList_0_4_2 + P-masterList_0_4_3 + P-masterList_0_4_4 + P-masterList_0_4_5 + P-masterList_0_4_6 + P-masterList_0_3_6 + P-masterList_0_3_5 + P-masterList_0_3_4 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_6_1_0 + P-masterList_6_1_1 + P-masterList_6_1_2 + P-masterList_6_1_3 + P-masterList_6_1_4 + P-masterList_6_1_5 + P-masterList_6_1_6 + P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_3_4 + P-masterList_3_3_5 + P-masterList_3_3_6 + P-masterList_0_5_0 + P-masterList_0_5_1 + P-masterList_0_5_2 + P-masterList_0_5_3 + P-masterList_0_5_4 + P-masterList_0_5_5 + P-masterList_0_5_6 + P-masterList_3_1_6 + P-masterList_3_1_5 + P-masterList_3_1_4 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_6_2_0 + P-masterList_6_2_1 + P-masterList_6_2_2 + P-masterList_6_2_3 + P-masterList_6_2_4 + P-masterList_6_2_5 + P-masterList_6_2_6 + P-masterList_3_4_0 + P-masterList_3_4_1 + P-masterList_3_4_2 + P-masterList_3_4_3 + P-masterList_3_4_4 + P-masterList_3_4_5 + P-masterList_3_4_6 + P-masterList_0_6_0 + P-masterList_0_6_1 + P-masterList_0_6_2 + P-masterList_0_6_3 + P-masterList_0_6_4 + P-masterList_0_6_5 + P-masterList_0_6_6 + P-masterList_5_5_6 + P-masterList_5_5_5 + P-masterList_5_5_4 + P-masterList_5_5_3 + P-masterList_5_5_2 + P-masterList_5_5_1 + P-masterList_5_5_0 + P-masterList_6_3_0 + P-masterList_6_3_1 + P-masterList_6_3_2 + P-masterList_6_3_3 + P-masterList_6_3_4 + P-masterList_6_3_5 + P-masterList_6_3_6 + P-masterList_3_5_0 + P-masterList_3_5_1 + P-masterList_3_5_2 + P-masterList_3_5_3 + P-masterList_3_5_4 + P-masterList_3_5_5 + P-masterList_3_5_6 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_1_4 + P-masterList_1_1_5 + P-masterList_1_1_6 + P-masterList_0_2_6 + P-masterList_0_2_5 + P-masterList_0_2_4 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_6_4_0 + P-masterList_6_4_1 + P-masterList_6_4_2 + P-masterList_6_4_3 + P-masterList_6_4_4 + P-masterList_6_4_5 + P-masterList_6_4_6 + P-masterList_3_6_0 + P-masterList_3_6_1 + P-masterList_3_6_2 + P-masterList_3_6_3 + P-masterList_3_6_4 + P-masterList_3_6_5 + P-masterList_3_6_6 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_2_4 + P-masterList_1_2_5 + P-masterList_1_2_6 + P-masterList_6_5_0 + P-masterList_6_5_1 + P-masterList_6_5_2 + P-masterList_6_5_3 + P-masterList_6_5_4 + P-masterList_6_5_5 + P-masterList_6_5_6 + P-masterList_2_6_6 + P-masterList_2_6_5 + P-masterList_2_6_4 + P-masterList_2_6_3 + P-masterList_2_6_2 + P-masterList_2_6_1 + P-masterList_2_6_0 + P-masterList_5_4_6 + P-masterList_5_4_5 + P-masterList_5_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_1_5 + P-masterList_4_1_6 + P-masterList_5_4_3 + P-masterList_5_4_2 + P-masterList_5_4_1 + P-masterList_5_4_0 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_1_3_4 + P-masterList_1_3_5 + P-masterList_1_3_6 + P-masterList_6_6_0 + P-masterList_6_6_1 + P-masterList_6_6_2 + P-masterList_6_6_3 + P-masterList_6_6_4 + P-masterList_6_6_5 + P-masterList_6_6_6 + P-masterList_4_2_0 + P-masterList_4_2_1 + P-masterList_4_2_2 + P-masterList_4_2_3 + P-masterList_4_2_4 + P-masterList_4_2_5 + P-masterList_4_2_6 + P-masterList_1_4_0 + P-masterList_1_4_1 + P-masterList_1_4_2 + P-masterList_1_4_3 + P-masterList_1_4_4 + P-masterList_1_4_5 + P-masterList_1_4_6 + P-masterList_0_1_6 + P-masterList_0_1_5 + P-masterList_0_1_4 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_4_3_0 + P-masterList_4_3_1 + P-masterList_4_3_2 + P-masterList_4_3_3 + P-masterList_4_3_4 + P-masterList_4_3_5 + P-masterList_4_3_6 + P-masterList_2_5_6 + P-masterList_2_5_5 + P-masterList_2_5_4 + P-masterList_2_5_3 + P-masterList_2_5_2 + P-masterList_1_5_0 + P-masterList_1_5_1 + P-masterList_1_5_2 + P-masterList_1_5_3 + P-masterList_1_5_4 + P-masterList_1_5_5 + P-masterList_1_5_6 + P-masterList_2_5_1 + P-masterList_2_5_0 + P-masterList_5_3_6 + P-masterList_5_3_5 + P-masterList_5_3_4 + P-masterList_5_3_3 + P-masterList_5_3_2 + P-masterList_5_3_1 + P-masterList_5_3_0 + P-masterList_4_4_0 + P-masterList_4_4_1 + P-masterList_4_4_2 + P-masterList_4_4_3 + P-masterList_4_4_4 + P-masterList_4_4_5 + P-masterList_4_4_6 + P-masterList_1_6_0 + P-masterList_1_6_1 + P-masterList_1_6_2 + P-masterList_1_6_3 + P-masterList_1_6_4 + P-masterList_1_6_5 + P-masterList_1_6_6 + P-masterList_4_5_0 + P-masterList_4_5_1 + P-masterList_4_5_2 + P-masterList_4_5_3 + P-masterList_4_5_4 + P-masterList_4_5_5 + P-masterList_4_5_6 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_1_4 + P-masterList_2_1_5 + P-masterList_2_1_6 + P-masterList_4_6_0 + P-masterList_4_6_1 + P-masterList_4_6_2 + P-masterList_4_6_3 + P-masterList_4_6_4 + P-masterList_4_6_5 + P-masterList_4_6_6 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_2_4 + P-masterList_2_2_5 + P-masterList_2_2_6 + P-masterList_2_4_6 + P-masterList_2_4_5 + P-masterList_2_4_4 + P-masterList_2_4_3 + P-masterList_2_4_2 + P-masterList_2_4_1 + P-masterList_2_4_0 + P-masterList_5_2_6 + P-masterList_5_2_5 + P-masterList_5_2_4 + P-masterList_5_2_3 + P-masterList_5_2_2 + P-masterList_5_2_1 + P-masterList_5_2_0 + P-masterList_5_1_0 + P-masterList_5_1_1 + P-masterList_5_1_2 + P-masterList_5_1_3 + P-masterList_5_1_4 + P-masterList_5_1_5 + P-masterList_5_1_6 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3 + P-masterList_2_3_4 + P-masterList_2_3_5 + P-masterList_2_3_6)
lola: after: (0 <= 27)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + P-electionFailed_3 + P-electionFailed_4 + P-electionFailed_5 + P-electionFailed_6 <= P-stage_2_SEC + P-stage_3_NEG + P-stage_5_SEC + P-stage_4_PRIM + P-stage_1_SEC + P-stage_6_SEC + P-stage_3_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_6_NEG + P-stage_4_NEG + P-stage_5_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_3_PRIM + P-stage_4_SEC + P-stage_5_NEG + P-stage_6_PRIM + P-stage_0_NEG + P-stage_1_PRIM)
lola: after: (0 <= 6)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= P-negotiation_6_4_NONE + P-negotiation_6_2_CO + P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_1_3_CO + P-negotiation_5_6_CO + P-negotiation_3_1_CO + P-negotiation_4_3_CO + P-negotiation_0_5_DONE + P-negotiation_5_0_NONE + P-negotiation_5_6_NONE + P-negotiation_5_3_DONE + P-negotiation_3_4_DONE + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_1_5_DONE + P-negotiation_2_6_CO + P-negotiation_0_2_CO + P-negotiation_0_2_NONE + P-negotiation_4_3_DONE + P-negotiation_6_1_DONE + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_2_1_NONE + P-negotiation_0_1_NONE + P-negotiation_6_2_DONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_0_4_DONE + P-negotiation_2_1_CO + P-negotiation_1_2_CO + P-negotiation_6_4_CO + P-negotiation_5_0_DONE + P-negotiation_2_4_CO + P-negotiation_3_1_DONE + P-negotiation_6_3_NONE + P-negotiation_1_2_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_6_6_DONE + P-negotiation_2_5_NONE + P-negotiation_3_6_CO + P-negotiation_0_6_NONE + P-negotiation_1_6_DONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_3_5_DONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_1_3_NONE + P-negotiation_3_6_DONE + P-negotiation_5_4_DONE + P-negotiation_3_4_CO + P-negotiation_3_2_NONE + P-negotiation_1_0_CO + P-negotiation_0_0_DONE + P-negotiation_6_3_DONE + P-negotiation_2_2_NONE + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_2_5_DONE + P-negotiation_0_6_DONE + P-negotiation_5_3_CO + P-negotiation_4_1_CO + P-negotiation_6_1_CO + P-negotiation_5_2_DONE + P-negotiation_3_3_DONE + P-negotiation_6_5_NONE + P-negotiation_1_4_DONE + P-negotiation_4_6_NONE + P-negotiation_6_0_CO + P-negotiation_0_4_CO + P-negotiation_6_0_DONE + P-negotiation_4_1_DONE + P-negotiation_2_2_DONE + P-negotiation_4_6_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_1_6_NONE + P-negotiation_1_1_CO + P-negotiation_6_5_DONE + P-negotiation_3_0_CO + P-negotiation_6_6_CO + P-negotiation_5_4_CO + P-negotiation_1_1_DONE + P-negotiation_3_0_DONE + P-negotiation_4_2_CO + P-negotiation_6_2_NONE + P-negotiation_4_3_NONE + P-negotiation_2_4_NONE + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_0_0_NONE + P-negotiation_0_5_NONE + P-negotiation_1_6_CO + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_6_5_CO + P-negotiation_4_1_NONE + P-negotiation_6_0_NONE + P-negotiation_2_2_CO + P-negotiation_4_6_CO + P-negotiation_0_3_CO + P-negotiation_5_2_CO + P-negotiation_3_6_NONE + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_1_4_CO + P-negotiation_6_6_NONE + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_6_3_CO + P-negotiation_2_6_DONE + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_2_3_NONE + P-negotiation_6_4_DONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_1_0_DONE + P-negotiation_6_1_NONE + P-negotiation_3_2_CO + P-negotiation_4_4_CO + P-negotiation_0_1_CO + P-negotiation_1_5_NONE + P-negotiation_5_6_DONE + P-negotiation_3_4_NONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_4_0_DONE + P-negotiation_2_6_NONE + P-negotiation_0_6_CO + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_1_3_DONE)
lola: after: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= 36)
lola: LP says that atomic proposition is always true: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= 36)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_6_6 + P-sendAnnPs__broadcasting_6_5 + P-sendAnnPs__broadcasting_6_4 + P-sendAnnPs__broadcasting_6_3 + P-sendAnnPs__broadcasting_6_2 + P-sendAnnPs__broadcasting_6_1 + P-sendAnnPs__broadcasting_5_6 + P-sendAnnPs__broadcasting_5_5 + P-sendAnnPs__broadcasting_5_4 + P-sendAnnPs__broadcasting_5_3 + P-sendAnnPs__broadcasting_5_2 + P-sendAnnPs__broadcasting_5_1 + P-sendAnnPs__broadcasting_4_6 + P-sendAnnPs__broadcasting_4_5 + P-sendAnnPs__broadcasting_4_4 + P-sendAnnPs__broadcasting_4_3 + P-sendAnnPs__broadcasting_4_2 + P-sendAnnPs__broadcasting_4_1 + P-sendAnnPs__broadcasting_3_6 + P-sendAnnPs__broadcasting_3_5 + P-sendAnnPs__broadcasting_3_4 + P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_6 + P-sendAnnPs__broadcasting_2_5 + P-sendAnnPs__broadcasting_2_4 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_6 + P-sendAnnPs__broadcasting_1_5 + P-sendAnnPs__broadcasting_1_4 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_6 + P-sendAnnPs__broadcasting_0_5 + P-sendAnnPs__broadcasting_0_4 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_4 + P-poll__waitingMessage_5 + P-poll__waitingMessage_6 + P-poll__waitingMessage_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_5_RP_6 <= P-network_0_3_RP_2)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_4_AnnP_4 <= P-poll__networl_5_2_AnsP_4)
lola: after: (0 <= P-poll__networl_5_2_AnsP_4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_5_1_AnnP_2 <= P-poll__networl_2_0_AI_5)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_4_1_RI_3 <= P-network_0_1_RI_2)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_4_RI_4 <= P-poll__networl_2_4_AI_4)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_2_AskP_6 <= P-network_2_6_RI_2)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_6_3_AnsP_0 <= P-network_0_6_AskP_5)
lola: after: (P-network_6_3_AnsP_0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_4_3_AI_6 <= P-poll__networl_2_3_AI_6)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_0_F_2 <= P-network_0_1_RI_4)
lola: after: (P-masterState_0_F_2 <= 0)
lola: LP says that atomic proposition is always true: (P-masterState_0_F_2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_2_RP_6 <= P-poll__networl_1_3_AskP_0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_6_0_AnnP_0 <= P-negotiation_2_3_DONE)
lola: after: (0 <= P-negotiation_2_3_DONE)
lola: always true
lola: A (F (X (G (X (TRUE))))) : A (F (G ((TRUE U FALSE)))) : A ((1 <= P-poll__pollEnd_6 + P-poll__pollEnd_5 + P-poll__pollEnd_4 + P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) : A (X (FALSE)) : A (FALSE) : A ((TRUE U X (X (TRUE)))) : A ((((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_4 + P-poll__waitingMessage_5 + P-poll__waitingMessage_6 + P-poll__waitingMessage_3) U TRUE) U G (F (TRUE)))) : A (TRUE) : A (X ((TRUE U G (TRUE)))) : A (TRUE) : A ((G (G (TRUE)) U TRUE)) : A (F (F (TRUE))) : A (G ((P-network_6_3_AnsP_0 <= 0))) : A (F (F (G (F (TRUE))))) : A (F (TRUE)) : A (F (G ((TRUE U TRUE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P-poll__pollEnd_6 + P-poll__pollEnd_5 + P-poll__pollEnd_4 + P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-poll__pollEnd_6 + P-poll__pollEnd_5 + P-poll__pollEnd_4 + P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)
lola: processed formula length: 144
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA NeoElection-PT-6-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA NeoElection-PT-6-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 69 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P-network_6_3_AnsP_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((P-network_6_3_AnsP_0 <= 0)))
lola: processed formula length: 35
lola: 71 rewrites
lola: closed formula file NeoElection-PT-6-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (1 <= P-network_6_3_AnsP_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-6-LTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA NeoElection-PT-6-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes yes yes yes yes yes no yes yes yes
lola:
preliminary result: yes no no no no yes yes yes yes yes yes yes no yes yes yes
lola: memory consumption: 39824 KB
lola: time consumption: 12 seconds

BK_STOP 1553035340600

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-3954"
echo " Executing tool win2018"
echo " Input is NeoElection-PT-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110-oct2-155272242200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-6.tgz
mv NeoElection-PT-6 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;