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-full
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 r022-qhx1-152646247300143
=====================================================================

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


BK_STOP 1526892400020

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ AutoFlight-PT-12b @ 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: 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: ========================================
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: 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
lola: 313657 markings, 645327 edges, 62731 markings/sec, 0 secs
lola: 633131 markings, 1304669 edges, 63895 markings/sec, 5 secs
lola: 943598 markings, 1983395 edges, 62093 markings/sec, 10 secs
lola: 1257112 markings, 2636498 edges, 62703 markings/sec, 15 secs
lola: 1576584 markings, 3295841 edges, 63894 markings/sec, 20 secs
lola: 1884138 markings, 3967028 edges, 61511 markings/sec, 25 secs
lola: 2201152 markings, 4636368 edges, 63403 markings/sec, 30 secs
lola: 2522504 markings, 5299861 edges, 64270 markings/sec, 35 secs
lola: 2833592 markings, 5970650 edges, 62218 markings/sec, 40 secs
lola: 3146622 markings, 6643017 edges, 62606 markings/sec, 45 secs
lola: 3474970 markings, 7317860 edges, 65670 markings/sec, 50 secs
lola: 3793394 markings, 8002368 edges, 63685 markings/sec, 55 secs
lola: 4104847 markings, 8678871 edges, 62291 markings/sec, 60 secs
lola: 4423591 markings, 9336632 edges, 63749 markings/sec, 65 secs
lola: 4738464 markings, 10000083 edges, 62975 markings/sec, 70 secs
lola: 5039033 markings, 10664686 edges, 60114 markings/sec, 75 secs
lola: 5364601 markings, 11335967 edges, 65114 markings/sec, 80 secs
lola: 5682670 markings, 11997308 edges, 63614 markings/sec, 85 secs
lola: 5988341 markings, 12671353 edges, 61134 markings/sec, 90 secs
lola: 6314819 markings, 13349830 edges, 65296 markings/sec, 95 secs
lola: 6641768 markings, 14026460 edges, 65390 markings/sec, 100 secs
lola: 6953523 markings, 14708161 edges, 62351 markings/sec, 105 secs
lola: 7280501 markings, 15391730 edges, 65396 markings/sec, 110 secs
lola: 7611841 markings, 16077070 edges, 66268 markings/sec, 115 secs
lola: 7927443 markings, 16766761 edges, 63120 markings/sec, 120 secs
lola: 8251661 markings, 17448459 edges, 64844 markings/sec, 125 secs
lola: 8583689 markings, 18135083 edges, 66406 markings/sec, 130 secs
lola: 8901093 markings, 18825131 edges, 63481 markings/sec, 135 secs
lola: 9227608 markings, 19515652 edges, 65303 markings/sec, 140 secs
lola: 9564258 markings, 20210634 edges, 67330 markings/sec, 145 secs
lola: 9885896 markings, 20907317 edges, 64328 markings/sec, 150 secs
lola: 10209352 markings, 21594598 edges, 64691 markings/sec, 155 secs
lola: 10540184 markings, 22277388 edges, 66166 markings/sec, 160 secs
lola: 10859032 markings, 22964873 edges, 63770 markings/sec, 165 secs
lola: 11178615 markings, 23651526 edges, 63917 markings/sec, 170 secs
lola: 11514334 markings, 24341278 edges, 67144 markings/sec, 175 secs
lola: 11835549 markings, 25032452 edges, 64243 markings/sec, 180 secs
lola: 12154439 markings, 25723344 edges, 63778 markings/sec, 185 secs
lola: 12481014 markings, 26394721 edges, 65315 markings/sec, 190 secs
lola: 12795577 markings, 27066217 edges, 62913 markings/sec, 195 secs
lola: 13103831 markings, 27736590 edges, 61651 markings/sec, 200 secs
lola: 13432733 markings, 28414723 edges, 65780 markings/sec, 205 secs
lola: 13755132 markings, 29092427 edges, 64480 markings/sec, 210 secs
lola: 14055739 markings, 29763360 edges, 60121 markings/sec, 215 secs
lola: 14361239 markings, 30391259 edges, 61100 markings/sec, 220 secs
lola: 14665458 markings, 31016357 edges, 60844 markings/sec, 225 secs
lola: 14955282 markings, 31649132 edges, 57965 markings/sec, 230 secs
lola: 15251978 markings, 32273098 edges, 59339 markings/sec, 235 secs
lola: 15557416 markings, 32901913 edges, 61088 markings/sec, 240 secs
lola: 15851184 markings, 33536043 edges, 58754 markings/sec, 245 secs
lola: 16137307 markings, 34159146 edges, 57225 markings/sec, 250 secs
lola: 16446192 markings, 34796044 edges, 61777 markings/sec, 255 secs
lola: 16746690 markings, 35426046 edges, 60100 markings/sec, 260 secs
lola: 17027845 markings, 36048008 edges, 56231 markings/sec, 265 secs
lola: 17334083 markings, 36682205 edges, 61248 markings/sec, 270 secs
lola: 17652445 markings, 37339625 edges, 63672 markings/sec, 275 secs
lola: 17954517 markings, 37998338 edges, 60414 markings/sec, 280 secs
lola: 18274531 markings, 38673536 edges, 64003 markings/sec, 285 secs
lola: 18603835 markings, 39352866 edges, 65861 markings/sec, 290 secs
lola: 18912354 markings, 40020796 edges, 61704 markings/sec, 295 secs
lola: 19227586 markings, 40692482 edges, 63046 markings/sec, 300 secs
lola: 19556212 markings, 41370300 edges, 65725 markings/sec, 305 secs
lola: 19867129 markings, 42040267 edges, 62183 markings/sec, 310 secs
lola: 20175694 markings, 42711660 edges, 61713 markings/sec, 315 secs
lola: 20517104 markings, 43411481 edges, 68282 markings/sec, 320 secs
lola: 20840486 markings, 44101245 edges, 64676 markings/sec, 325 secs
lola: 21156996 markings, 44788878 edges, 63302 markings/sec, 330 secs
lola: 21493430 markings, 45484554 edges, 67287 markings/sec, 335 secs
lola: 21818780 markings, 46171538 edges, 65070 markings/sec, 340 secs
lola: 22126929 markings, 46846669 edges, 61630 markings/sec, 345 secs
lola: local time limit reached - aborting
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-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-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-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-full"
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 r022-qhx1-152646247300143"
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 ;