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 428K
-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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 266K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is AutoFlight-PT-12b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r023-qhx1-152646247900143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526923199175


BK_STOP 1526923570366

--------------------
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-12b as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 3539587, 'Memory': 6137.5, 'Tool': 'lola'}, {'Time': 3539805, 'Memory': 6075.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola AutoFlight-PT-12b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
AutoFlight-PT-12b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ AutoFlight-PT-12b @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 2250/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1126 places, 1124 transitions, 1050 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1242 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-12b-CTLCardinality.task
lola: NOT(A (G ((((p713 <= p937) OR (p452 <= p524)) AND ((1 <= p454) OR (p947 <= p542)))))) : (E (F ((3 <= p557))) AND (E (G ((p668 <= 0))) OR A (X ((p925 + 1 <= p719))))) : NOT((E (((3 <= p85) U (3 <= p80))) OR E (F (((p191 <= p819) AND (3 <= p825)))))) : A (G (E (((2 <= p344) U (p533 <= p616))))) : NOT(A (F (((2 <= p302) AND (p1044 <= p1107) AND (p727 <= p1079))))) : A (G ((((p998 <= 1) OR (p860 <= 0)) AND (p510 <= 0)))) : (NOT(NOT(A (F ((1 <= p817))))) AND A (F (E (G ((3 <= p31)))))) : A ((A (F ((p111 <= p675))) U (3 <= p698))) : A (G (A (((p668 <= p706) U (p1057 <= p245))))) : NOT(E (((p953 <= p211) U ((p815 <= p338) AND (3 <= p855))))) : ((E (G (((p343 <= p755) AND (p394 <= p972)))) OR E (F (((p260 <= p13) AND (3 <= p62))))) OR (3 <= p875)) : (E (F (A (G ((p678 <= p311))))) AND E (X (A (F ((3 <= p173)))))) : (((p771 <= p581) AND (p241 <= p26) AND (((p1002 + 1 <= p964) AND (p927 + 1 <= p134)) OR (3 <= p363))) OR NOT(A (F ((2 <= p376))))) : (NOT(NOT(E (F ((3 <= p581))))) OR (A (X ((p675 + 1 <= p349))) AND (p620 <= p329))) : E (F ((E (G ((p513 <= p182))) AND A (G ((1 <= p1102)))))) : NOT(((p129 <= p684) AND A (F (((p91 <= p975) AND (3 <= p382))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((p713 <= p937) OR (p452 <= p524)) AND ((1 <= p454) OR (p947 <= p542))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p557))) AND (E (G ((p668 <= 0))) OR A (X ((p925 + 1 <= p719)))))
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 (F ((3 <= p557)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-12b-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-12b-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((3 <= p85) U (3 <= p80))) OR E (F (((p191 <= p819) AND (3 <= p825))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p85 <= 2) R (p80 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p85 <= 2) R (p80 <= 2)))
lola: processed formula: A (((p85 <= 2) R (p80 <= 2)))
lola: processed formula length: 29
lola: 8 rewrites
lola: formula mentions 0 of 1126 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 4 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 (((p819 + 1 <= p191) OR (p825 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-12b-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-12b-CTLCardinality-3.sara.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= p344) U (p533 <= p616)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((2 <= p344) U (p533 <= p616)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 1126 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 452 markings, 903 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((2 <= p302) AND (p1044 <= p1107) AND (p727 <= p1079)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p302) AND (p1044 <= p1107) AND (p727 <= p1079))))
lola: processed formula length: 69
lola: 5 rewrites
lola: formula mentions 0 of 1126 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: 540 markings, 539 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p998 <= 1) OR (p860 <= 0)) AND (p510 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 6 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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-12b-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 66 markings, 65 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((1 <= p817))))) AND A (F (E (G ((3 <= p31))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p817)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p817)))
lola: processed formula: A (F ((1 <= p817)))
lola: processed formula length: 19
lola: 6 rewrites
lola: formula mentions 0 of 1126 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: 284797 markings, 580071 edges, 56959 markings/sec, 0 secs
lola: 585524 markings, 1198179 edges, 60145 markings/sec, 5 secs
lola: 871100 markings, 1820819 edges, 57115 markings/sec, 10 secs
lola: 1159842 markings, 2431827 edges, 57748 markings/sec, 15 secs
lola: 1456211 markings, 3045545 edges, 59274 markings/sec, 20 secs
lola: 1741503 markings, 3655607 edges, 57058 markings/sec, 25 secs
lola: 2016582 markings, 4266873 edges, 55016 markings/sec, 30 secs
lola: 2320146 markings, 4893991 edges, 60713 markings/sec, 35 secs
lola: 2622817 markings, 5515336 edges, 60534 markings/sec, 40 secs
lola: 2908236 markings, 6138010 edges, 57084 markings/sec, 45 secs
lola: 3204719 markings, 6761521 edges, 59297 markings/sec, 50 secs
lola: 3513578 markings, 7397775 edges, 61772 markings/sec, 55 secs
lola: 3814145 markings, 8045747 edges, 60113 markings/sec, 60 secs
lola: 4121137 markings, 8712194 edges, 61398 markings/sec, 65 secs
lola: 4442891 markings, 9374439 edges, 64351 markings/sec, 70 secs
lola: 4743692 markings, 10011488 edges, 60160 markings/sec, 75 secs
lola: 5046364 markings, 10679363 edges, 60534 markings/sec, 80 secs
lola: 5375798 markings, 11356901 edges, 65887 markings/sec, 85 secs
lola: 5699082 markings, 12032146 edges, 64657 markings/sec, 90 secs
lola: 6004832 markings, 12709614 edges, 61150 markings/sec, 95 secs
lola: 6331554 markings, 13387677 edges, 65344 markings/sec, 100 secs
lola: 6660995 markings, 14068941 edges, 65888 markings/sec, 105 secs
lola: 6972293 markings, 14750819 edges, 62260 markings/sec, 110 secs
lola: 7286191 markings, 15403991 edges, 62780 markings/sec, 115 secs
lola: 7599257 markings, 16049478 edges, 62613 markings/sec, 120 secs
lola: 7917120 markings, 16743175 edges, 63573 markings/sec, 125 secs
lola: 8245137 markings, 17434677 edges, 65603 markings/sec, 130 secs
lola: 8580205 markings, 18128037 edges, 67014 markings/sec, 135 secs
lola: 8898481 markings, 18819502 edges, 63655 markings/sec, 140 secs
lola: 9226718 markings, 19513625 edges, 65647 markings/sec, 145 secs
lola: 9564399 markings, 20210879 edges, 67536 markings/sec, 150 secs
lola: 9881030 markings, 20896181 edges, 63326 markings/sec, 155 secs
lola: 10205593 markings, 21586597 edges, 64913 markings/sec, 160 secs
lola: 10511688 markings, 22218074 edges, 61219 markings/sec, 165 secs
lola: 10807293 markings, 22854345 edges, 59121 markings/sec, 170 secs
lola: 11095676 markings, 23484111 edges, 57677 markings/sec, 175 secs
lola: 11401369 markings, 24116014 edges, 61139 markings/sec, 180 secs
lola: 11708183 markings, 24757332 edges, 61363 markings/sec, 185 secs
lola: 11994668 markings, 25386985 edges, 57297 markings/sec, 190 secs
lola: 12299721 markings, 26020508 edges, 61011 markings/sec, 195 secs
lola: 12602367 markings, 26644697 edges, 60529 markings/sec, 200 secs
lola: 12890834 markings, 27269552 edges, 57693 markings/sec, 205 secs
lola: 13181709 markings, 27894744 edges, 58175 markings/sec, 210 secs
lola: 13479616 markings, 28510110 edges, 59581 markings/sec, 215 secs
lola: 13768129 markings, 29121032 edges, 57703 markings/sec, 220 secs
lola: 14040693 markings, 29727723 edges, 54513 markings/sec, 225 secs
lola: 14338189 markings, 30339612 edges, 59499 markings/sec, 230 secs
lola: 14644238 markings, 30969507 edges, 61210 markings/sec, 235 secs
lola: 14931182 markings, 31595082 edges, 57389 markings/sec, 240 secs
lola: 15229549 markings, 32225533 edges, 59673 markings/sec, 245 secs
lola: 15535840 markings, 32857110 edges, 61258 markings/sec, 250 secs
lola: 15831508 markings, 33493961 edges, 59134 markings/sec, 255 secs
lola: 16139440 markings, 34163556 edges, 61586 markings/sec, 260 secs
lola: 16463783 markings, 34832855 edges, 64869 markings/sec, 265 secs
lola: 16778570 markings, 35495753 edges, 62957 markings/sec, 270 secs
lola: 17072158 markings, 36149256 edges, 58718 markings/sec, 275 secs
lola: 17396416 markings, 36815997 edges, 64852 markings/sec, 280 secs
lola: 17718650 markings, 37484241 edges, 64447 markings/sec, 285 secs
lola: 18005408 markings, 38113040 edges, 57352 markings/sec, 290 secs
lola: 18312204 markings, 38753304 edges, 61359 markings/sec, 295 secs
lola: 18622297 markings, 39393019 edges, 62019 markings/sec, 300 secs
lola: 18911898 markings, 40019795 edges, 57920 markings/sec, 305 secs
lola: 19203766 markings, 40647719 edges, 58374 markings/sec, 310 secs
lola: 19511204 markings, 41281639 edges, 61488 markings/sec, 315 secs
lola: 19818590 markings, 41937337 edges, 61477 markings/sec, 320 secs
lola: 20119562 markings, 42595612 edges, 60194 markings/sec, 325 secs
lola: 20460826 markings, 43297469 edges, 68253 markings/sec, 330 secs
lola: 20796280 markings, 44004224 edges, 67091 markings/sec, 335 secs
lola: 21109204 markings, 44694260 edges, 62585 markings/sec, 340 secs
lola: 21449602 markings, 45392370 edges, 68080 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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-12b-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12b-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished 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-12b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-12b.tgz
mv AutoFlight-PT-12b 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-structural"
echo " Input is AutoFlight-PT-12b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r023-qhx1-152646247900143"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;