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 320K
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100371
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526727605565

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-PT-02 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 DrinkVendingMachine-PT-02 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DrinkVendingMachine-PT-02 @ 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: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-PT-02-ReachabilityFireability.task
lola: E (F (((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2) OR ((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE(elaborate3_2_1_7_2_1) OR FIREABLE(elaborate3_1_2_7_2_1) OR FIREABLE(elaborate3_2_2_8_2_1) OR FIREABLE(elaborate3_1_1_7_1_2) OR FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate3_1_2_8_2_1) OR FIREABLE(elaborate3_2_2_7_1_2) OR FIREABLE(elaborate3_1_1_8_1_2) OR FIREABLE(elaborate3_2_1_7_1_2) OR FIREABLE(elaborate3_1_2_7_1_2) OR FIREABLE(elaborate3_1_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_1_2) OR FIREABLE(elaborate3_1_2_8_1_2) OR FIREABLE(elaborate3_2_1_8_1_2) OR FIREABLE(elaborate3_1_1_8_2_2) OR FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate3_1_2_7_2_2) OR FIREABLE(elaborate3_2_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_2_2) OR FIREABLE(elaborate3_1_2_8_2_2) OR FIREABLE(elaborate3_2_1_8_2_2))) OR (NOT FIREABLE(elaborate3_1_1_7_1_1) AND NOT FIREABLE(elaborate3_1_2_7_1_1) AND NOT FIREABLE(elaborate3_2_1_7_1_1) AND NOT FIREABLE(elaborate3_1_1_8_1_1) AND NOT FIREABLE(elaborate3_2_2_7_1_1) AND NOT FIREABLE(elaborate3_2_2_8_1_1) AND NOT FIREABLE(elaborate3_1_1_7_2_1) AND NOT FIREABLE(elaborate3_2_1_8_1_1) AND NOT FIREABLE(elaborate3_1_2_8_1_1) AND NOT FIREABLE(elaborate3_2_2_7_2_1) AND NOT FIREABLE(elaborate3_1_1_8_2_1) AND NOT FIREABLE(elaborate3_2_1_7_2_1) AND NOT FIREABLE(elaborate3_1_2_7_2_1) AND NOT FIREABLE(elaborate3_2_2_8_2_1) AND NOT FIREABLE(elaborate3_1_1_7_1_2) AND NOT FIREABLE(elaborate3_2_1_8_2_1) AND NOT FIREABLE(elaborate3_1_2_8_2_1) AND NOT FIREABLE(elaborate3_2_2_7_1_2) AND NOT FIREABLE(elaborate3_1_1_8_1_2) AND NOT FIREABLE(elaborate3_2_1_7_1_2) AND NOT FIREABLE(elaborate3_1_2_7_1_2) AND NOT FIREABLE(elaborate3_1_1_7_2_2) AND NOT FIREABLE(elaborate3_2_2_8_1_2) AND NOT FIREABLE(elaborate3_1_2_8_1_2) AND NOT FIREABLE(elaborate3_2_1_8_1_2) AND NOT FIREABLE(elaborate3_1_1_8_2_2) AND NOT FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_1_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_7_2_2) AND NOT FIREABLE(elaborate3_2_2_8_2_2) AND NOT FIREABLE(elaborate3_1_2_8_2_2) AND NOT FIREABLE(elaborate3_2_1_8_2_2)) OR (NOT FIREABLE(serve_3) AND NOT FIREABLE(serve_2) AND NOT FIREABLE(serve_5) AND NOT FIREABLE(serve_4) AND NOT FIREABLE(serve_1) AND NOT FIREABLE(serve_7) AND NOT FIREABLE(serve_6) AND NOT FIREABLE(serve_8))) AND (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2) OR FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1))) OR ((FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE(elaborate3_2_1_7_2_1) OR FIREABLE(elaborate3_1_2_7_2_1) OR FIREABLE(elaborate3_2_2_8_2_1) OR FIREABLE(elaborate3_1_1_7_1_2) OR FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate3_1_2_8_2_1) OR FIREABLE(elaborate3_2_2_7_1_2) OR FIREABLE(elaborate3_1_1_8_1_2) OR FIREABLE(elaborate3_2_1_7_1_2) OR FIREABLE(elaborate3_1_2_7_1_2) OR FIREABLE(elaborate3_1_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_1_2) OR FIREABLE(elaborate3_1_2_8_1_2) OR FIREABLE(elaborate3_2_1_8_1_2) OR FIREABLE(elaborate3_1_1_8_2_2) OR FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate3_1_2_7_2_2) OR FIREABLE(elaborate3_2_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_2_2) OR FIREABLE(elaborate3_1_2_8_2_2) OR FIREABLE(elaborate3_2_1_8_2_2)) AND (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1) OR FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2))))))) : A (G ((FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE(elaborate3_2_1_7_2_1) OR FIREABLE(elaborate3_1_2_7_2_1) OR FIREABLE(elaborate3_2_2_8_2_1) OR FIREABLE(elaborate3_1_1_7_1_2) OR FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate3_1_2_8_2_1) OR FIREABLE(elaborate3_2_2_7_1_2) OR FIREABLE(elaborate3_1_1_8_1_2) OR FIREABLE(elaborate3_2_1_7_1_2) OR FIREABLE(elaborate3_1_2_7_1_2) OR FIREABLE(elaborate3_1_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_1_2) OR FIREABLE(elaborate3_1_2_8_1_2) OR FIREABLE(elaborate3_2_1_8_1_2) OR FIREABLE(elaborate3_1_1_8_2_2) OR FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate3_1_2_7_2_2) OR FIREABLE(elaborate3_2_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_2_2) OR FIREABLE(elaborate3_1_2_8_2_2) OR FIREABLE(elaborate3_2_1_8_2_2)))) : E (F ((((NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2) AND NOT FIREABLE(elaborate2_1_1_5_1) AND NOT FIREABLE(elaborate2_1_1_6_1) AND NOT FIREABLE(elaborate2_2_2_5_1) AND NOT FIREABLE(elaborate2_1_2_5_1) AND NOT FIREABLE(elaborate2_2_1_5_1) AND NOT FIREABLE(elaborate2_2_1_5_2) AND NOT FIREABLE(elaborate2_1_2_5_2) AND NOT FIREABLE(elaborate2_2_2_5_2) AND NOT FIREABLE(elaborate2_1_1_6_2) AND NOT FIREABLE(elaborate2_2_1_6_1) AND NOT FIREABLE(elaborate2_1_2_6_1) AND NOT FIREABLE(elaborate2_2_2_6_1) AND NOT FIREABLE(elaborate2_1_1_5_2) AND NOT FIREABLE(elaborate2_2_1_6_2) AND NOT FIREABLE(elaborate2_1_2_6_2) AND NOT FIREABLE(elaborate2_2_2_6_2))) AND ((NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2)) OR ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8)) AND (FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE(elaborate3_2_1_7_2_1) OR FIREABLE(elaborate3_1_2_7_2_1) OR FIREABLE(elaborate3_2_2_8_2_1) OR FIREABLE(elaborate3_1_1_7_1_2) OR FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate3_1_2_8_2_1) OR FIREABLE(elaborate3_2_2_7_1_2) OR FIREABLE(elaborate3_1_1_8_1_2) OR FIREABLE(elaborate3_2_1_7_1_2) OR FIREABLE(elaborate3_1_2_7_1_2) OR FIREABLE(elaborate3_1_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_1_2) OR FIREABLE(elaborate3_1_2_8_1_2) OR FIREABLE(elaborate3_2_1_8_1_2) OR FIREABLE(elaborate3_1_1_8_2_2) OR FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate3_1_2_7_2_2) OR FIREABLE(elaborate3_2_1_7_2_2) OR FIREABLE(elaborate3_2_2_8_2_2) OR FIREABLE(elaborate3_1_2_8_2_2) OR FIREABLE(elaborate3_2_1_8_2_2))) OR FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2))))) : E (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))) : A (G (((NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1) AND NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1) AND ((NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)) OR (NOT FIREABLE(serve_3) AND NOT FIREABLE(serve_2) AND NOT FIREABLE(serve_5) AND NOT FIREABLE(serve_4) AND NOT FIREABLE(serve_1) AND NOT FIREABLE(serve_7) AND NOT FIREABLE(serve_6) AND NOT FIREABLE(serve_8))))))) : A (G (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2)) AND NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1))))) : A (G ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8) OR (((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2))) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))))) : A (G ((((((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) OR (NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2))) AND (FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8) OR FIREABLE(addOption_2) OR FIREABLE(addOption_1) OR FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) OR (((NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1))) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))))) : A (G (((FIREABLE(serve_7) AND FIREABLE(elaborate3_1_2_8_2_2)) OR FIREABLE(elaborate0_2_2)))) : E (F (NOT FIREABLE(elaborate3_1_1_8_1_2))) : E (F ((NOT FIREABLE(elaborate3_1_1_8_2_1) OR NOT FIREABLE(elaborate3_2_1_7_2_2) OR (FIREABLE(elaborate3_1_1_8_1_1) AND FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_8_1_1)) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate3_1_1_8_1_2)))) : E (F (FIREABLE(elaborate3_2_2_8_1_2))) : E (F (FIREABLE(elaborate3_2_2_8_2_2))) : E (F (FIREABLE(elaborate3_1_1_7_2_2))) : A (G (FIREABLE(elaborate2_1_1_6_2))) : E (F ((FIREABLE(elaborate3_1_2_8_1_2) AND FIREABLE(elaborate3_2_1_7_2_1) AND (FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(serve_1)) AND (FIREABLE(serve_5) OR FIREABLE(elaborate2_2_2_6_1) OR (FIREABLE(elaborate2_1_1_6_1) AND FIREABLE(elaborate3_1_2_7_2_1))) AND FIREABLE(elaborate1_1_4_2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(elaborate3_1_1_8_1_2)))
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 (NOT FIREABLE(elaborate3_1_1_8_1_2)))
lola: processed formula length: 42
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: NOT FIREABLE(elaborate3_1_1_8_1_2)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-0.sara
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(elaborate3_2_2_8_1_2)))
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 (FIREABLE(elaborate3_2_2_8_1_2)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: FIREABLE(elaborate3_2_2_8_1_2)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-PT-02-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 816 markings, 3668 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-11 FALSE 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: E (F (FIREABLE(elaborate3_2_2_8_2_2)))
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 (FIREABLE(elaborate3_2_2_8_2_2)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: FIREABLE(elaborate3_2_2_8_2_2)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-PT-02-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 816 markings, 3668 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-12 FALSE 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: E (F (FIREABLE(elaborate3_1_1_7_2_2)))
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 (FIREABLE(elaborate3_1_1_7_2_2)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: FIREABLE(elaborate3_1_1_7_2_2)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-PT-02-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 720 markings, 2580 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-13 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: A (G (FIREABLE(elaborate2_1_1_6_2)))
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 (FIREABLE(elaborate2_1_1_6_2)))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-14 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: A (G (((FIREABLE(serve_7) AND FIREABLE(elaborate3_1_2_8_2_2)) OR FIREABLE(elaborate0_2_2))))
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 (((FIREABLE(serve_7) AND FIREABLE(elaborate3_1_2_8_2_2)) OR FIREABLE(elaborate0_2_2))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(serve_7) OR NOT FIREABLE(elaborate3_1_2_8_2_2)) AND NOT FIREABLE(elaborate0_2_2))
lola: state equation: Generated DNF with 20 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-8 FALSE 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: E (F ((NOT FIREABLE(elaborate3_1_1_8_2_1) OR NOT FIREABLE(elaborate3_2_1_7_2_2) OR (FIREABLE(elaborate3_1_1_8_1_1) AND FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_8_1_1)) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate3_1_1_8_1_2))))
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 ((NOT FIREABLE(elaborate3_1_1_8_2_1) OR NOT FIREABLE(elaborate3_2_1_7_2_2) OR (FIREABLE(elaborate3_1_1_8_1_1) AND FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_8_1_1)) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate3_1_1_8_1_2))))
lola: processed formula length: 258
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (NOT FIREABLE(elaborate3_1_1_8_2_1) OR NOT FIREABLE(elaborate3_2_1_7_2_2) OR (FIREABLE(elaborate3_1_1_8_1_1) AND FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_8_1_1)) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate3_1_1_8_1_2))
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 27 literals and 11 conjunctive subformulas
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))))
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 ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))))
lola: processed formula length: 253
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(elaborate3_1_2_8_1_2) AND FIREABLE(elaborate3_2_1_7_2_1) AND (FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(serve_1)) AND (FIREABLE(serve_5) OR FIREABLE(elaborate2_2_2_6_1) OR (FIREABLE(elaborate2_1_1_6_1) AND FIREABLE(elaborate3_1_2_7_2_1))) AND FIREABLE(elaborate1_1_4_2))))
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 ((FIREABLE(elaborate3_1_2_8_1_2) AND FIREABLE(elaborate3_2_1_7_2_1) AND (FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(serve_1)) AND (FIREABLE(serve_5) OR FIREABLE(elaborate2_2_2_6_1) OR (FIREABLE(elaborate2_1_1_6_1) AND FIREABLE(elaborate3_1_2_7_2_1))) AND FIREABLE(elaborate1_1_4_2))))
lola: processed formula length: 290
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: (FIREABLE(elaborate3_1_2_8_1_2) AND FIREABLE(elaborate3_2_1_7_2_1) AND (FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(serve_1)) AND (FIREABLE(serve_5) OR FIREABLE(elaborate2_2_2_6_1) OR (FIREABLE(elaborate2_1_1_6_1) AND FIREABLE(elaborate3_1_2_7_2_1))) AND FIREABLE(elaborate1_1_4_2))
lola: state equation: Generated DNF with 100 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 712 markings, 1727 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1) AND NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_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 (((NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1) AND NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1... (shortened)
lola: processed formula length: 679
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: ((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1) OR FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1) OR ((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8)))))
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-4 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: A (G (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_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 (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) AND (FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_... (shortened)
lola: processed formula length: 1003
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(elaborate2_1_1_5_1) AND NOT FIREABLE(elaborate2_1_1_6_1) AND NOT FIREABLE(elaborate2_2_2_5_1) AND NOT FIREABLE(elaborate2_1_2_5_1) AND NOT FIREABLE(elaborate2_2_1_5_1) AND NOT FIREABLE(elaborate2_2_1_5_2) AND NOT FIREABLE(elaborate2_1_2_5_2) AND NOT FIREABLE(elaborate2_2_2_5_2) AND NOT FIREABLE(elaborate2_1_1_6_2) AND NOT FIREABLE(elaborate2_2_1_6_1) AND NOT FIREABLE(elaborate2_1_2_6_1) AND NOT FIREABLE(elaborate2_2_2_6_1) AND NOT FIREABLE(elaborate2_1_1_5_2) AND NOT FIREABLE(elaborate2_2_1_6_2) AND NOT FIREABLE(elaborate2_1_2_6_2) AND NOT FIREABLE(elaborate2_2_2_6_2)) OR FIREABLE(addOption_2) OR FIREABLE(addOption_1) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1)) OR (NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-5 FALSE 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 ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8) OR (((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREAB... (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 ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8) OR (((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREAB... (shortened)
lola: processed formula length: 649
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(serve_3) AND NOT FIREABLE(serve_2) AND NOT FIREABLE(serve_5) AND NOT FIREABLE(serve_4) AND NOT FIREABLE(serve_1) AND NOT FIREABLE(serve_7) AND NOT FIREABLE(serve_6) AND NOT FIREABLE(serve_8) AND (((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 384 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-ReachabilityFireability-11-0.sara
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-6 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 ((((((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) OR (NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2))) AND (FIREABLE(serve_3)... (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 ((((((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) OR (NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2))) AND (FIREABLE(serve_3)... (shortened)
lola: processed formula length: 1105
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2))) AND (FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))) OR (NOT FIREABLE(serve_3) AND NOT FIREABLE(serve_2) AND NOT FIREABLE(serve_5) AND NOT FIREABLE(serve_4) AND NOT FIREABLE(serve_1) AND NOT FIREABLE(serve_7) AND NOT FIREABLE(serve_6) AND NOT FIREABLE(serve_8) AND NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1) AND NOT FIREABLE(serve_3) AND NOT FIREABLE(serve_2) AND NOT FIREABLE(serve_5) AND NOT FIREABLE(serve_4) AND NOT FIREABLE(serve_1) AND NOT FIREABLE(serve_7) AND NOT FIREABLE(serve_6) AND NOT FIREABLE(serve_8))) AND (((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1))) OR (NOT FIREABLE(elaborate0_1_2) AND NOT FIREABLE(elaborate0_2_1) AND NOT FIREABLE(elaborate0_2_2) AND NOT FIREABLE(elaborate0_1_1))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-7 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: A (G ((FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE... (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 ((FIREABLE(elaborate3_1_1_7_1_1) OR FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate3_2_1_7_1_1) OR FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_2_2_7_1_1) OR FIREABLE(elaborate3_2_2_8_1_1) OR FIREABLE(elaborate3_1_1_7_2_1) OR FIREABLE(elaborate3_2_1_8_1_1) OR FIREABLE(elaborate3_1_2_8_1_1) OR FIREABLE(elaborate3_2_2_7_2_1) OR FIREABLE(elaborate3_1_1_8_2_1) OR FIREABLE... (shortened)
lola: processed formula length: 1125
lola: 2 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(elaborate3_1_1_7_1_1) AND NOT FIREABLE(elaborate3_1_2_7_1_1) AND NOT FIREABLE(elaborate3_2_1_7_1_1) AND NOT FIREABLE(elaborate3_1_1_8_1_1) AND NOT FIREABLE(elaborate3_2_2_7_1_1) AND NOT FIREABLE(elaborate3_2_2_8_1_1) AND NOT FIREABLE(elaborate3_1_1_7_2_1) AND NOT FIREABLE(elaborate3_2_1_8_1_1) AND NOT FIREABLE(elaborate3_1_2_8_1_1) AND NOT FIREABLE(elaborate3_2_2_7_2_1) AND NOT FIREABLE(elaborate3_1_1_8_2_1) AND NOT FIREABLE(elaborate3_2_1_7_2_1) AND NOT FIREABLE(elaborate3_1_2_7_2_1) AND NOT FIREABLE(elaborate3_2_2_8_2_1) AND NOT FIREABLE(elaborate3_1_1_7_1_2) AND NOT FIREABLE(elaborate3_2_1_8_2_1) AND NOT FIREABLE(elaborate3_1_2_8_2_1) AND NOT FIREABLE(elaborate3_2_2_7_1_2) AND NOT FIREABLE(elaborate3_1_1_8_1_2) AND NOT FIREABLE(elaborate3_2_1_7_1_2) AND NOT FIREABLE(elaborate3_1_2_7_1_2) AND NOT FIREABLE(elaborate3_1_1_7_2_2) AND NOT FIREABLE(elaborate3_2_2_8_1_2) AND NOT FIREABLE(elaborate3_1_2_8_1_2) AND NOT FIREABLE(elaborate3_2_1_8_1_2) AND NOT FIREABLE(elaborate3_1_1_8_2_2) AND NOT FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate3_1_2_7_2_2) AND NOT FIREABLE(elaborate3_2_1_7_2_2) AND NOT FIREABLE(elaborate3_2_2_8_2_2) AND NOT FIREABLE(elaborate3_1_2_8_2_2) AND NOT FIREABLE(elaborate3_2_1_8_2_2))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-1 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 (F ((((NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2) AND NOT FIREABLE(elaborate2_1_1_5_1) AND NOT FIREABLE... (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 ((((NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_1)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1) AND NOT FIREABLE(elaborate1_2_4_1) AND NOT FIREABLE(elaborate1_1_3_2) AND NOT FIREABLE(elaborate1_1_3_1) AND NOT FIREABLE(elaborate1_1_4_2) AND NOT FIREABLE(elaborate1_2_3_2) AND NOT FIREABLE(elaborate1_2_4_2) AND NOT FIREABLE(elaborate2_1_1_5_1) AND NOT FIREABLE... (shortened)
lola: processed formula length: 3057
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) ... (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 (((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) ... (shortened)
lola: processed formula length: 6015
lola: 1 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-ReachabilityFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no no yes yes no no no no no
lola:
preliminary result: yes no yes yes no no no no no yes yes no no no no no
lola: memory consumption: 14720 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="ReachabilityFireability"
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/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 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 DrinkVendingMachine-PT-02, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r076-blw3-152649937100371"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;