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 S_CircadianClock-PT-100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700612
=====================================================================

--------------------
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 1496356566598


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


checking for too many tokens
===========================================================================================
S_CircadianClock-PT-100000: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_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 || 4441931 markings, 7638141 edges, 888386 markings/sec, 0 secs
lola: sara is running 5 secs || 7441080 markings, 13886706 edges, 599830 markings/sec, 5 secs
lola: sara is running 10 secs || 10410267 markings, 20101404 edges, 593837 markings/sec, 10 secs
lola: sara is running 15 secs || 13339476 markings, 26242387 edges, 585842 markings/sec, 15 secs
lola: sara is running 20 secs || 16247480 markings, 32352184 edges, 581601 markings/sec, 20 secs
lola: sara is running 25 secs || 19202827 markings, 38533258 edges, 591069 markings/sec, 25 secs
lola: sara is running 30 secs || 22084453 markings, 44592831 edges, 576325 markings/sec, 30 secs
lola: sara is running 35 secs || 24913761 markings, 50520996 edges, 565862 markings/sec, 35 secs
lola: sara is running 40 secs || 27619111 markings, 56197251 edges, 541070 markings/sec, 40 secs
lola: sara is running 45 secs || 30342384 markings, 61891400 edges, 544655 markings/sec, 45 secs
lola: sara is running 50 secs || 33070053 markings, 67592589 edges, 545534 markings/sec, 50 secs
lola: sara is running 55 secs || 35738972 markings, 73194363 edges, 533784 markings/sec, 55 secs
lola: sara is running 60 secs || 38451471 markings, 78856777 edges, 542500 markings/sec, 60 secs
lola: sara is running 65 secs || 41069280 markings, 84367592 edges, 523562 markings/sec, 65 secs
lola: sara is running 70 secs || 43723523 markings, 89944218 edges, 530849 markings/sec, 70 secs
lola: sara is running 75 secs || 46368717 markings, 95491928 edges, 529039 markings/sec, 75 secs
lola: sara is running 80 secs || 49059531 markings, 101117784 edges, 538163 markings/sec, 80 secs
lola: sara is running 85 secs || 51698799 markings, 106617586 edges, 527854 markings/sec, 85 secs
lola: sara is running 90 secs || 54372838 markings, 112224851 edges, 534808 markings/sec, 90 secs
lola: sara is running 95 secs || 57072220 markings, 117871795 edges, 539876 markings/sec, 95 secs
lola: sara is running 100 secs || 59745781 markings, 123478571 edges, 534712 markings/sec, 100 secs
lola: sara is running 105 secs || 62391015 markings, 129038064 edges, 529047 markings/sec, 105 secs
lola: sara is running 110 secs || 65018608 markings, 134531296 edges, 525519 markings/sec, 110 secs
lola: sara is running 115 secs || 67616877 markings, 139982575 edges, 519654 markings/sec, 115 secs
lola: sara is running 120 secs || 70384541 markings, 145768336 edges, 553533 markings/sec, 120 secs
lola: sara is running 125 secs || 72959946 markings, 151159528 edges, 515081 markings/sec, 125 secs
lola: sara is running 130 secs || 75656266 markings, 156799553 edges, 539264 markings/sec, 130 secs
lola: sara is running 135 secs || 78274524 markings, 162315027 edges, 523652 markings/sec, 135 secs
lola: sara is running 140 secs || 80931536 markings, 167866946 edges, 531402 markings/sec, 140 secs
lola: sara is running 145 secs || 83501280 markings, 173258335 edges, 513949 markings/sec, 145 secs
lola: sara is running 150 secs || 86237349 markings, 178987395 edges, 547214 markings/sec, 150 secs
lola: sara is running 155 secs || 89082757 markings, 184932838 edges, 569082 markings/sec, 155 secs
lola: sara is running 160 secs || 91737884 markings, 190512353 edges, 531025 markings/sec, 160 secs
lola: sara is running 165 secs || 94432672 markings, 196136614 edges, 538958 markings/sec, 165 secs
lola: sara is running 170 secs || 97088472 markings, 201699429 edges, 531160 markings/sec, 170 secs
lola: sara is running 175 secs || 99567395 markings, 206908251 edges, 495785 markings/sec, 175 secs
lola: sara is running 180 secs || 102176755 markings, 212367782 edges, 521872 markings/sec, 180 secs
lola: sara is running 185 secs || 104801697 markings, 217874677 edges, 524988 markings/sec, 185 secs
lola: sara is running 190 secs || 107405317 markings, 223311073 edges, 520724 markings/sec, 190 secs
lola: sara is running 195 secs || 110026740 markings, 228795588 edges, 524285 markings/sec, 195 secs
lola: sara is running 200 secs || 112657251 markings, 234301425 edges, 526102 markings/sec, 200 secs
lola: sara is running 205 secs || 115341728 markings, 239910646 edges, 536895 markings/sec, 205 secs
lola: sara is running 210 secs || 117993576 markings, 245470371 edges, 530370 markings/sec, 210 secs
lola: sara is running 215 secs || 120121567 markings, 249939731 edges, 425598 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 301 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 331 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 368 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 414 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 || 5545829 markings, 9141394 edges, 1109166 markings/sec, 0 secs
lola: sara is running 5 secs || 11375443 markings, 18857003 edges, 1165923 markings/sec, 5 secs
lola: sara is running 10 secs || 17134170 markings, 28453818 edges, 1151745 markings/sec, 10 secs
lola: sara is running 15 secs || 22775577 markings, 37855529 edges, 1128281 markings/sec, 15 secs
lola: sara is running 20 secs || 28408203 markings, 47243410 edges, 1126525 markings/sec, 20 secs
lola: sara is running 25 secs || 34136151 markings, 56790358 edges, 1145590 markings/sec, 25 secs
lola: sara is running 30 secs || 39706866 markings, 66073005 edges, 1114143 markings/sec, 30 secs
lola: sara is running 35 secs || 45370892 markings, 75514134 edges, 1132805 markings/sec, 35 secs
lola: sara is running 40 secs || 50940294 markings, 84795369 edges, 1113880 markings/sec, 40 secs
lola: sara is running 45 secs || 56386974 markings, 93873814 edges, 1089336 markings/sec, 45 secs
lola: sara is running 50 secs || 61922336 markings, 103097920 edges, 1107072 markings/sec, 50 secs
lola: sara is running 55 secs || 67459207 markings, 112327248 edges, 1107374 markings/sec, 55 secs
lola: sara is running 60 secs || 72865427 markings, 121335571 edges, 1081244 markings/sec, 60 secs
lola: sara is running 65 secs || 78029237 markings, 129942728 edges, 1032762 markings/sec, 65 secs
lola: sara is running 70 secs || 83498365 markings, 139057116 edges, 1093826 markings/sec, 70 secs
lola: sara is running 75 secs || 88759931 markings, 147827952 edges, 1052313 markings/sec, 75 secs
lola: sara is running 80 secs || 94166034 markings, 156835756 edges, 1081221 markings/sec, 80 secs
lola: sara is running 85 secs || 99275233 markings, 165351820 edges, 1021840 markings/sec, 85 secs
lola: sara is running 90 secs || 104720075 markings, 174427338 edges, 1088968 markings/sec, 90 secs
lola: sara is running 95 secs || 110221447 markings, 183594974 edges, 1100274 markings/sec, 95 secs
lola: sara is running 100 secs || 115832675 markings, 192946556 edges, 1122246 markings/sec, 100 secs
lola: sara is running 105 secs || 119714917 markings, 199417962 edges, 776448 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 457 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 534 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 641 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 801 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 1068 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 1602 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: ========================================
lola: subprocess 15 will run for 3205 seconds at most (--localtimelimit=-1)
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: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-15.sara
lola: RESULT
lola:
SUMMARY: yes yes yes no unknown no no yes unknown no yes yes yes yes no yes
lola: ========================================
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 1496356901437

--------------------
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_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/S_CircadianClock-PT-100000.tgz
mv S_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 S_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 r088-csrt-149441074700612"
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 ;