About the Execution of M4M.struct for DLCround-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12568.640 | 784579.00 | 786975.00 | 2762.90 | ???????????????? | 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 644K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K 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.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 479K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DLCround-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649743900073
=====================================================================
--------------------
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 DLCround-PT-08a-CTLCardinality-00
FORMULA_NAME DLCround-PT-08a-CTLCardinality-01
FORMULA_NAME DLCround-PT-08a-CTLCardinality-02
FORMULA_NAME DLCround-PT-08a-CTLCardinality-03
FORMULA_NAME DLCround-PT-08a-CTLCardinality-04
FORMULA_NAME DLCround-PT-08a-CTLCardinality-05
FORMULA_NAME DLCround-PT-08a-CTLCardinality-06
FORMULA_NAME DLCround-PT-08a-CTLCardinality-07
FORMULA_NAME DLCround-PT-08a-CTLCardinality-08
FORMULA_NAME DLCround-PT-08a-CTLCardinality-09
FORMULA_NAME DLCround-PT-08a-CTLCardinality-10
FORMULA_NAME DLCround-PT-08a-CTLCardinality-11
FORMULA_NAME DLCround-PT-08a-CTLCardinality-12
FORMULA_NAME DLCround-PT-08a-CTLCardinality-13
FORMULA_NAME DLCround-PT-08a-CTLCardinality-14
FORMULA_NAME DLCround-PT-08a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526672013396
BK_STOP 1526672797975
--------------------
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 DLCround-PT-08a as instance name.
Using DLCround 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': 5079, 'Memory': 326.25, 'Tool': 'itstools'}, {'Time': 223642, 'Memory': 4096.14, 'Tool': 'gspn'}, {'Time': 573383, 'Memory': 4388.86, 'Tool': 'marcie'}, {'Time': 2190334, 'Memory': 15950.03, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 431.253002559559x far from the best tool itstools.
CTLCardinality lola DLCround-PT-08a...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCround-PT-08a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCround-PT-08a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DLCround-PT-08a @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 139 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2170/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 1907 transitions, 106 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-08a-CTLCardinality.task
lola: ((E (F ((3 <= p128))) AND E (F (((3 <= p172) OR (3 <= p203))))) OR E (X (((p185 + 1 <= p255) OR (p227 <= 0))))) : ((((p31 <= p195) OR A (F ((p62 <= p117)))) OR A (G ((p241 <= 2)))) AND E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231))))) : (E (((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))) AND E (F (E (X (TRUE))))) : NOT((E (X ((p45 <= p46))) AND NOT(A (G ((p21 <= p232)))))) : (NOT(E (G (((2 <= p24) AND (p160 <= p55))))) AND A (G ((p197 <= p125)))) : ((NOT(E (F ((2 <= p262)))) AND E (F (((2 <= p193) OR (1 <= p164))))) AND E (F (((p99 <= 2) OR (p140 + 1 <= p223))))) : A (G (E (X (((p127 <= p164) OR (1 <= p189)))))) : E (F ((((p122 <= p97) AND (p253 + 1 <= p199)) AND E (X ((2 <= p182)))))) : E (F (A (G (((2 <= p83) OR (p121 <= p212)))))) : E (F (NOT(E (F ((1 <= p200)))))) : (NOT(NOT(A (G ((p63 <= p237))))) OR (((1 <= p47) OR A (X ((p55 <= p236)))) AND ((1 <= p258) AND (p84 <= p104) AND (p127 <= p96) AND (p172 <= p187) AND (p183 <= p115)))) : E ((E (X ((p169 <= p234))) U ((p66 <= p141) AND (2 <= p253) AND (1 <= p151) AND (p130 <= p47)))) : E ((((1 <= p197) OR (3 <= p114) OR (3 <= p190) OR (p192 <= p248)) U (((2 <= p257) AND (p238 <= p100)) OR ((3 <= p141) AND (p10 <= p53))))) : (NOT(E (F (((1 <= p160) AND (2 <= p242))))) AND A (F (((p92 <= 1) AND (p28 <= 0))))) : A (G (E (X (((p228 <= p198) OR (p108 <= p100)))))) : E (((p56 <= p225) U E (X ((2 <= p260)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((3 <= p128))) AND E (F (((3 <= p172) OR (3 <= p203))))) OR E (X (((p185 + 1 <= p255) OR (p227 <= 0)))))
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: E (F ((3 <= p128)))
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 16 bytes per marking, with 22 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p185 + 1 <= p255) OR (p227 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p185 + 1 <= p255) OR (p227 <= 0)))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p31 <= p195) OR A (F ((p62 <= p117)))) OR A (G ((p241 <= 2)))) AND E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231)))))
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: (p31 <= p195)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p31 <= p195)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p42 <= 1) U ((3 <= p184) AND (p194 <= p231)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 146308 markings, 6233927 edges, 29249 markings/sec, 0 secs
lola: 304920 markings, 12908695 edges, 31722 markings/sec, 5 secs
lola: 452170 markings, 19233795 edges, 29450 markings/sec, 10 secs
lola: 604880 markings, 25663337 edges, 30542 markings/sec, 15 secs
lola: 759835 markings, 32261291 edges, 30991 markings/sec, 20 secs
lola: 915634 markings, 38807808 edges, 31160 markings/sec, 25 secs
lola: 1067199 markings, 45285016 edges, 30313 markings/sec, 30 secs
lola: 1222398 markings, 51946271 edges, 31040 markings/sec, 35 secs
lola: 1373544 markings, 58833500 edges, 30229 markings/sec, 40 secs
lola: 1512324 markings, 65025770 edges, 27756 markings/sec, 45 secs
lola: 1662379 markings, 71783654 edges, 30011 markings/sec, 50 secs
lola: 1810154 markings, 78413242 edges, 29555 markings/sec, 55 secs
lola: 1955878 markings, 84993551 edges, 29145 markings/sec, 60 secs
lola: 2100939 markings, 91564918 edges, 29012 markings/sec, 65 secs
lola: 2250529 markings, 98307739 edges, 29918 markings/sec, 70 secs
lola: 2403588 markings, 104884092 edges, 30612 markings/sec, 75 secs
lola: 2553245 markings, 111263698 edges, 29931 markings/sec, 80 secs
lola: 2695438 markings, 117725535 edges, 28439 markings/sec, 85 secs
lola: 2841841 markings, 124353964 edges, 29281 markings/sec, 90 secs
lola: 2983465 markings, 130748850 edges, 28325 markings/sec, 95 secs
lola: 3125817 markings, 137135569 edges, 28470 markings/sec, 100 secs
lola: 3267340 markings, 143431345 edges, 28305 markings/sec, 105 secs
lola: 3407720 markings, 149788273 edges, 28076 markings/sec, 110 secs
lola: 3559696 markings, 156615071 edges, 30395 markings/sec, 115 secs
lola: 3710829 markings, 163422541 edges, 30227 markings/sec, 120 secs
lola: 3859420 markings, 170111385 edges, 29718 markings/sec, 125 secs
lola: 4007268 markings, 176744836 edges, 29570 markings/sec, 130 secs
lola: 4156470 markings, 183417834 edges, 29840 markings/sec, 135 secs
lola: 4300889 markings, 189924665 edges, 28884 markings/sec, 140 secs
lola: 4447802 markings, 196412889 edges, 29383 markings/sec, 145 secs
lola: 4596230 markings, 203124770 edges, 29686 markings/sec, 150 secs
lola: 4744042 markings, 209663799 edges, 29562 markings/sec, 155 secs
lola: 4894148 markings, 216135446 edges, 30021 markings/sec, 160 secs
lola: 5036320 markings, 222589859 edges, 28434 markings/sec, 165 secs
lola: 5177551 markings, 228996355 edges, 28246 markings/sec, 170 secs
lola: 5318258 markings, 235360306 edges, 28141 markings/sec, 175 secs
lola: 5458283 markings, 241726541 edges, 28005 markings/sec, 180 secs
lola: 5604469 markings, 248034242 edges, 29237 markings/sec, 185 secs
lola: 5745024 markings, 254431740 edges, 28111 markings/sec, 190 secs
lola: 5885893 markings, 260751781 edges, 28174 markings/sec, 195 secs
lola: 6025915 markings, 267079652 edges, 28004 markings/sec, 200 secs
lola: 6163465 markings, 273349421 edges, 27510 markings/sec, 205 secs
lola: 6304899 markings, 279727799 edges, 28287 markings/sec, 210 secs
lola: 6444358 markings, 285950432 edges, 27892 markings/sec, 215 secs
lola: 6582447 markings, 292166596 edges, 27618 markings/sec, 220 secs
lola: 6727660 markings, 298715788 edges, 29043 markings/sec, 225 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
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))) AND E (F (E (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 193668 markings, 7155575 edges, 3689329903141912576 markings/sec, 0 secs
lola: 380617 markings, 14101532 edges, 37390 markings/sec, 5 secs
lola: 563546 markings, 20836987 edges, 36586 markings/sec, 10 secs
lola: 743218 markings, 27456333 edges, 35934 markings/sec, 15 secs
lola: 921699 markings, 34165489 edges, 35696 markings/sec, 20 secs
lola: 1098008 markings, 41099867 edges, 35262 markings/sec, 25 secs
lola: 1271110 markings, 47846518 edges, 34620 markings/sec, 30 secs
lola: 1441168 markings, 54555841 edges, 34012 markings/sec, 35 secs
lola: 1611280 markings, 61247341 edges, 34022 markings/sec, 40 secs
lola: 1787665 markings, 68139526 edges, 35277 markings/sec, 45 secs
lola: 1963213 markings, 74980610 edges, 35110 markings/sec, 50 secs
lola: 2134971 markings, 81716406 edges, 34352 markings/sec, 55 secs
lola: 2302416 markings, 88316612 edges, 33489 markings/sec, 60 secs
lola: 2468885 markings, 94926578 edges, 33294 markings/sec, 65 secs
lola: 2638890 markings, 101564176 edges, 34001 markings/sec, 70 secs
lola: 2809472 markings, 108217621 edges, 34116 markings/sec, 75 secs
lola: 2983940 markings, 114784353 edges, 34894 markings/sec, 80 secs
lola: 3150061 markings, 121241451 edges, 33224 markings/sec, 85 secs
lola: 3319740 markings, 127631869 edges, 33936 markings/sec, 90 secs
lola: 3481578 markings, 134038940 edges, 32368 markings/sec, 95 secs
lola: 3674440 markings, 140947618 edges, 38572 markings/sec, 100 secs
lola: 3868504 markings, 147648664 edges, 38813 markings/sec, 105 secs
lola: 4055770 markings, 154188426 edges, 37453 markings/sec, 110 secs
lola: 4247114 markings, 160677121 edges, 38269 markings/sec, 115 secs
lola: 4432276 markings, 167127703 edges, 37032 markings/sec, 120 secs
lola: 4629008 markings, 173796964 edges, 39346 markings/sec, 125 secs
lola: 4817124 markings, 180225436 edges, 37623 markings/sec, 130 secs
lola: 5001331 markings, 186668956 edges, 36841 markings/sec, 135 secs
lola: 5187897 markings, 193072736 edges, 37313 markings/sec, 140 secs
lola: 5370865 markings, 199344732 edges, 36594 markings/sec, 145 secs
lola: 5554417 markings, 205622529 edges, 36710 markings/sec, 150 secs
lola: 5732098 markings, 211890374 edges, 35536 markings/sec, 155 secs
lola: 5919345 markings, 218213792 edges, 37449 markings/sec, 160 secs
lola: 6094549 markings, 224402053 edges, 35041 markings/sec, 165 secs
lola: 6271331 markings, 230609207 edges, 35356 markings/sec, 170 secs
lola: 6454042 markings, 236990774 edges, 36542 markings/sec, 175 secs
lola: 6634099 markings, 243197575 edges, 36011 markings/sec, 180 secs
lola: 6823971 markings, 249748892 edges, 37974 markings/sec, 185 secs
lola: 7007497 markings, 256085563 edges, 36705 markings/sec, 190 secs
lola: 7182157 markings, 262145752 edges, 34932 markings/sec, 195 secs
lola: 7355125 markings, 268205939 edges, 34594 markings/sec, 200 secs
lola: 7518075 markings, 274000027 edges, 32590 markings/sec, 205 secs
lola: 7689635 markings, 279973430 edges, 34312 markings/sec, 210 secs
lola: 7860920 markings, 285722655 edges, 34257 markings/sec, 215 secs
lola: 8024756 markings, 291534848 edges, 32767 markings/sec, 220 secs
lola: 8196904 markings, 298160783 edges, 34430 markings/sec, 225 secs
lola: 8369097 markings, 304881853 edges, 34439 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((p45 <= p46))) AND NOT(A (G ((p21 <= p232))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p46 + 1 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p46 + 1 <= p45)))
lola: processed formula: A (X ((p46 + 1 <= p45)))
lola: processed formula length: 24
lola: 10 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p21 <= p232)))
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 16 bytes per marking, with 22 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 DLCround-PT-08a-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08a-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((2 <= p24) AND (p160 <= p55))))) AND A (G ((p197 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: processed formula: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p197 <= p125)))
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 16 bytes per marking, with 22 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 DLCround-PT-08a-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((2 <= p262)))) AND E (F (((2 <= p193) OR (1 <= p164))))) AND E (F (((p99 <= 2) OR (p140 + 1 <= p223)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p262 <= 1)))
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 16 bytes per marking, with 22 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-5.sara
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p193) OR (1 <= p164))))
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 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p99 <= 2) OR (p140 + 1 <= p223))))
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 16 bytes per marking, with 22 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-7.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p127 <= p164) OR (1 <= p189))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p127 <= p164) OR (1 <= p189))))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 142172 markings, 6050129 edges, 3689348869717491712 markings/sec, 0 secs
lola: 283496 markings, 11979289 edges, 28265 markings/sec, 5 secs
lola: 416857 markings, 17711489 edges, 26672 markings/sec, 10 secs
lola: 550070 markings, 23377706 edges, 26643 markings/sec, 15 secs
lola: 683101 markings, 28987289 edges, 26606 markings/sec, 20 secs
lola: 816552 markings, 34587890 edges, 26690 markings/sec, 25 secs
lola: 945821 markings, 40092072 edges, 25854 markings/sec, 30 secs
lola: 1074851 markings, 45610578 edges, 25806 markings/sec, 35 secs
lola: 1204683 markings, 51177531 edges, 25966 markings/sec, 40 secs
lola: 1334967 markings, 57084154 edges, 26057 markings/sec, 45 secs
lola: 1463809 markings, 62844148 edges, 25768 markings/sec, 50 secs
lola: 1590711 markings, 68554879 edges, 25380 markings/sec, 55 secs
lola: 1716182 markings, 74210812 edges, 25094 markings/sec, 60 secs
lola: 1840858 markings, 79790816 edges, 24935 markings/sec, 65 secs
lola: 1964094 markings, 85374592 edges, 24647 markings/sec, 70 secs
lola: 2087396 markings, 90936282 edges, 24660 markings/sec, 75 secs
lola: 2214019 markings, 96641191 edges, 25325 markings/sec, 80 secs
lola: 2342729 markings, 102225156 edges, 25742 markings/sec, 85 secs
lola: 2468760 markings, 107679832 edges, 25206 markings/sec, 90 secs
lola: 2592593 markings, 113080074 edges, 24767 markings/sec, 95 secs
lola: 2715080 markings, 118608995 edges, 24497 markings/sec, 100 secs
lola: 2839183 markings, 124230566 edges, 24821 markings/sec, 105 secs
lola: 2961388 markings, 129737769 edges, 24441 markings/sec, 110 secs
lola: 3083684 markings, 135261055 edges, 24459 markings/sec, 115 secs
lola: 3205329 markings, 140651470 edges, 24329 markings/sec, 120 secs
lola: 3326945 markings, 146113053 edges, 24323 markings/sec, 125 secs
lola: 3446434 markings, 151542762 edges, 23898 markings/sec, 130 secs
lola: 3577002 markings, 157386378 edges, 26114 markings/sec, 135 secs
lola: 3703815 markings, 163118097 edges, 25363 markings/sec, 140 secs
lola: 3830128 markings, 168790328 edges, 25263 markings/sec, 145 secs
lola: 3956132 markings, 174431392 edges, 25201 markings/sec, 150 secs
lola: 4081636 markings, 180039463 edges, 25101 markings/sec, 155 secs
lola: 4206272 markings, 185653740 edges, 24927 markings/sec, 160 secs
lola: 4328907 markings, 191195889 edges, 24527 markings/sec, 165 secs
lola: 4453625 markings, 196678080 edges, 24944 markings/sec, 170 secs
lola: 4579498 markings, 202340203 edges, 25175 markings/sec, 175 secs
lola: 4701212 markings, 207850373 edges, 24343 markings/sec, 180 secs
lola: 4830810 markings, 213369572 edges, 25920 markings/sec, 185 secs
lola: 4952600 markings, 218824428 edges, 24358 markings/sec, 190 secs
lola: 5073748 markings, 224296668 edges, 24230 markings/sec, 195 secs
lola: 5193153 markings, 229700458 edges, 23881 markings/sec, 200 secs
lola: 5311848 markings, 235067973 edges, 23739 markings/sec, 205 secs
lola: 5430352 markings, 240482455 edges, 23701 markings/sec, 210 secs
lola: 5553995 markings, 245795460 edges, 24729 markings/sec, 215 secs
lola: 5672652 markings, 251151512 edges, 23731 markings/sec, 220 secs
lola: 5790270 markings, 256514266 edges, 23524 markings/sec, 225 secs
lola: 5910048 markings, 261845999 edges, 23956 markings/sec, 230 secs
lola: 6027663 markings, 267161419 edges, 23523 markings/sec, 235 secs
lola: 6143623 markings, 272466843 edges, 23192 markings/sec, 240 secs
lola: 6262328 markings, 277799387 edges, 23741 markings/sec, 245 secs
lola: 6382261 markings, 283108730 edges, 23987 markings/sec, 250 secs
lola: 6498815 markings, 288420684 edges, 23311 markings/sec, 255 secs
lola: 6616188 markings, 293709984 edges, 23475 markings/sec, 260 secs
lola: 6740372 markings, 299281387 edges, 24837 markings/sec, 265 secs
lola: 6861115 markings, 304799374 edges, 24149 markings/sec, 270 secs
lola: 6978297 markings, 310089785 edges, 23436 markings/sec, 275 secs
lola: 7116793 markings, 315689930 edges, 27699 markings/sec, 280 secs
lola: 7255347 markings, 321190205 edges, 27711 markings/sec, 285 secs
lola: 7390959 markings, 326572738 edges, 27122 markings/sec, 290 secs
lola: 7523223 markings, 331837135 edges, 26453 markings/sec, 295 secs
lola: 7658018 markings, 337179525 edges, 26959 markings/sec, 300 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
Segmentation fault (core dumped)
FORMULA DLCround-PT-08a-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-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="DLCround-PT-08a"
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/DLCround-PT-08a.tgz
mv DLCround-PT-08a 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 DLCround-PT-08a, 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 r071-smll-152649743900073"
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 '
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 ;