About the Execution of LoLA for S_SmallOperatingSystem-PT-MT8192DC4096
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15948.030 | 791324.00 | 801334.00 | 280.40 | ?FFTFT?FTTTTFTTF | 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)
..................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SmallOperatingSystem-PT-MT8192DC4096, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900061
=====================================================================
--------------------
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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496558309422
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC4096: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC4096: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_SmallOperatingSystem-PT-MT8192DC4096 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: E (F (((LoadingMem <= DiskControllerUnit) AND (CPUUnit <= 1)))) : E (F ((CPUUnit + 1 <= TaskSuspended))) : E (F (((TaskOnDisk <= TransferToDisk)))) : E (F ((FreeMemSegment <= ExecutingTask))) : E (F (((TaskSuspended <= TaskReady) AND ((FreeMemSegment <= 1) OR (FreeMemSegment + 1 <= TaskReady))))) : A (G (((ExecutingTask <= TaskOnDisk) OR ((1 <= TaskOnDisk) AND (2 <= DiskControllerUnit) AND ((3 <= FreeMemSegment) OR (ExecutingTask <= FreeMemSegment)))))) : E (F (((CPUUnit <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem) AND (TransferToDisk + 1 <= FreeMemSegment) AND (TaskSuspended + 1 <= LoadingMem) AND (1 <= LoadingMem)))) : A (G (TRUE)) : E (F (((CPUUnit <= 1) AND (LoadingMem + 1 <= TaskReady) AND (LoadingMem <= DiskControllerUnit)))) : A (G ((((3 <= DiskControllerUnit) AND (DiskControllerUnit <= 0)) OR (2 <= FreeMemSegment)))) : E (F (())) : A (G ((1 <= TaskOnDisk))) : E (F (((CPUUnit + 1 <= FreeMemSegment) OR (TaskOnDisk <= 2)))) : A (G ((((DiskControllerUnit <= FreeMemSegment)) OR (ExecutingTask <= TaskOnDisk) OR (3 <= FreeMemSegment)))) : A (G (((1 <= CPUUnit) AND ((LoadingMem <= TransferToDisk) OR (1 <= TaskOnDisk))))) : E (F ((((2 <= ExecutingTask) OR (1 <= CPUUnit)) AND ())))
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 (((LoadingMem <= DiskControllerUnit) AND (CPUUnit <= 1))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2572964 markings, 3859444 edges, 514593 markings/sec, 0 secs
lola: sara is running 5 secs || 4693534 markings, 7040297 edges, 424114 markings/sec, 5 secs
lola: sara is running 10 secs || 6761394 markings, 10142088 edges, 413572 markings/sec, 10 secs
lola: sara is running 15 secs || 8825787 markings, 13238678 edges, 412879 markings/sec, 15 secs
lola: sara is running 20 secs || 10869052 markings, 16303574 edges, 408653 markings/sec, 20 secs
lola: sara is running 25 secs || 12876156 markings, 19314232 edges, 401421 markings/sec, 25 secs
lola: sara is running 30 secs || 14861232 markings, 22291846 edges, 397015 markings/sec, 30 secs
lola: sara is running 35 secs || 16804432 markings, 25206646 edges, 388640 markings/sec, 35 secs
lola: sara is running 40 secs || 18787669 markings, 28181500 edges, 396647 markings/sec, 40 secs
lola: sara is running 45 secs || 20769992 markings, 31154986 edges, 396465 markings/sec, 45 secs
lola: sara is running 50 secs || 22758632 markings, 34137946 edges, 397728 markings/sec, 50 secs
lola: sara is running 55 secs || 24755764 markings, 37133644 edges, 399426 markings/sec, 55 secs
lola: sara is running 60 secs || 26730143 markings, 40095212 edges, 394876 markings/sec, 60 secs
lola: sara is running 65 secs || 28690729 markings, 43036091 edges, 392117 markings/sec, 65 secs
lola: sara is running 70 secs || 30643359 markings, 45965036 edges, 390526 markings/sec, 70 secs
lola: sara is running 75 secs || 32588380 markings, 48882569 edges, 389004 markings/sec, 75 secs
lola: sara is running 80 secs || 34531648 markings, 51797469 edges, 388654 markings/sec, 80 secs
lola: sara is running 85 secs || 36472208 markings, 54708310 edges, 388112 markings/sec, 85 secs
lola: sara is running 90 secs || 38407648 markings, 57611470 edges, 387088 markings/sec, 90 secs
lola: sara is running 95 secs || 40343401 markings, 60515099 edges, 387151 markings/sec, 95 secs
lola: sara is running 100 secs || 42274504 markings, 63411753 edges, 386221 markings/sec, 100 secs
lola: sara is running 105 secs || 44193210 markings, 66289814 edges, 383741 markings/sec, 105 secs
lola: sara is running 110 secs || 46095997 markings, 69143994 edges, 380557 markings/sec, 110 secs
lola: sara is running 115 secs || 47996933 markings, 71995397 edges, 380187 markings/sec, 115 secs
lola: sara is running 120 secs || 49904014 markings, 74856018 edges, 381416 markings/sec, 120 secs
lola: sara is running 125 secs || 51432509 markings, 78338132 edges, 305699 markings/sec, 125 secs
lola: sara is running 130 secs || 52742646 markings, 81739902 edges, 262027 markings/sec, 130 secs
lola: sara is running 135 secs || 53989277 markings, 84978195 edges, 249326 markings/sec, 135 secs
lola: sara is running 140 secs || 55197422 markings, 88116428 edges, 241629 markings/sec, 140 secs
lola: sara is running 145 secs || 56377256 markings, 91182326 edges, 235967 markings/sec, 145 secs
lola: sara is running 150 secs || 57547101 markings, 94221848 edges, 233969 markings/sec, 150 secs
lola: sara is running 155 secs || 58706718 markings, 97237087 edges, 231923 markings/sec, 155 secs
lola: sara is running 160 secs || 59860279 markings, 100235150 edges, 230712 markings/sec, 160 secs
lola: sara is running 165 secs || 60996944 markings, 103186603 edges, 227333 markings/sec, 165 secs
lola: sara is running 170 secs || 62132378 markings, 106137610 edges, 227087 markings/sec, 170 secs
lola: sara is running 175 secs || 63262778 markings, 109075870 edges, 226080 markings/sec, 175 secs
lola: sara is running 180 secs || 64394005 markings, 112016048 edges, 226245 markings/sec, 180 secs
lola: sara is running 185 secs || 65522907 markings, 114951981 edges, 225780 markings/sec, 185 secs
lola: sara is running 190 secs || 66642581 markings, 117858304 edges, 223935 markings/sec, 190 secs
lola: sara is running 195 secs || 67753483 markings, 120748585 edges, 222180 markings/sec, 195 secs
lola: sara is running 200 secs || 68856812 markings, 123614224 edges, 220666 markings/sec, 200 secs
lola: sara is running 205 secs || 69959444 markings, 126483016 edges, 220526 markings/sec, 205 secs
lola: sara is running 210 secs || 71057377 markings, 129333067 edges, 219587 markings/sec, 210 secs
lola: sara is running 215 secs || 72153550 markings, 132183212 edges, 219235 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit + 1 <= TaskSuspended)))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskOnDisk <= TransferToDisk))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= ExecutingTask)))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended <= TaskReady) AND ((FreeMemSegment <= 1) OR (FreeMemSegment + 1 <= TaskReady)))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= TaskOnDisk) OR ((1 <= TaskOnDisk) AND (2 <= DiskControllerUnit) AND ((3 <= FreeMemSegment) OR (ExecutingTask <= FreeMemSegment))))))
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 20 bytes per marking, with 0 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5.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: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem) AND (TransferToDisk + 1 <= FreeMemSegment) AND (TaskSuspended + 1 <= LoadingMem) AND (1 <= LoadingMem))))
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 20 bytes per marking, with 0 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: processed formula with 0 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: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= 1) AND (LoadingMem + 1 <= TaskReady) AND (LoadingMem <= DiskControllerUnit))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= DiskControllerUnit) AND (DiskControllerUnit <= 0)) OR (2 <= FreeMemSegment))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TaskOnDisk)))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11.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: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit + 1 <= FreeMemSegment) OR (TaskOnDisk <= 2))))
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 20 bytes per marking, with 0 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: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((DiskControllerUnit <= FreeMemSegment)) OR (ExecutingTask <= TaskOnDisk) OR (3 <= FreeMemSegment))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13.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: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= CPUUnit) AND ((LoadingMem <= TransferToDisk) OR (1 <= TaskOnDisk)))))
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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2724026 markings, 4090180 edges, 544805 markings/sec, 0 secs
lola: sara is running 5 secs || 5432236 markings, 8155757 edges, 541642 markings/sec, 5 secs
lola: sara is running 10 secs || 7401843 markings, 11896645 edges, 393921 markings/sec, 10 secs
lola: sara is running 15 secs || 8846007 markings, 15152256 edges, 288833 markings/sec, 15 secs
lola: sara is running 20 secs || 10248668 markings, 18312655 edges, 280532 markings/sec, 20 secs
lola: sara is running 25 secs || 11581442 markings, 21314897 edges, 266555 markings/sec, 25 secs
lola: sara is running 30 secs || 12870893 markings, 24219151 edges, 257890 markings/sec, 30 secs
lola: sara is running 35 secs || 14043247 markings, 26859409 edges, 234471 markings/sec, 35 secs
lola: sara is running 40 secs || 15354473 markings, 29812195 edges, 262245 markings/sec, 40 secs
lola: sara is running 45 secs || 16645147 markings, 32718533 edges, 258135 markings/sec, 45 secs
lola: sara is running 50 secs || 17913412 markings, 35574271 edges, 253653 markings/sec, 50 secs
lola: sara is running 55 secs || 19159244 markings, 38379380 edges, 249166 markings/sec, 55 secs
lola: sara is running 60 secs || 20521890 markings, 41447410 edges, 272529 markings/sec, 60 secs
lola: sara is running 65 secs || 21840640 markings, 44416516 edges, 263750 markings/sec, 65 secs
lola: sara is running 70 secs || 23145123 markings, 47353409 edges, 260897 markings/sec, 70 secs
lola: sara is running 75 secs || 24422478 markings, 50229157 edges, 255471 markings/sec, 75 secs
lola: sara is running 80 secs || 25676042 markings, 53051302 edges, 250713 markings/sec, 80 secs
lola: sara is running 85 secs || 26964910 markings, 55952870 edges, 257774 markings/sec, 85 secs
lola: sara is running 90 secs || 28235100 markings, 58812338 edges, 254038 markings/sec, 90 secs
lola: sara is running 95 secs || 29515721 markings, 61695243 edges, 256124 markings/sec, 95 secs
lola: sara is running 100 secs || 30771061 markings, 64521208 edges, 251068 markings/sec, 100 secs
lola: sara is running 105 secs || 32019816 markings, 67332298 edges, 249751 markings/sec, 105 secs
lola: sara is running 110 secs || 33259193 markings, 70122233 edges, 247875 markings/sec, 110 secs
lola: sara is running 115 secs || 34475548 markings, 72860323 edges, 243271 markings/sec, 115 secs
lola: sara is running 120 secs || 35770382 markings, 75775048 edges, 258967 markings/sec, 120 secs
lola: sara is running 125 secs || 37064718 markings, 78688623 edges, 258867 markings/sec, 125 secs
lola: sara is running 130 secs || 38347261 markings, 81575620 edges, 256509 markings/sec, 130 secs
lola: sara is running 135 secs || 39593847 markings, 84381670 edges, 249317 markings/sec, 135 secs
lola: sara is running 140 secs || 40851774 markings, 87213210 edges, 251585 markings/sec, 140 secs
lola: sara is running 145 secs || 42091686 markings, 90004173 edges, 247982 markings/sec, 145 secs
lola: sara is running 150 secs || 43328180 markings, 92787431 edges, 247299 markings/sec, 150 secs
lola: sara is running 155 secs || 44535736 markings, 95505538 edges, 241511 markings/sec, 155 secs
lola: sara is running 160 secs || 45787538 markings, 98323205 edges, 250360 markings/sec, 160 secs
lola: sara is running 165 secs || 47050726 markings, 101166494 edges, 252638 markings/sec, 165 secs
lola: sara is running 170 secs || 48291238 markings, 103958730 edges, 248102 markings/sec, 170 secs
lola: sara is running 175 secs || 49513633 markings, 106710164 edges, 244479 markings/sec, 175 secs
lola: sara is running 180 secs || 50717172 markings, 109419132 edges, 240708 markings/sec, 180 secs
lola: sara is running 185 secs || 51958530 markings, 112213231 edges, 248272 markings/sec, 185 secs
lola: sara is running 190 secs || 53170173 markings, 114940435 edges, 242329 markings/sec, 190 secs
lola: sara is running 195 secs || 54367773 markings, 117635993 edges, 239520 markings/sec, 195 secs
lola: sara is running 200 secs || 55562151 markings, 120324302 edges, 238876 markings/sec, 200 secs
lola: sara is running 205 secs || 56733697 markings, 122961209 edges, 234309 markings/sec, 205 secs
lola: sara is running 210 secs || 58483784 markings, 126786785 edges, 350017 markings/sec, 210 secs
lola: sara is running 215 secs || 60053859 markings, 130477910 edges, 314015 markings/sec, 215 secs
lola: sara is running 220 secs || 61684733 markings, 134195338 edges, 326175 markings/sec, 220 secs
lola: sara is running 225 secs || 62906674 markings, 137458558 edges, 244388 markings/sec, 225 secs
lola: sara is running 230 secs || 64105902 markings, 140656921 edges, 239846 markings/sec, 230 secs
lola: sara is running 235 secs || 65486649 markings, 144024052 edges, 276149 markings/sec, 235 secs
lola: sara is running 240 secs || 66969009 markings, 147557334 edges, 296472 markings/sec, 240 secs
lola: sara is running 245 secs || 68153744 markings, 150719790 edges, 236947 markings/sec, 245 secs
lola: sara is running 250 secs || 69325303 markings, 153850982 edges, 234312 markings/sec, 250 secs
lola: sara is running 255 secs || 71114546 markings, 157663577 edges, 357849 markings/sec, 255 secs
lola: sara is running 260 secs || 72940996 markings, 161480003 edges, 365290 markings/sec, 260 secs
lola: sara is running 265 secs || 74650183 markings, 165091395 edges, 341837 markings/sec, 265 secs
lola: sara is running 270 secs || 76507729 markings, 168844913 edges, 371509 markings/sec, 270 secs
lola: sara is running 275 secs || 77785575 markings, 172073510 edges, 255569 markings/sec, 275 secs
lola: sara is running 280 secs || 78927442 markings, 175128579 edges, 228373 markings/sec, 280 secs
lola: sara is running 285 secs || 80717499 markings, 178840986 edges, 358011 markings/sec, 285 secs
lola: sara is running 290 secs || 82117974 markings, 182221134 edges, 280095 markings/sec, 290 secs
lola: sara is running 295 secs || 83235454 markings, 185215213 edges, 223496 markings/sec, 295 secs
lola: sara is running 300 secs || 84384398 markings, 188280281 edges, 229789 markings/sec, 300 secs
lola: sara is running 305 secs || 85534389 markings, 191355329 edges, 229998 markings/sec, 305 secs
lola: sara is running 310 secs || 86657126 markings, 194363289 edges, 224547 markings/sec, 310 secs
lola: sara is running 315 secs || 87762334 markings, 197323808 edges, 221042 markings/sec, 315 secs
lola: sara is running 320 secs || 89536141 markings, 200961446 edges, 354761 markings/sec, 320 secs
lola: sara is running 325 secs || 91049521 markings, 204465946 edges, 302676 markings/sec, 325 secs
lola: sara is running 330 secs || 92143681 markings, 207400686 edges, 218832 markings/sec, 330 secs
lola: sara is running 335 secs || 93282182 markings, 210437054 edges, 227700 markings/sec, 335 secs
lola: sara is running 340 secs || 94394366 markings, 213408028 edges, 222437 markings/sec, 340 secs
lola: sara is running 345 secs || 95529728 markings, 216440308 edges, 227072 markings/sec, 345 secs
lola: sara is running 350 secs || 96700245 markings, 219541532 edges, 234103 markings/sec, 350 secs
lola: sara is running 355 secs || 97834108 markings, 222561407 edges, 226773 markings/sec, 355 secs
lola: sara is running 360 secs || 98974924 markings, 225613631 edges, 228163 markings/sec, 360 secs
lola: sara is running 365 secs || 100069361 markings, 228560307 edges, 218887 markings/sec, 365 secs
lola: sara is running 370 secs || 101201000 markings, 231603462 edges, 226328 markings/sec, 370 secs
lola: sara is running 375 secs || 102372053 markings, 234705651 edges, 234211 markings/sec, 375 secs
lola: sara is running 380 secs || 103522918 markings, 237763107 edges, 230173 markings/sec, 380 secs
lola: sara is running 385 secs || 104670381 markings, 240820866 edges, 229493 markings/sec, 385 secs
lola: sara is running 390 secs || 105830022 markings, 243887907 edges, 231928 markings/sec, 390 secs
lola: sara is running 395 secs || 106948511 markings, 246898132 edges, 223698 markings/sec, 395 secs
lola: sara is running 400 secs || 108090978 markings, 249939909 edges, 228493 markings/sec, 400 secs
lola: sara is running 405 secs || 109186066 markings, 252888990 edges, 219018 markings/sec, 405 secs
lola: sara is running 410 secs || 110289126 markings, 255852042 edges, 220612 markings/sec, 410 secs
lola: sara is running 415 secs || 111476376 markings, 258982861 edges, 237450 markings/sec, 415 secs
lola: sara is running 420 secs || 112601362 markings, 261993400 edges, 224997 markings/sec, 420 secs
lola: sara is running 425 secs || 113727711 markings, 265004338 edges, 225270 markings/sec, 425 secs
lola: sara is running 430 secs || 114853343 markings, 268010827 edges, 225126 markings/sec, 430 secs
lola: sara is running 435 secs || 116018108 markings, 271052578 edges, 232953 markings/sec, 435 secs
lola: sara is running 440 secs || 117940758 markings, 274897875 edges, 384530 markings/sec, 440 secs
lola: sara is running 445 secs || 119659202 markings, 278683471 edges, 343689 markings/sec, 445 secs
lola: sara is running 450 secs || 120771827 markings, 281649439 edges, 222525 markings/sec, 450 secs
lola: sara is running 455 secs || 121926130 markings, 284701276 edges, 230861 markings/sec, 455 secs
lola: sara is running 460 secs || 123056147 markings, 287730822 edges, 226003 markings/sec, 460 secs
lola: sara is running 465 secs || 124153513 markings, 290670369 edges, 219473 markings/sec, 465 secs
lola: sara is running 470 secs || 125197463 markings, 293499887 edges, 208790 markings/sec, 470 secs
lola: sara is running 475 secs || 126853650 markings, 296978493 edges, 331237 markings/sec, 475 secs
lola: sara is running 480 secs || 128886444 markings, 301044080 edges, 406559 markings/sec, 480 secs
lola: sara is running 485 secs || 130096796 markings, 304166103 edges, 242070 markings/sec, 485 secs
lola: sara is running 490 secs || 131238739 markings, 307213289 edges, 228389 markings/sec, 490 secs
lola: sara is running 495 secs || 132409284 markings, 310331561 edges, 234109 markings/sec, 495 secs
lola: sara is running 500 secs || 133552166 markings, 313389069 edges, 228576 markings/sec, 500 secs
lola: sara is running 505 secs || 134652624 markings, 316329900 edges, 220092 markings/sec, 505 secs
lola: sara is running 510 secs || 135776383 markings, 319330662 edges, 224752 markings/sec, 510 secs
lola: sara is running 515 secs || 136946099 markings, 322398080 edges, 233943 markings/sec, 515 secs
lola: sara is running 520 secs || 138046975 markings, 325357751 edges, 220175 markings/sec, 520 secs
lola: sara is running 525 secs || 139118446 markings, 328267664 edges, 214294 markings/sec, 525 secs
lola: sara is running 530 secs || 140298787 markings, 331372147 edges, 236068 markings/sec, 530 secs
lola: sara is running 535 secs || 141671213 markings, 334614112 edges, 274485 markings/sec, 535 secs
lola: sara is running 540 secs || 143504940 markings, 338281567 edges, 366745 markings/sec, 540 secs
lola: sara is running 545 secs || 145241364 markings, 342010969 edges, 347285 markings/sec, 545 secs
lola: sara is running 550 secs || 146385535 markings, 345049811 edges, 228834 markings/sec, 550 secs
lola: sara is running 555 secs || 147528831 markings, 348111689 edges, 228659 markings/sec, 555 secs
lola: sara is running 560 secs || 148587960 markings, 350980450 edges, 211826 markings/sec, 560 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= ExecutingTask) OR (1 <= CPUUnit)) AND ())))
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 20 bytes per marking, with 0 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: RESULT
lola:
SUMMARY: unknown no yes yes yes yes no yes yes no no yes no yes unknown no
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496559100746
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_SmallOperatingSystem-PT-MT8192DC4096"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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/S_SmallOperatingSystem-PT-MT8192DC4096.tgz
mv S_SmallOperatingSystem-PT-MT8192DC4096 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SmallOperatingSystem-PT-MT8192DC4096, 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 r158-ebro-149443463900061"
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 ;