fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r019-qhx1-152646243600116
Last Updated
June 26, 2018

About the Execution of Irma.struct for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2164.540 269448.00 281918.00 6901.60 ???????????????? 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 280K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 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 15K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 113K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is AutoFlight-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r019-qhx1-152646243600116
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526803501046


BK_STOP 1526803770494

--------------------
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 AutoFlight-PT-05b as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', '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': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1366607, 'Memory': 4301.99, 'Tool': 'lola'}, {'Time': 1366759, 'Memory': 4213.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola AutoFlight-PT-05b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
AutoFlight-PT-05b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ AutoFlight-PT-05b @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 962/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 482 places, 480 transitions, 448 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 535 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-05b-CTLFireability.task
lola: ((A (X (NOT FIREABLE(t253))) AND E (F ((FIREABLE(t153) AND FIREABLE(t77))))) AND (FIREABLE(t30) OR A (F ((NOT FIREABLE(t477) OR NOT FIREABLE(t435)))))) : (E (G (((NOT FIREABLE(t49) OR NOT FIREABLE(t243)) AND NOT FIREABLE(t12)))) AND NOT((E ((FIREABLE(t59) U FIREABLE(t290))) OR (E (F (FIREABLE(t96))) AND A (G (FIREABLE(t25))))))) : A ((E (F ((FIREABLE(t288) AND FIREABLE(t15)))) U FIREABLE(t393))) : ((A (F ((FIREABLE(t444) AND FIREABLE(t6) AND FIREABLE(t474) AND FIREABLE(t431)))) OR A (X ((FIREABLE(t141) AND FIREABLE(t249) AND FIREABLE(t479) AND FIREABLE(t462))))) AND (((FIREABLE(t48) OR FIREABLE(t455)) OR NOT(E (F (FIREABLE(t358))))) OR (E (G ((FIREABLE(t411) AND FIREABLE(t181)))) AND A (X ((FIREABLE(t337) OR FIREABLE(t294))))))) : ((E (F ((FIREABLE(t150) AND FIREABLE(t376) AND NOT FIREABLE(t421)))) OR FIREABLE(t274)) AND (A (X ((NOT FIREABLE(t371) OR NOT FIREABLE(t296)))) OR NOT((A (X (FIREABLE(t113))) OR A (X (FIREABLE(t343))))))) : NOT(A (F ((A (X (FIREABLE(t225))) OR FIREABLE(t309))))) : NOT(E (F (((FIREABLE(t447) OR FIREABLE(t263) OR (FIREABLE(t382) AND FIREABLE(t168))) AND A (X (FIREABLE(t65))))))) : NOT(A ((((FIREABLE(t463) OR FIREABLE(t16)) AND FIREABLE(t185)) U A (F (FIREABLE(t380)))))) : E (((FIREABLE(t458) AND FIREABLE(t161)) U A (F (FIREABLE(t253))))) : E (G (A (F ((FIREABLE(t252) AND FIREABLE(t317) AND (FIREABLE(t403) OR FIREABLE(t106))))))) : A (F (E (G ((FIREABLE(t333) OR FIREABLE(t55) OR FIREABLE(t196)))))) : A ((((NOT FIREABLE(t134) OR NOT FIREABLE(t360)) AND NOT FIREABLE(t415)) U FIREABLE(t33))) : E (X (A (F (A (F (FIREABLE(t334))))))) : E (F (FIREABLE(t260))) : E (F (((FIREABLE(t63) AND (FIREABLE(t476) OR NOT FIREABLE(t80))) AND E (F ((FIREABLE(t173) AND FIREABLE(t135))))))) : A (X (A (G (A (F (FIREABLE(t107)))))))
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 (X (NOT FIREABLE(t253))) AND E (F ((FIREABLE(t153) AND FIREABLE(t77))))) AND (FIREABLE(t30) OR A (F ((NOT FIREABLE(t477) OR NOT FIREABLE(t435))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(t253)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(t253)))
lola: processed formula: A (X (NOT FIREABLE(t253)))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t153) AND FIREABLE(t77))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1124 markings, 1134 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t30)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t30)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t477) OR NOT FIREABLE(t435))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t477) OR NOT FIREABLE(t435))))
lola: processed formula: A (F ((NOT FIREABLE(t477) OR NOT FIREABLE(t435))))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((NOT FIREABLE(t49) OR NOT FIREABLE(t243)) AND NOT FIREABLE(t12)))) AND NOT((E ((FIREABLE(t59) U FIREABLE(t290))) OR (E (F (FIREABLE(t96))) AND A (G (FIREABLE(t25)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(t49) OR NOT FIREABLE(t243)) AND NOT FIREABLE(t12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FIREABLE(t49) AND FIREABLE(t243)) OR FIREABLE(t12))))
lola: processed formula length: 69
lola: 14 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 239 markings, 238 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t59) R NOT FIREABLE(t290)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((NOT FIREABLE(t59) R NOT FIREABLE(t290)))
lola: processed formula: A ((NOT FIREABLE(t59) R NOT FIREABLE(t290)))
lola: processed formula length: 44
lola: 12 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t96)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t25)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((FIREABLE(t288) AND FIREABLE(t15)))) U FIREABLE(t393)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (FIREABLE(t288) AND FIREABLE(t15))) U FIREABLE(t393))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 482 places; total mentions: 0
lola: closed formula file AutoFlight-PT-05b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 419880 markings, 1819087 edges, 3689329903141912576 markings/sec, 0 secs
lola: 760513 markings, 3650714 edges, 68127 markings/sec, 5 secs
lola: 1138875 markings, 5458461 edges, 75672 markings/sec, 10 secs
lola: 1453049 markings, 7286090 edges, 62835 markings/sec, 15 secs
lola: 1792718 markings, 9101677 edges, 67934 markings/sec, 20 secs
lola: 2124580 markings, 10931218 edges, 66372 markings/sec, 25 secs
lola: 2432494 markings, 12753483 edges, 61583 markings/sec, 30 secs
lola: 2737177 markings, 14516526 edges, 60937 markings/sec, 35 secs
lola: 3008740 markings, 16281239 edges, 54313 markings/sec, 40 secs
lola: 3269079 markings, 18060826 edges, 52068 markings/sec, 45 secs
lola: 3620553 markings, 19882159 edges, 70295 markings/sec, 50 secs
lola: 3938750 markings, 21731284 edges, 63639 markings/sec, 55 secs
lola: 4254177 markings, 23534119 edges, 63085 markings/sec, 60 secs
lola: 4551864 markings, 25364227 edges, 59537 markings/sec, 65 secs
lola: 4820817 markings, 27151057 edges, 53791 markings/sec, 70 secs
lola: 5125649 markings, 28937693 edges, 60966 markings/sec, 75 secs
lola: 5425759 markings, 30718838 edges, 60022 markings/sec, 80 secs
lola: 5708213 markings, 32505208 edges, 56491 markings/sec, 85 secs
lola: 5972736 markings, 34257980 edges, 52905 markings/sec, 90 secs
lola: 6195428 markings, 35983629 edges, 44538 markings/sec, 95 secs
lola: 6407331 markings, 37774327 edges, 42381 markings/sec, 100 secs
lola: 6762625 markings, 39510909 edges, 71059 markings/sec, 105 secs
lola: 7124515 markings, 41279330 edges, 72378 markings/sec, 110 secs
lola: 7464837 markings, 43063488 edges, 68064 markings/sec, 115 secs
lola: 7805624 markings, 44867559 edges, 68157 markings/sec, 120 secs
lola: 8095695 markings, 46653006 edges, 58014 markings/sec, 125 secs
lola: 8441964 markings, 48441535 edges, 69254 markings/sec, 130 secs
lola: 8746445 markings, 50253297 edges, 60896 markings/sec, 135 secs
lola: 9076223 markings, 52048314 edges, 65956 markings/sec, 140 secs
lola: 9371470 markings, 53861997 edges, 59049 markings/sec, 145 secs
lola: 9613232 markings, 55676957 edges, 48352 markings/sec, 150 secs
lola: 9958473 markings, 57446501 edges, 69048 markings/sec, 155 secs
lola: 10287803 markings, 59276113 edges, 65866 markings/sec, 160 secs
lola: 10602245 markings, 61093119 edges, 62888 markings/sec, 165 secs
lola: 10899567 markings, 62914116 edges, 59464 markings/sec, 170 secs
lola: 11158374 markings, 64739699 edges, 51761 markings/sec, 175 secs
lola: 11473771 markings, 66566025 edges, 63079 markings/sec, 180 secs
lola: 11789023 markings, 68388507 edges, 63050 markings/sec, 185 secs
lola: 12077711 markings, 70236997 edges, 57738 markings/sec, 190 secs
lola: 12362231 markings, 72040550 edges, 56904 markings/sec, 195 secs
lola: 12610408 markings, 73870690 edges, 49635 markings/sec, 200 secs
lola: 12832038 markings, 75714396 edges, 44326 markings/sec, 205 secs
lola: 13124794 markings, 77489738 edges, 58551 markings/sec, 210 secs
lola: 13460353 markings, 79300168 edges, 67112 markings/sec, 215 secs
lola: 13764606 markings, 81125755 edges, 60851 markings/sec, 220 secs
lola: 14074502 markings, 82858891 edges, 61979 markings/sec, 225 secs
lola: 14347349 markings, 84573916 edges, 54569 markings/sec, 230 secs
lola: 14593805 markings, 86285468 edges, 49291 markings/sec, 235 secs
lola: 14886190 markings, 88002470 edges, 58477 markings/sec, 240 secs
lola: 15183641 markings, 89829337 edges, 59490 markings/sec, 245 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: '
'
Aborted (core dumped)
FORMULA AutoFlight-PT-05b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-05b-CTLFireability-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 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="AutoFlight-PT-05b"
export BK_EXAMINATION="CTLFireability"
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/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b 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 AutoFlight-PT-05b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r019-qhx1-152646243600116"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;