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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Dekker-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-blw3-152732476300031
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527928476963


BK_STOP 1527929048957

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Dekker-PT-200 as instance name.
Using Dekker 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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1172270, 'Memory': 15930.1, 'Tool': 'lola'}, {'Time': 1226772, 'Memory': 13928.23, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola Dekker-PT-200...

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


checking for too many tokens
===========================================================================================
Dekker-PT-200: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ Dekker-PT-200 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 41400/65536 symbol table entries, 18535 collisions
lola: preprocessing...
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80600 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-200-LTLCardinality.task
lola: A ((2 <= flag_1_139)) : A (X (G (((2 <= flag_0_24) U (flag_1_191 <= flag_1_168))))) : A ((flag_1_79 <= p0_148)) : A (G (X (((flag_0_180 <= flag_1_19) U (p0_167 <= p1_153))))) : A (((2 <= flag_0_67) U F (X ((3 <= p3_5))))) : A ((2 <= p1_188)) : A (G (((1 <= p1_13) U (1 <= flag_0_151)))) : A (F (X (((p0_82 <= p0_154) U (2 <= p0_55))))) : A ((((3 <= flag_1_124) U (3 <= p1_112)) U F ((flag_1_174 <= flag_0_39)))) : A (G ((X ((1 <= p3_121)) U G ((1 <= p1_83))))) : A (F (F (G ((flag_0_165 <= flag_1_50))))) : A (X (G (X (F ((3 <= flag_0_72)))))) : A (F ((F ((flag_1_153 <= p1_30)) U G ((p0_143 <= p3_164))))) : A ((flag_0_118 <= flag_0_66)) : A (X (F (X ((p1_33 <= p3_93))))) : A (F (F (((1 <= flag_0_144) U (2 <= flag_1_185)))))
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 ((2 <= flag_1_139))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= flag_1_139)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-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 (X (G (((2 <= flag_0_24) U (flag_1_191 <= flag_1_168)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((2 <= flag_0_24) U (flag_1_191 <= flag_1_168)))))
lola: processed formula: A (X (G (((2 <= flag_0_24) U (flag_1_191 <= flag_1_168)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 21522 markings, 3765857 edges, 4304 markings/sec, 0 secs
lola: 38738 markings, 7829839 edges, 3443 markings/sec, 5 secs
lola: 55271 markings, 11926408 edges, 3307 markings/sec, 10 secs
lola: 70900 markings, 16101538 edges, 3126 markings/sec, 15 secs
lola: 85094 markings, 20371981 edges, 2839 markings/sec, 20 secs
lola: 98801 markings, 24551848 edges, 2741 markings/sec, 25 secs
lola: 112785 markings, 28768976 edges, 2797 markings/sec, 30 secs
lola: 126353 markings, 32647606 edges, 2714 markings/sec, 35 secs
lola: 138379 markings, 36505101 edges, 2405 markings/sec, 40 secs
lola: 150965 markings, 40521604 edges, 2517 markings/sec, 45 secs
lola: 164553 markings, 44693732 edges, 2718 markings/sec, 50 secs
lola: 178731 markings, 48842964 edges, 2836 markings/sec, 55 secs
lola: 191176 markings, 53080028 edges, 2489 markings/sec, 60 secs
lola: 203998 markings, 57334226 edges, 2564 markings/sec, 65 secs
lola: 217146 markings, 61583428 edges, 2630 markings/sec, 70 secs
lola: 229501 markings, 65887887 edges, 2471 markings/sec, 75 secs
lola: 242478 markings, 70161485 edges, 2595 markings/sec, 80 secs
lola: 256111 markings, 74445532 edges, 2727 markings/sec, 85 secs
lola: 267813 markings, 78647262 edges, 2340 markings/sec, 90 secs
lola: 278015 markings, 82629080 edges, 2040 markings/sec, 95 secs
lola: 290093 markings, 86410947 edges, 2416 markings/sec, 100 secs
lola: 301802 markings, 90343187 edges, 2342 markings/sec, 105 secs
lola: 312732 markings, 94585798 edges, 2186 markings/sec, 110 secs
lola: 324657 markings, 98767900 edges, 2385 markings/sec, 115 secs
lola: 334930 markings, 103130584 edges, 2055 markings/sec, 120 secs
lola: 346608 markings, 107446592 edges, 2336 markings/sec, 125 secs
lola: 360113 markings, 111699542 edges, 2701 markings/sec, 130 secs
lola: 372668 markings, 115993115 edges, 2511 markings/sec, 135 secs
lola: 384542 markings, 120316610 edges, 2375 markings/sec, 140 secs
lola: 394721 markings, 124385125 edges, 2036 markings/sec, 145 secs
lola: 407206 markings, 128257154 edges, 2497 markings/sec, 150 secs
lola: 418941 markings, 132138878 edges, 2347 markings/sec, 155 secs
lola: 430196 markings, 136161157 edges, 2251 markings/sec, 160 secs
lola: 441558 markings, 140531382 edges, 2272 markings/sec, 165 secs
lola: 453892 markings, 144817094 edges, 2467 markings/sec, 170 secs
lola: 467269 markings, 149009934 edges, 2675 markings/sec, 175 secs
lola: 480905 markings, 153169430 edges, 2727 markings/sec, 180 secs
lola: 494308 markings, 157374348 edges, 2681 markings/sec, 185 secs
lola: 506258 markings, 161640096 edges, 2390 markings/sec, 190 secs
lola: 518136 markings, 165839212 edges, 2376 markings/sec, 195 secs
lola: 529185 markings, 170022113 edges, 2210 markings/sec, 200 secs
lola: 542230 markings, 174130723 edges, 2609 markings/sec, 205 secs
lola: 552950 markings, 178071097 edges, 2144 markings/sec, 210 secs
lola: 564359 markings, 182102566 edges, 2282 markings/sec, 215 secs
lola: 574629 markings, 186181859 edges, 2054 markings/sec, 220 secs
lola: 585484 markings, 190251011 edges, 2171 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((flag_1_79 <= p0_148))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (flag_1_79 <= p0_148)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-LTLCardinality.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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((flag_0_180 <= flag_1_19) U (p0_167 <= p1_153)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((flag_0_180 <= flag_1_19) U (p0_167 <= p1_153)))))
lola: processed formula: A (G (X (((flag_0_180 <= flag_1_19) U (p0_167 <= p1_153)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= flag_0_67) U F (X ((3 <= p3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= flag_0_67) U F (X ((3 <= p3_5)))))
lola: processed formula: A (((2 <= flag_0_67) U F (X ((3 <= p3_5)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p1_188))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1_188)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1_13) U (1 <= flag_0_151))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((1 <= p1_13) U (1 <= flag_0_151))))
lola: processed formula: A (G (((1 <= p1_13) U (1 <= flag_0_151))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 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: 23 markings, 70 edges, 5 markings/sec, 0 secs
lola: 34 markings, 157 edges, 2 markings/sec, 5 secs
lola: 42 markings, 259 edges, 2 markings/sec, 10 secs
lola: 48 markings, 292 edges, 1 markings/sec, 15 secs
lola: 55 markings, 371 edges, 1 markings/sec, 20 secs
lola: 61 markings, 440 edges, 1 markings/sec, 25 secs
lola: 66 markings, 494 edges, 1 markings/sec, 30 secs
lola: 71 markings, 550 edges, 1 markings/sec, 35 secs
lola: 75 markings, 607 edges, 1 markings/sec, 40 secs
lola: 79 markings, 666 edges, 1 markings/sec, 45 secs
lola: 83 markings, 707 edges, 1 markings/sec, 50 secs
lola: 87 markings, 787 edges, 1 markings/sec, 55 secs
lola: 90 markings, 850 edges, 1 markings/sec, 60 secs
lola: 94 markings, 953 edges, 1 markings/sec, 65 secs
lola: 97 markings, 975 edges, 1 markings/sec, 70 secs
lola: 100 markings, 1059 edges, 1 markings/sec, 75 secs
lola: 104 markings, 1142 edges, 1 markings/sec, 80 secs
lola: 107 markings, 1229 edges, 1 markings/sec, 85 secs
lola: 110 markings, 1252 edges, 1 markings/sec, 90 secs
lola: 113 markings, 1297 edges, 1 markings/sec, 95 secs
lola: 116 markings, 1428 edges, 1 markings/sec, 100 secs
lola: 119 markings, 1496 edges, 1 markings/sec, 105 secs
lola: 121 markings, 1565 edges, 0 markings/sec, 110 secs
lola: 124 markings, 1568 edges, 1 markings/sec, 115 secs
lola: 127 markings, 1636 edges, 1 markings/sec, 120 secs
lola: 129 markings, 1682 edges, 0 markings/sec, 125 secs
lola: 131 markings, 1772 edges, 0 markings/sec, 130 secs
lola: 134 markings, 1863 edges, 1 markings/sec, 135 secs
lola: 137 markings, 2031 edges, 1 markings/sec, 140 secs
lola: 139 markings, 2033 edges, 0 markings/sec, 145 secs
lola: 141 markings, 2035 edges, 0 markings/sec, 150 secs
lola: 144 markings, 2106 edges, 1 markings/sec, 155 secs
lola: 146 markings, 2227 edges, 0 markings/sec, 160 secs
lola: 148 markings, 2229 edges, 0 markings/sec, 165 secs
lola: 150 markings, 2253 edges, 0 markings/sec, 170 secs
lola: 152 markings, 2325 edges, 0 markings/sec, 175 secs
lola: 154 markings, 2447 edges, 0 markings/sec, 180 secs
lola: 157 markings, 2497 edges, 1 markings/sec, 185 secs
lola: 159 markings, 2567 edges, 0 markings/sec, 190 secs
lola: 162 markings, 2665 edges, 1 markings/sec, 195 secs
lola: 164 markings, 2716 edges, 0 markings/sec, 200 secs
lola: 166 markings, 2718 edges, 0 markings/sec, 205 secs
lola: 169 markings, 2792 edges, 1 markings/sec, 210 secs
lola: 171 markings, 2842 edges, 0 markings/sec, 215 secs
lola: 173 markings, 2938 edges, 0 markings/sec, 220 secs
lola: 176 markings, 3037 edges, 1 markings/sec, 225 secs
lola: 178 markings, 3166 edges, 0 markings/sec, 230 secs
lola: 180 markings, 3244 edges, 0 markings/sec, 235 secs
lola: 181 markings, 3245 edges, 0 markings/sec, 240 secs
lola: 183 markings, 3270 edges, 0 markings/sec, 245 secs
lola: 185 markings, 3345 edges, 0 markings/sec, 250 secs
lola: 187 markings, 3471 edges, 0 markings/sec, 255 secs
lola: 189 markings, 3549 edges, 0 markings/sec, 260 secs
lola: 191 markings, 3622 edges, 0 markings/sec, 265 secs
lola: 193 markings, 3748 edges, 0 markings/sec, 270 secs
lola: 195 markings, 3989 edges, 0 markings/sec, 275 secs
lola: 196 markings, 3990 edges, 0 markings/sec, 280 secs
lola: 198 markings, 3992 edges, 0 markings/sec, 285 secs
lola: 200 markings, 3994 edges, 0 markings/sec, 290 secs
lola: 202 markings, 4020 edges, 0 markings/sec, 295 secs
lola: 204 markings, 4072 edges, 0 markings/sec, 300 secs
lola: 206 markings, 4098 edges, 0 markings/sec, 305 secs
lola: 208 markings, 4228 edges, 0 markings/sec, 310 secs
lola: 210 markings, 4256 edges, 0 markings/sec, 315 secs
lola: 212 markings, 4307 edges, 0 markings/sec, 320 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: '\ufffd'
Aborted (core dumped)
FORMULA Dekker-PT-200-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-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 stdout -----
----- 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="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is Dekker-PT-200, 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 r235-blw3-152732476300031"
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 ;