About the Execution of 2018-Gold for NeoElection-PT-8
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
274.780 | 105238.00 | 106729.00 | 32.40 | TFTFTTTFTTTTTTTT | 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-155272242200080.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-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242200080
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 293K Feb 12 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 736K Feb 12 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 452K Feb 8 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 8 02:03 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 26K Feb 5 00:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 5 00:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 126K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 317K Feb 4 07:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 766K Feb 4 07:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 1 01:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 1 01:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 97K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 197K Feb 4 22:22 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 20M 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-8-LTLCardinality-00
FORMULA_NAME NeoElection-PT-8-LTLCardinality-01
FORMULA_NAME NeoElection-PT-8-LTLCardinality-02
FORMULA_NAME NeoElection-PT-8-LTLCardinality-03
FORMULA_NAME NeoElection-PT-8-LTLCardinality-04
FORMULA_NAME NeoElection-PT-8-LTLCardinality-05
FORMULA_NAME NeoElection-PT-8-LTLCardinality-06
FORMULA_NAME NeoElection-PT-8-LTLCardinality-07
FORMULA_NAME NeoElection-PT-8-LTLCardinality-08
FORMULA_NAME NeoElection-PT-8-LTLCardinality-09
FORMULA_NAME NeoElection-PT-8-LTLCardinality-10
FORMULA_NAME NeoElection-PT-8-LTLCardinality-11
FORMULA_NAME NeoElection-PT-8-LTLCardinality-12
FORMULA_NAME NeoElection-PT-8-LTLCardinality-13
FORMULA_NAME NeoElection-PT-8-LTLCardinality-14
FORMULA_NAME NeoElection-PT-8-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553035349034
info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-8 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-8 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ NeoElection-PT-8 @ 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: 32328/65536 symbol table entries, 8032 collisions
lola: preprocessing...
lola: Size of bit vector: 10062
lola: finding significant places
lola: 10062 places, 22266 transitions, 2295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5067 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-8-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (P-sendAnnPs__broadcasting_8_8 + P-sendAnnPs__broadcasting_8_7 + P-sendAnnPs__broadcasting_8_6 + P-sendAnnPs__broadcasting_8_5 + P-sendAnnPs__broadcasting_8_4 + P-sendAnnPs__broadcasting_8_3 + P-sendAnnPs__broadcasting_8_2 + P-sendAnnPs__broadcasting_8_1 + P-sendAnnPs__broadcasting_7_8 + P-sendAnnPs__broadcasting_7_7 + P-sendAnnPs__broadcasting_7_6 + P-sendAnnPs__broadcasting_7_5 + P-sendAnnPs__broadcasting_7_4 + P-sendAnnPs__broadcasting_7_3 + P-sendAnnPs__broadcasting_7_2 + P-sendAnnPs__broadcasting_7_1 + P-sendAnnPs__broadcasting_6_8 + P-sendAnnPs__broadcasting_6_7 + 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_8 + P-sendAnnPs__broadcasting_5_7 + 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_8 + P-sendAnnPs__broadcasting_4_7 + 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_8 + P-sendAnnPs__broadcasting_3_7 + 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_8 + P-sendAnnPs__broadcasting_2_7 + 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_8 + P-sendAnnPs__broadcasting_1_7 + 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_8 + P-sendAnnPs__broadcasting_0_7 + 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-stage_2_SEC + P-stage_3_NEG + P-stage_1_SEC + P-stage_5_SEC + P-stage_4_PRIM + P-stage_6_SEC + P-stage_3_SEC + P-stage_0_SEC + P-stage_7_PRIM + P-stage_8_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_6_NEG + P-stage_4_NEG + P-stage_5_PRIM + P-stage_7_NEG + P-stage_0_PRIM + P-stage_8_PRIM + P-stage_2_NEG + P-stage_3_PRIM + P-stage_4_SEC + P-stage_5_NEG + P-stage_7_SEC + P-stage_6_PRIM + P-stage_8_NEG + P-stage_0_NEG + P-stage_1_PRIM)
lola: after: (P-sendAnnPs__broadcasting_8_8 + P-sendAnnPs__broadcasting_8_7 + P-sendAnnPs__broadcasting_8_6 + P-sendAnnPs__broadcasting_8_5 + P-sendAnnPs__broadcasting_8_4 + P-sendAnnPs__broadcasting_8_3 + P-sendAnnPs__broadcasting_8_2 + P-sendAnnPs__broadcasting_8_1 + P-sendAnnPs__broadcasting_7_8 + P-sendAnnPs__broadcasting_7_7 + P-sendAnnPs__broadcasting_7_6 + P-sendAnnPs__broadcasting_7_5 + P-sendAnnPs__broadcasting_7_4 + P-sendAnnPs__broadcasting_7_3 + P-sendAnnPs__broadcasting_7_2 + P-sendAnnPs__broadcasting_7_1 + P-sendAnnPs__broadcasting_6_8 + P-sendAnnPs__broadcasting_6_7 + 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_8 + P-sendAnnPs__broadcasting_5_7 + 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_8 + P-sendAnnPs__broadcasting_4_7 + 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_8 + P-sendAnnPs__broadcasting_3_7 + 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_8 + P-sendAnnPs__broadcasting_2_7 + 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_8 + P-sendAnnPs__broadcasting_1_7 + 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_8 + P-sendAnnPs__broadcasting_0_7 + 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 <= 8)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_8_8 + P-sendAnnPs__broadcasting_8_7 + P-sendAnnPs__broadcasting_8_6 + P-sendAnnPs__broadcasting_8_5 + P-sendAnnPs__broadcasting_8_4 + P-sendAnnPs__broadcasting_8_3 + P-sendAnnPs__broadcasting_8_2 + P-sendAnnPs__broadcasting_8_1 + P-sendAnnPs__broadcasting_7_8 + P-sendAnnPs__broadcasting_7_7 + P-sendAnnPs__broadcasting_7_6 + P-sendAnnPs__broadcasting_7_5 + P-sendAnnPs__broadcasting_7_4 + P-sendAnnPs__broadcasting_7_3 + P-sendAnnPs__broadcasting_7_2 + P-sendAnnPs__broadcasting_7_1 + P-sendAnnPs__broadcasting_6_8 + P-sendAnnPs__broadcasting_6_7 + 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_8 + P-sendAnnPs__broadcasting_5_7 + 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_8 + P-sendAnnPs__broadcasting_4_7 + 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_8 + P-sendAnnPs__broadcasting_3_7 + 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_8 + P-sendAnnPs__broadcasting_2_7 + 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_8 + P-sendAnnPs__broadcasting_1_7 + 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_8 + P-sendAnnPs__broadcasting_0_7 + 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 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_6_4_NONE + P-negotiation_6_2_CO + P-negotiation_3_2_DONE + P-negotiation_8_3_NONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_7_4_CO + P-negotiation_1_3_CO + P-negotiation_7_0_DONE + P-negotiation_8_6_CO + P-negotiation_3_7_DONE + P-negotiation_1_8_DONE + P-negotiation_5_6_CO + P-negotiation_7_5_CO + P-negotiation_3_1_CO + P-negotiation_1_8_NONE + P-negotiation_0_7_DONE + P-negotiation_0_7_CO + P-negotiation_5_0_NONE + P-negotiation_7_2_DONE + P-negotiation_3_7_NONE + P-negotiation_4_3_CO + P-negotiation_5_3_DONE + P-negotiation_7_8_DONE + P-negotiation_0_5_DONE + P-negotiation_3_4_DONE + P-negotiation_1_5_DONE + P-negotiation_8_8_DONE + P-negotiation_5_6_NONE + P-negotiation_2_6_CO + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_0_2_CO + P-negotiation_7_5_NONE + P-negotiation_0_2_NONE + P-negotiation_8_0_DONE + P-negotiation_4_3_DONE + P-negotiation_6_1_DONE + P-negotiation_6_7_CO + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_0_1_NONE + P-negotiation_2_1_NONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_6_2_DONE + P-negotiation_0_4_DONE + P-negotiation_7_7_DONE + P-negotiation_5_8_DONE + P-negotiation_2_1_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_8_8_CO + P-negotiation_8_1_DONE + P-negotiation_6_4_CO + P-negotiation_5_0_DONE + P-negotiation_8_2_NONE + P-negotiation_1_2_CO + P-negotiation_3_1_DONE + P-negotiation_6_3_NONE + P-negotiation_1_2_DONE + P-negotiation_8_5_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_6_6_DONE + P-negotiation_2_5_NONE + P-negotiation_2_4_CO + P-negotiation_4_7_DONE + P-negotiation_0_6_NONE + P-negotiation_2_8_DONE + P-negotiation_8_3_CO + P-negotiation_3_6_CO + P-negotiation_7_1_NONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_7_4_DONE + P-negotiation_3_3_NONE + P-negotiation_8_0_CO + P-negotiation_4_8_NONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_8_7_NONE + P-negotiation_1_6_DONE + P-negotiation_4_8_CO + P-negotiation_3_6_DONE + P-negotiation_6_8_NONE + P-negotiation_5_8_CO + P-negotiation_1_7_DONE + P-negotiation_6_7_NONE + P-negotiation_3_4_CO + P-negotiation_3_5_DONE + P-negotiation_8_2_DONE + P-negotiation_1_0_CO + P-negotiation_8_6_NONE + P-negotiation_1_3_NONE + P-negotiation_6_3_DONE + P-negotiation_2_2_NONE + P-negotiation_5_4_DONE + P-negotiation_7_7_CO + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_7_6_NONE + P-negotiation_2_5_DONE + P-negotiation_5_7_NONE + P-negotiation_3_2_NONE + P-negotiation_0_6_DONE + P-negotiation_5_3_CO + P-negotiation_7_3_DONE + P-negotiation_0_0_DONE + P-negotiation_3_8_NONE + P-negotiation_4_1_CO + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_7_1_DONE + P-negotiation_5_2_DONE + P-negotiation_8_4_NONE + P-negotiation_7_0_NONE + P-negotiation_3_3_DONE + P-negotiation_7_2_CO + P-negotiation_6_5_NONE + P-negotiation_2_8_CO + P-negotiation_1_4_DONE + P-negotiation_8_7_DONE + P-negotiation_1_7_CO + P-negotiation_4_6_NONE + P-negotiation_6_0_CO + P-negotiation_6_8_DONE + P-negotiation_2_7_NONE + P-negotiation_0_8_NONE + P-negotiation_0_4_CO + P-negotiation_6_1_CO + P-negotiation_6_0_DONE + P-negotiation_4_7_CO + P-negotiation_4_1_DONE + P-negotiation_7_3_CO + P-negotiation_2_2_DONE + P-negotiation_0_8_DONE + P-negotiation_0_3_DONE + P-negotiation_7_6_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_5_7_DONE + P-negotiation_1_6_NONE + P-negotiation_1_1_CO + P-negotiation_3_8_DONE + P-negotiation_8_5_CO + P-negotiation_2_7_DONE + P-negotiation_6_6_CO + P-negotiation_7_8_NONE + P-negotiation_5_4_CO + P-negotiation_8_1_NONE + P-negotiation_4_6_DONE + P-negotiation_3_0_DONE + P-negotiation_4_2_CO + P-negotiation_1_1_DONE + P-negotiation_8_4_DONE + P-negotiation_3_0_CO + P-negotiation_6_5_DONE + P-negotiation_2_4_NONE + P-negotiation_4_3_NONE + P-negotiation_6_2_NONE + P-negotiation_0_5_NONE + P-negotiation_7_8_CO + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_7_3_NONE + P-negotiation_0_0_NONE + P-negotiation_1_6_CO + P-negotiation_1_1_NONE + P-negotiation_8_4_CO + 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_2_7_CO + P-negotiation_7_1_CO + P-negotiation_0_8_CO + P-negotiation_5_2_CO + P-negotiation_7_6_CO + P-negotiation_1_7_NONE + P-negotiation_3_6_NONE + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_7_4_NONE + P-negotiation_5_7_CO + P-negotiation_1_4_CO + P-negotiation_2_8_NONE + P-negotiation_7_0_CO + P-negotiation_4_7_NONE + P-negotiation_3_8_CO + P-negotiation_6_6_NONE + P-negotiation_8_2_CO + P-negotiation_8_5_NONE + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_6_3_CO + P-negotiation_5_8_NONE + P-negotiation_2_6_DONE + P-negotiation_7_7_NONE + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_8_7_CO + P-negotiation_2_3_NONE + P-negotiation_6_4_DONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_8_3_DONE + P-negotiation_1_0_DONE + P-negotiation_6_1_NONE + P-negotiation_3_2_CO + P-negotiation_8_0_NONE + P-negotiation_4_4_CO + P-negotiation_6_8_CO + P-negotiation_0_1_CO + P-negotiation_8_8_NONE + P-negotiation_1_5_NONE + P-negotiation_5_6_DONE + P-negotiation_3_4_NONE + P-negotiation_7_5_DONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_7_2_NONE + P-negotiation_4_0_DONE + P-negotiation_3_7_CO + P-negotiation_8_1_CO + P-negotiation_0_7_NONE + P-negotiation_4_8_DONE + P-negotiation_2_6_NONE + P-negotiation_0_6_CO + P-negotiation_6_7_DONE + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_8_6_DONE + P-negotiation_1_3_DONE + P-negotiation_1_8_CO <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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: after: (64 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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: (2 <= P-negotiation_6_4_NONE + P-negotiation_6_2_CO + P-negotiation_3_2_DONE + P-negotiation_8_3_NONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_7_4_CO + P-negotiation_1_3_CO + P-negotiation_7_0_DONE + P-negotiation_8_6_CO + P-negotiation_3_7_DONE + P-negotiation_1_8_DONE + P-negotiation_5_6_CO + P-negotiation_7_5_CO + P-negotiation_3_1_CO + P-negotiation_1_8_NONE + P-negotiation_0_7_DONE + P-negotiation_0_7_CO + P-negotiation_5_0_NONE + P-negotiation_7_2_DONE + P-negotiation_3_7_NONE + P-negotiation_4_3_CO + P-negotiation_5_3_DONE + P-negotiation_7_8_DONE + P-negotiation_0_5_DONE + P-negotiation_3_4_DONE + P-negotiation_1_5_DONE + P-negotiation_8_8_DONE + P-negotiation_5_6_NONE + P-negotiation_2_6_CO + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_0_2_CO + P-negotiation_7_5_NONE + P-negotiation_0_2_NONE + P-negotiation_8_0_DONE + P-negotiation_4_3_DONE + P-negotiation_6_1_DONE + P-negotiation_6_7_CO + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_0_1_NONE + P-negotiation_2_1_NONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_6_2_DONE + P-negotiation_0_4_DONE + P-negotiation_7_7_DONE + P-negotiation_5_8_DONE + P-negotiation_2_1_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_8_8_CO + P-negotiation_8_1_DONE + P-negotiation_6_4_CO + P-negotiation_5_0_DONE + P-negotiation_8_2_NONE + P-negotiation_1_2_CO + P-negotiation_3_1_DONE + P-negotiation_6_3_NONE + P-negotiation_1_2_DONE + P-negotiation_8_5_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_6_6_DONE + P-negotiation_2_5_NONE + P-negotiation_2_4_CO + P-negotiation_4_7_DONE + P-negotiation_0_6_NONE + P-negotiation_2_8_DONE + P-negotiation_8_3_CO + P-negotiation_3_6_CO + P-negotiation_7_1_NONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_7_4_DONE + P-negotiation_3_3_NONE + P-negotiation_8_0_CO + P-negotiation_4_8_NONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_8_7_NONE + P-negotiation_1_6_DONE + P-negotiation_4_8_CO + P-negotiation_3_6_DONE + P-negotiation_6_8_NONE + P-negotiation_5_8_CO + P-negotiation_1_7_DONE + P-negotiation_6_7_NONE + P-negotiation_3_4_CO + P-negotiation_3_5_DONE + P-negotiation_8_2_DONE + P-negotiation_1_0_CO + P-negotiation_8_6_NONE + P-negotiation_1_3_NONE + P-negotiation_6_3_DONE + P-negotiation_2_2_NONE + P-negotiation_5_4_DONE + P-negotiation_7_7_CO + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_7_6_NONE + P-negotiation_2_5_DONE + P-negotiation_5_7_NONE + P-negotiation_3_2_NONE + P-negotiation_0_6_DONE + P-negotiation_5_3_CO + P-negotiation_7_3_DONE + P-negotiation_0_0_DONE + P-negotiation_3_8_NONE + P-negotiation_4_1_CO + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_7_1_DONE + P-negotiation_5_2_DONE + P-negotiation_8_4_NONE + P-negotiation_7_0_NONE + P-negotiation_3_3_DONE + P-negotiation_7_2_CO + P-negotiation_6_5_NONE + P-negotiation_2_8_CO + P-negotiation_1_4_DONE + P-negotiation_8_7_DONE + P-negotiation_1_7_CO + P-negotiation_4_6_NONE + P-negotiation_6_0_CO + P-negotiation_6_8_DONE + P-negotiation_2_7_NONE + P-negotiation_0_8_NONE + P-negotiation_0_4_CO + P-negotiation_6_1_CO + P-negotiation_6_0_DONE + P-negotiation_4_7_CO + P-negotiation_4_1_DONE + P-negotiation_7_3_CO + P-negotiation_2_2_DONE + P-negotiation_0_8_DONE + P-negotiation_0_3_DONE + P-negotiation_7_6_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_5_7_DONE + P-negotiation_1_6_NONE + P-negotiation_1_1_CO + P-negotiation_3_8_DONE + P-negotiation_8_5_CO + P-negotiation_2_7_DONE + P-negotiation_6_6_CO + P-negotiation_7_8_NONE + P-negotiation_5_4_CO + P-negotiation_8_1_NONE + P-negotiation_4_6_DONE + P-negotiation_3_0_DONE + P-negotiation_4_2_CO + P-negotiation_1_1_DONE + P-negotiation_8_4_DONE + P-negotiation_3_0_CO + P-negotiation_6_5_DONE + P-negotiation_2_4_NONE + P-negotiation_4_3_NONE + P-negotiation_6_2_NONE + P-negotiation_0_5_NONE + P-negotiation_7_8_CO + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_7_3_NONE + P-negotiation_0_0_NONE + P-negotiation_1_6_CO + P-negotiation_1_1_NONE + P-negotiation_8_4_CO + 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_2_7_CO + P-negotiation_7_1_CO + P-negotiation_0_8_CO + P-negotiation_5_2_CO + P-negotiation_7_6_CO + P-negotiation_1_7_NONE + P-negotiation_3_6_NONE + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_7_4_NONE + P-negotiation_5_7_CO + P-negotiation_1_4_CO + P-negotiation_2_8_NONE + P-negotiation_7_0_CO + P-negotiation_4_7_NONE + P-negotiation_3_8_CO + P-negotiation_6_6_NONE + P-negotiation_8_2_CO + P-negotiation_8_5_NONE + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_6_3_CO + P-negotiation_5_8_NONE + P-negotiation_2_6_DONE + P-negotiation_7_7_NONE + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_8_7_CO + P-negotiation_2_3_NONE + P-negotiation_6_4_DONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_8_3_DONE + P-negotiation_1_0_DONE + P-negotiation_6_1_NONE + P-negotiation_3_2_CO + P-negotiation_8_0_NONE + P-negotiation_4_4_CO + P-negotiation_6_8_CO + P-negotiation_0_1_CO + P-negotiation_8_8_NONE + P-negotiation_1_5_NONE + P-negotiation_5_6_DONE + P-negotiation_3_4_NONE + P-negotiation_7_5_DONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_7_2_NONE + P-negotiation_4_0_DONE + P-negotiation_3_7_CO + P-negotiation_8_1_CO + P-negotiation_0_7_NONE + P-negotiation_4_8_DONE + P-negotiation_2_6_NONE + P-negotiation_0_6_CO + P-negotiation_6_7_DONE + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_8_6_DONE + P-negotiation_1_3_DONE + P-negotiation_1_8_CO)
lola: after: (0 <= 62)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= P-electedPrimary_8 + P-electedPrimary_7 + P-electedPrimary_6 + P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: LP says that atomic proposition is always true: (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_7 + P-poll__waitingMessage_8 + P-poll__waitingMessage_3 <= P-startNeg__broadcasting_1_6 + P-startNeg__broadcasting_1_5 + P-startNeg__broadcasting_1_4 + P-startNeg__broadcasting_1_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_0_6 + P-startNeg__broadcasting_0_5 + P-startNeg__broadcasting_0_4 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_2_4 + P-startNeg__broadcasting_2_5 + P-startNeg__broadcasting_2_6 + P-startNeg__broadcasting_2_7 + P-startNeg__broadcasting_2_8 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_3_4 + P-startNeg__broadcasting_3_5 + P-startNeg__broadcasting_3_6 + P-startNeg__broadcasting_3_7 + P-startNeg__broadcasting_3_8 + P-startNeg__broadcasting_4_1 + P-startNeg__broadcasting_4_2 + P-startNeg__broadcasting_4_3 + P-startNeg__broadcasting_4_4 + P-startNeg__broadcasting_4_5 + P-startNeg__broadcasting_4_6 + P-startNeg__broadcasting_4_7 + P-startNeg__broadcasting_4_8 + P-startNeg__broadcasting_8_8 + P-startNeg__broadcasting_8_7 + P-startNeg__broadcasting_8_6 + P-startNeg__broadcasting_8_5 + P-startNeg__broadcasting_8_4 + P-startNeg__broadcasting_8_3 + P-startNeg__broadcasting_8_2 + P-startNeg__broadcasting_8_1 + P-startNeg__broadcasting_7_8 + P-startNeg__broadcasting_7_7 + P-startNeg__broadcasting_7_6 + P-startNeg__broadcasting_7_5 + P-startNeg__broadcasting_7_4 + P-startNeg__broadcasting_7_3 + P-startNeg__broadcasting_7_2 + P-startNeg__broadcasting_7_1 + P-startNeg__broadcasting_6_8 + P-startNeg__broadcasting_6_7 + P-startNeg__broadcasting_6_6 + P-startNeg__broadcasting_5_1 + P-startNeg__broadcasting_5_2 + P-startNeg__broadcasting_5_3 + P-startNeg__broadcasting_5_4 + P-startNeg__broadcasting_5_5 + P-startNeg__broadcasting_5_6 + P-startNeg__broadcasting_5_7 + P-startNeg__broadcasting_5_8 + P-startNeg__broadcasting_6_5 + P-startNeg__broadcasting_6_4 + P-startNeg__broadcasting_6_3 + P-startNeg__broadcasting_6_2 + P-startNeg__broadcasting_6_1 + P-startNeg__broadcasting_0_7 + P-startNeg__broadcasting_0_8 + P-startNeg__broadcasting_1_7 + P-startNeg__broadcasting_1_8)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P-negotiation_6_4_NONE + P-negotiation_6_2_CO + P-negotiation_3_2_DONE + P-negotiation_8_3_NONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_7_4_CO + P-negotiation_1_3_CO + P-negotiation_7_0_DONE + P-negotiation_8_6_CO + P-negotiation_3_7_DONE + P-negotiation_1_8_DONE + P-negotiation_5_6_CO + P-negotiation_7_5_CO + P-negotiation_3_1_CO + P-negotiation_1_8_NONE + P-negotiation_0_7_DONE + P-negotiation_0_7_CO + P-negotiation_5_0_NONE + P-negotiation_7_2_DONE + P-negotiation_3_7_NONE + P-negotiation_4_3_CO + P-negotiation_5_3_DONE + P-negotiation_7_8_DONE + P-negotiation_0_5_DONE + P-negotiation_3_4_DONE + P-negotiation_1_5_DONE + P-negotiation_8_8_DONE + P-negotiation_5_6_NONE + P-negotiation_2_6_CO + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_0_2_CO + P-negotiation_7_5_NONE + P-negotiation_0_2_NONE + P-negotiation_8_0_DONE + P-negotiation_4_3_DONE + P-negotiation_6_1_DONE + P-negotiation_6_7_CO + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_0_1_NONE + P-negotiation_2_1_NONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_6_2_DONE + P-negotiation_0_4_DONE + P-negotiation_7_7_DONE + P-negotiation_5_8_DONE + P-negotiation_2_1_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_8_8_CO + P-negotiation_8_1_DONE + P-negotiation_6_4_CO + P-negotiation_5_0_DONE + P-negotiation_8_2_NONE + P-negotiation_1_2_CO + P-negotiation_3_1_DONE + P-negotiation_6_3_NONE + P-negotiation_1_2_DONE + P-negotiation_8_5_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_6_6_DONE + P-negotiation_2_5_NONE + P-negotiation_2_4_CO + P-negotiation_4_7_DONE + P-negotiation_0_6_NONE + P-negotiation_2_8_DONE + P-negotiation_8_3_CO + P-negotiation_3_6_CO + P-negotiation_7_1_NONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_7_4_DONE + P-negotiation_3_3_NONE + P-negotiation_8_0_CO + P-negotiation_4_8_NONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_8_7_NONE + P-negotiation_1_6_DONE + P-negotiation_4_8_CO + P-negotiation_3_6_DONE + P-negotiation_6_8_NONE + P-negotiation_5_8_CO + P-negotiation_1_7_DONE + P-negotiation_6_7_NONE + P-negotiation_3_4_CO + P-negotiation_3_5_DONE + P-negotiation_8_2_DONE + P-negotiation_1_0_CO + P-negotiation_8_6_NONE + P-negotiation_1_3_NONE + P-negotiation_6_3_DONE + P-negotiation_2_2_NONE + P-negotiation_5_4_DONE + P-negotiation_7_7_CO + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_7_6_NONE + P-negotiation_2_5_DONE + P-negotiation_5_7_NONE + P-negotiation_3_2_NONE + P-negotiation_0_6_DONE + P-negotiation_5_3_CO + P-negotiation_7_3_DONE + P-negotiation_0_0_DONE + P-negotiation_3_8_NONE + P-negotiation_4_1_CO + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_7_1_DONE + P-negotiation_5_2_DONE + P-negotiation_8_4_NONE + P-negotiation_7_0_NONE + P-negotiation_3_3_DONE + P-negotiation_7_2_CO + P-negotiation_6_5_NONE + P-negotiation_2_8_CO + P-negotiation_1_4_DONE + P-negotiation_8_7_DONE + P-negotiation_1_7_CO + P-negotiation_4_6_NONE + P-negotiation_6_0_CO + P-negotiation_6_8_DONE + P-negotiation_2_7_NONE + P-negotiation_0_8_NONE + P-negotiation_0_4_CO + P-negotiation_6_1_CO + P-negotiation_6_0_DONE + P-negotiation_4_7_CO + P-negotiation_4_1_DONE + P-negotiation_7_3_CO + P-negotiation_2_2_DONE + P-negotiation_0_8_DONE + P-negotiation_0_3_DONE + P-negotiation_7_6_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_5_7_DONE + P-negotiation_1_6_NONE + P-negotiation_1_1_CO + P-negotiation_3_8_DONE + P-negotiation_8_5_CO + P-negotiation_2_7_DONE + P-negotiation_6_6_CO + P-negotiation_7_8_NONE + P-negotiation_5_4_CO + P-negotiation_8_1_NONE + P-negotiation_4_6_DONE + P-negotiation_3_0_DONE + P-negotiation_4_2_CO + P-negotiation_1_1_DONE + P-negotiation_8_4_DONE + P-negotiation_3_0_CO + P-negotiation_6_5_DONE + P-negotiation_2_4_NONE + P-negotiation_4_3_NONE + P-negotiation_6_2_NONE + P-negotiation_0_5_NONE + P-negotiation_7_8_CO + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_7_3_NONE + P-negotiation_0_0_NONE + P-negotiation_1_6_CO + P-negotiation_1_1_NONE + P-negotiation_8_4_CO + 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_2_7_CO + P-negotiation_7_1_CO + P-negotiation_0_8_CO + P-negotiation_5_2_CO + P-negotiation_7_6_CO + P-negotiation_1_7_NONE + P-negotiation_3_6_NONE + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_7_4_NONE + P-negotiation_5_7_CO + P-negotiation_1_4_CO + P-negotiation_2_8_NONE + P-negotiation_7_0_CO + P-negotiation_4_7_NONE + P-negotiation_3_8_CO + P-negotiation_6_6_NONE + P-negotiation_8_2_CO + P-negotiation_8_5_NONE + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_6_3_CO + P-negotiation_5_8_NONE + P-negotiation_2_6_DONE + P-negotiation_7_7_NONE + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_8_7_CO + P-negotiation_2_3_NONE + P-negotiation_6_4_DONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_8_3_DONE + P-negotiation_1_0_DONE + P-negotiation_6_1_NONE + P-negotiation_3_2_CO + P-negotiation_8_0_NONE + P-negotiation_4_4_CO + P-negotiation_6_8_CO + P-negotiation_0_1_CO + P-negotiation_8_8_NONE + P-negotiation_1_5_NONE + P-negotiation_5_6_DONE + P-negotiation_3_4_NONE + P-negotiation_7_5_DONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_7_2_NONE + P-negotiation_4_0_DONE + P-negotiation_3_7_CO + P-negotiation_8_1_CO + P-negotiation_0_7_NONE + P-negotiation_4_8_DONE + P-negotiation_2_6_NONE + P-negotiation_0_6_CO + P-negotiation_6_7_DONE + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_8_6_DONE + P-negotiation_1_3_DONE + P-negotiation_1_8_CO)
lola: after: (0 <= 62)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-dead_8 + P-dead_7 + P-dead_6 + P-dead_5 + P-dead_4 + P-dead_3 + P-dead_2 + P-dead_1 + P-dead_0 <= P-electedPrimary_8 + P-electedPrimary_7 + P-electedPrimary_6 + P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: after: (0 <= P-electedPrimary_8 + P-electedPrimary_7 + P-electedPrimary_6 + P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_8_7_RP_0 <= P-network_8_0_RP_3)
lola: after: (P-network_8_7_RP_0 <= 0)
lola: LP says that atomic proposition is always true: (P-network_8_7_RP_0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_6_1_AskP_1 <= P-network_4_6_AnsP_7)
lola: after: (0 <= P-network_4_6_AnsP_7)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_2_RP_8 <= P-network_4_7_RP_1)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_5_0_AskP_1 <= P-poll__networl_0_7_RP_0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_4_0_AskP_6 <= P-network_6_1_AskP_4)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_5_1_DONE <= P-masterList_1_4_6)
lola: after: (P-negotiation_5_1_DONE <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_5_3_6 <= P-network_3_1_RI_0)
lola: after: (0 <= P-network_3_1_RI_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_3_4_AskP_4 <= P-poll__networl_5_1_AskP_8)
lola: after: (0 <= 0)
lola: always true
lola: A ((((1 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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) U (2 <= 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__handlingMessage_7 + P-poll__handlingMessage_8)) U G (G (TRUE)))) : A ((64 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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 (G (G (G (X (TRUE))))) : A (X (((P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5 + P-polling_6 + P-polling_7 + P-polling_8 <= P-electedSecondary_8 + P-electedSecondary_7 + P-electedSecondary_6 + P-electedSecondary_5 + P-electedSecondary_4 + P-electedSecondary_3 + P-electedSecondary_2 + P-electedSecondary_1 + P-electedSecondary_0) U FALSE))) : A (G (X (G (G (TRUE))))) : A (X (X (TRUE))) : A ((1 <= P-electionInit_4 + P-electionInit_2 + P-electionInit_1 + P-electionInit_0 + P-electionInit_3 + P-electionInit_5 + P-electionInit_6 + P-electionInit_7 + P-electionInit_8)) : A ((F (X (TRUE)) U X (X ((3 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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 (F (TRUE)) : A (F ((P-negotiation_6_1_DONE <= P-network_2_1_AnsP_7))) : A (X (X (TRUE))) : A (G (F (X (F (TRUE))))) : A (F (X (G (F (TRUE))))) : A (F ((G (TRUE) U X ((P-negotiation_5_1_DONE <= 0))))) : A (TRUE) : A (X (X (F (G (TRUE)))))
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:142
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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-8-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (64 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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: (64 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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: 185
lola: 59 rewrites
lola: closed formula file NeoElection-PT-8-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-8-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 247 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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-8-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P-electionInit_4 + P-electionInit_2 + P-electionInit_1 + P-electionInit_0 + P-electionInit_3 + P-electionInit_5 + P-electionInit_6 + P-electionInit_7 + P-electionInit_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-electionInit_4 + P-electionInit_2 + P-electionInit_1 + P-electionInit_0 + P-electionInit_3 + P-electionInit_5 + P-electionInit_6 + P-electionInit_7 + P-electionInit_8)
lola: processed formula length: 175
lola: 59 rewrites
lola: closed formula file NeoElection-PT-8-LTLCardinality.task
lola: processed formula with 1 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-8-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 288 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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-8-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 315 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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-8-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 346 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((3 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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 LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((3 <= P-poll__pollEnd_8 + P-poll__pollEnd_7 + 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: 200
lola: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 753 markings, 753 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 433 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 495 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 577 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 693 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P-negotiation_5_1_DONE <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P-negotiation_5_1_DONE <= 0))))
lola: processed formula length: 41
lola: 59 rewrites
lola: closed formula file NeoElection-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 2 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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1155 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1732 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: 59 rewrites
lola: closed formula file NeoElection-PT-8-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: 9 markings, 8 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P-negotiation_6_1_DONE <= P-network_2_1_AnsP_7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (P-network_2_1_AnsP_7 + 1 <= P-negotiation_6_1_DONE)
lola: processed formula length: 52
lola: 61 rewrites
lola: closed formula file NeoElection-PT-8-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA NeoElection-PT-8-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no yes yes yes yes yes yes yes yes
lola:
preliminary result: yes no yes no yes yes yes no yes yes yes yes yes yes yes yes
lola: memory consumption: 79684 KB
lola: time consumption: 105 seconds
BK_STOP 1553035454272
--------------------
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-8"
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-8, 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-155272242200080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-8.tgz
mv NeoElection-PT-8 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 '
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 ;