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 172K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TokenRing-COL-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258100687
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528206196480

info: Time: 3600 - MCC
===========================================================================================
prep: translating TokenRing-COL-005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TokenRing-COL-005 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ TokenRing-COL-005 @ 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: 192/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1152
lola: finding significant places
lola: 36 places, 156 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 192 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-COL-005-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 4)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: after: (0 <= 5)
lola: always true
lola: A (X (X (TRUE))) : A (G ((TRUE U TRUE))) : A ((TRUE U TRUE)) : A (TRUE) : A (F ((TRUE U F (TRUE)))) : A (X (F (X (X (TRUE))))) : A ((F (G (TRUE)) U (TRUE U TRUE))) : A ((X (X (TRUE)) U G (X (TRUE)))) : A (X (X (TRUE))) : A (G (X (TRUE))) : A (TRUE) : A (G (TRUE)) : A (X ((X (TRUE) U G (TRUE)))) : A (F (TRUE)) : A (X ((F (TRUE) U F (TRUE)))) : A (X (G (G (TRUE))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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: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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-3 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-4 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-6 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-11 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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 TokenRing-COL-005-LTLCardinality-13 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: 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-0 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola: ========================================

FORMULA TokenRing-COL-005-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 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: 71 rewrites
lola: closed formula file TokenRing-COL-005-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: 6 markings, 5 edges
lola:
FORMULA TokenRing-COL-005-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes yes yes yes yes yes yes yes yes yes
========================================lola:
preliminary result: yes yes yes yes yes yes yes yes yes yes yes yes yes yes yes yes

lola: memory consumption: 15848 KB
lola: time consumption: 0 seconds

BK_STOP 1528206196818

--------------------
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="TokenRing-COL-005"
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/TokenRing-COL-005.tgz
mv TokenRing-COL-005 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 TokenRing-COL-005, 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 r208-smll-152732258100687"
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 ;