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 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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 21K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 4.0K 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-C01M01P01D01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800201
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526789546041

info: Time: 3600 - MCC
===========================================================================================
prep: translating IOTPpurchase-PT-C01M01P01D01 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IOTPpurchase-PT-C01M01P01D01 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ IOTPpurchase-PT-C01M01P01D01 @ 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-C01M01P01D01-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p8_2)
lola: LP says that atomic proposition is always false: (2 <= p5_1)
lola: LP says that atomic proposition is always false: (3 <= PaymentHandlerPayment_p5_0)
lola: LP says that atomic proposition is always true: (Status_p21_14 <= p12_4)
lola: LP says that atomic proposition is always true: (ConsumerPayment_p3 <= p11_8)
lola: LP says that atomic proposition is always false: (2 <= p3_7)
lola: LP says that atomic proposition is always false: (3 <= HowDeliver_p12_2)
lola: LP says that atomic proposition is always false: (2 <= Organization_p21_8)
lola: LP says that atomic proposition is always false: (2 <= p4_5)
lola: LP says that atomic proposition is always false: (3 <= PaySchemeData_p11_10)
lola: LP says that atomic proposition is always false: (2 <= Status_p21_5)
lola: LP says that atomic proposition is always false: (3 <= p12_7)
lola: LP says that atomic proposition is always false: (2 <= Order_p20)
lola: LP says that atomic proposition is always false: (3 <= Organization_p21_4)
lola: LP says that atomic proposition is always false: (3 <= p11_3)
lola: LP says that atomic proposition is always false: (2 <= p7_1)
lola: LP says that atomic proposition is always false: (3 <= HowDeliver_p12_2)
lola: LP says that atomic proposition is always false: (3 <= Order_p22_3)
lola: place invariant simplifies atomic proposition
lola: before: (Payment_p21_7 <= p5_1)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p5_2)
lola: LP says that atomic proposition is always false: (2 <= Organization_p21_2)
lola: LP says that atomic proposition is always false: (3 <= p12_4)
lola: LP says that atomic proposition is always false: (3 <= PaymentHandlerPayment_p5_0)
lola: LP says that atomic proposition is always false: (2 <= MerchantDelivery_p4_6)
lola: LP says that atomic proposition is always false: (3 <= p3_8)
lola: LP says that atomic proposition is always false: (2 <= OfferRequest_p10)
lola: E (F (((Organization_p21_8 + 1 <= p3_4) AND (BrandList_p11_2 <= 0) AND ((Order_p22_3 <= PaymentNote_p21_13) OR (Payment_p21_7 <= Status_p22_13))))) : A (G (((WhatDeliver_p12_1 + 1 <= p3_3)))) : A (G (((PaymentNote_p21_13 <= Payment_p21_3)))) : A (G ((((p5_4 <= 0) AND (p4_1 + 1 <= MerchantPayment_p4_0)) OR ((Organization_p22_9 <= 0))))) : E (F (((1 <= PaySchemeData_p21_10) AND (1 <= WhatDeliver_p12_1) AND (Delivery_p22_4 + 1 <= p8_1) AND ((p8_2 + 1 <= p5_4))))) : A (G (((PaymentHandlerPayment_p5_0 <= PaymentAmount_p11_6)))) : E (F (((p4_5 <= p8_1)))) : E (F (())) : A (G (FALSE)) : E (F ((((Payment_p20 <= p3_8) OR (Order_p22_3 <= DeliveryResponse_p12_6)) AND (HowDeliver_p12_2 <= p6_5)))) : E (F ((p6_2 + 1 <= ConsumerOffer_p1))) : A (G ((((1 <= p12_7))))) : A (G (())) : E (F ((p6_1 <= p6_3))) : E (F (())) : E (F (((p12_3 <= 0) AND ((PaymentResponse_p11_12 <= p4_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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-C01M01P01D01-ReachabilityCardinality-7 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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-C01M01P01D01-ReachabilityCardinality-8 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 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: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p12_7)))))
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 <= p12_7)))))
lola: processed formula length: 24
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((PaymentNote_p21_13 <= Payment_p21_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 (((PaymentNote_p21_13 <= Payment_p21_3))))
lola: processed formula length: 47
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((Payment_p21_3 + 1 <= PaymentNote_p21_13))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p6_2 + 1 <= ConsumerOffer_p1)))
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_2 + 1 <= ConsumerOffer_p1)))
lola: processed formula length: 38
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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_2 + 1 <= ConsumerOffer_p1)
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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((PaymentHandlerPayment_p5_0 <= PaymentAmount_p11_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 (((PaymentHandlerPayment_p5_0 <= PaymentAmount_p11_6))))
lola: processed formula length: 61
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((PaymentAmount_p11_6 + 1 <= PaymentHandlerPayment_p5_0))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-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 IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-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 (F (((p4_5 <= p8_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 (((p4_5 <= p8_1))))
lola: processed formula length: 24
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((p4_5 <= p8_1))
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: 0 markings, 0 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-6 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 (F ((p6_1 <= p6_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 ((p6_1 <= p6_3)))
lola: processed formula length: 22
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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_1 <= p6_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-C01M01P01D01-ReachabilityCardinality-9-0.sara
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((WhatDeliver_p12_1 + 1 <= p3_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 (((WhatDeliver_p12_1 + 1 <= p3_3))))
lola: processed formula length: 41
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((p3_3 <= WhatDeliver_p12_1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10-0.sara

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
sara: try reading problem file IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9-0.sara.
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12_3 <= 0) AND ((PaymentResponse_p11_12 <= p4_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 (((p12_3 <= 0) AND ((PaymentResponse_p11_12 <= p4_1)))))
lola: processed formula length: 61
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((p12_3 <= 0) AND ((PaymentResponse_p11_12 <= p4_1)))
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: 34 markings, 33 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15 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 ((((p5_4 <= 0) AND (p4_1 + 1 <= MerchantPayment_p4_0)) OR ((Organization_p22_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 ((((p5_4 <= 0) AND (p4_1 + 1 <= MerchantPayment_p4_0)) OR ((Organization_p22_9 <= 0)))))
lola: sara: place or transition ordering is non-deterministic
processed formula length: 94
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: (((1 <= p5_4) OR (MerchantPayment_p4_0 <= p4_1)) AND ((1 <= Organization_p22_9)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space

lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12-0.sara
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= PaySchemeData_p21_10) AND (1 <= WhatDeliver_p12_1) AND (Delivery_p22_4 + 1 <= p8_1) AND ((p8_2 + 1 <= p5_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 (((1 <= PaySchemeData_p21_10) AND (1 <= WhatDeliver_p12_1) AND (Delivery_p22_4 + 1 <= p8_1) AND ((p8_2 + 1 <= p5_4)))))
lola: processed formula length: 124
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: ((1 <= PaySchemeData_p21_10) AND (1 <= WhatDeliver_p12_1) AND (Delivery_p22_4 + 1 <= p8_1) AND ((p8_2 + 1 <= p5_4)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 107 markings, 141 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Payment_p20 <= p3_8) OR (Order_p22_3 <= DeliveryResponse_p12_6)) AND (HowDeliver_p12_2 <= p6_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 ((((Payment_p20 <= p3_8) OR (Order_p22_3 <= DeliveryResponse_p12_6)) AND (HowDeliver_p12_2 <= p6_5))))
lola: processed formula length: 108
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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: (((Payment_p20 <= p3_8) OR (Order_p22_3 <= DeliveryResponse_p12_6)) AND (HowDeliver_p12_2 <= p6_5))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14-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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Organization_p21_8 + 1 <= p3_4) AND (BrandList_p11_2 <= 0) AND ((Order_p22_3 <= PaymentNote_p21_13) OR (Payment_p21_7 <= Status_p22_13)))))
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 (((Organization_p21_8 + 1 <= p3_4) AND (BrandList_p11_2 <= 0) AND ((Order_p22_3 <= PaymentNote_p21_13) OR (Payment_p21_7 <= Status_p22_13)))))
lola: processed formula length: 148
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-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)
sara: try reading problem file IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14-0.sara.
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: ((Organization_p21_8 + 1 <= p3_4) AND (BrandList_p11_2 <= 0) AND ((Order_p22_3 <= PaymentNote_p21_13) OR (Payment_p21_7 <= Status_p22_13)))
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: 15 markings, 14 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15-0.sara
lola: ========================================

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no yes no no yes yes no yes yes yes yes
lola:
preliminary result: yes no no no no no yes no no yes yes no yes yes yes yes
sara: place or transition ordering is non-deterministic

lola: memory consumption: 24952 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-C01M01P01D01"
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-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 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-C01M01P01D01, 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-152658630800201"
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 ;