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 316K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SafeBus-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r155-smll-152685553100227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527015598404


BK_STOP 1527015643176

--------------------
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 SafeBus-PT-03 as instance name.
Using SafeBus as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, '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': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 301, 'Memory': 111.26, 'Tool': 'lola'}, {'Time': 464, 'Memory': 110.73, 'Tool': 'lola'}, {'Time': 1315, 'Memory': 140.25, 'Tool': 'gspn'}, {'Time': 2745, 'Memory': 163.45, 'Tool': 'gspn'}, {'Time': 3038, 'Memory': 243.05, 'Tool': 'itstools'}, {'Time': 3122, 'Memory': 2206.45, 'Tool': 'marcie'}, {'Time': 3284, 'Memory': 255.86, 'Tool': 'itstools'}, {'Time': 3503, 'Memory': 2206.59, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SafeBus-PT-03...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
SafeBus-PT-03: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SafeBus-PT-03 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-03-CTLCardinality.task
lola: (NOT((((S_tout <= 0) AND (T_out <= 1)) AND A (F ((1 <= RMC_1 + RMC_2 + RMC_3))))) AND ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))) : NOT(((PMC_3 + PMC_2 + PMC_1 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2) OR (A (G (TRUE)) AND ((PMC_3 + PMC_2 + PMC_1 + 1 <= FMCb))))) : E (X (A (F ((R_tout <= 0))))) : ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR A (F (A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))))) : ((NOT(A (F ((1 <= loop_em_1 + loop_em_2 + loop_em_3)))) AND E (G ((ACK <= 2)))) AND (E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3))) AND (((FMC_1 + FMC_2 + FMC_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= FMC_1 + FMC_2 + FMC_3) OR (listen_3 + listen_2 + listen_1 <= loop_em_1 + loop_em_2 + loop_em_3)) OR E (X ((cable_free <= T_out)))))) : A (F (NOT(A (F ((MSG_1 + MSG_2 + MSG_3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3)))))) : ((A (F ((FMC_1 + FMC_2 + FMC_3 <= 2))) AND A (F (((2 <= ACK) AND (ACK <= wait_cable_1 + wait_cable_2 + wait_cable_3))))) AND (A (((2 <= FMC_1 + FMC_2 + FMC_3) U (PMC_3 + PMC_2 + PMC_1 <= cable_used_1 + cable_used_2 + cable_used_3))) OR A (G (((2 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (ACK <= FMCb)))))) : (E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0)))) AND (((cable_free <= msgl_1 + msgl_2 + msgl_3) OR ((R_tout <= 0) AND (listen_3 + listen_2 + listen_1 <= 0))) OR A (F ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= 2))))) : (A (X (E (G ((1 <= T_out))))) OR A (F (((PMC_3 <= FMC_2) AND (3 <= wait_cable_2) AND (AMC_2_3 <= 1))))) : A (F (A (G ((ACK <= listen_3))))) : ((E (((RMC_3 <= RMC_2) U (3 <= listen_2))) OR ((1 <= loop_em_1) OR (3 <= wait_msg_2))) AND (1 <= FMCb)) : A (F (A (((1 <= cable_used_3) U (3 <= AMC_2_2))))) : A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3) AND (wait_msg_2 <= 2)))) : E (G (E (G ((cable_used_2 <= 1))))) : E (F ((3 <= FMC_2))) : (A (F (((msgl_3 + 1 <= ACK) AND (listen_2 + 1 <= loop_em_1)))) AND (E (((wait_msg_1 <= RMC_2) U (2 <= cable_used_2))) AND (AMC_3_1 <= Cpt2_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((S_tout <= 0) AND (T_out <= 1)) AND A (F ((1 <= RMC_1 + RMC_2 + RMC_3))))) AND ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free)))
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: ((1 <= S_tout) OR (2 <= T_out))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= S_tout) OR (2 <= T_out))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((RMC_1 + RMC_2 + RMC_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= RMC_1 + RMC_2 + RMC_3)))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 65 markings, 74 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: processed formula length: 126
lola: 5 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((PMC_3 + PMC_2 + PMC_1 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2) OR (A (G (TRUE)) AND ((PMC_3 + PMC_2 + PMC_1 + 1 <= FMCb)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= PMC_3 + PMC_2 + PMC_1) AND ((FMCb <= PMC_3 + PMC_2 + PMC_1)))
lola: processed formula length: 154
lola: 8 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((R_tout <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (R_tout <= 0)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 132 markings, 134 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR A (F (A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3))))))
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: (3 <= wait_msg_1 + wait_msg_2 + wait_msg_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= wait_msg_1 + wait_msg_2 + wait_msg_3)
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 1 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))
lola: processed formula: A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: 89 markings, 94 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((1 <= loop_em_1 + loop_em_2 + loop_em_3)))) AND E (G ((ACK <= 2)))) AND (E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3))) AND (((FMC_1 + FMC_2 + FMC_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= FMC_1 + FMC_2 + FMC_3) OR (listen_3 + listen_2 + listen_1 <= loop_em_1 + loop_em_2 + loop_em_3)) OR E (X ((cable_free <= T_out))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((loop_em_1 + loop_em_2 + loop_em_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= loop_em_1 + loop_em_2 + loop_em_3)))
lola: processed formula length: 55
lola: 6 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 301 markings, 491 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((ACK <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= ACK)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FMC_1 + FMC_2 + FMC_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= FMC_1 + FMC_2 + FMC_3) OR (listen_3 + listen_2 + listen_1 <= loop_em_1 + loop_em_2 + loop_em_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FMC_1 + FMC_2 + FMC_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (1 <= FMC_1 + FMC_2 + FMC_3) OR (listen_3 + listen_2 + listen_1 <= loop_em_1 + loop_em_2 + loop_em_3))
lola: processed formula length: 160
lola: 4 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((MSG_1 + MSG_2 + MSG_3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (MSG_1 + MSG_2 + MSG_3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3))))
lola: processed formula length: 139
lola: 6 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 39 markings, 86 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((FMC_1 + FMC_2 + FMC_3 <= 2))) AND A (F (((2 <= ACK) AND (ACK <= wait_cable_1 + wait_cable_2 + wait_cable_3))))) AND (A (((2 <= FMC_1 + FMC_2 + FMC_3) U (PMC_3 + PMC_2 + PMC_1 <= cable_used_1 + cable_used_2 + cable_used_3))) OR A (G (((2 <= Cpt2_1 + Cpt2_2 + Cpt2_3) OR (ACK <= FMCb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FMC_1 + FMC_2 + FMC_3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FMC_1 + FMC_2 + FMC_3 <= 2)))
lola: processed formula: A (F ((FMC_1 + FMC_2 + FMC_3 <= 2)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= ACK) AND (ACK <= wait_cable_1 + wait_cable_2 + wait_cable_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= ACK) AND (ACK <= wait_cable_1 + wait_cable_2 + wait_cable_3))))
lola: processed formula: A (F (((2 <= ACK) AND (ACK <= wait_cable_1 + wait_cable_2 + wait_cable_3))))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: 37 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0)))) AND (((cable_free <= msgl_1 + msgl_2 + msgl_3) OR ((R_tout <= 0) AND (listen_3 + listen_2 + listen_1 <= 0))) OR A (F ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= RMC_1 + RMC_2 + RMC_3) OR (1 <= S_tout))))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cable_free <= msgl_1 + msgl_2 + msgl_3) OR ((R_tout <= 0) AND (listen_3 + listen_2 + listen_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cable_free <= msgl_1 + msgl_2 + msgl_3) OR ((R_tout <= 0) AND (listen_3 + listen_2 + listen_1 <= 0)))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 3 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((1 <= T_out))))) OR A (F (((PMC_3 <= FMC_2) AND (3 <= wait_cable_2) AND (AMC_2_3 <= 1)))))
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 (E (G ((1 <= T_out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (T_out <= 0))))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((PMC_3 <= FMC_2) AND (3 <= wait_cable_2) AND (AMC_2_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((PMC_3 <= FMC_2) AND (3 <= wait_cable_2) AND (AMC_2_3 <= 1))))
lola: processed formula: A (F (((PMC_3 <= FMC_2) AND (3 <= wait_cable_2) AND (AMC_2_3 <= 1))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: 37 markings, 37 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: A (F (A (G ((ACK <= listen_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((ACK <= listen_3)))))
lola: processed formula: A (F (A (G ((ACK <= listen_3)))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: 185 markings, 195 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((RMC_3 <= RMC_2) U (3 <= listen_2))) OR ((1 <= loop_em_1) OR (3 <= wait_msg_2))) AND (1 <= FMCb))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((RMC_3 <= RMC_2) U (3 <= listen_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((RMC_3 <= RMC_2) U (3 <= listen_2))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 4416 markings, 11148 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= loop_em_1) OR (3 <= wait_msg_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= loop_em_1) OR (3 <= wait_msg_2))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((1 <= cable_used_3) U (3 <= AMC_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((1 <= cable_used_3) U (3 <= AMC_2_2)))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 37 markings, 102 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3) AND (wait_msg_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3) AND (wait_msg_2 <= 2))))
lola: processed formula: A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3) AND (wait_msg_2 <= 2))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((cable_used_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (2 <= cable_used_2))))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 37 markings, 111 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= FMC_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-03-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3920 markings, 9416 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((msgl_3 + 1 <= ACK) AND (listen_2 + 1 <= loop_em_1)))) AND (E (((wait_msg_1 <= RMC_2) U (2 <= cable_used_2))) AND (AMC_3_1 <= Cpt2_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((msgl_3 + 1 <= ACK) AND (listen_2 + 1 <= loop_em_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((msgl_3 + 1 <= ACK) AND (listen_2 + 1 <= loop_em_1))))
lola: processed formula: A (F (((msgl_3 + 1 <= ACK) AND (listen_2 + 1 <= loop_em_1))))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 31 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: 67 markings, 67 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes no no no no no yes no no
FORMULA SafeBus-PT-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="SafeBus-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 mcc4mcc-structural"
echo " Input is SafeBus-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r155-smll-152685553100227"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;