fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r172-smll-152708743200318
Last Updated
June 26, 2018

About the Execution of LoLA for TokenRing-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
184.340 8042.00 8674.00 193.50 FTTFTTTTTFTTFTTF normal

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.4M
-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 18K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 533K May 15 18:54 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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743200318
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527327497792

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ TokenRing-PT-010 @ 3569 seconds
lola: LoLA will run for 3569 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-CTLCardinality.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: (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: always true
lola: always true
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: (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: (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: always true
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: 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: (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: 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: always true
lola: LP says that atomic proposition is always false: (3 <= State_6_1)
lola: LP says that atomic proposition is always false: (3 <= State_5_6)
lola: LP says that atomic proposition is always false: (2 <= State_6_9)
lola: LP says that atomic proposition is always false: (2 <= State_9_8)
lola: LP says that atomic proposition is always false: (2 <= State_3_9)
lola: LP says that atomic proposition is always false: (2 <= State_7_5)
lola: LP says that atomic proposition is always false: (3 <= State_0_2)
lola: A ((A (X (TRUE)) U ())) : E (X (E (G (())))) : E (G (A ((TRUE U TRUE)))) : E ((A (F (TRUE)) U ())) : A (G (())) : E (G (TRUE)) : (A (X (A (X (TRUE)))) AND A (G (()))) : A (G ((A (X (TRUE)) OR TRUE))) : A ((() U A (G ((State_5_8 <= State_0_0))))) : A (F ((((State_9_9 + 1 <= State_3_9)) AND A (X ((1 <= State_10_1)))))) : A (F ((((State_10_8 <= State_0_0) AND (1 <= State_4_2))))) : E (G (E (X (((State_9_4 <= State_7_1) OR (State_2_3 <= State_6_3)))))) : A (((((State_10_0 <= State_10_2) AND (State_1_7 <= State_10_3)) OR (State_4_4 <= State_4_3)) U ())) : (A (F (A (G ((State_7_4 <= State_1_3))))) AND E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))))) : E (F (A (((State_6_6 <= State_0_6) U (1 <= State_1_6))))) : A (F (A (((1 <= State_4_0) U FALSE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:136
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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-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: 0 markings, 0 edges

FORMULA TokenRing-PT-010-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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-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: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-4 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-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: 0 markings, 0 edges

FORMULA TokenRing-PT-010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges

FORMULA TokenRing-PT-010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges

FORMULA TokenRing-PT-010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges

FORMULA TokenRing-PT-010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 53 rewrites
lola: closed formula file TokenRing-PT-010-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: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((State_9_9 + 1 <= State_3_9)) AND A (X ((1 <= State_10_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (((State_9_9 + 1 <= State_3_9)) AND AX((1 <= State_10_1))))
lola: processed formula length: 68
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 143 markings, 143 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((State_9_4 <= State_7_1) OR (State_2_3 <= State_6_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(((State_9_4 <= State_7_1) OR (State_2_3 <= State_6_3))))))
lola: processed formula length: 79
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 143 markings, 143 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-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 (F ((((State_10_8 <= State_0_0) AND (1 <= State_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((State_0_0 + 1 <= State_10_8) OR (State_4_2 <= 0)))
lola: processed formula length: 54
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 28480 markings, 109845 edges, 5696 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 31683 markings, 126246 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-10 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: E (F (A (((State_6_6 <= State_0_6) U (1 <= State_1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U A((State_6_6 <= State_0_6) U (1 <= State_1_6)))
lola: processed formula length: 56
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 899 markings, 2702 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-14 TRUE 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 (A (G ((State_5_8 <= State_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (State_0_0 + 1 <= State_5_8)
lola: processed formula length: 28
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: The predicate is eventually invariant.
lola: 58905 markings, 294050 edges
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((State_7_4 <= State_1_3))))) AND E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))))
lola: processed formula length: 87
lola: 54 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TokenRing-PT-010-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 97 markings, 96 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((State_7_4 <= State_1_3))))) AND E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))))
lola: processed formula length: 87
lola: 54 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((State_2_9 <= State_3_4) AND (1 <= State_1_6) AND ((State_3_8 <= State_5_10)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TokenRing-PT-010-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 97 markings, 96 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((State_7_4 <= State_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (State_1_3 + 1 <= State_7_4)
lola: processed formula length: 28
lola: 55 rewrites
lola: closed formula file TokenRing-PT-010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: The predicate is eventually invariant.
lola: 58905 markings, 294050 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA TokenRing-PT-010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes yes yes no yes yes no yes yes no
lola:
preliminary result: no yes yes no yes yes yes yes yes no yes yes no yes yes no
lola: ========================================
lola: memory consumption: 24372 KB
lola: time consumption: 7 seconds

BK_STOP 1527327505834

--------------------
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="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-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 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 r172-smll-152708743200318"
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 ;