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 232K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IOTPpurchase-PT-C05M04P03D02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800217
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526797017978

info: Time: 3600 - MCC
===========================================================================================
prep: translating IOTPpurchase-PT-C05M04P03D02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IOTPpurchase-PT-C05M04P03D02 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ IOTPpurchase-PT-C05M04P03D02 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 156/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(GetPaymentAmount_t3_5) OR NOT FIREABLE(CheckDeliveryInfo_t6_3)))) : A (G (((NOT FIREABLE(GetPaymentRequest_t5_0) OR NOT FIREABLE(SelectBrand_t3_3)) AND NOT FIREABLE(CheckDeliveryNote_t6_6)))) : E (F (((FIREABLE(PutWhatDeliver_t6_1) OR FIREABLE(CheckPaymentAmount_t3_6)) AND FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(CheckRequest_t2) AND (FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(GetHowDeliver_t6_2)) AND (NOT FIREABLE(GetOfferResponse_t1) OR NOT FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(PutOfferRequest_t1))))) : E (F (FIREABLE(t8_4))) : E (F ((FIREABLE(CheckDeliveryNote_t6_6) AND FIREABLE(PaymentExchange_t3_8)))) : E (F (FIREABLE(GetDeliveryResponse_t6_5))) : A (G ((NOT FIREABLE(GetDeliveryRequest_t8_0) OR NOT FIREABLE(t8_4) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(PutOfferRequest_t1) AND NOT FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(SelectBrand_t3_3))))) : E (F (FIREABLE(CheckDeliveryRequest_t8_1))) : E (F (FIREABLE(CheckDeliveryInfo_t6_3))) : A (G (((FIREABLE(CheckOffer_t3) AND FIREABLE(PaymentExchange_t3_8)) OR NOT FIREABLE(GetDeliveryRequest_t8_0)))) : E (F ((NOT FIREABLE(MakeChoice_t1) AND ((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(WhatDeliverDecision_t6_0)) OR FIREABLE(CheckOffer_t3)) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(PutBrandList_t4_2) AND (FIREABLE(PutBrandList_t4_2) OR FIREABLE(t5_4) OR (FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_2)))))) : E (F (FIREABLE(GetDeliveryRequest_t8_0))) : A (G (NOT FIREABLE(t7_4))) : E (F ((FIREABLE(t5_4) AND NOT FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(PutPaymentRequest_t3_7) AND (FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(SelectBrand_t3_3)) AND (FIREABLE(PutPaymentAmount_t4_5) OR FIREABLE(PutDeliveryResponse_t8_2))))) : A (G (((FIREABLE(PaymentExchange_t3_8) OR (NOT FIREABLE(GetWhatDeliver_t7_0) AND NOT FIREABLE(PaymentResponse_t3_9))) AND NOT FIREABLE(GetDeliveryRequest_t8_0)))) : E (F ((FIREABLE(WhatDeliverDecision_t6_0) AND FIREABLE(t5_4) AND FIREABLE(PutOfferRequest_t1))))
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 (FIREABLE(t8_4)))
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(t8_4)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(t8_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-0.sara

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GetDeliveryResponse_t6_5)))
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(GetDeliveryResponse_t6_5)))
lola: processed formula length: 42
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(GetDeliveryResponse_t6_5)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CheckDeliveryRequest_t8_1)))
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(CheckDeliveryRequest_t8_1)))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(CheckDeliveryRequest_t8_1)
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-7 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 (F (FIREABLE(CheckDeliveryInfo_t6_3)))
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(CheckDeliveryInfo_t6_3)))
lola: processed formula length: 40
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(CheckDeliveryInfo_t6_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-3-0.sara
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-8 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 (F (FIREABLE(GetDeliveryRequest_t8_0)))
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(GetDeliveryRequest_t8_0)))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(GetDeliveryRequest_t8_0)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-11 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: A (G (NOT FIREABLE(t7_4)))
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(t7_4)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: FIREABLE(t7_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-5-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: 34 markings, 33 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CheckDeliveryNote_t6_6) AND FIREABLE(PaymentExchange_t3_8))))
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(CheckDeliveryNote_t6_6) AND FIREABLE(PaymentExchange_t3_8))))
lola: processed formula length: 77
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(CheckDeliveryNote_t6_6) AND FIREABLE(PaymentExchange_t3_8))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(GetPaymentAmount_t3_5) OR NOT FIREABLE(CheckDeliveryInfo_t6_3))))
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(GetPaymentAmount_t3_5) OR NOT FIREABLE(CheckDeliveryInfo_t6_3))))
lola: processed formula length: 86
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: 53 markings, 52 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-0 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: A (G (((NOT FIREABLE(GetPaymentRequest_t5_0) OR NOT FIREABLE(SelectBrand_t3_3)) AND NOT FIREABLE(CheckDeliveryNote_t6_6))))
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(GetPaymentRequest_t5_0) OR NOT FIREABLE(SelectBrand_t3_3)) AND NOT FIREABLE(CheckDeliveryNote_t6_6))))
lola: processed formula length: 124
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: ((FIREABLE(GetPaymentRequest_t5_0) AND FIREABLE(SelectBrand_t3_3)) OR FIREABLE(CheckDeliveryNote_t6_6))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-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 not invariant.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(CheckOffer_t3) AND FIREABLE(PaymentExchange_t3_8)) OR NOT FIREABLE(GetDeliveryRequest_t8_0))))
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(CheckOffer_t3) AND FIREABLE(PaymentExchange_t3_8)) OR NOT FIREABLE(GetDeliveryRequest_t8_0))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: formula 0: ((NOT FIREABLE(CheckOffer_t3) OR NOT FIREABLE(PaymentExchange_t3_8)) AND FIREABLE(GetDeliveryRequest_t8_0))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(WhatDeliverDecision_t6_0) AND FIREABLE(t5_4) AND FIREABLE(PutOfferRequest_t1))))
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(WhatDeliverDecision_t6_0) AND FIREABLE(t5_4) AND FIREABLE(PutOfferRequest_t1))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(WhatDeliverDecision_t6_0) AND FIREABLE(t5_4) AND FIREABLE(PutOfferRequest_t1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(PaymentExchange_t3_8) OR (NOT FIREABLE(GetWhatDeliver_t7_0) AND NOT FIREABLE(PaymentResponse_t3_9))) AND NOT FIREABLE(GetDeliveryRequest_t8_0))))
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(PaymentExchange_t3_8) OR (NOT FIREABLE(GetWhatDeliver_t7_0) AND NOT FIREABLE(PaymentResponse_t3_9))) AND NOT FIREABLE(GetDeliveryRequest_t8_0))))
lola: processed formula length: 163
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(PaymentExchange_t3_8) AND (FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(PaymentResponse_t3_9))) OR FIREABLE(GetDeliveryRequest_t8_0))
lola: state equation: Generated DNF with 14 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-11-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-14 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: E (F ((FIREABLE(t5_4) AND NOT FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(PutPaymentRequest_t3_7) AND (FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(SelectBrand_t3_3)) AND (FIREABLE(PutPaymentAmount_t4_5) OR FIREABLE(PutDeliveryResponse_t8_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(t5_4) AND NOT FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(PutPaymentRequest_t3_7) AND (FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(SelectBrand_t3_3)) AND (FIREABLE(PutPaymentAmount_t4_5) OR FIREABLE(PutDeliveryResponse_t8_2)))))
lola: processed formula length: 249
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(t5_4) AND NOT FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(PutPaymentRequest_t3_7) AND (FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(SelectBrand_t3_3)) AND (FIREABLE(PutPaymentAmount_t4_5) OR FIREABLE(PutDeliveryResponse_t8_2)))
lola: state equation: Generated DNF with 104 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78 markings, 77 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-12-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(GetDeliveryRequest_t8_0) OR NOT FIREABLE(t8_4) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(PutOfferRequest_t1) AND NOT FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(SelectBrand_t3_3)))))
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(GetDeliveryRequest_t8_0) OR NOT FIREABLE(t8_4) OR NOT FIREABLE(GetOfferRequest_t2) OR (NOT FIREABLE(CheckBrandSelection_t4_4) AND NOT FIREABLE(PutOfferRequest_t1) AND NOT FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(SelectBrand_t3_3)))))
lola: processed formula length: 265
lola: 2 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: 146 markings, 145 edges
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-10-0.sara.
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(PutWhatDeliver_t6_1) OR FIREABLE(CheckPaymentAmount_t3_6)) AND FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(CheckRequest_t2) AND (FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(GetHowDeliver_t6_2)) AND (NOT FIREABLE(GetOfferResponse_t1) OR NOT FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(PutOfferRequest_t1)))))
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(PutWhatDeliver_t6_1) OR FIREABLE(CheckPaymentAmount_t3_6)) AND FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(CheckRequest_t2) AND (FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(GetHowDeliver_t6_2)) AND (NOT FIREABLE(GetOfferResponse_t1) OR NOT FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(PutOfferRequest_t1)))))
lola: processed formula length: 332
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(PutWhatDeliver_t6_1) OR FIREABLE(CheckPaymentAmount_t3_6)) AND FIREABLE(PutBrandSelection_t3_4) AND NOT FIREABLE(CheckRequest_t2) AND (FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(GetHowDeliver_t6_2)) AND (NOT FIREABLE(GetOfferResponse_t1) OR NOT FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(PutOfferRequest_t1)))
lola: state equation: Generated DNF with 154 literals and 20 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(MakeChoice_t1) AND ((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(WhatDeliverDecision_t6_0)) OR FIREABLE(CheckOffer_t3)) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(PutBrandList_t4_2) AND (FIREABLE(PutBrandList_t4_2) OR FIREABLE(t5_4) OR (FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_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(MakeChoice_t1) AND ((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(WhatDeliverDecision_t6_0)) OR FIREABLE(CheckOffer_t3)) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(PutBrandList_t4_2) AND (FIREABLE(PutBrandList_t4_2) OR FIREABLE(t5_4) OR (FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_2))))))
lola: processed formula length: 379
lola: 1 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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(MakeChoice_t1) AND ((FIREABLE(PaymentExchange_t3_8) AND FIREABLE(WhatDeliverDecision_t6_0)) OR FIREABLE(CheckOffer_t3)) AND FIREABLE(BrandDecision_t4_1) AND FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(PutBrandList_t4_2) AND (FIREABLE(PutBrandList_t4_2) OR FIREABLE(t5_4) OR (FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_2))))
lola: state equation: Generated DNF with 112 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 119 markings, 118 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no yes yes no yes yes no yes no yes
lola:
preliminary result: no no yes yes yes yes no yes yes no yes yes no yes no yes
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: memory consumption: 14788 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="IOTPpurchase-PT-C05M04P03D02"
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/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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 IOTPpurchase-PT-C05M04P03D02, 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 r100-smll-152658630800217"
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 ;