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)
..........................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is TokenRing-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008600309
=====================================================================

--------------------
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-CTLCardinality-0
FORMULA_NAME TokenRing-COL-005-CTLCardinality-1
FORMULA_NAME TokenRing-COL-005-CTLCardinality-10
FORMULA_NAME TokenRing-COL-005-CTLCardinality-11
FORMULA_NAME TokenRing-COL-005-CTLCardinality-12
FORMULA_NAME TokenRing-COL-005-CTLCardinality-13
FORMULA_NAME TokenRing-COL-005-CTLCardinality-14
FORMULA_NAME TokenRing-COL-005-CTLCardinality-15
FORMULA_NAME TokenRing-COL-005-CTLCardinality-2
FORMULA_NAME TokenRing-COL-005-CTLCardinality-3
FORMULA_NAME TokenRing-COL-005-CTLCardinality-4
FORMULA_NAME TokenRing-COL-005-CTLCardinality-5
FORMULA_NAME TokenRing-COL-005-CTLCardinality-6
FORMULA_NAME TokenRing-COL-005-CTLCardinality-7
FORMULA_NAME TokenRing-COL-005-CTLCardinality-8
FORMULA_NAME TokenRing-COL-005-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494944233053


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ TokenRing-PT-005 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-CTLCardinality.task
lola: (A ((TRUE U ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) OR (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)))) AND (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)) : E (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) U FALSE)) : NOT((E (G (())) OR ((State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5 <= 0) AND (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)))) : A (G (A (F (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)))))) : ((() AND NOT(E (X (TRUE)))) OR A (F (E (F (TRUE))))) : (A (G (TRUE)) OR A (G (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) : ((A (((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) U TRUE)) AND A (G (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) OR (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) AND A (((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) U (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5 <= 0)))) : (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) : E (X ((A (F (TRUE)) OR TRUE))) : (A (X (E (G ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) AND (() AND (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5 <= 0))) : TRUE : A ((E (F ((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))) U ((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) OR (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) OR ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) AND (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) : ((A (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) U TRUE)) OR ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) AND A (F ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))))) AND A (F (A (F (TRUE))))) : NOT(E (G (()))) : ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) AND ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) OR (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)) AND (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5) AND (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5))) AND (3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 + State_1_5 + State_0_5 + State_5_5)) : (A ((() U FALSE)) AND ())
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((TRUE U ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Sta... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + ... (shortened)
lola: processed formula length: 889
lola: 3 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: processed formula length: 436
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (())) OR ((State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4... (shortened)
lola: processed formula length: 468
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((() AND NOT(E (X (TRUE)))) OR A (F (E (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (TRUE)) OR A (G (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Stat... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Sta... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to TokenRing-COL-005-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_... (shortened)
lola: processed formula length: 878
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5 ... (shortened)
lola: processed formula length: 436
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F (TRUE)) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 +... (shortened)
lola: processed formula length: 455
lola: 3 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (() AND (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (() AND (State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2... (shortened)
lola: processed formula length: 445
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 +... (shortened)
lola: processed formula length: 2215
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + Stat... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 10 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (())))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_5_4 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_5_3 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_5_2 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_5_1 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_5_0 + State_4_5 + State_3_5 + State_2_5... (shortened)
lola: processed formula length: 2649
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: processed formula with 6 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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((() U FALSE)) AND ())
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.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: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no yes yes no yes yes yes no yes no
FORMULA TokenRing-COL-005-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494944233341

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-PT-005"
export BK_EXAMINATION="CTLCardinality"
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-PT-005.tgz
mv TokenRing-PT-005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is TokenRing-PT-005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-ebro-149441008600309"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;