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 428K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 6.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469900773
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527057940420

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Philosophers-PT-000020 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Philosophers-PT-000020 @ 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: 200/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 100 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 140 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000020-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always false: (2 <= Eat_4)
lola: LP says that atomic proposition is always false: (2 <= Catch2_1)
lola: LP says that atomic proposition is always false: (3 <= Catch2_7)
lola: LP says that atomic proposition is always false: (2 <= Eat_1)
lola: LP says that atomic proposition is always false: (2 <= Catch1_17)
lola: LP says that atomic proposition is always false: (2 <= Catch2_1)
lola: LP says that atomic proposition is always false: (2 <= Think_1)
lola: LP says that atomic proposition is always false: (2 <= Fork_14)
lola: LP says that atomic proposition is always false: (2 <= Catch2_18)
lola: LP says that atomic proposition is always false: (2 <= Catch1_12)
lola: LP says that atomic proposition is always false: (3 <= Catch2_17)
lola: LP says that atomic proposition is always false: (2 <= Catch2_3)
lola: E (F (E (F (((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9)))))) : A (G ((A (X ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9))) AND ((1 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + 1 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9))))) : (E (F ((((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9) AND (2 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9))))) OR (A (X (((3 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9) AND (3 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)))) OR A (G (((1 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) AND (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)))))) : A (G ((((2 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20) OR (Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20) OR (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)) OR A (G ((Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9)))))) : A (G (E (((2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) U (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20))))) : (E (F (A (G ((3 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9))))) OR (E (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + 1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20))) AND (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))) : NOT(A (F (A (G ((Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)))))) : NOT(A (X (A (G ((Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)))))) : NOT(E (F (E (X (FALSE))))) : A (G (E (G (TRUE)))) : (NOT(A (((Eat_17 <= Catch2_1) U (Eat_13 <= Think_2)))) OR E (F (E (X (FALSE))))) : A (G (TRUE)) : E (F (())) : E (F (())) : (((Think_17 <= Fork_1) AND (((Fork_11 <= Catch1_2)) AND A (F ((Fork_12 <= Catch2_9))))) OR NOT(E (F (())))) : A (G (E (F (()))))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-8 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: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-9 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: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-11 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-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 Philosophers-PT-000020-CTLCardinality-15 FALSE 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: (E (F ((((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + C... (shortened)
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 ((((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + C... (shortened)
lola: processed formula length: 674
lola: 52 rewrites
lola: closed formula file Philosophers-PT-000020-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: (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9) AND (2 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-2 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: E (X (E (F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + 1 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + 1 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch... (shortened)
lola: processed formula length: 426
lola: 52 rewrites
lola: closed formula file Philosophers-PT-000020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Thi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Catch1_10 + Catch1_11 + Catch1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Catch1_10 + Catch1_11 + Catch1_1... (shortened)
lola: processed formula length: 816
lola: 53 rewrites
lola: closed formula file Philosophers-PT-000020-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-1 FALSE 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: E (F (((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Think... (shortened)
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 (((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Think... (shortened)
lola: processed formula length: 839
lola: 52 rewrites
lola: closed formula file Philosophers-PT-000020-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: ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) OR (Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-0 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 (G (E (((2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) U (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((2 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) U (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)))))
lola: processed formula length: 396
lola: 53 rewrites
lola: closed formula file Philosophers-PT-000020-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19 markings, 37 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-4 FALSE 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 ((((2 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20) OR (Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= 1) AND (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + C... (shortened)
lola: processed formula length: 1306
lola: 57 rewrites
lola: closed formula file Philosophers-PT-000020-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52 markings, 65 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Catch2_1 + 1 <= Eat_17) R (Think_2 + 1 <= Eat_13)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((Catch2_1 + 1 <= Eat_17) R (Think_2 + 1 <= Eat_13)))
lola: processed formula length: 56
lola: 53 rewrites
lola: closed formula file Philosophers-PT-000020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_... (shortened)
lola: processed formula length: 446
lola: 52 rewrites
lola: closed formula file Philosophers-PT-000020-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: Reachability of the predicate is possibly preserved.
lola: 21 markings, 21 edges
lola: ========================================

FORMULA Philosophers-PT-000020-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((3 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9))))) OR (E (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: processed formula length: 235
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 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: (E (F (A (G ((3 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9))))) OR (E (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: processed formula length: 235
lola: 51 rewrites
lola: closed formula file Philosophers-PT-000020-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 <= 2)
lola: processed formula length: 235
lola: 53 rewrites
lola: closed formula file Philosophers-PT-000020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 1243154 markings, 2786013 edges, 248631 markings/sec, 0 secs
lola: 2298725 markings, 5186639 edges, 211114 markings/sec, 5 secs
lola: 3293459 markings, 7440087 edges, 198947 markings/sec, 10 secs
lola: 4241579 markings, 9587188 edges, 189624 markings/sec, 15 secs
lola: 5189326 markings, 11729952 edges, 189549 markings/sec, 20 secs
lola: 6101662 markings, 13819895 edges, 182467 markings/sec, 25 secs
lola: 7013495 markings, 15894492 edges, 182367 markings/sec, 30 secs
lola: 7910166 markings, 17945737 edges, 179334 markings/sec, 35 secs
lola: 8786139 markings, 19959674 edges, 175195 markings/sec, 40 secs
lola: 9659416 markings, 21969395 edges, 174655 markings/sec, 45 secs
lola: 10504040 markings, 23931906 edges, 168925 markings/sec, 50 secs
lola: 11331377 markings, 25852950 edges, 165467 markings/sec, 55 secs
lola: 12161593 markings, 27787241 edges, 166043 markings/sec, 60 secs
lola: 12978288 markings, 29687163 edges, 163339 markings/sec, 65 secs
lola: 13775044 markings, 31555242 edges, 159351 markings/sec, 70 secs
lola: 14573487 markings, 33435483 edges, 159689 markings/sec, 75 secs
lola: 15360893 markings, 35281510 edges, 157481 markings/sec, 80 secs
lola: 16141142 markings, 37113075 edges, 156050 markings/sec, 85 secs
lola: 16934633 markings, 38961527 edges, 158698 markings/sec, 90 secs
lola: 17718379 markings, 40792426 edges, 156749 markings/sec, 95 secs
lola: 18501785 markings, 42616196 edges, 156681 markings/sec, 100 secs
lola: 19266285 markings, 44416980 edges, 152900 markings/sec, 105 secs
lola: 20038702 markings, 46225408 edges, 154483 markings/sec, 110 secs
lola: 20800386 markings, 48016792 edges, 152337 markings/sec, 115 secs
lola: 21564835 markings, 49817228 edges, 152890 markings/sec, 120 secs
lola: 22319626 markings, 51595858 edges, 150958 markings/sec, 125 secs
lola: 23088805 markings, 53405521 edges, 153836 markings/sec, 130 secs
lola: 23845606 markings, 55179418 edges, 151360 markings/sec, 135 secs
lola: 24598939 markings, 56945019 edges, 150667 markings/sec, 140 secs
lola: 25347681 markings, 58715145 edges, 149748 markings/sec, 145 secs
lola: 26107717 markings, 60512325 edges, 152007 markings/sec, 150 secs
lola: 26849266 markings, 62250782 edges, 148310 markings/sec, 155 secs
lola: 27589686 markings, 63993126 edges, 148084 markings/sec, 160 secs
lola: 28337096 markings, 65751996 edges, 149482 markings/sec, 165 secs
lola: 29077994 markings, 67489024 edges, 148180 markings/sec, 170 secs
lola: 29807145 markings, 69225603 edges, 145830 markings/sec, 175 secs
lola: 30534697 markings, 70943842 edges, 145510 markings/sec, 180 secs
lola: 31267814 markings, 72671183 edges, 146623 markings/sec, 185 secs
lola: 32000112 markings, 74390871 edges, 146460 markings/sec, 190 secs
lola: 32717943 markings, 76092408 edges, 143566 markings/sec, 195 secs
lola: 33430169 markings, 77776254 edges, 142445 markings/sec, 200 secs
lola: 34146573 markings, 79482220 edges, 143281 markings/sec, 205 secs
lola: 34860080 markings, 81175991 edges, 142701 markings/sec, 210 secs
lola: 35584500 markings, 82893299 edges, 144884 markings/sec, 215 secs
lola: 36326582 markings, 84649045 edges, 148416 markings/sec, 220 secs
lola: 37042559 markings, 86349849 edges, 143195 markings/sec, 225 secs
lola: 37762406 markings, 88043057 edges, 143969 markings/sec, 230 secs
lola: 38469833 markings, 89719390 edges, 141485 markings/sec, 235 secs
lola: 39178921 markings, 91405325 edges, 141818 markings/sec, 240 secs
lola: 39870439 markings, 93068417 edges, 138304 markings/sec, 245 secs
lola: 40570337 markings, 94740515 edges, 139980 markings/sec, 250 secs
lola: 41277225 markings, 96418412 edges, 141378 markings/sec, 255 secs
lola: 41969023 markings, 98072346 edges, 138360 markings/sec, 260 secs
lola: 42669061 markings, 99744903 edges, 140008 markings/sec, 265 secs
lola: 43367181 markings, 101417482 edges, 139624 markings/sec, 270 secs
lola: 44071622 markings, 103094377 edges, 140888 markings/sec, 275 secs
lola: 44787982 markings, 104799109 edges, 143272 markings/sec, 280 secs
lola: 45484619 markings, 106471375 edges, 139327 markings/sec, 285 secs
lola: 46184829 markings, 108165949 edges, 140042 markings/sec, 290 secs
lola: 46906487 markings, 109878360 edges, 144332 markings/sec, 295 secs
lola: 47623375 markings, 111588560 edges, 143378 markings/sec, 300 secs
lola: 48318853 markings, 113268731 edges, 139096 markings/sec, 305 secs
lola: 49017058 markings, 114944904 edges, 139641 markings/sec, 310 secs
lola: 49711063 markings, 116627860 edges, 138801 markings/sec, 315 secs
lola: 50398896 markings, 118272281 edges, 137567 markings/sec, 320 secs
lola: 51097050 markings, 119941429 edges, 139631 markings/sec, 325 secs
lola: 51784304 markings, 121590031 edges, 137451 markings/sec, 330 secs
lola: 52479720 markings, 123246557 edges, 139083 markings/sec, 335 secs
lola: 53179459 markings, 124931368 edges, 139948 markings/sec, 340 secs
lola: 53862332 markings, 126574643 edges, 136575 markings/sec, 345 secs
lola: 54568508 markings, 128270254 edges, 141235 markings/sec, 350 secs
lola: 55245989 markings, 129909668 edges, 135496 markings/sec, 355 secs
lola: 55935999 markings, 131577100 edges, 138002 markings/sec, 360 secs
lola: 56617425 markings, 133230840 edges, 136285 markings/sec, 365 secs
lola: 57294432 markings, 134865278 edges, 135401 markings/sec, 370 secs
lola: 57967110 markings, 136490352 edges, 134536 markings/sec, 375 secs
lola: 58656697 markings, 138141544 edges, 137917 markings/sec, 380 secs
lola: 59338353 markings, 139782616 edges, 136331 markings/sec, 385 secs
lola: 59997549 markings, 141390743 edges, 131839 markings/sec, 390 secs
lola: 60640296 markings, 142943920 edges, 128549 markings/sec, 395 secs
lola: 61291280 markings, 144518385 edges, 130197 markings/sec, 400 secs
lola: 61934301 markings, 146073199 edges, 128604 markings/sec, 405 secs
lola: 62569939 markings, 147618648 edges, 127128 markings/sec, 410 secs
lola: 63220637 markings, 149185813 edges, 130140 markings/sec, 415 secs
lola: 63870712 markings, 150751484 edges, 130015 markings/sec, 420 secs
lola: 64522549 markings, 152321975 edges, 130367 markings/sec, 425 secs
lola: 65175323 markings, 153887964 edges, 130555 markings/sec, 430 secs
lola: 65831916 markings, 155468912 edges, 131319 markings/sec, 435 secs
lola: 66484593 markings, 157047422 edges, 130535 markings/sec, 440 secs
lola: 67131341 markings, 158608046 edges, 129350 markings/sec, 445 secs
lola: 67762944 markings, 160144578 edges, 126321 markings/sec, 450 secs
lola: 68379404 markings, 161644884 edges, 123292 markings/sec, 455 secs
lola: 69003352 markings, 163156255 edges, 124790 markings/sec, 460 secs
lola: 69623706 markings, 164663065 edges, 124071 markings/sec, 465 secs
lola: 70241161 markings, 166177188 edges, 123491 markings/sec, 470 secs
lola: 70873346 markings, 167705424 edges, 126437 markings/sec, 475 secs
lola: 71490353 markings, 169215249 edges, 123401 markings/sec, 480 secs
lola: 72097716 markings, 170708596 edges, 121473 markings/sec, 485 secs
lola: 72713231 markings, 172222132 edges, 123103 markings/sec, 490 secs
lola: 73328782 markings, 173725766 edges, 123110 markings/sec, 495 secs
lola: 73939564 markings, 175214099 edges, 122156 markings/sec, 500 secs
lola: 74571594 markings, 176742525 edges, 126406 markings/sec, 505 secs
lola: 75210598 markings, 178300891 edges, 127801 markings/sec, 510 secs
lola: 75841155 markings, 179831322 edges, 126111 markings/sec, 515 secs
lola: 76482869 markings, 181380500 edges, 128343 markings/sec, 520 secs
lola: 77120981 markings, 182917060 edges, 127622 markings/sec, 525 secs
lola: 77773864 markings, 184484417 edges, 130577 markings/sec, 530 secs
lola: 78405131 markings, 186025828 edges, 126253 markings/sec, 535 secs
lola: 79043355 markings, 187577295 edges, 127645 markings/sec, 540 secs
lola: 79686325 markings, 189143484 edges, 128594 markings/sec, 545 secs
lola: 80324900 markings, 190707337 edges, 127715 markings/sec, 550 secs
lola: 80958713 markings, 192258307 edges, 126763 markings/sec, 555 secs
lola: 81596845 markings, 193807778 edges, 127626 markings/sec, 560 secs
lola: 82214506 markings, 195338427 edges, 123532 markings/sec, 565 secs
lola: 82840666 markings, 196877679 edges, 125232 markings/sec, 570 secs
lola: 83470498 markings, 198424981 edges, 125966 markings/sec, 575 secs
lola: 84102028 markings, 199960254 edges, 126306 markings/sec, 580 secs
lola: 84725976 markings, 201493123 edges, 124790 markings/sec, 585 secs
lola: 85360391 markings, 203035991 edges, 126883 markings/sec, 590 secs
lola: 85992229 markings, 204573432 edges, 126368 markings/sec, 595 secs
lola: 86619139 markings, 206107618 edges, 125382 markings/sec, 600 secs
lola: 87245537 markings, 207647846 edges, 125280 markings/sec, 605 secs
lola: 87863181 markings, 209169573 edges, 123529 markings/sec, 610 secs
lola: 88481681 markings, 210694091 edges, 123700 markings/sec, 615 secs
lola: 89081105 markings, 212178533 edges, 119885 markings/sec, 620 secs
lola: 89706691 markings, 213723709 edges, 125117 markings/sec, 625 secs
lola: 90320725 markings, 215232959 edges, 122807 markings/sec, 630 secs
lola: 90940521 markings, 216771768 edges, 123959 markings/sec, 635 secs
lola: 91558405 markings, 218287838 edges, 123577 markings/sec, 640 secs
lola: 92170293 markings, 219789005 edges, 122378 markings/sec, 645 secs
lola: 92793614 markings, 221303983 edges, 124664 markings/sec, 650 secs
lola: 93409354 markings, 222819757 edges, 123148 markings/sec, 655 secs
lola: 94030633 markings, 224341257 edges, 124256 markings/sec, 660 secs
lola: 94651565 markings, 225875875 edges, 124186 markings/sec, 665 secs
lola: 95270948 markings, 227393117 edges, 123877 markings/sec, 670 secs
lola: 95888797 markings, 228918349 edges, 123570 markings/sec, 675 secs
lola: 96496069 markings, 230425433 edges, 121454 markings/sec, 680 secs
lola: 97121501 markings, 231963272 edges, 125086 markings/sec, 685 secs
lola: 97734203 markings, 233474300 edges, 122540 markings/sec, 690 secs
lola: 98351925 markings, 234989006 edges, 123544 markings/sec, 695 secs
lola: 98972755 markings, 236512433 edges, 124166 markings/sec, 700 secs
lola: 99589205 markings, 238024979 edges, 123290 markings/sec, 705 secs
lola: 100196656 markings, 239525813 edges, 121490 markings/sec, 710 secs
lola: 100815611 markings, 241052947 edges, 123791 markings/sec, 715 secs
lola: 101431925 markings, 242601762 edges, 123263 markings/sec, 720 secs
lola: 102057278 markings, 244149575 edges, 125071 markings/sec, 725 secs
lola: 102679753 markings, 245676953 edges, 124495 markings/sec, 730 secs
lola: 103295068 markings, 247195328 edges, 123063 markings/sec, 735 secs
lola: 103910259 markings, 248700055 edges, 123038 markings/sec, 740 secs
lola: 104523294 markings, 250211555 edges, 122607 markings/sec, 745 secs
lola: 105140901 markings, 251746234 edges, 123521 markings/sec, 750 secs
lola: 105758424 markings, 253279941 edges, 123505 markings/sec, 755 secs
lola: 106377174 markings, 254805133 edges, 123750 markings/sec, 760 secs
lola: 107002615 markings, 256341328 edges, 125088 markings/sec, 765 secs
lola: 107624244 markings, 257883852 edges, 124326 markings/sec, 770 secs
lola: 108243119 markings, 259405506 edges, 123775 markings/sec, 775 secs
lola: 108851869 markings, 260924594 edges, 121750 markings/sec, 780 secs
lola: 109463174 markings, 262427088 edges, 122261 markings/sec, 785 secs
lola: 110077264 markings, 263947977 edges, 122818 markings/sec, 790 secs
lola: 110688490 markings, 265448728 edges, 122245 markings/sec, 795 secs
lola: 111299099 markings, 266955249 edges, 122122 markings/sec, 800 secs
lola: 111893992 markings, 268446181 edges, 118979 markings/sec, 805 secs
lola: 112491741 markings, 269938403 edges, 119550 markings/sec, 810 secs
lola: 113098791 markings, 271453992 edges, 121410 markings/sec, 815 secs
lola: 113711117 markings, 272963672 edges, 122465 markings/sec, 820 secs
lola: 114309352 markings, 274458846 edges, 119647 markings/sec, 825 secs
lola: 114917483 markings, 275970092 edges, 121626 markings/sec, 830 secs
lola: 115523873 markings, 277486691 edges, 121278 markings/sec, 835 secs
lola: 116138845 markings, 278995006 edges, 122994 markings/sec, 840 secs
lola: 116733995 markings, 280483770 edges, 119030 markings/sec, 845 secs
lola: 117325423 markings, 281962597 edges, 118286 markings/sec, 850 secs
lola: 117923364 markings, 283443964 edges, 119588 markings/sec, 855 secs
lola: 118511913 markings, 284904977 edges, 117710 markings/sec, 860 secs
lola: 119113787 markings, 286400054 edges, 120375 markings/sec, 865 secs
lola: 119706759 markings, 287867057 edges, 118594 markings/sec, 870 secs
lola: 120301015 markings, 289357420 edges, 118851 markings/sec, 875 secs
lola: 120883773 markings, 290825148 edges, 116552 markings/sec, 880 secs
lola: 121485403 markings, 292310771 edges, 120326 markings/sec, 885 secs
lola: 122085698 markings, 293813620 edges, 120059 markings/sec, 890 secs
lola: 122676804 markings, 295285371 edges, 118221 markings/sec, 895 secs
lola: 123273473 markings, 296769752 edges, 119334 markings/sec, 900 secs
lola: 123868550 markings, 298258940 edges, 119015 markings/sec, 905 secs
lola: 124459929 markings, 299739970 edges, 118276 markings/sec, 910 secs
lola: 125060048 markings, 301233714 edges, 120024 markings/sec, 915 secs
lola: 125644388 markings, 302694746 edges, 116868 markings/sec, 920 secs
lola: 126245401 markings, 304198368 edges, 120203 markings/sec, 925 secs
lola: 126843612 markings, 305699548 edges, 119642 markings/sec, 930 secs
lola: 127036405 markings, 306171641 edges, 38559 markings/sec, 935 secs
lola: 127042503 markings, 306185506 edges, 1220 markings/sec, 940 secs
lola: 127050358 markings, 306203574 edges, 1571 markings/sec, 945 secs
lola: 127062335 markings, 306233606 edges, 2395 markings/sec, 950 secs
lola: 127066869 markings, 306243111 edges, 907 markings/sec, 955 secs
lola: 127073010 markings, 306257546 edges, 1228 markings/sec, 960 secs
lola: 127077688 markings, 306268700 edges, 936 markings/sec, 965 secs
lola: 127093693 markings, 306310841 edges, 3201 markings/sec, 970 secs
lola: 127103033 markings, 306333416 edges, 1868 markings/sec, 975 secs
lola: 127108704 markings, 306349552 edges, 1134 markings/sec, 980 secs
lola: 127113468 markings, 306362757 edges, 953 markings/sec, 985 secs
lola: 127117440 markings, 306373627 edges, 794 markings/sec, 990 secs
lola: 127122037 markings, 306383920 edges, 919 markings/sec, 995 secs
lola: 127138448 markings, 306426970 edges, 3282 markings/sec, 1000 secs
lola: 127142584 markings, 306437463 edges, 827 markings/sec, 1005 secs
lola: 127158727 markings, 306479392 edges, 3229 markings/sec, 1010 secs
lola: 127162205 markings, 306488635 edges, 696 markings/sec, 1015 secs
lola: 127168406 markings, 306502179 edges, 1240 markings/sec, 1020 secs
lola: 127174968 markings, 306519264 edges, 1312 markings/sec, 1025 secs
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: ========================================
FORMULA Philosophers-PT-000020-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no unknown yes yes yes yes no yes no no yes no
lola:
preliminary result: yes no yes no no unknown yes yes yes yes no yes no no yes no
lola: memory consumption: 21524 KB
lola: time consumption: 1043 seconds

BK_STOP 1527058983627

--------------------
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="Philosophers-PT-000020"
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/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 Philosophers-PT-000020, 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 r112-csrt-152666469900773"
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 ;