Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 37K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 35K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 33K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 911K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582800085
=====================================================================

--------------------
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-3-LTLCardinality-00
FORMULA_NAME NeoElection-PT-3-LTLCardinality-01
FORMULA_NAME NeoElection-PT-3-LTLCardinality-02
FORMULA_NAME NeoElection-PT-3-LTLCardinality-03
FORMULA_NAME NeoElection-PT-3-LTLCardinality-04
FORMULA_NAME NeoElection-PT-3-LTLCardinality-05
FORMULA_NAME NeoElection-PT-3-LTLCardinality-06
FORMULA_NAME NeoElection-PT-3-LTLCardinality-07
FORMULA_NAME NeoElection-PT-3-LTLCardinality-08
FORMULA_NAME NeoElection-PT-3-LTLCardinality-09
FORMULA_NAME NeoElection-PT-3-LTLCardinality-10
FORMULA_NAME NeoElection-PT-3-LTLCardinality-11
FORMULA_NAME NeoElection-PT-3-LTLCardinality-12
FORMULA_NAME NeoElection-PT-3-LTLCardinality-13
FORMULA_NAME NeoElection-PT-3-LTLCardinality-14
FORMULA_NAME NeoElection-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527430351226

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-3 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-3 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ NeoElection-PT-3 @ 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: 1988/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 972
lola: finding significant places
lola: 972 places, 1016 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 472 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-3-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: after: (0 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: always true
lola: LP says that atomic proposition is always false: (1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_2_F_3 + P-masterState_0_F_3 + P-masterState_3_F_3 + P-masterState_1_T_3)
lola: after: (P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= 3)
lola: LP says that atomic proposition is always true: (P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= 3)
lola: LP says that atomic proposition is always false: (1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3)
lola: LP says that atomic proposition is always false: (1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: LP says that atomic proposition is always false: (2 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3 <= P-stage_2_SEC + P-stage_3_NEG + P-stage_1_SEC + P-stage_0_SEC + P-stage_3_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_3_PRIM + P-stage_0_NEG + P-stage_1_PRIM)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + P-electionFailed_3 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: after: (0 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3 <= P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3)
lola: after: (6 <= P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3)
lola: LP says that atomic proposition is always false: (6 <= P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3)
lola: LP says that atomic proposition is always false: (3 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3)
lola: after: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= 6)
lola: LP says that atomic proposition is always true: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_0_0_AI_1 <= P-startNeg__broadcasting_0_2)
lola: after: (0 <= P-startNeg__broadcasting_0_2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_0_RP_0 <= P-network_1_1_AnsP_0)
lola: after: (0 <= P-network_1_1_AnsP_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_2_AskP_2 <= P-network_1_1_AI_1)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_1_AskP_2 <= P-network_1_3_AnsP_0)
lola: after: (0 <= P-network_1_3_AnsP_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_0_AskP_1 <= P-electionInit_2)
lola: after: (0 <= P-electionInit_2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_1_3_3 <= P-masterList_0_3_1)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-startNeg__broadcasting_3_1 <= P-poll__networl_1_0_AskP_3)
lola: after: (P-startNeg__broadcasting_3_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_3_RP_3 <= P-masterList_3_3_0)
lola: after: (0 <= 0)
lola: always true
lola: A (F (TRUE)) : A ((X (X (TRUE)) U (P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 <= P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1))) : A (X (FALSE)) : A ((TRUE U FALSE)) : A ((F (X (FALSE)) U F (G (FALSE)))) : A (X (FALSE)) : A ((G (TRUE) U FALSE)) : A (F ((G (FALSE) U X (TRUE)))) : A (X (F (G (TRUE)))) : A (G (TRUE)) : A (TRUE) : A (G (G (TRUE))) : A (X (TRUE)) : A (G (X (X (F (TRUE))))) : A (X (F ((P-startNeg__broadcasting_3_1 <= 0)))) : A (X (TRUE))
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:98
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-0 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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-3-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) U (P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 <= P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) U (P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 <= P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendA... (shortened)
lola: processed formula length: 457
lola: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 1 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 4 markings, 3 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 4 markings, 3 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 4 markings, 3 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 4 markings, 3 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P-startNeg__broadcasting_3_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P-startNeg__broadcasting_3_1 <= 0))))
lola: processed formula length: 47
lola: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 717 markings, 1032 edges
lola:
FORMULA NeoElection-PT-3-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3569 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: 55 rewrites
lola: closed formula file NeoElection-PT-3-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: 4 markings, 3 edges
lola: ========================================

FORMULA NeoElection-PT-3-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no no yes yes yes yes yes yes yes yes yes
lola:
preliminary result: yes yes no no no no no yes yes yes yes yes yes yes yes yes
lola: memory consumption: 17740 KB
lola: time consumption: 1 seconds

BK_STOP 1527430352363

--------------------
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-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-3.tgz
mv NeoElection-PT-3 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is NeoElection-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-csrt-152732582800085"
echo "====================================================================="
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 ;