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 irma4mcc-structural
Input is IOTPpurchase-PT-C01M01P01D01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633700200
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526733963224


BK_STOP 1526734010084

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using IOTPpurchase-PT-C01M01P01D01 as instance name.
Using IOTPpurchase as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 137, 'Memory': 110.22, 'Tool': 'lola'}, {'Time': 192, 'Memory': 100, 'Tool': 'gspn'}, {'Time': 275, 'Memory': 111.46, 'Tool': 'lola'}, {'Time': 1821, 'Memory': 166.76, 'Tool': 'gspn'}, {'Time': 1848, 'Memory': 2046.86, 'Tool': 'marcie'}, {'Time': 1853, 'Memory': 1834.36, 'Tool': 'marcie'}, {'Time': 2289, 'Memory': 250.53, 'Tool': 'itstools'}, {'Time': 2545, 'Memory': 241.13, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola IOTPpurchase-PT-C01M01P01D01...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
IOTPpurchase-PT-C01M01P01D01: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
IOTPpurchase-PT-C01M01P01D01: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ IOTPpurchase-PT-C01M01P01D01 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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: 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-CTLFireability.task
lola: ((E (F (FIREABLE(t5_4))) OR FIREABLE(GetDeliveryResponse_t6_5)) OR (A (F ((FIREABLE(PaymentResponse_t3_9) AND NOT FIREABLE(t8_4)))) OR E (X ((NOT FIREABLE(PaymentExchange_t3_8) AND (FIREABLE(TradeDecision_t3_0) OR FIREABLE(CheckDeliveryInfo_t6_3))))))) : NOT(NOT(((FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(BrandDecision_t4_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(GetBrandSelection_t4_3)) AND A ((FIREABLE(GetPaidFor_t4_0) U FIREABLE(CheckDeliveryRequest_t8_1)))))) : NOT(((E (X ((FIREABLE(SelectBrand_t3_3) OR FIREABLE(GetDeliveryRequest_t8_0)))) AND E (G ((FIREABLE(PutOfferRequest_t1) OR FIREABLE(CheckPaymentReseitp_t3_10))))) OR ((FIREABLE(PutBrandList_t4_2) OR FIREABLE(CheckPaymentReseitp_t3_10)) AND NOT FIREABLE(PaymentExchange_t5_2) AND ((FIREABLE(PutPaidFor_t3_1) AND FIREABLE(GetPaymentRequest_t5_0)) OR (FIREABLE(CheckPaymentRequest_t5_1) AND FIREABLE(GetOfferRequest_t2))) AND (FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(GetDeliveryResponse_t6_5) OR NOT FIREABLE(PutPaymentRequest_t3_7) OR NOT FIREABLE(PaymentResponse_t3_9) OR NOT FIREABLE(PutOfferResponse_t2))))) : ((NOT FIREABLE(PaymentExchange_t5_2) AND A (((FIREABLE(t5_4) AND FIREABLE(CheckRequest_t2)) U (FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(CheckWhatDeliver_t7_1))))) AND FIREABLE(MakeChoice_t1)) : (FIREABLE(CheckRequest_t2) AND (FIREABLE(PutDeliveryRequest_t6_4) OR A (X (FIREABLE(MakeChoice_t1))))) : E ((E (X (FIREABLE(CheckPaymentRequest_t5_1))) U ((FIREABLE(GetDeliveryResponse_t6_5) AND FIREABLE(GetWhatDeliver_t7_0)) OR (FIREABLE(GetPaymentAmount_t3_5) AND FIREABLE(SelectBrand_t3_3)) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(GetDeliveryResponse_t6_5) OR NOT FIREABLE(PutBrandList_t4_2)))) : E (G ((FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(t6_7) AND FIREABLE(TradeDecision_t3_0) AND FIREABLE(PutPaymentAmount_t4_5)))) : NOT(A (G ((NOT FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(GetBrandSelection_t4_3) AND FIREABLE(PaymentResponse_t3_9))))) : NOT(((E (X (NOT FIREABLE(PutPaymentRequest_t3_7))) AND ((FIREABLE(SelectBrand_t3_3) OR FIREABLE(t5_4)) AND FIREABLE(GetBrandList_t3_2))) OR (NOT FIREABLE(PutDeliveryRequest_t6_4) OR NOT FIREABLE(PutPaymentRequest_t3_7)))) : NOT FIREABLE(t8_4) : NOT(((A (X (NOT FIREABLE(CheckPaymentAmount_t3_6))) OR E (X ((FIREABLE(PutHowDeliver_t7_2) AND FIREABLE(GetPaymentAmount_t3_5))))) OR E (X (NOT FIREABLE(PutDeliveryResponse_t8_2))))) : NOT((E (F (FIREABLE(GetHowDeliver_t6_2))) AND (A ((FIREABLE(MakeChoice_t1) U FIREABLE(CheckRequest_t2))) AND A ((FIREABLE(GetOfferRequest_t2) U FIREABLE(PutOfferRequest_t1)))))) : E (F (E (G (FIREABLE(CheckDeliveryRequest_t8_1))))) : NOT(E (X ((E (G (FIREABLE(GetWhatDeliver_t7_0))) OR E (X (FIREABLE(PutOfferResponse_t2))))))) : A ((A (F (NOT FIREABLE(PutHowDeliver_t7_2))) U A (G (NOT FIREABLE(PaymentExchange_t5_2))))) : NOT((E (F ((NOT FIREABLE(t8_4) AND NOT FIREABLE(PaymentResponse_t3_9)))) AND (NOT FIREABLE(t6_7) AND NOT FIREABLE(GetPaymentRequest_t5_0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (FIREABLE(t5_4))) OR FIREABLE(GetDeliveryResponse_t6_5)) OR (A (F ((FIREABLE(PaymentResponse_t3_9) AND NOT FIREABLE(t8_4)))) OR E (X ((NOT FIREABLE(PaymentExchange_t3_8) AND (FIREABLE(TradeDecision_t3_0) OR FIREABLE(CheckDeliveryInfo_t6_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5_4)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(BrandDecision_t4_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(GetBrandSelection_t4_3)) AND A ((FIREABLE(GetPaidFor_t4_0) U FIREABLE(CheckDeliveryRequest_t8_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(BrandDecision_t4_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(GetBrandSelection_t4_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(PutBrandSelection_t3_4) AND FIREABLE(BrandDecision_t4_1) AND NOT FIREABLE(CheckWhatDeliver_t7_1) AND FIREABLE(GetBrandSelection_t4_3))
lola: processed formula length: 144
lola: 12 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (X ((FIREABLE(SelectBrand_t3_3) OR FIREABLE(GetDeliveryRequest_t8_0)))) AND E (G ((FIREABLE(PutOfferRequest_t1) OR FIREABLE(CheckPaymentReseitp_t3_10))))) OR ((FIREABLE(PutBrandList_t4_2) OR FIREABLE(CheckPaymentReseitp_t3_10)) AND NOT FIREABLE(PaymentExchange_t5_2) AND ((FIREABLE(PutPaidFor_t3_1) AND FIREABLE(GetPaymentRequest_t5_0)) OR (FIREABLE(CheckPaymentRequest_t5_1) AND FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(SelectBrand_t3_3) AND NOT FIREABLE(GetDeliveryRequest_t8_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(SelectBrand_t3_3) AND NOT FIREABLE(GetDeliveryRequest_t8_0))))
lola: processed formula: A (X ((NOT FIREABLE(SelectBrand_t3_3) AND NOT FIREABLE(GetDeliveryRequest_t8_0))))
lola: processed formula length: 82
lola: 9 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(PutBrandList_t4_2) AND NOT FIREABLE(CheckPaymentReseitp_t3_10)) OR FIREABLE(PaymentExchange_t5_2) OR ((NOT FIREABLE(PutPaidFor_t3_1) OR NOT FIREABLE(GetPaymentRequest_t5_0)) AND (NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(GetOfferRequest_t2))) OR (NOT FIREABLE(CheckPaymentAmount_t3_6) AND NOT FIREABLE(GetDeliveryResponse_t6_5) AND FIREABLE(PutPaymentRequest_t3_7) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(PutBrandList_t4_2) AND NOT FIREABLE(CheckPaymentReseitp_t3_10)) OR FIREABLE(PaymentExchange_t5_2) OR ((NOT FIREABLE(PutPaidFor_t3_1) OR NOT FIREABLE(GetPaymentRequest_t5_0)) AND (NOT FIREABLE(CheckPaymentRequest_t5_1) OR NOT FIREABLE(GetOfferRequest_t2))) OR (NOT FIREABLE(CheckPaymentAmount_t3_6) AND NOT FIREABLE(GetDeliveryResponse_t6_5) AND FIREABLE(PutPaymentRequest_t3_7) AN... (shortened)
lola: processed formula length: 468
lola: 9 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(PaymentExchange_t5_2) AND A (((FIREABLE(t5_4) AND FIREABLE(CheckRequest_t2)) U (FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(CheckWhatDeliver_t7_1))))) AND FIREABLE(MakeChoice_t1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(PaymentExchange_t5_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(PaymentExchange_t5_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t5_4) AND FIREABLE(CheckRequest_t2)) U (FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(CheckWhatDeliver_t7_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(t5_4) AND FIREABLE(CheckRequest_t2)) U (FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(CheckWhatDeliver_t7_1))))
lola: processed formula: A (((FIREABLE(t5_4) AND FIREABLE(CheckRequest_t2)) U (FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(CheckWhatDeliver_t7_1))))
lola: processed formula length: 125
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(CheckRequest_t2) AND (FIREABLE(PutDeliveryRequest_t6_4) OR A (X (FIREABLE(MakeChoice_t1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(CheckRequest_t2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(CheckRequest_t2)
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X (FIREABLE(CheckPaymentRequest_t5_1))) U ((FIREABLE(GetDeliveryResponse_t6_5) AND FIREABLE(GetWhatDeliver_t7_0)) OR (FIREABLE(GetPaymentAmount_t3_5) AND FIREABLE(SelectBrand_t3_3)) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(GetDeliveryResponse_t6_5) OR NOT FIREABLE(PutBrandList_t4_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(FIREABLE(CheckPaymentRequest_t5_1)) U ((FIREABLE(GetDeliveryResponse_t6_5) AND FIREABLE(GetWhatDeliver_t7_0)) OR (FIREABLE(GetPaymentAmount_t3_5) AND FIREABLE(SelectBrand_t3_3)) OR FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(GetDeliveryResponse_t6_5) OR NOT FIREABLE(PutBrandList_t4_2)))
lola: processed formula length: 293
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(PutPaymentAmount_t4_5) AND FIREABLE(t6_7) AND FIREABLE(TradeDecision_t3_0) AND FIREABLE(PutPaymentAmount_t4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(PutPaymentAmount_t4_5) OR NOT FIREABLE(t6_7) OR NOT FIREABLE(TradeDecision_t3_0) OR NOT FIREABLE(PutPaymentAmount_t4_5))))
lola: processed formula length: 152
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((NOT FIREABLE(GetPaymentRequest_t5_0) AND NOT FIREABLE(GetBrandSelection_t4_3) AND FIREABLE(PaymentResponse_t3_9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (X (NOT FIREABLE(PutPaymentRequest_t3_7))) AND ((FIREABLE(SelectBrand_t3_3) OR FIREABLE(t5_4)) AND FIREABLE(GetBrandList_t3_2))) OR (NOT FIREABLE(PutDeliveryRequest_t6_4) OR NOT FIREABLE(PutPaymentRequest_t3_7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(PutPaymentRequest_t3_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(PutPaymentRequest_t3_7)))
lola: processed formula: A (X (FIREABLE(PutPaymentRequest_t3_7)))
lola: processed formula length: 40
lola: 7 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 47 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(SelectBrand_t3_3) AND NOT FIREABLE(t5_4)) OR NOT FIREABLE(GetBrandList_t3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(SelectBrand_t3_3) AND NOT FIREABLE(t5_4)) OR NOT FIREABLE(GetBrandList_t3_2))
lola: processed formula length: 93
lola: 7 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(PutDeliveryRequest_t6_4) AND FIREABLE(PutPaymentRequest_t3_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(PutDeliveryRequest_t6_4) AND FIREABLE(PutPaymentRequest_t3_7))
lola: processed formula length: 72
lola: 7 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t8_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t8_4)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (X (NOT FIREABLE(CheckPaymentAmount_t3_6))) OR E (X ((FIREABLE(PutHowDeliver_t7_2) AND FIREABLE(GetPaymentAmount_t3_5))))) OR E (X (NOT FIREABLE(PutDeliveryResponse_t8_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(CheckPaymentAmount_t3_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(CheckPaymentAmount_t3_6))
lola: processed formula length: 37
lola: 13 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (FIREABLE(GetHowDeliver_t6_2))) AND (A ((FIREABLE(MakeChoice_t1) U FIREABLE(CheckRequest_t2))) AND A ((FIREABLE(GetOfferRequest_t2) U FIREABLE(PutOfferRequest_t1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(GetHowDeliver_t6_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 34 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(MakeChoice_t1) R NOT FIREABLE(CheckRequest_t2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(MakeChoice_t1) U FIREABLE(CheckRequest_t2)))
lola: processed formula length: 59
lola: 16 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(CheckDeliveryRequest_t8_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(CheckDeliveryRequest_t8_1))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 45 markings, 91 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X ((E (G (FIREABLE(GetWhatDeliver_t7_0))) OR E (X (FIREABLE(PutOfferResponse_t2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (NOT FIREABLE(GetWhatDeliver_t7_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U NOT FIREABLE(GetWhatDeliver_t7_0)))
lola: processed formula length: 47
lola: 14 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (NOT FIREABLE(PutOfferResponse_t2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(AX(NOT FIREABLE(PutOfferResponse_t2)))
lola: processed formula length: 41
lola: 14 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F (NOT FIREABLE(PutHowDeliver_t7_2))) U A (G (NOT FIREABLE(PaymentExchange_t5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U NOT FIREABLE(PutHowDeliver_t7_2)) U NOT(E(TRUE U FIREABLE(PaymentExchange_t5_2))))
lola: processed formula length: 93
lola: 4 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 180 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((NOT FIREABLE(t8_4) AND NOT FIREABLE(PaymentResponse_t3_9)))) AND (NOT FIREABLE(t6_7) AND NOT FIREABLE(GetPaymentRequest_t5_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t8_4) OR FIREABLE(PaymentResponse_t3_9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes no yes no yes no yes no yes no unknown
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="CTLFireability"
export BK_TOOL="irma4mcc-structural"
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 irma4mcc-structural"
echo " Input is IOTPpurchase-PT-C01M01P01D01, 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 r103-smll-152658633700200"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;