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 172K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 irma4mcc-full
Input is SwimmingPool-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732261200667
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527461915559


BK_STOP 1527462460940

--------------------
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-10 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 506370, 'Memory': 14779.59, 'Tool': 'lola'}, {'Time': 506567, 'Memory': 13813.52, 'Tool': 'lola'}, {'Time': 3511122, 'Memory': 5451.85, 'Tool': 'itstools'}, {'Time': 3512195, 'Memory': 5454.14, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola SwimmingPool-PT-10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ SwimmingPool-PT-10 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 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-10-LTLCardinality.task
lola: A ((1 <= Dressed)) : A (G ((1 <= InBath))) : A (F ((G ((Bags <= Entered)) U G ((1 <= Dress))))) : A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered))) : A (G ((Out <= Bags))) : A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins))))) : A (F (F (X (G ((Bags <= Dress)))))) : A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress))))) : A (X (G ((2 <= Entered)))) : A (F (F (((Entered <= Out) U (Dress <= Cabins))))) : A ((G (F ((2 <= Out))) U F ((2 <= Bags)))) : A (X (F (X (G ((1 <= Bags)))))) : A ((1 <= Entered)) : A (X ((Out <= Dressed))) : A (X (X (((Dress <= InBath) U (Undress <= Entered))))) : A (G (G (X (F ((Cabins <= Out))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= Dressed))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Dressed)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= InBath)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 307 markings, 308 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Out <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (G ((Bags <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 406 markings, 406 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
make: [verify] Error 134 (ignored)
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 406 markings, 406 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= Entered))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 406 markings, 406 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((Entered <= Out) U (Dress <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (G ((1 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1910478 markings, 5259023 edges, 382096 markings/sec, 0 secs
lola: 3541726 markings, 10236136 edges, 326250 markings/sec, 5 secs
lola: 5038850 markings, 14930876 edges, 299425 markings/sec, 10 secs
lola: 6455324 markings, 19440953 edges, 283295 markings/sec, 15 secs
lola: 7819482 markings, 23826213 edges, 272832 markings/sec, 20 secs
lola: 8953592 markings, 27492101 edges, 226822 markings/sec, 25 secs
lola: 9943501 markings, 30720209 edges, 197982 markings/sec, 30 secs
lola: 10925114 markings, 33955385 edges, 196323 markings/sec, 35 secs
lola: 11902257 markings, 37184171 edges, 195429 markings/sec, 40 secs
lola: 12883426 markings, 40413887 edges, 196234 markings/sec, 45 secs
lola: 13855831 markings, 43639353 edges, 194481 markings/sec, 50 secs
lola: 14841636 markings, 46905033 edges, 197161 markings/sec, 55 secs
lola: 15825260 markings, 50188136 edges, 196725 markings/sec, 60 secs
lola: 16794781 markings, 53451888 edges, 193904 markings/sec, 65 secs
lola: 17759963 markings, 56692142 edges, 193036 markings/sec, 70 secs
lola: 18718316 markings, 59932098 edges, 191671 markings/sec, 75 secs
lola: 19647712 markings, 63074804 edges, 185879 markings/sec, 80 secs
lola: 20582489 markings, 66230692 edges, 186955 markings/sec, 85 secs
lola: 21496763 markings, 69327080 edges, 182855 markings/sec, 90 secs
lola: 22412358 markings, 72442164 edges, 183119 markings/sec, 95 secs
lola: 23322198 markings, 75539906 edges, 181968 markings/sec, 100 secs
lola: 24227417 markings, 78620455 edges, 181044 markings/sec, 105 secs
lola: 25123638 markings, 81672860 edges, 179244 markings/sec, 110 secs
lola: 26010076 markings, 84701995 edges, 177288 markings/sec, 115 secs
lola: 26890955 markings, 87725350 edges, 176176 markings/sec, 120 secs
lola: 27775631 markings, 90746165 edges, 176935 markings/sec, 125 secs
lola: 28655492 markings, 93749121 edges, 175972 markings/sec, 130 secs
lola: 29535778 markings, 96742513 edges, 176057 markings/sec, 135 secs
lola: 30414580 markings, 99735860 edges, 175760 markings/sec, 140 secs
lola: 31282983 markings, 102703112 edges, 173681 markings/sec, 145 secs
lola: 32146512 markings, 105654203 edges, 172706 markings/sec, 150 secs
lola: 33006933 markings, 108602976 edges, 172084 markings/sec, 155 secs
lola: 33860715 markings, 111538875 edges, 170756 markings/sec, 160 secs
lola: 34721365 markings, 114489216 edges, 172130 markings/sec, 165 secs
lola: 35569694 markings, 117403158 edges, 169666 markings/sec, 170 secs
lola: 36412162 markings, 120308480 edges, 168494 markings/sec, 175 secs
lola: 37255339 markings, 123205816 edges, 168635 markings/sec, 180 secs
lola: 38102707 markings, 126125376 edges, 169474 markings/sec, 185 secs
lola: 38984731 markings, 129173849 edges, 176405 markings/sec, 190 secs
lola: 39863937 markings, 132212631 edges, 175841 markings/sec, 195 secs
lola: 40716984 markings, 135167729 edges, 170609 markings/sec, 200 secs
lola: 41558565 markings, 138080800 edges, 168316 markings/sec, 205 secs
lola: 42409093 markings, 141028266 edges, 170106 markings/sec, 210 secs
lola: 43255196 markings, 143965559 edges, 169221 markings/sec, 215 secs
lola: 44102695 markings, 146907566 edges, 169500 markings/sec, 220 secs
lola: 44949484 markings, 149855361 edges, 169358 markings/sec, 225 secs
lola: 45788612 markings, 152778210 edges, 167826 markings/sec, 230 secs
lola: 46622306 markings, 155690961 edges, 166739 markings/sec, 235 secs
lola: 47457880 markings, 158601361 edges, 167115 markings/sec, 240 secs
lola: 48288384 markings, 161497930 edges, 166101 markings/sec, 245 secs
lola: 49113408 markings, 164377455 edges, 165005 markings/sec, 250 secs
lola: 49947675 markings, 167280867 edges, 166853 markings/sec, 255 secs
lola: 50767730 markings, 170148399 edges, 164011 markings/sec, 260 secs
lola: 51583574 markings, 173003543 edges, 163169 markings/sec, 265 secs
lola: 52390812 markings, 175825340 edges, 161448 markings/sec, 270 secs
lola: 53194982 markings, 178638414 edges, 160834 markings/sec, 275 secs
lola: 53993031 markings, 181442195 edges, 159610 markings/sec, 280 secs
lola: 54789407 markings, 184229767 edges, 159275 markings/sec, 285 secs
lola: 55592403 markings, 187052111 edges, 160599 markings/sec, 290 secs
lola: 56398600 markings, 189879133 edges, 161239 markings/sec, 295 secs
lola: 57203654 markings, 192699395 edges, 161011 markings/sec, 300 secs
lola: 58004340 markings, 195511132 edges, 160137 markings/sec, 305 secs
lola: 58801146 markings, 198316414 edges, 159361 markings/sec, 310 secs
lola: 59596466 markings, 201105169 edges, 159064 markings/sec, 315 secs
lola: 60392602 markings, 203902881 edges, 159227 markings/sec, 320 secs
lola: 61183908 markings, 206683521 edges, 158261 markings/sec, 325 secs
lola: 61979341 markings, 209472937 edges, 159087 markings/sec, 330 secs
lola: 62772804 markings, 212255872 edges, 158693 markings/sec, 335 secs
lola: 63560008 markings, 215019990 edges, 157441 markings/sec, 340 secs
lola: 64351044 markings, 217801649 edges, 158207 markings/sec, 345 secs
lola: 65136077 markings, 220571318 edges, 157007 markings/sec, 350 secs
lola: 65922292 markings, 223329546 edges, 157243 markings/sec, 355 secs
lola: 66718265 markings, 226123371 edges, 159195 markings/sec, 360 secs
lola: 67500692 markings, 228887724 edges, 156485 markings/sec, 365 secs
lola: 68272294 markings, 231603315 edges, 154320 markings/sec, 370 secs
lola: 69037004 markings, 234299189 edges, 152942 markings/sec, 375 secs
lola: 69805689 markings, 237001519 edges, 153737 markings/sec, 380 secs
lola: 70570983 markings, 239705729 edges, 153059 markings/sec, 385 secs
lola: 71333653 markings, 242391826 edges, 152534 markings/sec, 390 secs
lola: 72101911 markings, 245102789 edges, 153652 markings/sec, 395 secs
lola: 72860588 markings, 247792254 edges, 151735 markings/sec, 400 secs
lola: 73633258 markings, 250524456 edges, 154534 markings/sec, 405 secs
lola: 74405755 markings, 253255564 edges, 154499 markings/sec, 410 secs
lola: 75168894 markings, 255964925 edges, 152628 markings/sec, 415 secs
lola: 75932691 markings, 258678375 edges, 152759 markings/sec, 420 secs
lola: 76694948 markings, 261378367 edges, 152451 markings/sec, 425 secs
lola: 77458562 markings, 264085651 edges, 152723 markings/sec, 430 secs
lola: 78219372 markings, 266786124 edges, 152162 markings/sec, 435 secs
lola: 78982288 markings, 269492580 edges, 152583 markings/sec, 440 secs
lola: 79737549 markings, 272178917 edges, 151052 markings/sec, 445 secs
lola: 80490667 markings, 274852933 edges, 150624 markings/sec, 450 secs
lola: 81244593 markings, 277532725 edges, 150785 markings/sec, 455 secs
lola: 81995363 markings, 280215814 edges, 150154 markings/sec, 460 secs
lola: 82754888 markings, 282907211 edges, 151905 markings/sec, 465 secs
lola: 82991378 markings, 283747890 edges, 47298 markings/sec, 470 secs
lola: 82995292 markings, 283761994 edges, 783 markings/sec, 475 secs
lola: 82999980 markings, 283778985 edges, 938 markings/sec, 480 secs
lola: 83002882 markings, 283789539 edges, 580 markings/sec, 485 secs
lola: 83004289 markings, 283794523 edges, 281 markings/sec, 490 secs
lola: 83005712 markings, 283799652 edges, 285 markings/sec, 495 secs
lola: 83005719 markings, 283799675 edges, 1 markings/sec, 500 secs
lola: 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: '\ufffd'
Aborted (core dumped)
FORMULA SwimmingPool-PT-10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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-10.tgz
mv SwimmingPool-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is SwimmingPool-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-152732261200667"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;