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-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 r234-blw3-152732475700031
=====================================================================

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


BK_STOP 1527921017188

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

Time: 3600 - MCC
----- Start make prepare stderr -----
----- 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 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stderr -----
----- 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: 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: 21481 markings, 3759629 edges, 4296 markings/sec, 0 secs
lola: 38230 markings, 7692850 edges, 3350 markings/sec, 5 secs
lola: 54453 markings, 11726649 edges, 3245 markings/sec, 10 secs
lola: 69821 markings, 15769609 edges, 3074 markings/sec, 15 secs
lola: 83731 markings, 19923390 edges, 2782 markings/sec, 20 secs
lola: 96974 markings, 24042604 edges, 2649 markings/sec, 25 secs
lola: 110713 markings, 28090506 edges, 2748 markings/sec, 30 secs
lola: 123832 markings, 31917456 edges, 2624 markings/sec, 35 secs
lola: 136336 markings, 35800705 edges, 2501 markings/sec, 40 secs
lola: 148708 markings, 39907853 edges, 2474 markings/sec, 45 secs
lola: 162291 markings, 43994361 edges, 2717 markings/sec, 50 secs
lola: 176532 markings, 48057144 edges, 2848 markings/sec, 55 secs
lola: 188905 markings, 52225718 edges, 2475 markings/sec, 60 secs
lola: 200455 markings, 56249699 edges, 2310 markings/sec, 65 secs
lola: 213045 markings, 60212284 edges, 2518 markings/sec, 70 secs
lola: 225849 markings, 64417388 edges, 2561 markings/sec, 75 secs
lola: 237098 markings, 68677009 edges, 2250 markings/sec, 80 secs
lola: 250984 markings, 72753951 edges, 2777 markings/sec, 85 secs
lola: 262380 markings, 76781760 edges, 2279 markings/sec, 90 secs
lola: 273673 markings, 80831006 edges, 2259 markings/sec, 95 secs
lola: 285126 markings, 84906295 edges, 2291 markings/sec, 100 secs
lola: 298323 markings, 88969970 edges, 2639 markings/sec, 105 secs
lola: 308833 markings, 93286496 edges, 2102 markings/sec, 110 secs
lola: 321010 markings, 97431545 edges, 2435 markings/sec, 115 secs
lola: 331049 markings, 101428588 edges, 2008 markings/sec, 120 secs
lola: 340549 markings, 105392280 edges, 1900 markings/sec, 125 secs
lola: 352635 markings, 109250461 edges, 2417 markings/sec, 130 secs
lola: 365184 markings, 113330174 edges, 2510 markings/sec, 135 secs
lola: 376911 markings, 117429067 edges, 2345 markings/sec, 140 secs
lola: 387575 markings, 121434910 edges, 2133 markings/sec, 145 secs
lola: 396965 markings, 125405475 edges, 1878 markings/sec, 150 secs
lola: 410386 markings, 129318394 edges, 2684 markings/sec, 155 secs
lola: 422578 markings, 133419946 edges, 2438 markings/sec, 160 secs
lola: 433924 markings, 137583714 edges, 2269 markings/sec, 165 secs
lola: 444935 markings, 141938147 edges, 2202 markings/sec, 170 secs
lola: 457657 markings, 145947609 edges, 2544 markings/sec, 175 secs
lola: 469181 markings, 149722705 edges, 2305 markings/sec, 180 secs
lola: 482136 markings, 153557253 edges, 2591 markings/sec, 185 secs
lola: 494456 markings, 157426510 edges, 2464 markings/sec, 190 secs
lola: 505817 markings, 161518122 edges, 2272 markings/sec, 195 secs
lola: 517440 markings, 165594768 edges, 2325 markings/sec, 200 secs
lola: 528297 markings, 169760513 edges, 2171 markings/sec, 205 secs
lola: 540731 markings, 173692085 edges, 2487 markings/sec, 210 secs
lola: 551854 markings, 177618123 edges, 2225 markings/sec, 215 secs
lola: 563127 markings, 181700837 edges, 2255 markings/sec, 220 secs
lola: 573177 markings, 185551130 edges, 2010 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: 34 markings, 157 edges, 2 markings/sec, 5 secs
lola: 41 markings, 216 edges, 1 markings/sec, 10 secs
lola: 49 markings, 307 edges, 2 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: 65 markings, 493 edges, 1 markings/sec, 30 secs
lola: 70 markings, 549 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: 91 markings, 889 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: 101 markings, 1060 edges, 1 markings/sec, 75 secs
lola: 104 markings, 1142 edges, 1 markings/sec, 80 secs
lola: 108 markings, 1230 edges, 1 markings/sec, 85 secs
lola: 111 markings, 1274 edges, 1 markings/sec, 90 secs
lola: 114 markings, 1318 edges, 1 markings/sec, 95 secs
lola: 116 markings, 1428 edges, 0 markings/sec, 100 secs
lola: 119 markings, 1496 edges, 1 markings/sec, 105 secs
lola: 122 markings, 1566 edges, 1 markings/sec, 110 secs
lola: 125 markings, 1590 edges, 1 markings/sec, 115 secs
lola: 127 markings, 1636 edges, 0 markings/sec, 120 secs
lola: 130 markings, 1728 edges, 1 markings/sec, 125 secs
lola: 133 markings, 1818 edges, 1 markings/sec, 130 secs
lola: 135 markings, 1933 edges, 0 markings/sec, 135 secs
lola: 137 markings, 2031 edges, 0 markings/sec, 140 secs
lola: 140 markings, 2034 edges, 1 markings/sec, 145 secs
lola: 142 markings, 2058 edges, 0 markings/sec, 150 secs
lola: 145 markings, 2153 edges, 1 markings/sec, 155 secs
lola: 147 markings, 2228 edges, 0 markings/sec, 160 secs
lola: 149 markings, 2230 edges, 0 markings/sec, 165 secs
lola: 151 markings, 2300 edges, 0 markings/sec, 170 secs
lola: 154 markings, 2447 edges, 1 markings/sec, 175 secs
lola: 156 markings, 2473 edges, 0 markings/sec, 180 secs
lola: 158 markings, 2520 edges, 0 markings/sec, 185 secs
lola: 161 markings, 2664 edges, 1 markings/sec, 190 secs
lola: 163 markings, 2715 edges, 0 markings/sec, 195 secs
lola: 166 markings, 2718 edges, 1 markings/sec, 200 secs
lola: 168 markings, 2767 edges, 0 markings/sec, 205 secs
lola: 170 markings, 2841 edges, 0 markings/sec, 210 secs
lola: 172 markings, 2892 edges, 0 markings/sec, 215 secs
lola: 175 markings, 2988 edges, 1 markings/sec, 220 secs
lola: 177 markings, 3113 edges, 0 markings/sec, 225 secs
lola: 179 markings, 3243 edges, 0 markings/sec, 230 secs
lola: 181 markings, 3245 edges, 0 markings/sec, 235 secs
lola: 183 markings, 3270 edges, 0 markings/sec, 240 secs
lola: 185 markings, 3345 edges, 0 markings/sec, 245 secs
lola: 187 markings, 3471 edges, 0 markings/sec, 250 secs
lola: 189 markings, 3549 edges, 0 markings/sec, 255 secs
lola: 191 markings, 3622 edges, 0 markings/sec, 260 secs
lola: 193 markings, 3748 edges, 0 markings/sec, 265 secs
lola: 195 markings, 3989 edges, 0 markings/sec, 270 secs
lola: 197 markings, 3991 edges, 0 markings/sec, 275 secs
lola: 199 markings, 3993 edges, 0 markings/sec, 280 secs
lola: 201 markings, 3995 edges, 0 markings/sec, 285 secs
lola: 203 markings, 4046 edges, 0 markings/sec, 290 secs
lola: 205 markings, 4073 edges, 0 markings/sec, 295 secs
lola: 207 markings, 4149 edges, 0 markings/sec, 300 secs
lola: 209 markings, 4229 edges, 0 markings/sec, 305 secs
lola: 211 markings, 4282 edges, 0 markings/sec, 310 secs
lola: 213 markings, 4358 edges, 0 markings/sec, 315 secs
lola: 215 markings, 4463 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)
----- Kill lola and sara stderr -----
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 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="Dekker-PT-200"
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/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-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 r234-blw3-152732475700031"
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 ;