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 184K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 23K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Parking-PT-104, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478400388
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527294644652


BK_STOP 1527294689122

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Parking-PT-104 as instance name.
Using Parking as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 506, 'Memory': 101.1, 'Tool': 'gspn'}, {'Time': 577, 'Memory': 111.1, 'Tool': 'lola'}, {'Time': 878, 'Memory': 110.15, 'Tool': 'lola'}, {'Time': 2089, 'Memory': 167.58, 'Tool': 'gspn'}, {'Time': 2711, 'Memory': 250.07, 'Tool': 'itstools'}, {'Time': 2743, 'Memory': 244.27, 'Tool': 'itstools'}, {'Time': 3277, 'Memory': 2206.36, 'Tool': 'marcie'}, {'Time': 3289, 'Memory': 2205.86, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.140316205533597x far from the best tool gspn.
CTLCardinality lola Parking-PT-104...

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


checking for too many tokens
===========================================================================================
Parking-PT-104: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Parking-PT-104 @ 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: 162/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 65 places, 97 transitions, 49 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 63 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-104-CTLCardinality.task
lola: NOT(A (F (A (F ((3 <= p49)))))) : E (G ((p20 <= p1))) : E (((p50 <= 0) U A (F ((3 <= p25))))) : NOT(E (G (A (F ((1 <= p37)))))) : A (((p51 <= p25) U ((p58 + 1 <= p3) AND (p33 + 1 <= p57)))) : E (F ((3 <= p54))) : (NOT(A (G ((p40 <= 2)))) OR (((p12 <= p63) OR E (F ((p30 <= p57)))) AND A (F ((p61 + 1 <= p29))))) : A (X (A (F ((2 <= p4))))) : A (F (((p21 <= p50) AND (2 <= p50)))) : NOT(E (G (((p14 <= p16) OR (p2 <= p9) OR (p57 <= 0))))) : E (X (E (F (((p58 <= p63) AND (3 <= p32)))))) : ((E (G ((p33 <= 1))) OR E (G ((p39 <= p7)))) OR (((3 <= p3) AND (p20 + 1 <= p21) AND (1 <= p35)) AND A (((3 <= p56) U (3 <= p34))))) : NOT(E (F (((1 <= p0) AND (2 <= p9) AND (p17 <= p28))))) : A ((E (X ((1 <= p55))) U E (F ((1 <= p62))))) : (A (F (A (X ((3 <= p62))))) AND A (X (E (G ((p61 <= p50)))))) : A (F ((E (X ((p5 <= p45))) AND ((p32 <= p61) AND (p21 <= p17) AND (2 <= p13)))))
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(A (F (A (F ((3 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p49)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p20 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1 + 1 <= p20)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p50 <= 0) U A (F ((3 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p50 <= 0) U A(TRUE U (3 <= p25)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 30289 markings, 358641 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= p37))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p51 <= p25) U ((p58 + 1 <= p3) AND (p33 + 1 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p51 <= p25) U ((p58 + 1 <= p3) AND (p33 + 1 <= p57))))
lola: processed formula: A (((p51 <= p25) U ((p58 + 1 <= p3) AND (p33 + 1 <= p57))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 13 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p54)))
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 8 bytes per marking, with 15 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 Parking-PT-104-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 246 markings, 862 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((p40 <= 2)))) OR (((p12 <= p63) OR E (F ((p30 <= p57)))) AND A (F ((p61 + 1 <= p29)))))
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: E (F ((3 <= p40)))
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 8 bytes per marking, with 15 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 Parking-PT-104-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 211 markings, 668 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p12 <= p63)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p12 <= p63)
lola: processed formula length: 12
lola: 3 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: processed formula with 1 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p61 + 1 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p61 + 1 <= p29)))
lola: processed formula: A (F ((p61 + 1 <= p29)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 14 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: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= p4)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p21 <= p50) AND (2 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p21 <= p50) AND (2 <= p50))))
lola: processed formula: A (F (((p21 <= p50) AND (2 <= p50))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 14 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: 19 markings, 19 edges
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((p14 <= p16) OR (p2 <= p9) OR (p57 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p16 + 1 <= p14) AND (p9 + 1 <= p2) AND (1 <= p57))))
lola: processed formula: A (F (((p16 + 1 <= p14) AND (p9 + 1 <= p2) AND (1 <= p57))))
lola: processed formula length: 60
lola: 3 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 14 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((p58 <= p63) AND (3 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((p58 <= p63) AND (3 <= p32))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 31744 markings, 339200 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p33 <= 1))) OR E (G ((p39 <= p7)))) OR (((3 <= p3) AND (p20 + 1 <= p21) AND (1 <= p35)) AND A (((3 <= p56) U (3 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p33 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p33)))
lola: processed formula length: 25
lola: 3 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((1 <= p0) AND (2 <= p9) AND (p17 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-104-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((1 <= p55))) U E (F ((1 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((1 <= p55)) U E(TRUE U (1 <= p62)))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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 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: 3628 markings, 30011 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p62))))) AND A (X (E (G ((p61 <= p50))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p62)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 1152 markings, 8530 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((p5 <= p45))) AND ((p32 <= p61) AND (p21 <= p17) AND (2 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((p5 <= p45)) AND ((p32 <= p61) AND (p21 <= p17) AND (2 <= p13))))
lola: processed formula length: 78
lola: 2 rewrites
lola: formula mentions 0 of 65 places; total mentions: 0
lola: closed formula file Parking-PT-104-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 15 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: 21 markings, 20 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no no no no no yes yes yes no no
FORMULA Parking-PT-104-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-104-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="Parking-PT-104"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/Parking-PT-104.tgz
mv Parking-PT-104 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-full"
echo " Input is Parking-PT-104, 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 r118-csrt-152666478400388"
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 ;