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-3254
Executing tool lola
Input is CircadianClock-PT-100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500612
=====================================================================

--------------------
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 CircadianClock-PT-100000-ReachabilityFireability-0
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-1
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-10
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-11
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-12
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-13
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-14
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-15
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-2
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-3
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-4
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-5
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-6
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-7
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-8
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1494622198723


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ CircadianClock-PT-100000 @ 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-100000-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deactive) OR (FIREABLE(deg_mr) AND FIREABLE(deactive) AND FIREABLE(deg_a)) OR (FIREABLE(deg_r) AND NOT FIREABLE(transc_da_a) AND (FIREABLE(deg_r) OR FIREABLE(transl_a) OR FIREABLE(deg_mr)))))) : A (G (())) : A (G ((FIREABLE(rel_r) OR FIREABLE(transl_a) OR FIREABLE(transc_da_a) OR FIREABLE(deg_r) OR (NOT FIREABLE(rel_r) AND FIREABLE(deg_a)) OR FIREABLE(transl_r) OR FIREABLE(transc_da)))) : E (F (())) : A (G ((FIREABLE(rel_r) OR NOT FIREABLE(transc_dr_a) OR (FIREABLE(rel_r) AND (FIREABLE(transl_a)) AND FIREABLE(transc_da) AND FIREABLE(bind_r) AND FIREABLE(deg_r))))) : E (F ((FIREABLE(bind_r) AND FIREABLE(rel_r) AND (FIREABLE(deg_mr) OR (NOT FIREABLE(deg_mr) AND NOT FIREABLE(bind_a)))))) : E (F ((FIREABLE(transc_dr) AND FIREABLE(transc_da) AND FIREABLE(rel_a) AND FIREABLE(deg_mr) AND (FIREABLE(transl_a) OR FIREABLE(transc_dr))))) : E (F ((FIREABLE(bind_a) AND FIREABLE(deg_a) AND NOT FIREABLE(deg_c) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr)))) : A (G ((FIREABLE(rel_a) OR NOT FIREABLE(rel_r) OR (FIREABLE(transc_da) AND (FIREABLE(bind_r) OR FIREABLE(transc_dr_a))) OR FIREABLE(transl_a)))) : E (F ((NOT FIREABLE(transc_da) AND (FIREABLE(transc_da) OR (FIREABLE(transl_a) AND FIREABLE(bind_r) AND FIREABLE(deactive) AND FIREABLE(transc_dr_a)))))) : A (G (())) : A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deactive) OR FIREABLE(deg_a) OR (FIREABLE(deactive) AND (FIREABLE(transc_da) OR FIREABLE(rel_a) OR NOT FIREABLE(transl_r)))))) : A (G (())) : E (F (NOT FIREABLE(deg_ma))) : A (G ((FIREABLE(deg_r) AND (FIREABLE(transc_dr_a) OR FIREABLE(rel_a))))) : E (F (((NOT FIREABLE(transl_a) AND FIREABLE(deg_mr)) OR (NOT FIREABLE(bind_r) AND NOT FIREABLE(transl_r) AND FIREABLE(deg_r)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deactive) OR (FIREABLE(deg_mr) AND FIREABLE(deactive) AND FIREABLE(deg_a)) OR (FIREABLE(deg_r) AND NOT FIREABLE(transc_da_a) AND (FIREABLE(deg_r) OR FIREABLE(transl_a) OR FIREABLE(deg_mr))))))
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 28 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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_r) OR FIREABLE(transl_a) OR FIREABLE(transc_da_a) OR FIREABLE(deg_r) OR (NOT FIREABLE(rel_r) AND FIREABLE(deg_a)) OR FIREABLE(transl_r) OR FIREABLE(transc_da))))
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 28 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 224 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-2.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 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 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_r) OR NOT FIREABLE(transc_dr_a) OR (FIREABLE(rel_r) AND (FIREABLE(transl_a)) AND FIREABLE(transc_da) AND FIREABLE(bind_r) AND FIREABLE(deg_r)))))
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 28 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 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 4483403 markings, 7723806 edges, 896681 markings/sec, 0 secs
lola: sara is running 5 secs || 7327944 markings, 13650512 edges, 568908 markings/sec, 5 secs
lola: sara is running 10 secs || 10046577 markings, 19334795 edges, 543727 markings/sec, 10 secs
lola: sara is running 15 secs || 12795461 markings, 25109110 edges, 549777 markings/sec, 15 secs
lola: sara is running 20 secs || 15663120 markings, 31118589 edges, 573532 markings/sec, 20 secs
lola: sara is running 25 secs || 18639711 markings, 37351382 edges, 595318 markings/sec, 25 secs
lola: sara is running 30 secs || 21525239 markings, 43407414 edges, 577106 markings/sec, 30 secs
lola: sara is running 35 secs || 24356152 markings, 49349290 edges, 566183 markings/sec, 35 secs
lola: sara is running 40 secs || 27146018 markings, 55213132 edges, 557973 markings/sec, 40 secs
lola: sara is running 45 secs || 29951594 markings, 61077243 edges, 561115 markings/sec, 45 secs
lola: sara is running 50 secs || 32758564 markings, 66940812 edges, 561394 markings/sec, 50 secs
lola: sara is running 55 secs || 35514492 markings, 72725006 edges, 551186 markings/sec, 55 secs
lola: sara is running 60 secs || 38307432 markings, 78554190 edges, 558588 markings/sec, 60 secs
lola: sara is running 65 secs || 41005888 markings, 84234922 edges, 539691 markings/sec, 65 secs
lola: sara is running 70 secs || 43772413 markings, 90046172 edges, 553305 markings/sec, 70 secs
lola: sara is running 75 secs || 46569531 markings, 95910436 edges, 559424 markings/sec, 75 secs
lola: sara is running 80 secs || 49481210 markings, 101995914 edges, 582336 markings/sec, 80 secs
lola: sara is running 85 secs || 52425215 markings, 108149993 edges, 588801 markings/sec, 85 secs
lola: sara is running 90 secs || 55373613 markings, 114322123 edges, 589680 markings/sec, 90 secs
lola: sara is running 95 secs || 58247611 markings, 120351286 edges, 574800 markings/sec, 95 secs
lola: sara is running 100 secs || 61183463 markings, 126493012 edges, 587170 markings/sec, 100 secs
lola: sara is running 105 secs || 64032263 markings, 132472847 edges, 569760 markings/sec, 105 secs
lola: sara is running 110 secs || 66838072 markings, 138350234 edges, 561162 markings/sec, 110 secs
lola: sara is running 115 secs || 69776892 markings, 144496547 edges, 587764 markings/sec, 115 secs
lola: sara is running 120 secs || 72638858 markings, 150488790 edges, 572393 markings/sec, 120 secs
lola: sara is running 125 secs || 75575696 markings, 156630520 edges, 587368 markings/sec, 125 secs
lola: sara is running 130 secs || 78402183 markings, 162576885 edges, 565297 markings/sec, 130 secs
lola: sara is running 135 secs || 81284691 markings, 168620277 edges, 576502 markings/sec, 135 secs
lola: sara is running 140 secs || 84089790 markings, 174499486 edges, 561020 markings/sec, 140 secs
lola: sara is running 145 secs || 86860709 markings, 180293487 edges, 554184 markings/sec, 145 secs
lola: sara is running 150 secs || 89720757 markings, 186279532 edges, 572010 markings/sec, 150 secs
lola: sara is running 155 secs || 92474494 markings, 192049615 edges, 550747 markings/sec, 155 secs
lola: sara is running 160 secs || 95223795 markings, 197795110 edges, 549860 markings/sec, 160 secs
lola: sara is running 165 secs || 97954743 markings, 203509858 edges, 546190 markings/sec, 165 secs
lola: sara is running 170 secs || 100654853 markings, 209194992 edges, 540022 markings/sec, 170 secs
lola: sara is running 175 secs || 103403568 markings, 214941011 edges, 549743 markings/sec, 175 secs
lola: sara is running 180 secs || 106169783 markings, 220718874 edges, 553243 markings/sec, 180 secs
lola: sara is running 185 secs || 108940774 markings, 226513296 edges, 554198 markings/sec, 185 secs
lola: sara is running 190 secs || 111659844 markings, 232219186 edges, 543814 markings/sec, 190 secs
lola: sara is running 195 secs || 114422962 markings, 237991201 edges, 552624 markings/sec, 195 secs
lola: sara is running 200 secs || 117227329 markings, 243871866 edges, 560873 markings/sec, 200 secs
lola: sara is running 205 secs || 119919545 markings, 249512374 edges, 538443 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(bind_r) AND FIREABLE(rel_r) AND (FIREABLE(deg_mr) OR (NOT FIREABLE(deg_mr) AND NOT FIREABLE(bind_a))))))
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 28 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 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-5.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(transc_dr) AND FIREABLE(transc_da) AND FIREABLE(rel_a) AND FIREABLE(deg_mr) AND (FIREABLE(transl_a) OR FIREABLE(transc_dr)))))
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 28 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 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-6.sara.

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 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(bind_a) AND FIREABLE(deg_a) AND NOT FIREABLE(deg_c) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr))))
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 28 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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_a) OR NOT FIREABLE(rel_r) OR (FIREABLE(transc_da) AND (FIREABLE(bind_r) OR FIREABLE(transc_dr_a))) OR FIREABLE(transl_a))))
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 28 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 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 5493334 markings, 9054041 edges, 1098667 markings/sec, 0 secs
lola: sara is running 5 secs || 10987767 markings, 18210876 edges, 1098887 markings/sec, 5 secs
lola: sara is running 10 secs || 16644536 markings, 27638394 edges, 1131354 markings/sec, 10 secs
lola: sara is running 15 secs || 22219607 markings, 36929918 edges, 1115014 markings/sec, 15 secs
lola: sara is running 20 secs || 27821886 markings, 46265711 edges, 1120456 markings/sec, 20 secs
lola: sara is running 25 secs || 33576997 markings, 55857489 edges, 1151022 markings/sec, 25 secs
lola: sara is running 30 secs || 39224298 markings, 65270279 edges, 1129460 markings/sec, 30 secs
lola: sara is running 35 secs || 44920973 markings, 74763549 edges, 1139335 markings/sec, 35 secs
lola: sara is running 40 secs || 50491556 markings, 84048198 edges, 1114117 markings/sec, 40 secs
lola: sara is running 45 secs || 55772436 markings, 92848647 edges, 1056176 markings/sec, 45 secs
lola: sara is running 50 secs || 61318390 markings, 102092893 edges, 1109191 markings/sec, 50 secs
lola: sara is running 55 secs || 66990334 markings, 111544451 edges, 1134389 markings/sec, 55 secs
lola: sara is running 60 secs || 72591690 markings, 120879904 edges, 1120271 markings/sec, 60 secs
lola: sara is running 65 secs || 77851807 markings, 129647868 edges, 1052023 markings/sec, 65 secs
lola: sara is running 70 secs || 83446350 markings, 138970751 edges, 1118909 markings/sec, 70 secs
lola: sara is running 75 secs || 88922396 markings, 148098491 edges, 1095209 markings/sec, 75 secs
lola: sara is running 80 secs || 94183976 markings, 156866617 edges, 1052316 markings/sec, 80 secs
lola: sara is running 85 secs || 99336870 markings, 165455240 edges, 1030579 markings/sec, 85 secs
lola: sara is running 90 secs || 105027431 markings, 174938389 edges, 1138112 markings/sec, 90 secs
lola: sara is running 95 secs || 110715705 markings, 184417647 edges, 1137655 markings/sec, 95 secs
lola: sara is running 100 secs || 116491837 markings, 194044993 edges, 1155226 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(transc_da) AND (FIREABLE(transc_da) OR (FIREABLE(transl_a) AND FIREABLE(bind_r) AND FIREABLE(deactive) AND FIREABLE(transc_dr_a))))))
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 28 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 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-9.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deactive) OR FIREABLE(deg_a) OR (FIREABLE(deactive) AND (FIREABLE(transc_da) OR FIREABLE(rel_a) OR NOT FIREABLE(transl_r))))))
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 28 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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.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 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(deg_ma)))
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 28 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(deg_r) AND (FIREABLE(transc_dr_a) OR FIREABLE(rel_a)))))
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 28 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 9 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-14.sara
lola: lola: ========================================
subprocess 15 will run for 3219 seconds at most (--localtimelimit=-1)lola: state equation: calling and running sara

lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(transl_a) AND FIREABLE(deg_mr)) OR (NOT FIREABLE(bind_r) AND NOT FIREABLE(transl_r) AND FIREABLE(deg_r)))))
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 28 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 16 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no unknown no no yes unknown no yes yes yes yes no yes
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-14.sara.
FORMULA CircadianClock-PT-100000-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622519292

--------------------
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="CircadianClock-PT-100000"
export BK_EXAMINATION="ReachabilityFireability"
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/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is CircadianClock-PT-100000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-csrt-149436126500612"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;