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 5.3M
-rw-r--r-- 1 mcc users 51K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M 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 17K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 171K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 481K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K 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 339K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 957K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 802K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TokenRing-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258200709
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528219899026

info: Time: 3600 - MCC
===========================================================================================
prep: translating TokenRing-PT-010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TokenRing-PT-010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ TokenRing-PT-010 @ 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: 1232/65536 symbol table entries, 62 collisions
lola: preprocessing...
lola: Size of bit vector: 3872
lola: finding significant places
lola: 121 places, 1111 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1232 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-PT-010-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 8)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 10)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 10)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 8)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 10)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10)
lola: after: (0 <= 9)
lola: always true
lola: A (X (F (F (F (TRUE))))) : A (F (G (TRUE))) : A (G (TRUE)) : A ((F (TRUE) U G (X (TRUE)))) : A (G (G (F (G (TRUE))))) : A (TRUE) : A (TRUE) : A (TRUE) : A (G (X (G (X ((State_5_2 <= State_5_1)))))) : A (X ((State_10_9 <= State_6_6))) : A (F (F (X ((State_9_1 <= State_8_10))))) : A ((G (X ((State_2_1 <= State_6_7))) U F (X ((State_2_0 <= State_1_5))))) : A (G (F (F (X ((State_2_9 <= State_7_6)))))) : A ((F ((State_2_3 <= State_1_3)) U ((State_8_9 <= State_10_1) U (State_2_3 <= State_10_7)))) : A (F (F (G (X ((State_9_1 <= State_3_8)))))) : A (X (F (G ((State_7_7 <= State_5_0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:154
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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: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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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-PT-010-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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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-PT-010-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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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-PT-010-LTLCardinality-4 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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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-PT-010-LTLCardinality-5 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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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-PT-010-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: 53 rewrites
lola: closed formula file TokenRing-PT-010-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA TokenRing-PT-010-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 11 markings, 10 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-0 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: 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: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 11 markings, 10 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-3 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 (X (G ((State_5_2 <= State_5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((State_5_2 <= State_5_1)))))
lola: processed formula length: 40
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 161 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-8 FALSE 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 ((State_10_9 <= State_6_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((State_10_9 <= State_6_6)))
lola: processed formula length: 33
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 11 markings, 10 edges
lola: ========================================

FORMULA TokenRing-PT-010-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 (F ((State_9_1 <= State_8_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((State_9_1 <= State_8_10))))
lola: processed formula length: 37
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 11 markings, 10 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-10 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 ((F ((State_2_0 <= State_1_5)) OR (G ((State_2_1 <= State_6_7)) AND F ((State_2_0 <= State_1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((State_2_0 <= State_1_5)) OR (G ((State_2_1 <= State_6_7)) AND F ((State_2_0 <= State_1_5))))))
lola: processed formula length: 105
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 21 markings, 20 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-11 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 (G (F ((State_2_9 <= State_7_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((State_2_9 <= State_7_6))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 31477 markings, 116399 edges, 6295 markings/sec, 0 secs
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: 47042 markings, 181869 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((State_9_1 <= State_3_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((State_9_1 <= State_3_8))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 1054
lola: add low 262
lola: add low 726
lola: add low 1092
lola: add low 411
lola: add low 847
lola: add low 94
lola: add low 540
lola: add low 940
lola: add low 222
lola: add low 271
lola: add low 1055
lola: add low 340
lola: add low 795
lola: add low 33
lola: add low 480
lola: add low 899
lola: add low 164
lola: add low 611
lola: add low 993
lola: add low 303
lola: add low 350
lola: add low 1056
lola: add low 422
lola: add low 858
lola: add low 105
lola: add low 551
lola: add low 952
lola: add low 234
lola: add low 681
lola: add low 1046
lola: add low 364
lola: add low 431
lola: add low 1057
lola: add low 493
lola: add low 911
lola: add low 176
lola: add low 622
lola: add low 1005
lola: add low 314
lola: add low 750
lola: add low 1107
lola: add low 444
lola: add low 502
lola: add low 1058
lola: add low 562
lola: add low 963
lola: add low 246
lola: add low 693
lola: add low 1068
lola: add low 386
lola: add low 813
lola: add low 59
lola: add low 524
lola: add low 571
lola: add low 1059
lola: add low 633
lola: add low 1016
lola: add low 326
lola: add low 762
lola: add low 7
lola: add low 456
lola: add low 875
lola: add low 140
lola: add low 594
lola: add low 642
lola: add low 1060
lola: add low 713
lola: add low 1089
lola: add low 408
lola: add low 844
lola: add low 81
lola: add low 536
lola: add low 936
lola: add low 218
lola: add low 664
lola: add low 723
lola: add low 1061
lola: add low 437
lola: add low 865
lola: add low 132
lola: add low 606
lola: add low 999
lola: add low 318
lola: add low 764
lola: add low 28
lola: add low 486
lola: add low 675
lola: add low 389
lola: add low 40
lola: add low 507
lola: add low 917
lola: add low 200
lola: add low 665
lola: add low 1032
lola: add low 370
lola: add low 817
lola: add low 82
lola: add low 279
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 142 markings, 143 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((State_7_7 <= State_5_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((State_7_7 <= State_5_0))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 594
lola: add low 642
lola: add low 1060
lola: add low 713
lola: add low 1089
lola: add low 408
lola: add low 844
lola: add low 81
lola: add low 536
lola: add low 936
lola: add low 218
lola: add low 664
lola: add low 723
lola: add low 1061
lola: add low 437
lola: add low 865
lola: add low 132
lola: add low 606
lola: add low 999
lola: add low 318
lola: add low 764
lola: add low 28
lola: add low 486
lola: add low 675
lola: add low 389
lola: add low 40
lola: add low 507
lola: add low 917
lola: add low 200
lola: add low 665
lola: add low 1032
lola: add low 370
lola: add low 817
lola: add low 82
lola: add low 279
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 148 markings, 149 edges
lola: ========================================

FORMULA TokenRing-PT-010-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((State_2_3 <= State_1_3)) U ((State_8_9 <= State_10_1) U (State_2_3 <= State_10_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((State_2_3 <= State_1_3)) U ((State_8_9 <= State_10_1) U (State_2_3 <= State_10_7))))
lola: processed formula length: 92
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: using ltl preserving stubborn set method (--stubborn)
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 TokenRing-PT-010-LTLCardinality-13 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 no yes yes yes yes yes no no
lola:
preliminary result: yes yes yes yes yes yes yes yes no yes yes yes yes yes no no
lola: memory consumption: 19376 KB
lola: time consumption: 7 seconds

BK_STOP 1528219906927

--------------------
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-PT-010"
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-PT-010.tgz
mv TokenRing-PT-010 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-PT-010, 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-152732258200709"
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 ;