fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r098-ebro-149488455600238
Last Updated
June 27, 2017

About the Execution of LoLA for S_DES-PT-00b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1589.060 565942.00 568780.00 172.70 T?TFTFFT?TTFFTFT 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_DES-PT-00b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455600238
=====================================================================


--------------------
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 DES-PT-00b-CTLFireability-0
FORMULA_NAME DES-PT-00b-CTLFireability-1
FORMULA_NAME DES-PT-00b-CTLFireability-10
FORMULA_NAME DES-PT-00b-CTLFireability-11
FORMULA_NAME DES-PT-00b-CTLFireability-12
FORMULA_NAME DES-PT-00b-CTLFireability-13
FORMULA_NAME DES-PT-00b-CTLFireability-14
FORMULA_NAME DES-PT-00b-CTLFireability-15
FORMULA_NAME DES-PT-00b-CTLFireability-2
FORMULA_NAME DES-PT-00b-CTLFireability-3
FORMULA_NAME DES-PT-00b-CTLFireability-4
FORMULA_NAME DES-PT-00b-CTLFireability-5
FORMULA_NAME DES-PT-00b-CTLFireability-6
FORMULA_NAME DES-PT-00b-CTLFireability-7
FORMULA_NAME DES-PT-00b-CTLFireability-8
FORMULA_NAME DES-PT-00b-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1496450440424


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-00b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_DES-PT-00b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_DES-PT-00b @ 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: 501/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 271 places, 230 transitions, 212 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 319 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00b-CTLFireability.task
lola: (NOT(A (G ((NOT FIREABLE(t47) AND NOT FIREABLE(t42))))) OR (NOT(E (X (NOT FIREABLE(t55)))) AND (FIREABLE(t190) AND NOT FIREABLE(t188) AND (FIREABLE(t61) OR FIREABLE(t136) OR NOT FIREABLE(t142)) AND NOT FIREABLE(t172)))) : (E ((NOT FIREABLE(t160) U FIREABLE(t161))) AND A ((E (F (FIREABLE(t137))) U E (X (FIREABLE(t219)))))) : (NOT(E (F (FIREABLE(t100)))) OR E (F ((E (G (FIREABLE(t90))) AND E (F (FIREABLE(t145))))))) : E (F (FIREABLE(t168))) : NOT(NOT(NOT(A (G (NOT FIREABLE(t158)))))) : A (G (A (F ((FIREABLE(t47) AND FIREABLE(t2)))))) : NOT(NOT((A (F ((FIREABLE(t182) AND FIREABLE(t137)))) OR (FIREABLE(t132) AND NOT FIREABLE(t175))))) : (E (X (FIREABLE(t135))) OR ((((FIREABLE(t58) OR FIREABLE(t182) OR FIREABLE(t98) OR FIREABLE(t99)) AND NOT FIREABLE(t59)) OR A ((FIREABLE(t52) U FIREABLE(t195)))) OR E (F ((FIREABLE(t17) AND FIREABLE(t141) AND (FIREABLE(t229) OR FIREABLE(t130))))))) : (A (G (E (F ((FIREABLE(t156) OR FIREABLE(t121)))))) OR NOT(NOT((E (G (FIREABLE(t128))) OR FIREABLE(t70))))) : (((NOT(A (F (FIREABLE(t94)))) AND (FIREABLE(t14) OR NOT FIREABLE(t108) OR FIREABLE(t6))) OR (NOT FIREABLE(t98) AND NOT FIREABLE(t213) AND NOT FIREABLE(t106) AND FIREABLE(t229) AND FIREABLE(t154))) OR E (X ((E (G (FIREABLE(t71))) OR (FIREABLE(t71) OR FIREABLE(t40) OR FIREABLE(t118)))))) : NOT(A ((A (F (FIREABLE(t111))) U A (X (FIREABLE(t109)))))) : ((A ((NOT FIREABLE(t163) U FIREABLE(t110))) AND E (F (A (F (FIREABLE(t144)))))) OR FIREABLE(t60)) : (NOT(E ((NOT FIREABLE(t132) U (FIREABLE(t203) AND FIREABLE(t62))))) OR FIREABLE(t208)) : E (X (A (F (((FIREABLE(t120) AND FIREABLE(t181)) OR (FIREABLE(t136) AND FIREABLE(t144))))))) : E (G (((FIREABLE(t100) OR E (G (FIREABLE(t199)))) OR A (F (FIREABLE(t196)))))) : A (F ((NOT(A (F (FIREABLE(t25)))) OR (FIREABLE(t224) AND ((FIREABLE(t34) AND FIREABLE(t197)) OR FIREABLE(t44))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((NOT FIREABLE(t47) AND NOT FIREABLE(t42))))) OR (NOT(E (X (NOT FIREABLE(t55)))) AND (FIREABLE(t190) AND NOT FIREABLE(t188) AND (FIREABLE(t61) OR FIREABLE(t136) OR NOT FIREABLE(t142)) AND NOT FIREABLE(t172))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t47) OR FIREABLE(t42))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================lola:
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((NOT FIREABLE(t160) U FIREABLE(t161))) AND A ((E (F (FIREABLE(t137))) U E (X (FIREABLE(t219))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t160) U FIREABLE(t161)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(t160) U FIREABLE(t161))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F (FIREABLE(t137))) U E (X (FIREABLE(t219)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U FIREABLE(t137)) U EX(FIREABLE(t219)))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 402760 markings, 2165624 edges, 3689348869717491712 markings/sec, 0 secs
lola: 779295 markings, 4308868 edges, 75307 markings/sec, 5 secs
lola: 1080537 markings, 6285130 edges, 60248 markings/sec, 10 secs
lola: 1387273 markings, 8333384 edges, 61347 markings/sec, 15 secs
lola: 1695561 markings, 10284089 edges, 61658 markings/sec, 20 secs
lola: 2000617 markings, 12288633 edges, 61011 markings/sec, 25 secs
lola: 2332160 markings, 14293893 edges, 66309 markings/sec, 30 secs
lola: 2647062 markings, 16301585 edges, 62980 markings/sec, 35 secs
lola: 2942844 markings, 18312641 edges, 59156 markings/sec, 40 secs
lola: 3229648 markings, 20299775 edges, 57361 markings/sec, 45 secs
lola: 3557425 markings, 22218732 edges, 65555 markings/sec, 50 secs
lola: 3846699 markings, 24103025 edges, 57855 markings/sec, 55 secs
lola: 4125546 markings, 26000054 edges, 55769 markings/sec, 60 secs
lola: 4396843 markings, 27874985 edges, 54259 markings/sec, 65 secs
lola: 4639722 markings, 29854201 edges, 48576 markings/sec, 70 secs
lola: 4943015 markings, 31747415 edges, 60659 markings/sec, 75 secs
lola: 5260065 markings, 33637749 edges, 63410 markings/sec, 80 secs
lola: 5535250 markings, 35481880 edges, 55037 markings/sec, 85 secs
lola: 5811388 markings, 37324977 edges, 55228 markings/sec, 90 secs
lola: 6083083 markings, 39183227 edges, 54339 markings/sec, 95 secs
lola: 6401571 markings, 41104601 edges, 63698 markings/sec, 100 secs
lola: 6674453 markings, 42999129 edges, 54576 markings/sec, 105 secs
lola: 6952819 markings, 44871645 edges, 55673 markings/sec, 110 secs
lola: 7243435 markings, 46687941 edges, 58123 markings/sec, 115 secs
lola: 7501664 markings, 48483234 edges, 51646 markings/sec, 120 secs
lola: 7754063 markings, 50303584 edges, 50480 markings/sec, 125 secs
lola: 7994947 markings, 52155816 edges, 48177 markings/sec, 130 secs
lola: 8320955 markings, 54020473 edges, 65202 markings/sec, 135 secs
lola: 8606169 markings, 55861386 edges, 57043 markings/sec, 140 secs
lola: 8886323 markings, 57725852 edges, 56031 markings/sec, 145 secs
lola: 9155459 markings, 59534716 edges, 53827 markings/sec, 150 secs
lola: 9450504 markings, 61415207 edges, 59009 markings/sec, 155 secs
lola: 9741836 markings, 63320738 edges, 58266 markings/sec, 160 secs
lola: 10011923 markings, 65197833 edges, 54017 markings/sec, 165 secs
lola: 10305505 markings, 67042043 edges, 58716 markings/sec, 170 secs
lola: 10575395 markings, 68847949 edges, 53978 markings/sec, 175 secs
lola: 10832685 markings, 70633705 edges, 51458 markings/sec, 180 secs
lola: 11065942 markings, 72485568 edges, 46651 markings/sec, 185 secs
lola: 11295464 markings, 74376882 edges, 45904 markings/sec, 190 secs
lola: 11513120 markings, 76268660 edges, 43531 markings/sec, 195 secs
lola: 11719280 markings, 78128282 edges, 41232 markings/sec, 200 secs
lola: 11940186 markings, 80043402 edges, 44181 markings/sec, 205 secs
lola: 12148940 markings, 81950236 edges, 41751 markings/sec, 210 secs
lola: 12362788 markings, 83835615 edges, 42770 markings/sec, 215 secs
lola: 12566104 markings, 85675377 edges, 40663 markings/sec, 220 secs
lola: 12752925 markings, 87509515 edges, 37364 markings/sec, 225 secs
lola: 12960398 markings, 89322953 edges, 41495 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (FIREABLE(t100)))) OR E (F ((E (G (FIREABLE(t90))) AND E (F (FIREABLE(t145)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t100)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (FIREABLE(t90))) AND E (F (FIREABLE(t145))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U NOT FIREABLE(t90))) AND E(TRUE U FIREABLE(t145))))
lola: processed formula length: 73
lola: 7 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 465199 markings, 2061898 edges, 3689348869717491712 markings/sec, 0 secs
lola: 883182 markings, 4003070 edges, 83597 markings/sec, 5 secs
lola: 1326993 markings, 5963875 edges, 88762 markings/sec, 10 secs
lola: 1652216 markings, 7885616 edges, 65045 markings/sec, 15 secs
lola: 1945872 markings, 9758829 edges, 58731 markings/sec, 20 secs
lola: 2282982 markings, 11717245 edges, 67422 markings/sec, 25 secs
lola: 2561875 markings, 13612625 edges, 55779 markings/sec, 30 secs
lola: 2819948 markings, 15473539 edges, 51615 markings/sec, 35 secs
lola: 3141464 markings, 17427761 edges, 64303 markings/sec, 40 secs
lola: 3435764 markings, 19412122 edges, 58860 markings/sec, 45 secs
lola: 3695967 markings, 21326380 edges, 52041 markings/sec, 50 secs
lola: 3974722 markings, 23180668 edges, 55751 markings/sec, 55 secs
lola: 4286310 markings, 25125488 edges, 62318 markings/sec, 60 secs
lola: 4605574 markings, 27050511 edges, 63853 markings/sec, 65 secs
lola: 4922357 markings, 28950296 edges, 63357 markings/sec, 70 secs
lola: 5273363 markings, 30946053 edges, 70201 markings/sec, 75 secs
lola: 5567041 markings, 32817239 edges, 58736 markings/sec, 80 secs
lola: 5876109 markings, 34686103 edges, 61814 markings/sec, 85 secs
lola: 6206209 markings, 36667639 edges, 66020 markings/sec, 90 secs
lola: 6454968 markings, 38473668 edges, 49752 markings/sec, 95 secs
lola: 6710255 markings, 40264363 edges, 51057 markings/sec, 100 secs
lola: 7050879 markings, 42272879 edges, 68125 markings/sec, 105 secs
lola: 7317426 markings, 44108055 edges, 53309 markings/sec, 110 secs
lola: 7570878 markings, 45946705 edges, 50690 markings/sec, 115 secs
lola: 7859603 markings, 47791171 edges, 57745 markings/sec, 120 secs
lola: 8163443 markings, 49669996 edges, 60768 markings/sec, 125 secs
lola: 8463027 markings, 51518100 edges, 59917 markings/sec, 130 secs
lola: 8760805 markings, 53336309 edges, 59556 markings/sec, 135 secs
lola: 9152591 markings, 55259285 edges, 78357 markings/sec, 140 secs
lola: 9455095 markings, 57321252 edges, 60501 markings/sec, 145 secs
lola: 9731560 markings, 59324153 edges, 55293 markings/sec, 150 secs
lola: 9983442 markings, 61287877 edges, 50376 markings/sec, 155 secs
lola: 10221074 markings, 63292028 edges, 47526 markings/sec, 160 secs
lola: 10445952 markings, 65261200 edges, 44976 markings/sec, 165 secs
lola: 10692622 markings, 67242842 edges, 49334 markings/sec, 170 secs
lola: 10944167 markings, 69193156 edges, 50309 markings/sec, 175 secs
lola: 11192879 markings, 71004084 edges, 49742 markings/sec, 180 secs
lola: 11434362 markings, 72907962 edges, 48297 markings/sec, 185 secs
lola: 11637229 markings, 74792156 edges, 40573 markings/sec, 190 secs
lola: 11878351 markings, 76625863 edges, 48224 markings/sec, 195 secs
lola: 12155086 markings, 78535234 edges, 55347 markings/sec, 200 secs
lola: 12444067 markings, 80604645 edges, 57796 markings/sec, 205 secs
lola: 12693829 markings, 82661526 edges, 49952 markings/sec, 210 secs
lola: 12961769 markings, 84646019 edges, 53588 markings/sec, 215 secs
lola: 13215251 markings, 86637514 edges, 50696 markings/sec, 220 secs
lola: 13472273 markings, 88718515 edges, 51404 markings/sec, 225 secs
lola: 13712381 markings, 90790508 edges, 48022 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t168)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 877138 markings, 1411649 edges, 175428 markings/sec, 0 secs
lola: 1746245 markings, 2782937 edges, 173821 markings/sec, 5 secs
lola: 2604575 markings, 4143249 edges, 171666 markings/sec, 10 secs
lola: 3477162 markings, 5590570 edges, 174517 markings/sec, 15 secs
lola: 4326602 markings, 6953486 edges, 169888 markings/sec, 20 secs
lola: 5178781 markings, 8306233 edges, 170436 markings/sec, 25 secs
lola: 6005864 markings, 9683516 edges, 165417 markings/sec, 30 secs
lola: 6826699 markings, 10993023 edges, 164167 markings/sec, 35 secs
lola: 7652761 markings, 12307603 edges, 165212 markings/sec, 40 secs
lola: 8401413 markings, 13570444 edges, 149730 markings/sec, 45 secs
lola: 9176238 markings, 14896290 edges, 154965 markings/sec, 50 secs
lola: 9974868 markings, 16229398 edges, 159726 markings/sec, 55 secs
lola: 10715715 markings, 17565655 edges, 148169 markings/sec, 60 secs
lola: 11466414 markings, 18807934 edges, 150140 markings/sec, 65 secs
lola: 12213959 markings, 20029609 edges, 149509 markings/sec, 70 secs
lola: 12973648 markings, 21280738 edges, 151938 markings/sec, 75 secs
lola: 13674781 markings, 22642582 edges, 140227 markings/sec, 80 secs
lola: 14363419 markings, 24171898 edges, 137728 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (G (NOT FIREABLE(t158))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: ========================================
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((FIREABLE(t47) AND FIREABLE(t2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (FIREABLE(t47) AND FIREABLE(t2))))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((A (F ((FIREABLE(t182) AND FIREABLE(t137)))) OR (FIREABLE(t132) AND NOT FIREABLE(t175)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t182) AND FIREABLE(t137))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t182) AND FIREABLE(t137)))
lola: processed formula length: 45
lola: 11 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t132) AND NOT FIREABLE(t175))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t132) AND NOT FIREABLE(t175))
lola: processed formula length: 39
lola: 10 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (FIREABLE(t135))) OR ((((FIREABLE(t58) OR FIREABLE(t182) OR FIREABLE(t98) OR FIREABLE(t99)) AND NOT FIREABLE(t59)) OR A ((FIREABLE(t52) U FIREABLE(t195)))) OR E (F ((FIREABLE(t17) AND FIREABLE(t141) AND (FIREABLE(t229) OR FIREABLE(t130)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t135)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t135))
lola: processed formula length: 18
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t58) OR FIREABLE(t182) OR FIREABLE(t98) OR FIREABLE(t99)) AND NOT FIREABLE(t59))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t58) OR FIREABLE(t182) OR FIREABLE(t98) OR FIREABLE(t99)) AND NOT FIREABLE(t59))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.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 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t52) U FIREABLE(t195)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(t52) U FIREABLE(t195))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t17) AND FIREABLE(t141) AND (FIREABLE(t229) OR FIREABLE(t130)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((FIREABLE(t156) OR FIREABLE(t121)))))) OR NOT(NOT((E (G (FIREABLE(t128))) OR FIREABLE(t70)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((FIREABLE(t156) OR FIREABLE(t121))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (FIREABLE(t156) OR FIREABLE(t121))))))
lola: processed formula length: 65
lola: 12 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t128)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t128)))
lola: processed formula length: 33
lola: 12 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t70)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t70)
lola: processed formula length: 13
lola: 10 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((NOT(A (F (FIREABLE(t94)))) AND (FIREABLE(t14) OR NOT FIREABLE(t108) OR FIREABLE(t6))) OR (NOT FIREABLE(t98) AND NOT FIREABLE(t213) AND NOT FIREABLE(t106) AND FIREABLE(t229) AND FIREABLE(t154))) OR E (X ((E (G (FIREABLE(t71))) OR (FIREABLE(t71) OR FIREABLE(t40) OR FIREABLE(t118))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t94)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t94)))
lola: processed formula length: 28
lola: 7 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t14) OR NOT FIREABLE(t108) OR FIREABLE(t6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t14) OR NOT FIREABLE(t108) OR FIREABLE(t6))
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((A (F (FIREABLE(t111))) U A (X (FIREABLE(t109))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(A(TRUE U FIREABLE(t111)) U NOT(EX(NOT FIREABLE(t109)))))
lola: processed formula length: 62
lola: 13 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A ((NOT FIREABLE(t163) U FIREABLE(t110))) AND E (F (A (F (FIREABLE(t144)))))) OR FIREABLE(t60))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t163) U FIREABLE(t110)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(t163) U FIREABLE(t110))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t60)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E ((NOT FIREABLE(t132) U (FIREABLE(t203) AND FIREABLE(t62))))) OR FIREABLE(t208))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t132) R (NOT FIREABLE(t203) OR NOT FIREABLE(t62))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(NOT FIREABLE(t132) U (FIREABLE(t203) AND FIREABLE(t62))))
lola: processed formula length: 63
lola: 7 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 13 will run for 991 seconds at most (--localtimelimit=-1)
lola: ========================================lola:
========================================
lola: ...considering subproblem: E (X (A (F (((FIREABLE(t120) AND FIREABLE(t181)) OR (FIREABLE(t136) AND FIREABLE(t144)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((FIREABLE(t120) AND FIREABLE(t181)) OR (FIREABLE(t136) AND FIREABLE(t144)))))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(t100) OR E (G (FIREABLE(t199)))) OR A (F (FIREABLE(t196))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t100) AND (A(TRUE U NOT FIREABLE(t199)) AND NOT(A(TRUE U FIREABLE(t196)))))))
lola: processed formula length: 104
lola: 9 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2974 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT(A (F (FIREABLE(t25)))) OR (FIREABLE(t224) AND ((FIREABLE(t34) AND FIREABLE(t197)) OR FIREABLE(t44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U FIREABLE(t25))) OR (FIREABLE(t224) AND ((FIREABLE(t34) AND FIREABLE(t197)) OR FIREABLE(t44)))))
lola: processed formula length: 119
lola: 6 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: yes unknown unknown yes yes no no yes no yes yes no yes no no yes
lola: ========================================
FORMULA DES-PT-00b-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496451006366

--------------------
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_DES-PT-00b"
export BK_EXAMINATION="CTLFireability"
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_DES-PT-00b.tgz
mv S_DES-PT-00b 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_DES-PT-00b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-ebro-149488455600238"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;