About the Execution of LoLA for IOTPpurchase-PT-C03M03P03D03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
167.280 | 1189.00 | 1275.00 | 34.30 | FTTTTFFFTTFTFFTT | normal |
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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800207
=====================================================================
--------------------
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-CTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526793212262
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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ 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-CTLFireability.task
lola: A (X (A (F ((FIREABLE(PutPaidFor_t3_1) AND FIREABLE(GetOfferResponse_t1) AND NOT FIREABLE(GetWhatDeliver_t7_0)))))) : (((A (F (FIREABLE(GetWhatDeliver_t7_0))) OR A (F ((FIREABLE(GetDeliveryResponse_t6_5) OR FIREABLE(PutDeliveryResponse_t8_2))))) AND (E (F (FIREABLE(GetWhatDeliver_t7_0))) OR NOT(E (F (FIREABLE(CheckRequest_t2)))))) OR FIREABLE(t6_7)) : A (F (FIREABLE(CheckWhatDeliver_t7_1))) : (A (X ((E (F (FIREABLE(t6_7))) OR FIREABLE(BrandDecision_t4_1)))) OR (A (G ((FIREABLE(WhatDeliverDecision_t6_0) OR FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(TradeDecision_t3_0)))) OR (FIREABLE(CheckPaymentReseitp_t3_10) AND A ((FIREABLE(PutDeliveryResponse_t8_2) U FIREABLE(PutPaymentAmount_t4_5)))))) : E (G ((((FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(MakeChoice_t1) AND NOT FIREABLE(GetPaidFor_t4_0)) OR A (F (FIREABLE(PutOfferResponse_t2)))) OR A (F ((FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(PutWhatDeliver_t6_1))))))) : E (X (A (G ((NOT FIREABLE(CheckDeliveryInfo_t6_3) OR NOT FIREABLE(PaymentExchange_t3_8)))))) : A (F (((E (X (FIREABLE(PutPaidFor_t3_1))) AND (NOT FIREABLE(GetOfferRequest_t2) AND FIREABLE(CheckPaymentAmount_t3_6))) OR NOT(A (F (FIREABLE(CheckBrandSelection_t4_4))))))) : E (X ((FIREABLE(PutBrandSelection_t3_4) OR A (F ((FIREABLE(t7_4) AND FIREABLE(GetDeliveryRequest_t8_0))))))) : E (F (A (X (FIREABLE(WhatDeliverDecision_t6_0))))) : A ((NOT(A (F (FIREABLE(MakeChoice_t1)))) U ((NOT FIREABLE(GetOfferRequest_t2) AND NOT FIREABLE(GetWhatDeliver_t7_0)) AND A (F (FIREABLE(CheckPaymentReseitp_t3_10)))))) : A (F (E (G (FIREABLE(PutBrandSelection_t3_4))))) : E (F ((FIREABLE(GetDeliveryResponse_t6_5) AND NOT(E (X (FIREABLE(t8_4))))))) : (E (F (E (G ((FIREABLE(PutBrandList_t4_2) AND FIREABLE(GetPaymentAmount_t3_5)))))) OR ((FIREABLE(GetHowDeliver_t6_2) AND (A (F (FIREABLE(WhatDeliverDecision_t6_0))) OR (FIREABLE(PutOfferResponse_t2) OR FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(CheckBrandSelection_t4_4)))) AND E (X (FIREABLE(TradeDecision_t3_0))))) : A (G (NOT(A (F (FIREABLE(GetDeliveryResponse_t6_5)))))) : (A (F (E (X ((FIREABLE(t7_4) OR FIREABLE(PutDeliveryResponse_t8_2)))))) OR A (((FIREABLE(PaymentExchange_t3_8) AND NOT FIREABLE(PutWhatDeliver_t6_1)) U A (X (FIREABLE(GetPaymentRequest_t5_0)))))) : A (((NOT FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(BrandDecision_t4_1)) U FIREABLE(GetPaymentAmount_t3_5)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(PutPaidFor_t3_1) AND FIREABLE(GetOfferResponse_t1) AND NOT FIREABLE(GetWhatDeliver_t7_0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(PutPaidFor_t3_1) OR NOT FIREABLE(GetOfferResponse_t1) OR FIREABLE(GetWhatDeliver_t7_0))
lola: processed formula length: 103
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 53 markings, 53 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-0 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: (A (X ((E (F (FIREABLE(t6_7))) OR FIREABLE(BrandDecision_t4_1)))) OR (A (G ((FIREABLE(WhatDeliverDecision_t6_0) OR FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(TradeDecision_t3_0)))) OR (FIREABLE(CheckPaymentReseitp_t3_10) AND A ((FIREABLE(PutDeliveryResponse_t8_2) U FIREABLE(PutPaymentAmount_t4_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(CheckPaymentReseitp_t3_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(CheckPaymentReseitp_t3_10)
lola: processed formula length: 35
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(WhatDeliverDecision_t6_0) OR FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(TradeDecision_t3_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(WhatDeliverDecision_t6_0) OR FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(TradeDecision_t3_0))))
lola: processed formula length: 120
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(WhatDeliverDecision_t6_0) AND NOT FIREABLE(CheckBrandSelection_t4_4) AND FIREABLE(TradeDecision_t3_0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C03M03P03D03-CTLFireability-2-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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F (FIREABLE(t6_7))) OR FIREABLE(BrandDecision_t4_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((E(TRUE U FIREABLE(t6_7)) OR FIREABLE(BrandDecision_t4_1)))
lola: processed formula length: 62
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 115 markings, 114 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-3 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: E (X (A (G ((NOT FIREABLE(CheckDeliveryInfo_t6_3) OR NOT FIREABLE(PaymentExchange_t3_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (FIREABLE(CheckDeliveryInfo_t6_3) AND FIREABLE(PaymentExchange_t3_8)))))
lola: processed formula length: 88
lola: 22 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 64 markings, 63 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-5 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: A (F (((E (X (FIREABLE(PutPaidFor_t3_1))) AND (NOT FIREABLE(GetOfferRequest_t2) AND FIREABLE(CheckPaymentAmount_t3_6))) OR E (G (NOT FIREABLE(CheckBrandSelection_t4_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U ((EX(FIREABLE(PutPaidFor_t3_1)) AND (NOT FIREABLE(GetOfferRequest_t2) AND FIREABLE(CheckPaymentAmount_t3_6))) OR NOT(A(TRUE U FIREABLE(CheckBrandSelection_t4_4)))))
lola: processed formula length: 173
lola: 23 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 80755 markings, 301142 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (FIREABLE(PutBrandSelection_t3_4))) OR E (X (A (F ((FIREABLE(t7_4) AND FIREABLE(GetDeliveryRequest_t8_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(PutBrandSelection_t3_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(PutBrandSelection_t3_4))
lola: processed formula length: 36
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((FIREABLE(t7_4) AND FIREABLE(GetDeliveryRequest_t8_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (FIREABLE(t7_4) AND FIREABLE(GetDeliveryRequest_t8_0))))
lola: processed formula length: 68
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 151 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-7 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: E (F (A (X (FIREABLE(WhatDeliverDecision_t6_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(FIREABLE(WhatDeliverDecision_t6_0)))
lola: processed formula length: 48
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5452 markings, 9134 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-8 TRUE 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(GetDeliveryResponse_t6_5) AND A (X (NOT FIREABLE(t8_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (FIREABLE(GetDeliveryResponse_t6_5) AND AX(NOT FIREABLE(t8_4))))
lola: processed formula length: 73
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10050 markings, 17698 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-11 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 (E (G ((FIREABLE(PutBrandList_t4_2) AND FIREABLE(GetPaymentAmount_t3_5)))))) OR (FIREABLE(GetHowDeliver_t6_2) AND ((A (F (FIREABLE(WhatDeliverDecision_t6_0))) OR (FIREABLE(PutOfferResponse_t2) OR FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(CheckBrandSelection_t4_4))) AND E (X (FIREABLE(TradeDecision_t3_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(PutOfferResponse_t2) OR FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(CheckBrandSelection_t4_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(PutOfferResponse_t2) OR FIREABLE(SelectBrand_t3_3) OR NOT FIREABLE(CheckBrandSelection_t4_4))
lola: processed formula length: 105
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetHowDeliver_t6_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetHowDeliver_t6_2)
lola: processed formula length: 28
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((FIREABLE(PutBrandList_t4_2) AND FIREABLE(GetPaymentAmount_t3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (FIREABLE(PutBrandList_t4_2) AND FIREABLE(GetPaymentAmount_t3_5))
lola: processed formula length: 65
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 2788 markings, 2929 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-12 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 (F (E (X ((FIREABLE(t7_4) OR FIREABLE(PutDeliveryResponse_t8_2)))))) OR A (((FIREABLE(PaymentExchange_t3_8) AND NOT FIREABLE(PutWhatDeliver_t6_1)) U A (X (FIREABLE(GetPaymentRequest_t5_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: (A(TRUE U EX((FIREABLE(t7_4) OR FIREABLE(PutDeliveryResponse_t8_2)))) OR A((FIREABLE(PaymentExchange_t3_8) AND NOT FIREABLE(PutWhatDeliver_t6_1)) U AX(FIREABLE(GetPaymentRequest_t5_0))))
lola: processed formula length: 187
lola: 23 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11166 markings, 32142 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-14 TRUE 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 (NOT FIREABLE(GetDeliveryResponse_t6_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (NOT FIREABLE(GetDeliveryResponse_t6_5)))
lola: processed formula length: 46
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: FIREABLE(GetDeliveryResponse_t6_5)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-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: A (F (FIREABLE(CheckWhatDeliver_t7_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(CheckWhatDeliver_t7_1)
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 92 markings, 91 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-2 TRUE 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: A (F (E (G (FIREABLE(PutBrandSelection_t3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(PutBrandSelection_t3_4))))
lola: processed formula length: 61
lola: 22 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2486 markings, 4553 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (NOT FIREABLE(MakeChoice_t1))) U ((NOT FIREABLE(GetOfferRequest_t2) AND NOT FIREABLE(GetWhatDeliver_t7_0)) AND A (F (FIREABLE(CheckPaymentReseitp_t3_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(NOT(A(TRUE U FIREABLE(MakeChoice_t1))) U ((NOT FIREABLE(GetOfferRequest_t2) AND NOT FIREABLE(GetWhatDeliver_t7_0)) AND A(TRUE U FIREABLE(CheckPaymentReseitp_t3_10))))
lola: processed formula length: 168
lola: 23 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4787 markings, 10587 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-9 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: E (G (((FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(MakeChoice_t1) AND NOT FIREABLE(GetPaidFor_t4_0)) OR (A (F (FIREABLE(PutOfferResponse_t2))) OR A (F ((FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(PutWhatDeliver_t6_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(PutBrandSelection_t3_4) OR NOT FIREABLE(MakeChoice_t1) OR FIREABLE(GetPaidFor_t4_0)) AND (NOT(A(TRUE U FIREABLE(PutOfferResponse_t2))) AND NOT(A(TRUE U (FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(PutWhatDeliver_t6_1))))))))
lola: processed formula length: 258
lola: 25 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 75467 markings, 278095 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-4 TRUE 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: A (((NOT FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(BrandDecision_t4_1)) U FIREABLE(GetPaymentAmount_t3_5)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((NOT FIREABLE(GetPaymentAmount_t3_5) OR FIREABLE(PutDeliveryResponse_t8_2) OR FIREABLE(BrandDecision_t4_1)) U FIREABLE(GetPaymentAmount_t3_5)))
lola: processed formula length: 149
lola: 23 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 74 markings, 76 edges
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-15 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: (((A (F (FIREABLE(GetWhatDeliver_t7_0))) OR A (F ((FIREABLE(GetDeliveryResponse_t6_5) OR FIREABLE(PutDeliveryResponse_t8_2))))) AND (E (F (FIREABLE(GetWhatDeliver_t7_0))) OR A (G (NOT FIREABLE(CheckRequest_t2))))) OR FIREABLE(t6_7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(GetWhatDeliver_t7_0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(GetWhatDeliver_t7_0)
lola: processed formula length: 33
lola: 21 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 91 markings, 90 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t6_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t6_7)
lola: processed formula length: 14
lola: 19 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GetWhatDeliver_t7_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(GetWhatDeliver_t7_0)))
lola: processed formula length: 37
lola: 20 rewrites
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no no yes yes no yes no no yes yes
lola:
preliminary result: no yes yes yes yes no no no yes yes no yes no no yes yes
lola: memory consumption: 14808 KB
lola: time consumption: 1 seconds
BK_STOP 1526793213451
--------------------
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="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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 CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-152658630800207"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;