About the Execution of M4M.struct for AutoFlight-PT-48b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3471.550 | 758435.00 | 1481370.00 | 2841.90 | FFF?TFF?TFTTTFFT | 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 1.1M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 956K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is AutoFlight-PT-48b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r023-qhx1-152646247900173
=====================================================================
--------------------
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-48b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526928736434
BK_STOP 1526929494869
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using AutoFlight-PT-48b as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 514296, 'Memory': 2695.04, 'Tool': 'lola'}, {'Time': 517328, 'Memory': 2732.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola AutoFlight-PT-48b...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
AutoFlight-PT-48b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
AutoFlight-PT-48b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ AutoFlight-PT-48b @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7886/65536 symbol table entries, 1706 collisions
lola: preprocessing...
lola: finding significant places
lola: 3950 places, 3936 transitions, 3692 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4350 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-48b-ReachabilityCardinality.task
lola: E (F (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660)))) : A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87)))) : A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536))))) : E (F (((p1564 + 1 <= p3845) AND (1 <= p2709)))) : E (F ((1 <= p1303))) : E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547)))) : E (F ((2 <= p3223))) : A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 0))))) : A (G ((p3681 <= 1))) : E (F ((3 <= p516))) : E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 0))))) : A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414))))) : E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638)))) : E (F (((p858 + 1 <= p3228) AND (3 <= p433)))) : A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 0))))) : E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660))))
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 464 bytes per marking, with 20 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 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 37063 markings, 81671 edges, 7413 markings/sec, 0 secs
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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87))))
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 464 bytes per marking, with 20 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 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 44243 markings, 100554 edges, 8849 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 120717 markings, 324277 edges, 15295 markings/sec, 5 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536)))))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1564 + 1 <= p3845) AND (1 <= p2709))))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 63564 markings, 102640 edges, 12713 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 194773 markings, 323196 edges, 26242 markings/sec, 5 secs
lola: sara is running 10 secs || 323238 markings, 574815 edges, 25693 markings/sec, 10 secs
lola: sara is running 15 secs || 457816 markings, 812557 edges, 26916 markings/sec, 15 secs
lola: sara is running 20 secs || 583065 markings, 1071880 edges, 25050 markings/sec, 20 secs
lola: sara is running 25 secs || 705916 markings, 1321572 edges, 24570 markings/sec, 25 secs
lola: sara is running 30 secs || 829134 markings, 1568798 edges, 24644 markings/sec, 30 secs
lola: sara is running 35 secs || 963893 markings, 1815015 edges, 26952 markings/sec, 35 secs
lola: sara is running 40 secs || 1101290 markings, 2049360 edges, 27479 markings/sec, 40 secs
lola: sara is running 45 secs || 1212836 markings, 2302465 edges, 22309 markings/sec, 45 secs
lola: sara is running 50 secs || 1331813 markings, 2555288 edges, 23795 markings/sec, 50 secs
lola: sara is running 55 secs || 1450535 markings, 2787607 edges, 23744 markings/sec, 55 secs
lola: sara is running 60 secs || 1581841 markings, 3003537 edges, 26261 markings/sec, 60 secs
lola: sara is running 65 secs || 1701041 markings, 3244455 edges, 23840 markings/sec, 65 secs
lola: sara is running 70 secs || 1805760 markings, 3484754 edges, 20944 markings/sec, 70 secs
lola: sara is running 75 secs || 1937710 markings, 3744097 edges, 26390 markings/sec, 75 secs
lola: sara is running 80 secs || 2074293 markings, 3987969 edges, 27317 markings/sec, 80 secs
lola: sara is running 85 secs || 2208211 markings, 4225914 edges, 26784 markings/sec, 85 secs
lola: sara is running 90 secs || 2322323 markings, 4486515 edges, 22822 markings/sec, 90 secs
lola: sara is running 95 secs || 2442676 markings, 4736411 edges, 24071 markings/sec, 95 secs
lola: sara is running 100 secs || 2575002 markings, 4984818 edges, 26465 markings/sec, 100 secs
lola: sara is running 105 secs || 2718604 markings, 5219830 edges, 28720 markings/sec, 105 secs
lola: sara is running 110 secs || 2833501 markings, 5481394 edges, 22979 markings/sec, 110 secs
lola: sara is running 115 secs || 2956532 markings, 5744461 edges, 24606 markings/sec, 115 secs
lola: sara is running 120 secs || 3080799 markings, 5988314 edges, 24853 markings/sec, 120 secs
lola: sara is running 125 secs || 3208847 markings, 6200669 edges, 25610 markings/sec, 125 secs
lola: sara is running 130 secs || 3331682 markings, 6443693 edges, 24567 markings/sec, 130 secs
lola: sara is running 135 secs || 3441024 markings, 6694919 edges, 21868 markings/sec, 135 secs
lola: sara is running 140 secs || 3560951 markings, 6933401 edges, 23985 markings/sec, 140 secs
lola: sara is running 145 secs || 3685965 markings, 7158878 edges, 25003 markings/sec, 145 secs
lola: sara is running 150 secs || 3820817 markings, 7380131 edges, 26970 markings/sec, 150 secs
lola: sara is running 155 secs || 3946504 markings, 7591864 edges, 25137 markings/sec, 155 secs
lola: sara is running 160 secs || 4033950 markings, 7824792 edges, 17489 markings/sec, 160 secs
lola: sara is running 165 secs || 4128278 markings, 8065185 edges, 18866 markings/sec, 165 secs
lola: sara is running 170 secs || 4255266 markings, 8305644 edges, 25398 markings/sec, 170 secs
lola: sara is running 175 secs || 4380242 markings, 8541452 edges, 24995 markings/sec, 175 secs
lola: sara is running 180 secs || 4504065 markings, 8783733 edges, 24765 markings/sec, 180 secs
lola: sara is running 185 secs || 4630513 markings, 9023918 edges, 25290 markings/sec, 185 secs
lola: sara is running 190 secs || 4756931 markings, 9263617 edges, 25284 markings/sec, 190 secs
lola: sara is running 195 secs || 4879242 markings, 9499690 edges, 24462 markings/sec, 195 secs
lola: sara is running 200 secs || 4997299 markings, 9732389 edges, 23611 markings/sec, 200 secs
lola: sara is running 205 secs || 5114601 markings, 9969728 edges, 23460 markings/sec, 205 secs
lola: sara is running 210 secs || 5231814 markings, 10194830 edges, 23443 markings/sec, 210 secs
lola: sara is running 215 secs || 5358862 markings, 10404509 edges, 25410 markings/sec, 215 secs
lola: sara is running 220 secs || 5465907 markings, 10660711 edges, 21409 markings/sec, 220 secs
lola: sara is running 225 secs || 5567267 markings, 10926727 edges, 20272 markings/sec, 225 secs
lola: sara is running 230 secs || 5683285 markings, 11169942 edges, 23204 markings/sec, 230 secs
lola: sara is running 235 secs || 5809918 markings, 11407167 edges, 25327 markings/sec, 235 secs
lola: sara is running 240 secs || 5943044 markings, 11631293 edges, 26625 markings/sec, 240 secs
lola: sara is running 245 secs || 6046751 markings, 11906363 edges, 20741 markings/sec, 245 secs
lola: sara is running 250 secs || 6152824 markings, 12175538 edges, 21215 markings/sec, 250 secs
lola: sara is running 255 secs || 6278481 markings, 12424546 edges, 25131 markings/sec, 255 secs
lola: sara is running 260 secs || 6412241 markings, 12660202 edges, 26752 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1303)))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547))))
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 464 bytes per marking, with 20 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 67555 markings, 119258 edges, 13511 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 208035 markings, 374792 edges, 28096 markings/sec, 5 secs
lola: sara is running 10 secs || 342371 markings, 635100 edges, 26867 markings/sec, 10 secs
lola: sara is running 15 secs || 483491 markings, 886717 edges, 28224 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3223)))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 35677 markings, 84917 edges, 7135 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 106852 markings, 312828 edges, 14235 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 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 464 bytes per marking, with 20 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 32377 markings, 84887 edges, 6475 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 102064 markings, 298586 edges, 13937 markings/sec, 5 secs
lola: sara is running 10 secs || 169168 markings, 528548 edges, 13421 markings/sec, 10 secs
lola: sara is running 15 secs || 240620 markings, 746730 edges, 14290 markings/sec, 15 secs
lola: sara is running 20 secs || 306601 markings, 973453 edges, 13196 markings/sec, 20 secs
lola: sara is running 25 secs || 379383 markings, 1176882 edges, 14556 markings/sec, 25 secs
lola: sara is running 30 secs || 447932 markings, 1393233 edges, 13710 markings/sec, 30 secs
lola: sara is running 35 secs || 518568 markings, 1616975 edges, 14127 markings/sec, 35 secs
lola: sara is running 40 secs || 586504 markings, 1846166 edges, 13587 markings/sec, 40 secs
lola: sara is running 45 secs || 653294 markings, 2077193 edges, 13358 markings/sec, 45 secs
lola: sara is running 50 secs || 720226 markings, 2307940 edges, 13386 markings/sec, 50 secs
lola: sara is running 55 secs || 787642 markings, 2541445 edges, 13483 markings/sec, 55 secs
lola: sara is running 60 secs || 851756 markings, 2762757 edges, 12823 markings/sec, 60 secs
lola: sara is running 65 secs || 918465 markings, 2993914 edges, 13342 markings/sec, 65 secs
lola: sara is running 70 secs || 983261 markings, 3216229 edges, 12959 markings/sec, 70 secs
lola: sara is running 75 secs || 1046516 markings, 3438957 edges, 12651 markings/sec, 75 secs
lola: sara is running 80 secs || 1108432 markings, 3652384 edges, 12383 markings/sec, 80 secs
lola: sara is running 85 secs || 1175815 markings, 3887861 edges, 13477 markings/sec, 85 secs
lola: sara is running 90 secs || 1243062 markings, 4123507 edges, 13449 markings/sec, 90 secs
lola: sara is running 95 secs || 1311415 markings, 4363083 edges, 13671 markings/sec, 95 secs
lola: sara is running 100 secs || 1376493 markings, 4590948 edges, 13016 markings/sec, 100 secs
lola: sara is running 105 secs || 1441641 markings, 4817780 edges, 13030 markings/sec, 105 secs
lola: sara is running 110 secs || 1506965 markings, 5043946 edges, 13065 markings/sec, 110 secs
lola: sara is running 115 secs || 1571081 markings, 5265403 edges, 12823 markings/sec, 115 secs
lola: sara is running 120 secs || 1636850 markings, 5492022 edges, 13154 markings/sec, 120 secs
lola: sara is running 125 secs || 1698245 markings, 5704430 edges, 12279 markings/sec, 125 secs
lola: sara is running 130 secs || 1760889 markings, 5924830 edges, 12529 markings/sec, 130 secs
lola: sara is running 135 secs || 1825228 markings, 6150666 edges, 12868 markings/sec, 135 secs
lola: sara is running 140 secs || 1888399 markings, 6370507 edges, 12634 markings/sec, 140 secs
lola: sara is running 145 secs || 1951437 markings, 6589843 edges, 12608 markings/sec, 145 secs
lola: sara is running 150 secs || 2013920 markings, 6806742 edges, 12497 markings/sec, 150 secs
lola: sara is running 155 secs || 2076530 markings, 7022453 edges, 12522 markings/sec, 155 secs
lola: sara is running 160 secs || 2138756 markings, 7236656 edges, 12445 markings/sec, 160 secs
lola: sara is running 165 secs || 2199324 markings, 7448467 edges, 12114 markings/sec, 165 secs
lola: sara is running 170 secs || 2265192 markings, 7679615 edges, 13174 markings/sec, 170 secs
lola: sara is running 175 secs || 2328801 markings, 7902792 edges, 12722 markings/sec, 175 secs
lola: sara is running 180 secs || 2395208 markings, 8133445 edges, 13281 markings/sec, 180 secs
lola: sara is running 185 secs || 2460718 markings, 8359447 edges, 13102 markings/sec, 185 secs
lola: sara is running 190 secs || 2525877 markings, 8584947 edges, 13032 markings/sec, 190 secs
lola: sara is running 195 secs || 2590090 markings, 8807930 edges, 12843 markings/sec, 195 secs
lola: sara is running 200 secs || 2652865 markings, 9023552 edges, 12555 markings/sec, 200 secs
lola: sara is running 205 secs || 2719256 markings, 9258026 edges, 13278 markings/sec, 205 secs
lola: sara is running 210 secs || 2786774 markings, 9495002 edges, 13504 markings/sec, 210 secs
lola: sara is running 215 secs || 2855516 markings, 9730153 edges, 13748 markings/sec, 215 secs
lola: sara is running 220 secs || 2922798 markings, 9960097 edges, 13456 markings/sec, 220 secs
lola: sara is running 225 secs || 2987204 markings, 10186123 edges, 12881 markings/sec, 225 secs
lola: sara is running 230 secs || 3051963 markings, 10407365 edges, 12952 markings/sec, 230 secs
lola: sara is running 235 secs || 3119471 markings, 10638081 edges, 13502 markings/sec, 235 secs
lola: sara is running 240 secs || 3184812 markings, 10863887 edges, 13068 markings/sec, 240 secs
lola: sara is running 245 secs || 3250989 markings, 11093512 edges, 13235 markings/sec, 245 secs
lola: sara is running 250 secs || 3316508 markings, 11319007 edges, 13104 markings/sec, 250 secs
lola: sara is running 255 secs || 3382392 markings, 11547030 edges, 13177 markings/sec, 255 secs
lola: sara is running 260 secs || 3449160 markings, 11776644 edges, 13354 markings/sec, 260 secs
lola: sara is running 265 secs || 3514472 markings, 12001332 edges, 13062 markings/sec, 265 secs
lola: sara is running 270 secs || 3581277 markings, 12231687 edges, 13361 markings/sec, 270 secs
lola: sara is running 275 secs || 3645045 markings, 12452339 edges, 12754 markings/sec, 275 secs
lola: sara is running 280 secs || 3708394 markings, 12670700 edges, 12670 markings/sec, 280 secs
lola: sara is running 285 secs || 3769658 markings, 12882981 edges, 12253 markings/sec, 285 secs
lola: sara is running 290 secs || 3836325 markings, 13116006 edges, 13333 markings/sec, 290 secs
lola: sara is running 295 secs || 3902268 markings, 13346621 edges, 13189 markings/sec, 295 secs
lola: sara is running 300 secs || 3967931 markings, 13576063 edges, 13133 markings/sec, 300 secs
lola: sara is running 305 secs || 4032995 markings, 13803553 edges, 13013 markings/sec, 305 secs
lola: sara is running 310 secs || 4099772 markings, 14036938 edges, 13355 markings/sec, 310 secs
lola: sara is running 315 secs || 4165827 markings, 14265945 edges, 13211 markings/sec, 315 secs
lola: sara is running 320 secs || 4233283 markings, 14496319 edges, 13491 markings/sec, 320 secs
lola: sara is running 325 secs || 4297482 markings, 14718361 edges, 12840 markings/sec, 325 secs
lola: sara is running 330 secs || 4360668 markings, 14933965 edges, 12637 markings/sec, 330 secs
lola: sara is running 335 secs || 4428272 markings, 15170305 edges, 13521 markings/sec, 335 secs
lola: sara is running 340 secs || 4495836 markings, 15406066 edges, 13513 markings/sec, 340 secs
lola: sara is running 345 secs || 4562097 markings, 15637196 edges, 13252 markings/sec, 345 secs
lola: sara is running 350 secs || 4628641 markings, 15866038 edges, 13309 markings/sec, 350 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3681 <= 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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 31578 markings, 74979 edges, 6316 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 104022 markings, 302735 edges, 14489 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 9 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p516)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 187 markings, 186 edges
lola: ========================================
lola: subprocess 10 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 0)))))
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 464 bytes per marking, with 20 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: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2042 markings, 2088 edges
lola: ========================================
lola: subprocess 11 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414)))))
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 464 bytes per marking, with 20 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 107 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 711 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638))))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 13 will run for 948 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p858 + 1 <= p3228) AND (3 <= p433))))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 36001 markings, 81841 edges, 7200 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 112794 markings, 274327 edges, 15359 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 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 464 bytes per marking, with 20 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2834 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 464 bytes per marking, with 20 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-48b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown yes no no unknown yes no yes yes yes no no yes
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-48b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is AutoFlight-PT-48b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r023-qhx1-152646247900173"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;