About the Execution of Irma.full for AutoFlight-PT-48b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3461.820 | 754220.00 | 1449275.00 | 3283.20 | 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 irma4mcc-full
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 r018-qhx1-152646242900173
=====================================================================
--------------------
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 1526774483394
BK_STOP 1526775237614
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using AutoFlight-PT-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 || 34251 markings, 74540 edges, 6850 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 107705 markings, 257974 edges, 14691 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 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 || 46591 markings, 105983 edges, 9318 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 129793 markings, 345663 edges, 16640 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: 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 || 55922 markings, 90115 edges, 11184 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 182111 markings, 298285 edges, 25238 markings/sec, 5 secs
lola: sara is running 10 secs || 296584 markings, 523064 edges, 22895 markings/sec, 10 secs
lola: sara is running 15 secs || 420713 markings, 747768 edges, 24826 markings/sec, 15 secs
lola: sara is running 20 secs || 543994 markings, 1007063 edges, 24656 markings/sec, 20 secs
lola: sara is running 25 secs || 671698 markings, 1243362 edges, 25541 markings/sec, 25 secs
lola: sara is running 30 secs || 793381 markings, 1497518 edges, 24337 markings/sec, 30 secs
lola: sara is running 35 secs || 921035 markings, 1743898 edges, 25531 markings/sec, 35 secs
lola: sara is running 40 secs || 1063417 markings, 1977146 edges, 28476 markings/sec, 40 secs
lola: sara is running 45 secs || 1179667 markings, 2227998 edges, 23250 markings/sec, 45 secs
lola: sara is running 50 secs || 1299367 markings, 2491120 edges, 23940 markings/sec, 50 secs
lola: sara is running 55 secs || 1411969 markings, 2712528 edges, 22520 markings/sec, 55 secs
lola: sara is running 60 secs || 1538761 markings, 2932756 edges, 25358 markings/sec, 60 secs
lola: sara is running 65 secs || 1660678 markings, 3151880 edges, 24383 markings/sec, 65 secs
lola: sara is running 70 secs || 1766204 markings, 3390598 edges, 21105 markings/sec, 70 secs
lola: sara is running 75 secs || 1878839 markings, 3628429 edges, 22527 markings/sec, 75 secs
lola: sara is running 80 secs || 1996327 markings, 3860124 edges, 23498 markings/sec, 80 secs
lola: sara is running 85 secs || 2127154 markings, 4073897 edges, 26165 markings/sec, 85 secs
lola: sara is running 90 secs || 2243543 markings, 4306595 edges, 23278 markings/sec, 90 secs
lola: sara is running 95 secs || 2348686 markings, 4550784 edges, 21029 markings/sec, 95 secs
lola: sara is running 100 secs || 2465699 markings, 4781785 edges, 23403 markings/sec, 100 secs
lola: sara is running 105 secs || 2596822 markings, 5020909 edges, 26225 markings/sec, 105 secs
lola: sara is running 110 secs || 2729790 markings, 5243098 edges, 26594 markings/sec, 110 secs
lola: sara is running 115 secs || 2845800 markings, 5510759 edges, 23202 markings/sec, 115 secs
lola: sara is running 120 secs || 2970457 markings, 5773599 edges, 24931 markings/sec, 120 secs
lola: sara is running 125 secs || 3098629 markings, 6019464 edges, 25634 markings/sec, 125 secs
lola: sara is running 130 secs || 3241685 markings, 6254783 edges, 28611 markings/sec, 130 secs
lola: sara is running 135 secs || 3355805 markings, 6501505 edges, 22824 markings/sec, 135 secs
lola: sara is running 140 secs || 3468937 markings, 6752496 edges, 22626 markings/sec, 140 secs
lola: sara is running 145 secs || 3591959 markings, 6992156 edges, 24604 markings/sec, 145 secs
lola: sara is running 150 secs || 3723634 markings, 7220625 edges, 26335 markings/sec, 150 secs
lola: sara is running 155 secs || 3855289 markings, 7439113 edges, 26331 markings/sec, 155 secs
lola: sara is running 160 secs || 3988206 markings, 7659164 edges, 26583 markings/sec, 160 secs
lola: sara is running 165 secs || 4053548 markings, 7896417 edges, 13068 markings/sec, 165 secs
lola: sara is running 170 secs || 4166690 markings, 8137173 edges, 22628 markings/sec, 170 secs
lola: sara is running 175 secs || 4292405 markings, 8374889 edges, 25143 markings/sec, 175 secs
lola: sara is running 180 secs || 4424236 markings, 8625382 edges, 26366 markings/sec, 180 secs
lola: sara is running 185 secs || 4554913 markings, 8880758 edges, 26135 markings/sec, 185 secs
lola: sara is running 190 secs || 4689074 markings, 9134493 edges, 26832 markings/sec, 190 secs
lola: sara is running 195 secs || 4823070 markings, 9388802 edges, 26799 markings/sec, 195 secs
lola: sara is running 200 secs || 4947325 markings, 9635362 edges, 24851 markings/sec, 200 secs
lola: sara is running 205 secs || 5073619 markings, 9888322 edges, 25259 markings/sec, 205 secs
lola: sara is running 210 secs || 5197469 markings, 10131511 edges, 24770 markings/sec, 210 secs
lola: sara is running 215 secs || 5330690 markings, 10358267 edges, 26644 markings/sec, 215 secs
lola: sara is running 220 secs || 5450243 markings, 10619872 edges, 23911 markings/sec, 220 secs
lola: sara is running 225 secs || 5548218 markings, 10881919 edges, 19595 markings/sec, 225 secs
lola: sara is running 230 secs || 5661614 markings, 11124870 edges, 22679 markings/sec, 230 secs
lola: sara is running 235 secs || 5781106 markings, 11360358 edges, 23898 markings/sec, 235 secs
lola: sara is running 240 secs || 5909868 markings, 11572327 edges, 25752 markings/sec, 240 secs
lola: sara is running 245 secs || 6016913 markings, 11824299 edges, 21409 markings/sec, 245 secs
lola: sara is running 250 secs || 6115707 markings, 12087584 edges, 19759 markings/sec, 250 secs
lola: sara is running 255 secs || 6231900 markings, 12332690 edges, 23239 markings/sec, 255 secs
lola: sara is running 260 secs || 6356609 markings, 12567446 edges, 24942 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: 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: 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 || 63206 markings, 113612 edges, 12641 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 204986 markings, 368350 edges, 28356 markings/sec, 5 secs
lola: sara is running 10 secs || 339716 markings, 630009 edges, 26946 markings/sec, 10 secs
lola: sara is running 15 secs || 481067 markings, 880607 edges, 28270 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 || 38373 markings, 91411 edges, 7675 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 116293 markings, 336374 edges, 15584 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 || 36181 markings, 95019 edges, 7236 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 106147 markings, 315930 edges, 13993 markings/sec, 5 secs
lola: sara is running 10 secs || 173804 markings, 543587 edges, 13531 markings/sec, 10 secs
lola: sara is running 15 secs || 248036 markings, 773322 edges, 14846 markings/sec, 15 secs
lola: sara is running 20 secs || 318193 markings, 1011964 edges, 14031 markings/sec, 20 secs
lola: sara is running 25 secs || 394967 markings, 1225961 edges, 15355 markings/sec, 25 secs
lola: sara is running 30 secs || 469310 markings, 1461206 edges, 14869 markings/sec, 30 secs
lola: sara is running 35 secs || 544984 markings, 1701478 edges, 15135 markings/sec, 35 secs
lola: sara is running 40 secs || 616842 markings, 1950711 edges, 14372 markings/sec, 40 secs
lola: sara is running 45 secs || 688745 markings, 2198353 edges, 14381 markings/sec, 45 secs
lola: sara is running 50 secs || 759740 markings, 2445578 edges, 14199 markings/sec, 50 secs
lola: sara is running 55 secs || 830467 markings, 2688112 edges, 14145 markings/sec, 55 secs
lola: sara is running 60 secs || 901981 markings, 2937117 edges, 14303 markings/sec, 60 secs
lola: sara is running 65 secs || 970952 markings, 3175564 edges, 13794 markings/sec, 65 secs
lola: sara is running 70 secs || 1042029 markings, 3421618 edges, 14215 markings/sec, 70 secs
lola: sara is running 75 secs || 1111641 markings, 3663769 edges, 13922 markings/sec, 75 secs
lola: sara is running 80 secs || 1184883 markings, 3919807 edges, 14648 markings/sec, 80 secs
lola: sara is running 85 secs || 1254552 markings, 4163837 edges, 13934 markings/sec, 85 secs
lola: sara is running 90 secs || 1324626 markings, 4409242 edges, 14015 markings/sec, 90 secs
lola: sara is running 95 secs || 1394602 markings, 4654399 edges, 13995 markings/sec, 95 secs
lola: sara is running 100 secs || 1467736 markings, 4908012 edges, 14627 markings/sec, 100 secs
lola: sara is running 105 secs || 1538138 markings, 5151382 edges, 14080 markings/sec, 105 secs
lola: sara is running 110 secs || 1607257 markings, 5391162 edges, 13824 markings/sec, 110 secs
lola: sara is running 115 secs || 1676927 markings, 5630752 edges, 13934 markings/sec, 115 secs
lola: sara is running 120 secs || 1745212 markings, 5869841 edges, 13657 markings/sec, 120 secs
lola: sara is running 125 secs || 1814881 markings, 6114358 edges, 13934 markings/sec, 125 secs
lola: sara is running 130 secs || 1882728 markings, 6352111 edges, 13569 markings/sec, 130 secs
lola: sara is running 135 secs || 1949011 markings, 6581502 edges, 13257 markings/sec, 135 secs
lola: sara is running 140 secs || 2015191 markings, 6810194 edges, 13236 markings/sec, 140 secs
lola: sara is running 145 secs || 2080485 markings, 7035413 edges, 13059 markings/sec, 145 secs
lola: sara is running 150 secs || 2145059 markings, 7258284 edges, 12915 markings/sec, 150 secs
lola: sara is running 155 secs || 2212374 markings, 7494268 edges, 13463 markings/sec, 155 secs
lola: sara is running 160 secs || 2281709 markings, 7737621 edges, 13867 markings/sec, 160 secs
lola: sara is running 165 secs || 2351897 markings, 7982713 edges, 14038 markings/sec, 165 secs
lola: sara is running 170 secs || 2420467 markings, 8220121 edges, 13714 markings/sec, 170 secs
lola: sara is running 175 secs || 2485047 markings, 8442316 edges, 12916 markings/sec, 175 secs
lola: sara is running 180 secs || 2552015 markings, 8675453 edges, 13394 markings/sec, 180 secs
lola: sara is running 185 secs || 2613109 markings, 8886239 edges, 12219 markings/sec, 185 secs
lola: sara is running 190 secs || 2677765 markings, 9112483 edges, 12931 markings/sec, 190 secs
lola: sara is running 195 secs || 2744207 markings, 9345677 edges, 13288 markings/sec, 195 secs
lola: sara is running 200 secs || 2810849 markings, 9578488 edges, 13328 markings/sec, 200 secs
lola: sara is running 205 secs || 2879353 markings, 9813800 edges, 13701 markings/sec, 205 secs
lola: sara is running 210 secs || 2949081 markings, 10052413 edges, 13946 markings/sec, 210 secs
lola: sara is running 215 secs || 3015113 markings, 10278010 edges, 13206 markings/sec, 215 secs
lola: sara is running 220 secs || 3081506 markings, 10510992 edges, 13279 markings/sec, 220 secs
lola: sara is running 225 secs || 3150196 markings, 10745901 edges, 13738 markings/sec, 225 secs
lola: sara is running 230 secs || 3215898 markings, 10970340 edges, 13140 markings/sec, 230 secs
lola: sara is running 235 secs || 3283404 markings, 11204192 edges, 13501 markings/sec, 235 secs
lola: sara is running 240 secs || 3353357 markings, 11446541 edges, 13991 markings/sec, 240 secs
lola: sara is running 245 secs || 3423821 markings, 11687353 edges, 14093 markings/sec, 245 secs
lola: sara is running 250 secs || 3492868 markings, 11926673 edges, 13809 markings/sec, 250 secs
lola: sara is running 255 secs || 3562740 markings, 12169729 edges, 13974 markings/sec, 255 secs
lola: sara is running 260 secs || 3632502 markings, 12409799 edges, 13952 markings/sec, 260 secs
lola: sara is running 265 secs || 3701222 markings, 12644789 edges, 13744 markings/sec, 265 secs
lola: sara is running 270 secs || 3769820 markings, 12883538 edges, 13720 markings/sec, 270 secs
lola: sara is running 275 secs || 3843119 markings, 13139691 edges, 14660 markings/sec, 275 secs
lola: sara is running 280 secs || 3916796 markings, 13397336 edges, 14735 markings/sec, 280 secs
lola: sara is running 285 secs || 3989193 markings, 13650237 edges, 14479 markings/sec, 285 secs
lola: sara is running 290 secs || 4061889 markings, 13904470 edges, 14539 markings/sec, 290 secs
lola: sara is running 295 secs || 4133322 markings, 14154580 edges, 14287 markings/sec, 295 secs
lola: sara is running 300 secs || 4203363 markings, 14393236 edges, 14008 markings/sec, 300 secs
lola: sara is running 305 secs || 4273447 markings, 14634750 edges, 14017 markings/sec, 305 secs
lola: sara is running 310 secs || 4342547 markings, 14871436 edges, 13820 markings/sec, 310 secs
lola: sara is running 315 secs || 4411080 markings, 15110394 edges, 13707 markings/sec, 315 secs
lola: sara is running 320 secs || 4482588 markings, 15359786 edges, 14302 markings/sec, 320 secs
lola: sara is running 325 secs || 4556148 markings, 15616416 edges, 14712 markings/sec, 325 secs
lola: sara is running 330 secs || 4628207 markings, 15864072 edges, 14412 markings/sec, 330 secs
lola: sara is running 335 secs || 4699873 markings, 16109772 edges, 14333 markings/sec, 335 secs
lola: sara is running 340 secs || 4769828 markings, 16351202 edges, 13991 markings/sec, 340 secs
lola: sara is running 345 secs || 4838515 markings, 16587639 edges, 13737 markings/sec, 345 secs
lola: sara is running 350 secs || 4909935 markings, 16837949 edges, 14284 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 || 48093 markings, 115458 edges, 9619 markings/sec, 0 secs
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: 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
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-11.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: state equation: calling and running sara
sara: try reading problem file 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 949 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 || 36583 markings, 83252 edges, 7317 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 14 will run for 1418 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 2837 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: 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 stderr -----
----- Kill lola and sara stdout -----
----- 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="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-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 irma4mcc-full"
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 r018-qhx1-152646242900173"
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 ;