fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r238-blw3-152732478200031
Last Updated
June 26, 2018

About the Execution of M4M.full for Dekker-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14456.790 571848.00 573183.00 748.70 ???????????????? normal

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 mcc4mcc-full
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 r238-blw3-152732478200031
=====================================================================


--------------------
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 1528023111672


BK_STOP 1528023683520

--------------------
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 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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
LTLCardinality @ Dekker-PT-200 @ 3539 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 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: 21668 markings, 3790861 edges, 4334 markings/sec, 0 secs
lola: 38641 markings, 7799548 edges, 3395 markings/sec, 5 secs
lola: 55008 markings, 11868509 edges, 3273 markings/sec, 10 secs
lola: 70543 markings, 15996950 edges, 3107 markings/sec, 15 secs
lola: 84256 markings, 20078287 edges, 2743 markings/sec, 20 secs
lola: 97411 markings, 24163753 edges, 2631 markings/sec, 25 secs
lola: 111054 markings, 28188136 edges, 2729 markings/sec, 30 secs
lola: 124810 markings, 32156578 edges, 2751 markings/sec, 35 secs
lola: 137152 markings, 36074983 edges, 2468 markings/sec, 40 secs
lola: 148900 markings, 39960177 edges, 2350 markings/sec, 45 secs
lola: 162026 markings, 43922893 edges, 2625 markings/sec, 50 secs
lola: 175215 markings, 47631969 edges, 2638 markings/sec, 55 secs
lola: 186469 markings, 51400265 edges, 2251 markings/sec, 60 secs
lola: 197080 markings, 55376900 edges, 2122 markings/sec, 65 secs
lola: 210883 markings, 59498973 edges, 2761 markings/sec, 70 secs
lola: 223898 markings, 63734848 edges, 2603 markings/sec, 75 secs
lola: 235294 markings, 68070756 edges, 2279 markings/sec, 80 secs
lola: 249172 markings, 72230513 edges, 2776 markings/sec, 85 secs
lola: 261600 markings, 76487118 edges, 2486 markings/sec, 90 secs
lola: 273272 markings, 80661401 edges, 2334 markings/sec, 95 secs
lola: 283484 markings, 84486173 edges, 2042 markings/sec, 100 secs
lola: 295711 markings, 88151849 edges, 2445 markings/sec, 105 secs
lola: 305868 markings, 91977493 edges, 2031 markings/sec, 110 secs
lola: 317027 markings, 96038384 edges, 2232 markings/sec, 115 secs
lola: 328384 markings, 100256785 edges, 2271 markings/sec, 120 secs
lola: 338531 markings, 104574942 edges, 2029 markings/sec, 125 secs
lola: 351087 markings, 108725145 edges, 2511 markings/sec, 130 secs
lola: 363846 markings, 112872781 edges, 2552 markings/sec, 135 secs
lola: 375815 markings, 117048344 edges, 2394 markings/sec, 140 secs
lola: 387103 markings, 121258279 edges, 2258 markings/sec, 145 secs
lola: 396737 markings, 125323425 edges, 1927 markings/sec, 150 secs
lola: 409486 markings, 128986602 edges, 2550 markings/sec, 155 secs
lola: 420471 markings, 132731118 edges, 2197 markings/sec, 160 secs
lola: 430967 markings, 136482750 edges, 2099 markings/sec, 165 secs
lola: 440997 markings, 140275506 edges, 2006 markings/sec, 170 secs
lola: 451238 markings, 144061237 edges, 2048 markings/sec, 175 secs
lola: 463813 markings, 147815358 edges, 2515 markings/sec, 180 secs
lola: 474797 markings, 151483783 edges, 2197 markings/sec, 185 secs
lola: 487233 markings, 155079081 edges, 2487 markings/sec, 190 secs
lola: 498531 markings, 158827656 edges, 2260 markings/sec, 195 secs
lola: 508914 markings, 162512449 edges, 2077 markings/sec, 200 secs
lola: 519211 markings, 166293643 edges, 2059 markings/sec, 205 secs
lola: 530411 markings, 170366549 edges, 2240 markings/sec, 210 secs
lola: 542166 markings, 174112599 edges, 2351 markings/sec, 215 secs
lola: 553406 markings, 178252549 edges, 2248 markings/sec, 220 secs
lola: 564263 markings, 182068823 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: 22 markings, 69 edges, 4 markings/sec, 0 secs
lola: 33 markings, 132 edges, 2 markings/sec, 5 secs
lola: 41 markings, 216 edges, 2 markings/sec, 10 secs
lola: 47 markings, 277 edges, 1 markings/sec, 15 secs
lola: 54 markings, 355 edges, 1 markings/sec, 20 secs
lola: 60 markings, 439 edges, 1 markings/sec, 25 secs
lola: 65 markings, 493 edges, 1 markings/sec, 30 secs
lola: 70 markings, 549 edges, 1 markings/sec, 35 secs
lola: 74 markings, 606 edges, 1 markings/sec, 40 secs
lola: 78 markings, 665 edges, 1 markings/sec, 45 secs
lola: 82 markings, 687 edges, 1 markings/sec, 50 secs
lola: 86 markings, 748 edges, 1 markings/sec, 55 secs
lola: 89 markings, 849 edges, 1 markings/sec, 60 secs
lola: 92 markings, 951 edges, 1 markings/sec, 65 secs
lola: 96 markings, 955 edges, 1 markings/sec, 70 secs
lola: 99 markings, 1017 edges, 1 markings/sec, 75 secs
lola: 102 markings, 1081 edges, 1 markings/sec, 80 secs
lola: 105 markings, 1185 edges, 1 markings/sec, 85 secs
lola: 108 markings, 1230 edges, 1 markings/sec, 90 secs
lola: 111 markings, 1274 edges, 1 markings/sec, 95 secs
lola: 114 markings, 1318 edges, 1 markings/sec, 100 secs
lola: 117 markings, 1429 edges, 1 markings/sec, 105 secs
lola: 120 markings, 1564 edges, 1 markings/sec, 110 secs
lola: 122 markings, 1566 edges, 0 markings/sec, 115 secs
lola: 125 markings, 1590 edges, 1 markings/sec, 120 secs
lola: 128 markings, 1681 edges, 1 markings/sec, 125 secs
lola: 130 markings, 1728 edges, 0 markings/sec, 130 secs
lola: 133 markings, 1818 edges, 1 markings/sec, 135 secs
lola: 135 markings, 1933 edges, 0 markings/sec, 140 secs
lola: 137 markings, 2031 edges, 0 markings/sec, 145 secs
lola: 139 markings, 2033 edges, 0 markings/sec, 150 secs
lola: 142 markings, 2058 edges, 1 markings/sec, 155 secs
lola: 144 markings, 2106 edges, 0 markings/sec, 160 secs
lola: 146 markings, 2227 edges, 0 markings/sec, 165 secs
lola: 148 markings, 2229 edges, 0 markings/sec, 170 secs
lola: 150 markings, 2253 edges, 0 markings/sec, 175 secs
lola: 153 markings, 2373 edges, 1 markings/sec, 180 secs
lola: 155 markings, 2448 edges, 0 markings/sec, 185 secs
lola: 157 markings, 2497 edges, 0 markings/sec, 190 secs
lola: 160 markings, 2616 edges, 1 markings/sec, 195 secs
lola: 163 markings, 2715 edges, 1 markings/sec, 200 secs
lola: 165 markings, 2717 edges, 0 markings/sec, 205 secs
lola: 167 markings, 2742 edges, 0 markings/sec, 210 secs
lola: 170 markings, 2841 edges, 1 markings/sec, 215 secs
lola: 172 markings, 2892 edges, 0 markings/sec, 220 secs
lola: 174 markings, 2963 edges, 0 markings/sec, 225 secs
lola: 176 markings, 3037 edges, 0 markings/sec, 230 secs
lola: 178 markings, 3166 edges, 0 markings/sec, 235 secs
lola: 180 markings, 3244 edges, 0 markings/sec, 240 secs
lola: 182 markings, 3246 edges, 0 markings/sec, 245 secs
lola: 184 markings, 3319 edges, 0 markings/sec, 250 secs
lola: 186 markings, 3395 edges, 0 markings/sec, 255 secs
lola: 188 markings, 3472 edges, 0 markings/sec, 260 secs
lola: 190 markings, 3596 edges, 0 markings/sec, 265 secs
lola: 192 markings, 3672 edges, 0 markings/sec, 270 secs
lola: 194 markings, 3853 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="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/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 mcc4mcc-full"
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 r238-blw3-152732478200031"
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 ;