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 244K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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-C03M03P03D03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800208
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526793230436

info: Time: 3600 - MCC
===========================================================================================
prep: translating IOTPpurchase-PT-C03M03P03D03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IOTPpurchase-PT-C03M03P03D03 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ IOTPpurchase-PT-C03M03P03D03 @ 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: 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-C03M03P03D03-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= DeliveryRequest_p12_5)
lola: LP says that atomic proposition is always false: (3 <= p11_13)
lola: LP says that atomic proposition is always false: (3 <= PaymentAmount_p11_6)
lola: LP says that atomic proposition is always false: (3 <= p11_8)
lola: LP says that atomic proposition is always false: (2 <= PaySchemeData_p11_10)
lola: LP says that atomic proposition is always false: (3 <= p12_7)
lola: E (F (((2 <= MerchantDelivery_p4_6) AND (2 <= ConsumerPayment_p3)))) : A (G (((Organization_p22_5 <= WhatDeliver_p12_1) OR (1 <= Organization_p21_2) OR (p11_13 <= Delivery_p20_10) OR (p12_3 <= PaymentNote_p21_16) OR ((p1_2 <= 2) AND (Status_p21_9 <= 0))))) : A (G (())) : A (G (((3 <= Organization_p21_2) OR (p6_6 <= p1_1) OR (1 <= Organization_p21_8) OR ((PaymentNote_p21_13 <= p12_4) AND (1 <= PaymentNote_p21_16) AND (p12_0 <= p3_9))))) : A (G (((1 <= p11_3) OR (p11_8 <= WhatDeliver_p12_1) OR (p8_1 <= 1)))) : E (F ((2 <= Order_p22_6))) : E (F (((3 <= Status_p21_14) AND (3 <= Organization_p22_9) AND (1 <= p11_8) AND ((Status_p22_13 <= Organization_p20_7) OR (p1_1 <= p5_2) OR (PaymentNote_p21_16 <= 1))))) : E (F (((p6_4 <= ConsumerPayment_p3) AND (1 <= PaymentNote_p21_13) AND (p12_7 + 1 <= p6_7) AND ((1 <= ConsumerPayment_p3) OR (p10_0 <= 0))))) : E (F ((((2 <= p6_7) OR (2 <= p5_2)) AND (p2_2 <= p11_8) AND (Status_p22_11 <= Status_p20)))) : A (G ((((Organization_p21_2 <= 1) OR (Payment_p21_7 <= 2))))) : E (F ((DeliveryHandlerDelivery_p8_0 <= p12_7))) : A (G (TRUE)) : E (F ((2 <= Organization_p21_8))) : A (G (((Delivery_p22_8 + 1 <= p6_7) OR (PaymentNote_p21_13 <= 1) OR (p12_3 + 1 <= Order_p20_8)))) : A (G (((p3_6 <= 2) OR (Delivery_p22_4 + 1 <= MerchantOffer_p2) OR (Payment_p21_1 + 1 <= Status_p22_11) OR (Delivery_p22_1 + 1 <= Status_p21_11)))) : E (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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 IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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 IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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 IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Organization_p21_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 ((2 <= Organization_p21_8)))
lola: processed formula length: 33
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: (2 <= Organization_p21_8)
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: 45 markings, 44 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-12 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 ((2 <= Order_p22_6)))
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 ((2 <= Order_p22_6)))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: (2 <= Order_p22_6)
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: 69 markings, 68 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-5 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 (F (((2 <= MerchantDelivery_p4_6) AND (2 <= ConsumerPayment_p3))))
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 (((2 <= MerchantDelivery_p4_6) AND (2 <= ConsumerPayment_p3))))
lola: processed formula length: 68
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((2 <= MerchantDelivery_p4_6) AND (2 <= ConsumerPayment_p3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1418 markings, 1485 edges

lola: FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Organization_p21_2 <= 1) OR (Payment_p21_7 <= 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 ((((Organization_p21_2 <= 1) OR (Payment_p21_7 <= 2)))))
lola: processed formula length: 62
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: (((2 <= Organization_p21_2) AND (3 <= Payment_p21_7)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1779 markings, 1851 edges
lola:
FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DeliveryHandlerDelivery_p8_0 <= p12_7)))
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 ((DeliveryHandlerDelivery_p8_0 <= p12_7)))
lola: processed formula length: 47
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: (DeliveryHandlerDelivery_p8_0 <= p12_7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-7-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78 markings, 77 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p11_3) OR (p11_8 <= WhatDeliver_p12_1) OR (p8_1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p11_3) OR (p11_8 <= WhatDeliver_p12_1) OR (p8_1 <= 1))))
lola: processed formula length: 71
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((p11_3 <= 0) AND (WhatDeliver_p12_1 + 1 <= p11_8) AND (2 <= p8_1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-8-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 87 markings, 86 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-7-0.sara.
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Delivery_p22_8 + 1 <= p6_7) OR (PaymentNote_p21_13 <= 1) OR (p12_3 + 1 <= Order_p20_8))))
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 (((Delivery_p22_8 + 1 <= p6_7) OR (PaymentNote_p21_13 <= 1) OR (p12_3 + 1 <= Order_p20_8))))
lola: processed formula length: 99
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((p6_7 <= Delivery_p22_8) AND (2 <= PaymentNote_p21_13) AND (Order_p20_8 <= p12_3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-9-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: 50 markings, 49 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-13 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 (((p6_4 <= ConsumerPayment_p3) AND (1 <= PaymentNote_p21_13) AND (p12_7 + 1 <= p6_7) AND ((1 <= ConsumerPayment_p3) OR (p10_0 <= 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 (((p6_4 <= ConsumerPayment_p3) AND (1 <= PaymentNote_p21_13) AND (p12_7 + 1 <= p6_7) AND ((1 <= ConsumerPayment_p3) OR (p10_0 <= 0)))))
lola: processed formula length: 141
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((p6_4 <= ConsumerPayment_p3) AND (1 <= PaymentNote_p21_13) AND (p12_7 + 1 <= p6_7) AND ((1 <= ConsumerPayment_p3) OR (p10_0 <= 0)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-10-0.sara.

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

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p6_7) OR (2 <= p5_2)) AND (p2_2 <= p11_8) AND (Status_p22_11 <= Status_p20))))
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 ((((2 <= p6_7) OR (2 <= p5_2)) AND (p2_2 <= p11_8) AND (Status_p22_11 <= Status_p20))))
lola: processed formula length: 93
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: (((2 <= p6_7) OR (2 <= p5_2)) AND (p2_2 <= p11_8) AND (Status_p22_11 <= Status_p20))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-11-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3_6 <= 2) OR (Delivery_p22_4 + 1 <= MerchantOffer_p2) OR (Payment_p21_1 + 1 <= Status_p22_11) OR (Delivery_p22_1 + 1 <= Status_p21_11))))
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 (((p3_6 <= 2) OR (Delivery_p22_4 + 1 <= MerchantOffer_p2) OR (Payment_p21_1 + 1 <= Status_p22_11) OR (Delivery_p22_1 + 1 <= Status_p21_11))))
lola: processed formula length: 149
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((3 <= p3_6) AND (MerchantOffer_p2 <= Delivery_p22_4) AND (Status_p22_11 <= Payment_p21_1) AND (Status_p21_11 <= Delivery_p22_1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-12-0.sara
lola: The predicate is not invariant.
lola: 58 markings, 57 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Status_p21_14) AND (3 <= Organization_p22_9) AND (1 <= p11_8) AND ((Status_p22_13 <= Organization_p20_7) OR (p1_1 <= p5_2) OR (PaymentNote_p21_16 <= 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 (((3 <= Status_p21_14) AND (3 <= Organization_p22_9) AND (1 <= p11_8) AND ((Status_p22_13 <= Organization_p20_7) OR (p1_1 <= p5_2) OR (PaymentNote_p21_16 <= 1)))))
lola: processed formula length: 170
lola: 10 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((3 <= Status_p21_14) AND (3 <= Organization_p22_9) AND (1 <= p11_8) AND ((Status_p22_13 <= Organization_p20_7) OR (p1_1 <= p5_2) OR (PaymentNote_p21_16 <= 1)))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 228 markings, 230 edges

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Organization_p22_5 <= WhatDeliver_p12_1) OR (1 <= Organization_p21_2) OR (p11_13 <= Delivery_p20_10) OR (p12_3 <= PaymentNote_p21_16) OR ((p1_2 <= 2) AND (Status_p21_9 <= 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 (((Organization_p22_5 <= WhatDeliver_p12_1) OR (1 <= Organization_p21_2) OR (p11_13 <= Delivery_p20_10) OR (p12_3 <= PaymentNote_p21_16) OR ((p1_2 <= 2) AND (Status_p21_9 <= 0)))))
lola: processed formula length: 189
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((WhatDeliver_p12_1 + 1 <= Organization_p22_5) AND (Organization_p21_2 <= 0) AND (Delivery_p20_10 + 1 <= p11_13) AND (PaymentNote_p21_16 + 1 <= p12_3) AND ((3 <= p1_2) OR (1 <= Status_p21_9)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 236 markings, 238 edges
sara: place or transition ordering is non-deterministic
lola: ========================================

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-1 FALSE 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: A (G (((3 <= Organization_p21_2) OR (p6_6 <= p1_1) OR (1 <= Organization_p21_8) OR ((PaymentNote_p21_13 <= p12_4) AND (1 <= PaymentNote_p21_16) AND (p12_0 <= p3_9)))))
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 (((3 <= Organization_p21_2) OR (p6_6 <= p1_1) OR (1 <= Organization_p21_8) OR ((PaymentNote_p21_13 <= p12_4) AND (1 <= PaymentNote_p21_16) AND (p12_0 <= p3_9)))))
lola: processed formula length: 170
lola: 11 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality.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: ((Organization_p21_2 <= 2) AND (p1_1 + 1 <= p6_6) AND (Organization_p21_8 <= 0) AND ((p12_4 + 1 <= PaymentNote_p21_13) OR (PaymentNote_p21_16 <= 0) OR (p3_9 + 1 <= p12_0)))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola:
FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes no no yes yes yes yes yes no no no
lola:
preliminary result: no no yes no no yes no no yes yes yes yes yes no no no
========================================
lola: memory consumption: 25620 KB
lola: time consumption: 1 seconds

BK_STOP 1526793231159

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