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

About the Execution of M4M.full for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2178.840 264629.00 282385.00 1691.00 ???????????????? 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 mcc4mcc-full
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 r022-qhx1-152646247300116
=====================================================================


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


BK_STOP 1526890045546

--------------------
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 AutoFlight-PT-05b as instance name.
Using AutoFlight as model name.
Using algorithm or tool voting-classifier.
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}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 1366607, 'Memory': 4301.99, 'Tool': 'lola'}, {'Time': 1366759, 'Memory': 4213.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola AutoFlight-PT-05b...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
CTLFireability @ AutoFlight-PT-05b @ 3538 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
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: 410842 markings, 1770012 edges, 3689329903141912576 markings/sec, 0 secs
lola: 749988 markings, 3579833 edges, 67829 markings/sec, 5 secs
lola: 1119163 markings, 5357859 edges, 73835 markings/sec, 10 secs
lola: 1434673 markings, 7157212 edges, 63102 markings/sec, 15 secs
lola: 1765457 markings, 8965292 edges, 66157 markings/sec, 20 secs
lola: 2095924 markings, 10782144 edges, 66093 markings/sec, 25 secs
lola: 2405597 markings, 12611498 edges, 61935 markings/sec, 30 secs
lola: 2721062 markings, 14430713 edges, 63093 markings/sec, 35 secs
lola: 3007526 markings, 16271753 edges, 57293 markings/sec, 40 secs
lola: 3270106 markings, 18065759 edges, 52516 markings/sec, 45 secs
lola: 3618350 markings, 19868417 edges, 69649 markings/sec, 50 secs
lola: 3933150 markings, 21708115 edges, 62960 markings/sec, 55 secs
lola: 4251105 markings, 23509176 edges, 63591 markings/sec, 60 secs
lola: 4543208 markings, 25310307 edges, 58421 markings/sec, 65 secs
lola: 4813420 markings, 27112817 edges, 54042 markings/sec, 70 secs
lola: 5125773 markings, 28938411 edges, 62471 markings/sec, 75 secs
lola: 5430758 markings, 30746806 edges, 60997 markings/sec, 80 secs
lola: 5719882 markings, 32571950 edges, 57825 markings/sec, 85 secs
lola: 5991493 markings, 34368457 edges, 54322 markings/sec, 90 secs
lola: 6215755 markings, 36149075 edges, 44852 markings/sec, 95 secs
lola: 6431716 markings, 37998405 edges, 43192 markings/sec, 100 secs
lola: 6802150 markings, 39744811 edges, 74087 markings/sec, 105 secs
lola: 7162413 markings, 41520838 edges, 72053 markings/sec, 110 secs
lola: 7513890 markings, 43297963 edges, 70295 markings/sec, 115 secs
lola: 7847237 markings, 45098953 edges, 66669 markings/sec, 120 secs
lola: 8156636 markings, 46898888 edges, 61880 markings/sec, 125 secs
lola: 8477699 markings, 48653641 edges, 64213 markings/sec, 130 secs
lola: 8767214 markings, 50380684 edges, 57903 markings/sec, 135 secs
lola: 9087823 markings, 52124951 edges, 64122 markings/sec, 140 secs
lola: 9378095 markings, 53894235 edges, 58054 markings/sec, 145 secs
lola: 9614222 markings, 55684458 edges, 47225 markings/sec, 150 secs
lola: 9957812 markings, 57442328 edges, 68718 markings/sec, 155 secs
lola: 10276224 markings, 59210308 edges, 63682 markings/sec, 160 secs
lola: 10580953 markings, 60971656 edges, 60946 markings/sec, 165 secs
lola: 10864920 markings, 62733797 edges, 56793 markings/sec, 170 secs
lola: 11131246 markings, 64514735 edges, 53265 markings/sec, 175 secs
lola: 11423116 markings, 66261300 edges, 58374 markings/sec, 180 secs
lola: 11726154 markings, 68000402 edges, 60608 markings/sec, 185 secs
lola: 12016955 markings, 69783889 edges, 58160 markings/sec, 190 secs
lola: 12279676 markings, 71549379 edges, 52544 markings/sec, 195 secs
lola: 12541246 markings, 73314238 edges, 52314 markings/sec, 200 secs
lola: 12761380 markings, 75107612 edges, 44027 markings/sec, 205 secs
lola: 12992468 markings, 76862318 edges, 46218 markings/sec, 210 secs
lola: 13332726 markings, 78650600 edges, 68052 markings/sec, 215 secs
lola: 13649492 markings, 80449225 edges, 63353 markings/sec, 220 secs
lola: 13970930 markings, 82247697 edges, 64288 markings/sec, 225 secs
lola: 14273778 markings, 84069178 edges, 60570 markings/sec, 230 secs
lola: 14516909 markings, 85893519 edges, 48626 markings/sec, 235 secs
lola: 14844526 markings, 87739641 edges, 65523 markings/sec, 240 secs
lola: 15139905 markings, 89533307 edges, 59076 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 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="AutoFlight-PT-05b"
export BK_EXAMINATION="CTLFireability"
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/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 mcc4mcc-full"
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 r022-qhx1-152646247300116"
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 ;