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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100368
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526727585006

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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ 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-CTLFireability.task
lola: E (X ((((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1))) OR A (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) U (FIREABLE(addOption_2) OR FIREABLE(addOption_1))))))) : NOT((NOT((E (F ((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))) 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) 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(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(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 A (X ((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 (G (E (G (E (G ((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)))))))) : E (X (A (X (A (F ((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)))))))) : A (G (NOT(((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) OR ((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) 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 E (F ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)))))))) : A (G ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)))) : (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) : ((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 (E (((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)) U (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 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(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 (X ((((FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(serve_7)) OR E (F (FIREABLE(serve_3)))) OR (NOT FIREABLE(elaborate2_1_2_5_1) AND NOT FIREABLE(elaborate3_1_2_8_1_1) AND (NOT FIREABLE(elaborate2_1_2_5_1) OR NOT FIREABLE(addProduct_1)))))) : E ((A (G ((FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate2_2_1_5_1)))) U (NOT FIREABLE(serve_8) OR NOT FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate2_2_2_6_2)))) : E ((((NOT FIREABLE(elaborate3_1_1_7_1_2) AND NOT FIREABLE(serve_6)) AND E (F (FIREABLE(serve_4)))) U E ((FIREABLE(serve_3) U FIREABLE(elaborate3_2_2_7_2_1))))) : A ((((NOT FIREABLE(elaborate1_1_4_2) OR NOT FIREABLE(elaborate0_1_1)) AND NOT FIREABLE(elaborate3_2_2_8_2_1)) U (FIREABLE(serve_8) OR FIREABLE(elaborate3_2_2_7_1_1) OR NOT FIREABLE(elaborate3_2_1_8_1_1) OR ((FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_1_2_6_2)) AND NOT FIREABLE(elaborate3_1_1_8_2_1))))) : E (X (FIREABLE(elaborate0_1_2))) : ((E (G ((FIREABLE(elaborate3_2_2_8_2_2) AND FIREABLE(elaborate2_1_2_6_1) AND FIREABLE(elaborate3_2_1_8_2_1)))) OR (NOT(E (G (FIREABLE(elaborate3_2_1_8_2_2)))) OR FIREABLE(elaborate2_1_1_5_2))) OR ((E (F ((FIREABLE(elaborate1_2_4_1) AND FIREABLE(elaborate3_1_2_7_1_2)))) OR (NOT FIREABLE(elaborate3_1_2_7_2_2) OR NOT FIREABLE(elaborate0_2_1) OR NOT FIREABLE(elaborate3_2_2_7_1_2))) OR NOT(E (F (NOT FIREABLE(elaborate0_1_1)))))) : E (G ((A (F (FIREABLE(elaborate1_1_4_1))) OR (E (G (FIREABLE(elaborate0_2_2))) AND (NOT FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_2)))))) : FIREABLE(addOption_2)
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1))
lola: processed formula length: 113
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 DrinkVendingMachine-PT-02-CTLFireability-6 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: FIREABLE(addOption_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(addOption_2)
lola: processed formula length: 21
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 DrinkVendingMachine-PT-02-CTLFireability-15 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 (X (A (X (A (F ((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: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(AX(A(TRUE U (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: processed formula length: 191
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 32 markings, 35 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-3 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: (E (X (((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1))))) OR E (X (A (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) U (FIREABLE(addOption_2) OR FIREABLE(addOption_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND (FIREABLE(addOption_2) OR FIREABLE(addOption_1))))
lola: processed formula length: 109
lola: 45 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(serve_7)))) OR (E (X (E (F (FIREABLE(serve_3))))) OR E (X ((NOT FIREABLE(elaborate2_1_2_5_1) AND NOT FIREABLE(elaborate3_1_2_8_1_1) AND (NOT FIREABLE(elaborate2_1_2_5_1) OR NOT FIREABLE(addProduct_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(serve_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FIREABLE(elaborate3_1_2_7_1_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(serve_7)))
lola: processed formula length: 124
lola: 45 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(elaborate0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(elaborate0_1_2))
lola: processed formula length: 28
lola: 45 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-12 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: (E (F ((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))) 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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 FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 FIR... (shortened)
lola: processed formula length: 525
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2... (shortened)
lola: processed formula length: 983
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-1 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: A (G ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_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(addProduct_1) OR FIREABLE(addProduct_2))))
lola: processed formula length: 59
lola: 46 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-02-CTLFireability-7-0.sara
lola: state equation: calling and running sara
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-CTLFireability-5 FALSE 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 (G ((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 possible preservation
lola: processed formula: E (G ((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: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-2 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: E ((A (G ((FIREABLE(elaborate3_2_2_7_2_2) OR FIREABLE(elaborate2_2_1_5_1)))) U (NOT FIREABLE(serve_8) OR NOT FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate2_2_2_6_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(E(TRUE U (NOT FIREABLE(elaborate3_2_2_7_2_2) AND NOT FIREABLE(elaborate2_2_1_5_1)))) U (NOT FIREABLE(serve_8) OR NOT FIREABLE(elaborate3_2_1_8_2_1) OR FIREABLE(elaborate2_2_2_6_2)))
lola: processed formula length: 189
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (FIREABLE(elaborate1_1_4_1))) OR (E (G (FIREABLE(elaborate0_2_2))) AND (NOT FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U FIREABLE(elaborate1_1_4_1))) AND (A(TRUE U NOT FIREABLE(elaborate0_2_2)) OR (FIREABLE(elaborate2_2_2_5_1) AND NOT FIREABLE(elaborate2_1_2_5_2))))))
lola: processed formula length: 174
lola: 52 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 76 markings, 189 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-14 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: E ((((NOT FIREABLE(elaborate3_1_1_7_1_2) AND NOT FIREABLE(serve_6)) AND E (F (FIREABLE(serve_4)))) U E ((FIREABLE(serve_3) U FIREABLE(elaborate3_2_2_7_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(((NOT FIREABLE(elaborate3_1_1_7_1_2) AND NOT FIREABLE(serve_6)) AND E(TRUE U FIREABLE(serve_4))) U E(FIREABLE(serve_3) U FIREABLE(elaborate3_2_2_7_2_1)))
lola: processed formula length: 155
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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 3 significant temporal operators and needs 13 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: 1024 markings, 8928 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-10 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 ((((NOT FIREABLE(elaborate1_1_4_2) OR NOT FIREABLE(elaborate0_1_1)) AND NOT FIREABLE(elaborate3_2_2_8_2_1)) U (FIREABLE(serve_8) OR FIREABLE(elaborate3_2_2_7_1_1) OR NOT FIREABLE(elaborate3_2_1_8_1_1) OR ((FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_1_2_6_2)) AND NOT FIREABLE(elaborate3_1_1_8_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((NOT FIREABLE(elaborate1_1_4_2) OR NOT FIREABLE(elaborate0_1_1)) AND NOT FIREABLE(elaborate3_2_2_8_2_1)) U (FIREABLE(serve_8) OR FIREABLE(elaborate3_2_2_7_1_1) OR NOT FIREABLE(elaborate3_2_1_8_1_1) OR ((FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_1_2_6_2)) AND NOT FIREABLE(elaborate3_1_1_8_2_1)))))
lola: processed formula length: 317
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-11 TRUE 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: ((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 FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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(elabo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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(elabo... (shortened)
lola: processed formula length: 1117
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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 FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 FIR... (shortened)
lola: processed formula length: 525
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((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 ... (shortened)
lola: processed formula length: 1899
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-7 TRUE 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: (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) AND NOT FIREABLE(addOption_2) AND NOT FIREABLE(addOption_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)) OR (NOT FIREABLE(elaborate1_2_3_1) AND NOT FIREABLE(elaborate1_1_4_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_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:695
lola: processed formula: A (G ((NOT FIREABLE(addProduct_1) AND NOT FIREABLE(addProduct_2))))
lola: processed formula length: 67
lola: 46 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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:695
lola: formula 0: (FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-4 FALSE 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 (G ((FIREABLE(elaborate3_2_2_8_2_2) AND FIREABLE(elaborate2_1_2_6_1) AND FIREABLE(elaborate3_2_1_8_2_1)))) OR (A (F (NOT FIREABLE(elaborate3_2_1_8_2_2))) OR (FIREABLE(elaborate2_1_1_5_2) OR (E (F ((FIREABLE(elaborate1_2_4_1) AND FIREABLE(elaborate3_1_2_7_1_2)))) OR ((NOT FIREABLE(elaborate3_1_2_7_2_2) OR NOT FIREABLE(elaborate0_2_1) OR NOT FIREABLE(elaborate3_2_2_7_1_2)) OR A (G (FIREABLE(ela... (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: (NOT FIREABLE(elaborate3_1_2_7_2_2) OR NOT FIREABLE(elaborate0_2_1) OR NOT FIREABLE(elaborate3_2_2_7_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(elaborate3_1_2_7_2_2) OR NOT FIREABLE(elaborate0_2_1) OR NOT FIREABLE(elaborate3_2_2_7_1_2))
lola: processed formula length: 108
lola: 44 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLFireability-13 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 yes yes yes yes no yes yes yes yes no
lola:
preliminary result: yes no yes yes no no yes yes yes yes no yes yes yes yes no
lola: memory consumption: 14780 KB
lola: time consumption: 0 seconds

BK_STOP 1526727585325

--------------------
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="CTLFireability"
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 CTLFireability"
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-152649937100368"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;