fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r262-csrt-152732586800122
Last Updated
June 26, 2018

About the Execution of M4M.full for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3110.270 356369.00 360057.00 150.20 ???????????????? 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 592K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 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.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 427K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r262-csrt-152732586800122
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527525541494


BK_STOP 1527525897863

--------------------
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 Parking-PT-864 as instance name.
Using Parking as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 272439, 'Memory': 2858.29, 'Tool': 'lola'}, {'Time': 272479, 'Memory': 2863.94, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola Parking-PT-864...

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


checking for too many tokens
===========================================================================================
Parking-PT-864: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ Parking-PT-864 @ 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: 2882/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1185 places, 1697 transitions, 905 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1146 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-864-LTLFireability.task
lola: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229)))))) : A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397)))))) : A (X (FIREABLE(t1231))) : A (X (X (FIREABLE(t760)))) : A (X (G (G (X (F (FIREABLE(t1600))))))) : A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473)))))) : A (G (X (G (G (F (FIREABLE(t199))))))) : A (X (((FIREABLE(t1256) U FIREABLE(t1512)) U X (F (FIREABLE(t1618)))))) : A ((G (FIREABLE(t1244)) U F (G (X (FIREABLE(t1262)))))) : A (F (F ((G (FIREABLE(t646)) U FIREABLE(t431))))) : A (FIREABLE(t466)) : A (F ((F (G (FIREABLE(t932))) U X (X (FIREABLE(t463)))))) : A (F (X (X (FIREABLE(t274))))) : A (FIREABLE(t468)) : A (F (((FIREABLE(t1151) U FIREABLE(t917)) U X (FIREABLE(t1491))))) : A (FIREABLE(t431))
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 (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: processed formula: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 234 markings, 235 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: processed formula: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 25 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 18 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: 444 markings, 444 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t1231)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t1231)))
lola: processed formula: A (X (FIREABLE(t1231)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t760))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t760))))
lola: processed formula: A (X (X (FIREABLE(t760))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 20 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: 449 markings, 455 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: processed formula: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: processed formula: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: processed formula: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 231969 markings, 1696461 edges, 46394 markings/sec, 0 secs
lola: 430151 markings, 3321572 edges, 39636 markings/sec, 5 secs
lola: 623247 markings, 4968877 edges, 38619 markings/sec, 10 secs
lola: 802485 markings, 6562169 edges, 35848 markings/sec, 15 secs
lola: 972217 markings, 8152825 edges, 33946 markings/sec, 20 secs
lola: 1154199 markings, 9761608 edges, 36396 markings/sec, 25 secs
lola: 1329729 markings, 11321165 edges, 35106 markings/sec, 30 secs
lola: 1502389 markings, 12944626 edges, 34532 markings/sec, 35 secs
lola: 1684969 markings, 14681619 edges, 36516 markings/sec, 40 secs
lola: 1861505 markings, 16414977 edges, 35307 markings/sec, 45 secs
lola: 2024016 markings, 18117304 edges, 32502 markings/sec, 50 secs
lola: 2200295 markings, 19728472 edges, 35256 markings/sec, 55 secs
lola: 2381725 markings, 21332100 edges, 36286 markings/sec, 60 secs
lola: 2550121 markings, 22931828 edges, 33679 markings/sec, 65 secs
lola: 2726485 markings, 24608521 edges, 35273 markings/sec, 70 secs
lola: 2893135 markings, 26250594 edges, 33330 markings/sec, 75 secs
lola: 3052028 markings, 27900388 edges, 31779 markings/sec, 80 secs
lola: 3219625 markings, 29555236 edges, 33519 markings/sec, 85 secs
lola: 3385903 markings, 31212884 edges, 33256 markings/sec, 90 secs
lola: 3551511 markings, 32885036 edges, 33122 markings/sec, 95 secs
lola: 3709579 markings, 34563131 edges, 31614 markings/sec, 100 secs
lola: 3867131 markings, 36244050 edges, 31510 markings/sec, 105 secs
lola: 4016589 markings, 37900892 edges, 29892 markings/sec, 110 secs
lola: 4149747 markings, 39490723 edges, 26632 markings/sec, 115 secs
lola: 4346719 markings, 41157074 edges, 39394 markings/sec, 120 secs
lola: 4531594 markings, 42837456 edges, 36975 markings/sec, 125 secs
lola: 4695881 markings, 44456605 edges, 32857 markings/sec, 130 secs
lola: 4866921 markings, 46038811 edges, 34208 markings/sec, 135 secs
lola: 5023795 markings, 47609886 edges, 31375 markings/sec, 140 secs
lola: 5176727 markings, 49257689 edges, 30586 markings/sec, 145 secs
lola: 5356917 markings, 50959899 edges, 36038 markings/sec, 150 secs
lola: 5525519 markings, 52652286 edges, 33720 markings/sec, 155 secs
lola: 5681940 markings, 54301769 edges, 31284 markings/sec, 160 secs
lola: 5842403 markings, 55975674 edges, 32093 markings/sec, 165 secs
lola: 5995013 markings, 57642263 edges, 30522 markings/sec, 170 secs
lola: 6140985 markings, 59269910 edges, 29194 markings/sec, 175 secs
lola: 6290391 markings, 60918252 edges, 29881 markings/sec, 180 secs
lola: 6466265 markings, 62602966 edges, 35175 markings/sec, 185 secs
lola: 6626459 markings, 64235129 edges, 32039 markings/sec, 190 secs
lola: 6782087 markings, 65907502 edges, 31126 markings/sec, 195 secs
lola: 6941015 markings, 67538075 edges, 31786 markings/sec, 200 secs
lola: 7090425 markings, 69188709 edges, 29882 markings/sec, 205 secs
lola: 7225849 markings, 70751321 edges, 27085 markings/sec, 210 secs
lola: 7376063 markings, 72377188 edges, 30043 markings/sec, 215 secs
lola: 7533051 markings, 74091918 edges, 31398 markings/sec, 220 secs
lola: 7686433 markings, 75789898 edges, 30676 markings/sec, 225 secs
lola: 7830477 markings, 77485559 edges, 28809 markings/sec, 230 secs
lola: 7979165 markings, 79163489 edges, 29738 markings/sec, 235 secs
lola: 8106423 markings, 80693740 edges, 25452 markings/sec, 240 secs
lola: 8237291 markings, 82311073 edges, 26174 markings/sec, 245 secs
lola: 8385967 markings, 83946871 edges, 29735 markings/sec, 250 secs
lola: 8570127 markings, 85552142 edges, 36832 markings/sec, 255 secs
lola: 8752041 markings, 87215295 edges, 36383 markings/sec, 260 secs
lola: 8931033 markings, 88922579 edges, 35798 markings/sec, 265 secs
lola: 9104025 markings, 90652737 edges, 34598 markings/sec, 270 secs
lola: 9274883 markings, 92368016 edges, 34172 markings/sec, 275 secs
lola: 9430212 markings, 93953930 edges, 31066 markings/sec, 280 secs
lola: 9602193 markings, 95621157 edges, 34396 markings/sec, 285 secs
lola: 9766623 markings, 97290100 edges, 32886 markings/sec, 290 secs
lola: 9913507 markings, 98871164 edges, 29377 markings/sec, 295 secs
lola: 10074105 markings, 100537042 edges, 32120 markings/sec, 300 secs
lola: 10230411 markings, 102256196 edges, 31261 markings/sec, 305 secs
lola: 10378465 markings, 104002806 edges, 29611 markings/sec, 310 secs
lola: 10562549 markings, 105770060 edges, 36817 markings/sec, 315 secs
lola: 10739987 markings, 107540914 edges, 35488 markings/sec, 320 secs
lola: 10903739 markings, 109305292 edges, 32750 markings/sec, 325 secs
lola: 11074988 markings, 111062162 edges, 34250 markings/sec, 330 secs
lola: 11234681 markings, 112812300 edges, 31939 markings/sec, 335 secs
lola: 11386517 markings, 114560641 edges, 30367 markings/sec, 340 secs
lola: 11549255 markings, 116317376 edges, 32548 markings/sec, 345 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 Parking-PT-864-LTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="Parking-PT-864"
export BK_EXAMINATION="LTLFireability"
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/Parking-PT-864.tgz
mv Parking-PT-864 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 Parking-PT-864, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r262-csrt-152732586800122"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;