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 164K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.6K 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 7.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 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is SwimmingPool-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705517000262
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527108405970


BK_STOP 1527109134297

--------------------
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 SwimmingPool-PT-08 as instance name.
Using SwimmingPool 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1234902, 'Memory': 15951.57, 'Tool': 'lola'}, {'Time': 1372479, 'Memory': 15951.85, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SwimmingPool-PT-08...

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-08 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-08-CTLCardinality.task
lola: ((E (X ((Dress + 1 <= Undress))) AND ((Entered <= 2) AND (Bags <= 0) AND (3 <= Bags))) OR (NOT(A (G ((1 <= Bags)))) OR (E (G ((Bags <= WaitBag))) AND (2 <= Dressed)))) : (A (G ((WaitBag + 1 <= Cabins))) AND A (X (E (G ((1 <= Out)))))) : NOT((A (G (TRUE)) AND (Dressed <= WaitBag))) : (E (F (((3 <= Entered) AND (Entered + 1 <= Dress)))) AND (3 <= Out)) : NOT(NOT(NOT(E (G ((WaitBag <= Dress)))))) : A (G (E (X ((WaitBag + 1 <= Out))))) : A (G (E (F ((Undress <= 2))))) : NOT(A (X (E (F ((Out <= Cabins)))))) : E (F (A (G (((2 <= Bags) OR (WaitBag <= Bags)))))) : A (G (A (((2 <= Dressed) U (2 <= Out))))) : (((E (X ((Dress <= WaitBag))) AND (Dressed <= 1)) AND ((Out <= InBath) OR A (F ((1 <= WaitBag))))) OR (((3 <= Entered) OR A (X ((Out <= Bags)))) AND (Bags <= Dress))) : E (F ((A (G ((2 <= Dressed))) AND A (X ((Bags <= Entered)))))) : E (F (NOT(E (G ((2 <= Cabins)))))) : NOT(A (G ((3 <= Out)))) : (A (F (((Cabins <= Bags) AND (2 <= Out) AND (1 <= Undress)))) AND E ((((1 <= Entered) AND (2 <= Dressed)) U ((Dress <= Cabins) OR (Dressed <= Dress))))) : (A ((((Dress <= Bags) AND (Bags <= Dressed)) U (Cabins <= Dress))) OR A (G (((WaitBag + 1 <= Out) OR (Out <= 2)))))
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 (X ((Dress + 1 <= Undress))) AND ((Entered <= 2) AND (Bags <= 0) AND (3 <= Bags))) OR (NOT(A (G ((1 <= Bags)))) OR (E (G ((Bags <= WaitBag))) AND (2 <= Dressed))))
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 (X ((Dress + 1 <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Dress + 1 <= Undress))
lola: processed formula length: 26
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Bags <= 0)))
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 24 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: 401 markings, 400 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: (A (G ((WaitBag + 1 <= Cabins))) AND A (X (E (G ((1 <= Out))))))
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: A (G ((WaitBag + 1 <= Cabins)))
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 24 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 SwimmingPool-PT-08-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 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((A (G (TRUE)) AND (Dressed <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitBag + 1 <= Dressed)
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= Entered) AND (Entered + 1 <= Dress)))) AND (3 <= Out))
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: E (F (((3 <= Entered) AND (Entered + 1 <= Dress))))
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 24 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 513 markings, 521 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Out)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(E (G ((WaitBag <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Dress + 1 <= WaitBag)))
lola: processed formula: A (F ((Dress + 1 <= WaitBag)))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 162 markings, 161 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((WaitBag + 1 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((WaitBag + 1 <= Out)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 160 markings, 159 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((Undress <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (Undress <= 2)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 1180420 markings, 4308749 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((Out <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (Out <= Cabins))))
lola: processed formula length: 34
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 80 markings, 79 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((2 <= Bags) OR (WaitBag <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((Bags <= 1) AND (Bags + 1 <= WaitBag)))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 1180420 markings, 4729596 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= Dressed) U (2 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= Dressed) U (2 <= Out)))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 160 markings, 319 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (X ((Dress <= WaitBag))) AND (Dressed <= 1)) AND ((Out <= InBath) OR A (F ((1 <= WaitBag))))) OR (((3 <= Entered) OR A (X ((Out <= Bags)))) AND (Bags <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Dress <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Dress <= WaitBag))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Dressed <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= 1)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-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 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Out <= InBath)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Out <= InBath)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-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 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 162 markings, 161 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((2 <= Dressed))) AND A (X ((Bags <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (Dressed <= 1))) AND AX((Bags <= Entered))))
lola: processed formula length: 67
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1426025 markings, 6094132 edges, 3096159597753270272 markings/sec, 0 secs
lola: 2586270 markings, 11508346 edges, 232049 markings/sec, 5 secs
lola: 3672005 markings, 16709272 edges, 217147 markings/sec, 10 secs
lola: 4709969 markings, 21775409 edges, 207593 markings/sec, 15 secs
lola: 5707876 markings, 26690682 edges, 199581 markings/sec, 20 secs
lola: 6617443 markings, 31210235 edges, 181913 markings/sec, 25 secs
lola: 7529733 markings, 35756591 edges, 182458 markings/sec, 30 secs
lola: 8425957 markings, 40265772 edges, 179245 markings/sec, 35 secs
lola: 9312107 markings, 44742157 edges, 177230 markings/sec, 40 secs
lola: 10193027 markings, 49195760 edges, 176184 markings/sec, 45 secs
lola: 11063315 markings, 53606181 edges, 174058 markings/sec, 50 secs
lola: 11929782 markings, 57989866 edges, 173293 markings/sec, 55 secs
lola: 12788472 markings, 62359005 edges, 171738 markings/sec, 60 secs
lola: 13615276 markings, 66576830 edges, 165361 markings/sec, 65 secs
lola: 14475646 markings, 70979810 edges, 172074 markings/sec, 70 secs
lola: 15258628 markings, 75002904 edges, 156596 markings/sec, 75 secs
lola: 16040284 markings, 79011735 edges, 156331 markings/sec, 80 secs
lola: 16864397 markings, 83248044 edges, 164823 markings/sec, 85 secs
lola: 17694195 markings, 87541241 edges, 165960 markings/sec, 90 secs
lola: 18506351 markings, 91750922 edges, 162431 markings/sec, 95 secs
lola: 19298666 markings, 95866652 edges, 158463 markings/sec, 100 secs
lola: 20083441 markings, 99922959 edges, 156955 markings/sec, 105 secs
lola: 20861458 markings, 103967215 edges, 155603 markings/sec, 110 secs
lola: 21630206 markings, 107972592 edges, 153750 markings/sec, 115 secs
lola: 22393147 markings, 111957041 edges, 152588 markings/sec, 120 secs
lola: 23147039 markings, 115913935 edges, 150778 markings/sec, 125 secs
lola: 23898894 markings, 119860053 edges, 150371 markings/sec, 130 secs
lola: 24652531 markings, 123801635 edges, 150727 markings/sec, 135 secs
lola: 25400933 markings, 127722311 edges, 149680 markings/sec, 140 secs
lola: 26146977 markings, 131632765 edges, 149209 markings/sec, 145 secs
lola: 26884703 markings, 135504663 edges, 147545 markings/sec, 150 secs
lola: 27622192 markings, 139377345 edges, 147498 markings/sec, 155 secs
lola: 28362017 markings, 143254188 edges, 147965 markings/sec, 160 secs
lola: 29092695 markings, 147090376 edges, 146136 markings/sec, 165 secs
lola: 29807001 markings, 150855393 edges, 142861 markings/sec, 170 secs
lola: 30522009 markings, 154613686 edges, 143002 markings/sec, 175 secs
lola: 31231575 markings, 158338567 edges, 141913 markings/sec, 180 secs
lola: 31927321 markings, 162006409 edges, 139149 markings/sec, 185 secs
lola: 32620655 markings, 165659978 edges, 138667 markings/sec, 190 secs
lola: 33308489 markings, 169279413 edges, 137567 markings/sec, 195 secs
lola: 33991639 markings, 172881924 edges, 136630 markings/sec, 200 secs
lola: 34671639 markings, 176464475 edges, 136000 markings/sec, 205 secs
lola: 35349695 markings, 180038025 edges, 135611 markings/sec, 210 secs
lola: 36019273 markings, 183575420 edges, 133916 markings/sec, 215 secs
lola: 36688412 markings, 187105093 edges, 133828 markings/sec, 220 secs
lola: 37349988 markings, 190604737 edges, 132315 markings/sec, 225 secs
lola: 38012702 markings, 194102017 edges, 132543 markings/sec, 230 secs
lola: 38664849 markings, 197560439 edges, 130429 markings/sec, 235 secs
lola: 39319705 markings, 201022957 edges, 130971 markings/sec, 240 secs
lola: 39969024 markings, 204464060 edges, 129864 markings/sec, 245 secs
lola: 40609349 markings, 207874795 edges, 128065 markings/sec, 250 secs
lola: 41254619 markings, 211300469 edges, 129054 markings/sec, 255 secs
lola: 41896649 markings, 214698592 edges, 128406 markings/sec, 260 secs
lola: 42551733 markings, 218161612 edges, 131017 markings/sec, 265 secs
lola: 43227168 markings, 221748080 edges, 135087 markings/sec, 270 secs
lola: 43872009 markings, 225178425 edges, 128968 markings/sec, 275 secs
lola: 44505812 markings, 228550120 edges, 126761 markings/sec, 280 secs
lola: 45133333 markings, 231890427 edges, 125504 markings/sec, 285 secs
lola: 45757368 markings, 235226372 edges, 124807 markings/sec, 290 secs
lola: 46386267 markings, 238577276 edges, 125780 markings/sec, 295 secs
lola: 47015694 markings, 241921466 edges, 125885 markings/sec, 300 secs
lola: 47639822 markings, 245251196 edges, 124826 markings/sec, 305 secs
lola: 48257254 markings, 248554508 edges, 123486 markings/sec, 310 secs
lola: 48872146 markings, 251849430 edges, 122978 markings/sec, 315 secs
lola: 49485701 markings, 255139105 edges, 122711 markings/sec, 320 secs
lola: 50095076 markings, 258413428 edges, 121875 markings/sec, 325 secs
lola: 50703891 markings, 261673464 edges, 121763 markings/sec, 330 secs
lola: 51310922 markings, 264923111 edges, 121406 markings/sec, 335 secs
lola: 51921250 markings, 268189115 edges, 122066 markings/sec, 340 secs
lola: 52527968 markings, 271434974 edges, 121344 markings/sec, 345 secs
lola: 53131575 markings, 274667897 edges, 120721 markings/sec, 350 secs
lola: 53735790 markings, 277908502 edges, 120843 markings/sec, 355 secs
lola: 54333507 markings, 281124468 edges, 119543 markings/sec, 360 secs
lola: 54925454 markings, 284314024 edges, 118389 markings/sec, 365 secs
lola: 55526053 markings, 287529299 edges, 120120 markings/sec, 370 secs
lola: 56126143 markings, 290742102 edges, 120018 markings/sec, 375 secs
lola: 56724708 markings, 293948538 edges, 119713 markings/sec, 380 secs
lola: 57312057 markings, 297112325 edges, 117470 markings/sec, 385 secs
lola: 57908167 markings, 300308787 edges, 119222 markings/sec, 390 secs
lola: 58499219 markings, 303485447 edges, 118210 markings/sec, 395 secs
lola: 59080659 markings, 306627543 edges, 116288 markings/sec, 400 secs
lola: 59671131 markings, 309795650 edges, 118094 markings/sec, 405 secs
lola: 60260024 markings, 312954015 edges, 117779 markings/sec, 410 secs
lola: 60849101 markings, 316119337 edges, 117815 markings/sec, 415 secs
lola: 61434831 markings, 319266960 edges, 117146 markings/sec, 420 secs
lola: 62018172 markings, 322406698 edges, 116668 markings/sec, 425 secs
lola: 62598658 markings, 325537516 edges, 116097 markings/sec, 430 secs
lola: 63178452 markings, 328667214 edges, 115959 markings/sec, 435 secs
lola: 63761408 markings, 331805679 edges, 116591 markings/sec, 440 secs
lola: 64341137 markings, 334930590 edges, 115946 markings/sec, 445 secs
lola: 64920343 markings, 338049691 edges, 115841 markings/sec, 450 secs
lola: 65504480 markings, 341185776 edges, 116827 markings/sec, 455 secs
lola: 66086307 markings, 344312866 edges, 116365 markings/sec, 460 secs
lola: 66670659 markings, 347451927 edges, 116870 markings/sec, 465 secs
lola: 67248563 markings, 350565386 edges, 115581 markings/sec, 470 secs
lola: 67828319 markings, 353681314 edges, 115951 markings/sec, 475 secs
lola: 68406001 markings, 356792969 edges, 115536 markings/sec, 480 secs
lola: 68987405 markings, 359915579 edges, 116281 markings/sec, 485 secs
lola: 69558269 markings, 363001452 edges, 114173 markings/sec, 490 secs
lola: 70131093 markings, 366090275 edges, 114565 markings/sec, 495 secs
lola: 70703541 markings, 369178879 edges, 114490 markings/sec, 500 secs
lola: 71269138 markings, 372236854 edges, 113119 markings/sec, 505 secs
lola: 71838768 markings, 375313512 edges, 113926 markings/sec, 510 secs
lola: 72404361 markings, 378373741 edges, 113119 markings/sec, 515 secs
lola: 72966407 markings, 381423133 edges, 112409 markings/sec, 520 secs
lola: 73535930 markings, 384496033 edges, 113905 markings/sec, 525 secs
lola: 74109384 markings, 387581137 edges, 114691 markings/sec, 530 secs
lola: 74675147 markings, 390639877 edges, 113153 markings/sec, 535 secs
lola: 75238399 markings, 393690868 edges, 112650 markings/sec, 540 secs
lola: 75809346 markings, 396764739 edges, 114189 markings/sec, 545 secs
lola: 76373100 markings, 399813140 edges, 112751 markings/sec, 550 secs
lola: 76934827 markings, 402857766 edges, 112345 markings/sec, 555 secs
lola: 77493262 markings, 405887349 edges, 111687 markings/sec, 560 secs
lola: 78051780 markings, 408913422 edges, 111704 markings/sec, 565 secs
lola: 78615130 markings, 411959722 edges, 112670 markings/sec, 570 secs
lola: 79179522 markings, 415008104 edges, 112878 markings/sec, 575 secs
lola: 79734702 markings, 418022960 edges, 111036 markings/sec, 580 secs
lola: 80297561 markings, 421062549 edges, 112572 markings/sec, 585 secs
lola: 80853607 markings, 424079954 edges, 111209 markings/sec, 590 secs
lola: 81410153 markings, 427096939 edges, 111309 markings/sec, 595 secs
lola: 81970282 markings, 430124667 edges, 112026 markings/sec, 600 secs
lola: 82529384 markings, 433145564 edges, 111820 markings/sec, 605 secs
lola: 83081151 markings, 436140085 edges, 110353 markings/sec, 610 secs
lola: 83657777 markings, 439244580 edges, 115325 markings/sec, 615 secs
lola: 84244441 markings, 442417620 edges, 117333 markings/sec, 620 secs
lola: 84827383 markings, 445577354 edges, 116588 markings/sec, 625 secs
lola: 85409273 markings, 448733080 edges, 116378 markings/sec, 630 secs
lola: 85988814 markings, 451878748 edges, 115908 markings/sec, 635 secs
lola: 86573058 markings, 455040910 edges, 116849 markings/sec, 640 secs
lola: 87158002 markings, 458208235 edges, 116989 markings/sec, 645 secs
lola: 87741568 markings, 461363258 edges, 116713 markings/sec, 650 secs
lola: 88323340 markings, 464516387 edges, 116354 markings/sec, 655 secs
lola: 88906662 markings, 467674860 edges, 116664 markings/sec, 660 secs
lola: 89494286 markings, 470844592 edges, 117525 markings/sec, 665 secs
lola: 90074766 markings, 473995554 edges, 116096 markings/sec, 670 secs
lola: 90212606 markings, 474738600 edges, 27568 markings/sec, 675 secs
lola: 90219349 markings, 474775095 edges, 1349 markings/sec, 680 secs
lola: 90221132 markings, 474785274 edges, 357 markings/sec, 685 secs
lola: 90221140 markings, 474785318 edges, 2 markings/sec, 690 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA SwimmingPool-PT-08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-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="SwimmingPool-PT-08"
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/SwimmingPool-PT-08.tgz
mv SwimmingPool-PT-08 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 SwimmingPool-PT-08, 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 r166-smll-152705517000262"
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 ;