Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
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 r030-ebro-152646308700518
=====================================================================

--------------------
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-00
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-01
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-02
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-03
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-04
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-05
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-06
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-07
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-08
FORMULA_NAME CircadianClock-PT-100000-ReachabilityFireability-09
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

=== Now, execution of the tool begins

BK_START 1526778168038


BK_STOP 1526778660965

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CircadianClock-PT-100000 as instance name.
Using CircadianClock as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 320569, 'Memory': 15919.64, 'Tool': 'lola'}, {'Time': 334839, 'Memory': 15940.89, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola CircadianClock-PT-100000...

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


checking for too many tokens
===========================================================================================
CircadianClock-PT-100000: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ CircadianClock-PT-100000 @ 3540 seconds
----- Start make result stderr -----
----- 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: E (F (())) : A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deg_a) OR (NOT FIREABLE(transc_da_a) AND NOT FIREABLE(deg_r)) OR FIREABLE(deg_mr) OR FIREABLE(deactive)))) : E (F ((FIREABLE(bind_r) AND FIREABLE(transc_dr) AND NOT FIREABLE(deg_a)))) : E (F (())) : A (G ((NOT FIREABLE(bind_r) OR FIREABLE(deg_a)))) : A (G ((NOT FIREABLE(transl_a) OR NOT FIREABLE(transc_da) OR FIREABLE(deg_ma)))) : E (F ((FIREABLE(rel_r) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr_a) AND NOT FIREABLE(bind_a) AND NOT FIREABLE(transc_dr)))) : A (G (((FIREABLE(deg_r) AND FIREABLE(rel_r)) OR FIREABLE(deg_c) OR NOT FIREABLE(transl_r) OR NOT FIREABLE(rel_r) OR FIREABLE(deg_mr)))) : A (G (((FIREABLE(transc_da_a) AND FIREABLE(transl_r)) OR NOT FIREABLE(bind_r) OR FIREABLE(transc_da) OR FIREABLE(deg_ma) OR (FIREABLE(transc_dr) AND FIREABLE(transc_da_a)) OR FIREABLE(transc_dr)))) : A (G ((FIREABLE(rel_a) OR FIREABLE(transc_da)))) : E (F (())) : A (G ((FIREABLE(rel_r) OR FIREABLE(transc_dr_a) OR FIREABLE(transc_da_a) OR FIREABLE(transl_r) OR FIREABLE(transc_dr_a) OR FIREABLE(deg_ma) OR FIREABLE(transc_da) OR FIREABLE(bind_r) OR (FIREABLE(transc_dr) AND FIREABLE(transl_a))))) : A (G ((NOT FIREABLE(deg_c) OR NOT FIREABLE(transc_da) OR NOT FIREABLE(rel_a) OR FIREABLE(transc_dr_a)))) : E (F ((NOT FIREABLE(transc_dr) AND NOT FIREABLE(deactive) AND FIREABLE(transc_da_a) AND NOT FIREABLE(transc_dr_a)))) : E (F (((FIREABLE(rel_a) AND ((FIREABLE(transc_dr) AND FIREABLE(rel_r)) OR (FIREABLE(rel_r) AND FIREABLE(transc_da)))) OR (NOT FIREABLE(transc_da_a) AND (FIREABLE(rel_a) OR FIREABLE(rel_r)) AND NOT FIREABLE(deg_a))))) : E (F (((FIREABLE(bind_a) OR FIREABLE(transc_da)) AND FIREABLE(transc_da) AND FIREABLE(transl_a) AND FIREABLE(rel_r) AND (FIREABLE(transl_r) OR FIREABLE(deg_r)) AND (((FIREABLE(rel_a) OR FIREABLE(bind_r)) AND (FIREABLE(bind_a) OR FIREABLE(deg_mr))) OR NOT FIREABLE(deg_ma)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deg_a) OR (NOT FIREABLE(transc_da_a) AND NOT FIREABLE(deg_r)) OR FIREABLE(deg_mr) OR FIREABLE(deactive))))
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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(bind_r) AND FIREABLE(transc_dr) AND NOT FIREABLE(deg_a))))
lola: 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(bind_r) OR FIREABLE(deg_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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_a) OR NOT FIREABLE(transc_da) OR FIREABLE(deg_ma))))
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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(rel_r) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr_a) AND NOT FIREABLE(bind_a) 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 112 literals and 16 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 300005 markings, 400005 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(deg_r) AND FIREABLE(rel_r)) OR FIREABLE(deg_c) OR NOT FIREABLE(transl_r) OR NOT FIREABLE(rel_r) 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(transc_da_a) AND FIREABLE(transl_r)) OR NOT FIREABLE(bind_r) OR FIREABLE(transc_da) OR FIREABLE(deg_ma) OR (FIREABLE(transc_dr) AND FIREABLE(transc_da_a)) OR FIREABLE(transc_dr))))
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 168 literals and 24 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 || 2121619 markings, 3362832 edges, 424324 markings/sec, 0 secs
lola: sara is running 5 secs || 3861508 markings, 6309747 edges, 347978 markings/sec, 5 secs
lola: sara is running 10 secs || 5538322 markings, 9190004 edges, 335363 markings/sec, 10 secs
lola: sara is running 15 secs || 7223500 markings, 12041139 edges, 337036 markings/sec, 15 secs
lola: sara is running 20 secs || 8913542 markings, 14873732 edges, 338008 markings/sec, 20 secs
lola: sara is running 25 secs || 10602368 markings, 17749419 edges, 337765 markings/sec, 25 secs
lola: sara is running 30 secs || 12286057 markings, 20640960 edges, 336738 markings/sec, 30 secs
lola: sara is running 35 secs || 13952508 markings, 23441984 edges, 333290 markings/sec, 35 secs
lola: sara is running 40 secs || 15626989 markings, 26247368 edges, 334896 markings/sec, 40 secs
lola: sara is running 45 secs || 17267468 markings, 29065219 edges, 328096 markings/sec, 45 secs
lola: sara is running 50 secs || 18867271 markings, 31792912 edges, 319961 markings/sec, 50 secs
lola: sara is running 55 secs || 20524460 markings, 34568051 edges, 331438 markings/sec, 55 secs
lola: sara is running 60 secs || 22164300 markings, 37351120 edges, 327968 markings/sec, 60 secs
lola: sara is running 65 secs || 23801854 markings, 40167220 edges, 327511 markings/sec, 65 secs
lola: sara is running 70 secs || 25458314 markings, 42952434 edges, 331292 markings/sec, 70 secs
lola: sara is running 75 secs || 27105688 markings, 45710421 edges, 329475 markings/sec, 75 secs
lola: sara is running 80 secs || 28650243 markings, 48373916 edges, 308911 markings/sec, 80 secs
lola: sara is running 85 secs || 30265560 markings, 51115283 edges, 323063 markings/sec, 85 secs
lola: sara is running 90 secs || 31872743 markings, 53802953 edges, 321437 markings/sec, 90 secs
lola: sara is running 95 secs || 33483909 markings, 56556560 edges, 322233 markings/sec, 95 secs
lola: sara is running 100 secs || 35065517 markings, 59265410 edges, 316322 markings/sec, 100 secs
lola: sara is running 105 secs || 36648211 markings, 61910238 edges, 316539 markings/sec, 105 secs
lola: sara is running 110 secs || 38278493 markings, 64675296 edges, 326056 markings/sec, 110 secs
lola: sara is running 115 secs || 39953470 markings, 67552711 edges, 334995 markings/sec, 115 secs
lola: sara is running 120 secs || 41558724 markings, 70253884 edges, 321051 markings/sec, 120 secs
lola: sara is running 125 secs || 43219551 markings, 73035465 edges, 332165 markings/sec, 125 secs
lola: sara is running 130 secs || 44807272 markings, 75768415 edges, 317544 markings/sec, 130 secs
lola: sara is running 135 secs || 46380986 markings, 78443120 edges, 314743 markings/sec, 135 secs
lola: sara is running 140 secs || 48045768 markings, 81231638 edges, 332956 markings/sec, 140 secs
lola: sara is running 145 secs || 49689511 markings, 84030696 edges, 328749 markings/sec, 145 secs
lola: sara is running 150 secs || 51267927 markings, 86745576 edges, 315683 markings/sec, 150 secs
lola: sara is running 155 secs || 52901297 markings, 89479141 edges, 326674 markings/sec, 155 secs
lola: sara is running 160 secs || 54521735 markings, 92211175 edges, 324088 markings/sec, 160 secs
lola: sara is running 165 secs || 56038053 markings, 94829042 edges, 303264 markings/sec, 165 secs
lola: sara is running 170 secs || 57706915 markings, 97639329 edges, 333772 markings/sec, 170 secs
lola: sara is running 175 secs || 59340857 markings, 100373918 edges, 326788 markings/sec, 175 secs
lola: sara is running 180 secs || 60908394 markings, 103071963 edges, 313507 markings/sec, 180 secs
lola: sara is running 185 secs || 62508426 markings, 105792360 edges, 320006 markings/sec, 185 secs
lola: sara is running 190 secs || 64119072 markings, 108486196 edges, 322129 markings/sec, 190 secs
lola: sara is running 195 secs || 65723813 markings, 111225052 edges, 320948 markings/sec, 195 secs
lola: sara is running 200 secs || 67332167 markings, 113984324 edges, 321671 markings/sec, 200 secs
lola: sara is running 205 secs || 68939211 markings, 116671874 edges, 321409 markings/sec, 205 secs
lola: sara is running 210 secs || 70545704 markings, 119388776 edges, 321299 markings/sec, 210 secs
lola: sara is running 215 secs || 72102590 markings, 122073103 edges, 311377 markings/sec, 215 secs
lola: sara is running 220 secs || 73662470 markings, 124688041 edges, 311976 markings/sec, 220 secs
lola: sara is running 225 secs || 75340326 markings, 127507922 edges, 335571 markings/sec, 225 secs
lola: sara is running 230 secs || 77030998 markings, 130411191 edges, 338134 markings/sec, 230 secs
lola: sara is running 235 secs || 78661522 markings, 133186878 edges, 326105 markings/sec, 235 secs
lola: sara is running 240 secs || 80318708 markings, 135962211 edges, 331437 markings/sec, 240 secs
lola: sara is running 245 secs || 81969983 markings, 138766632 edges, 330255 markings/sec, 245 secs
lola: sara is running 250 secs || 83583625 markings, 141543886 edges, 322728 markings/sec, 250 secs
lola: sara is running 255 secs || 85252945 markings, 144347670 edges, 333864 markings/sec, 255 secs
lola: sara is running 260 secs || 86903644 markings, 147113404 edges, 330140 markings/sec, 260 secs
lola: sara is running 265 secs || 88508161 markings, 149875746 edges, 320903 markings/sec, 265 secs
lola: sara is running 270 secs || 90093410 markings, 152569057 edges, 317050 markings/sec, 270 secs
lola: sara is running 275 secs || 91708234 markings, 155270298 edges, 322965 markings/sec, 275 secs
lola: sara is running 280 secs || 93331292 markings, 158041715 edges, 324612 markings/sec, 280 secs
lola: sara is running 285 secs || 94965915 markings, 160846546 edges, 326925 markings/sec, 285 secs
lola: sara is running 290 secs || 96607672 markings, 163594931 edges, 328351 markings/sec, 290 secs
lola: sara is running 295 secs || 98251497 markings, 166366577 edges, 328765 markings/sec, 295 secs
lola: sara is running 300 secs || 99808701 markings, 169051552 edges, 311441 markings/sec, 300 secs
lola: sara is running 305 secs || 101348291 markings, 171641666 edges, 307918 markings/sec, 305 secs
lola: sara is running 310 secs || 102936576 markings, 174306730 edges, 317657 markings/sec, 310 secs
lola: sara is running 315 secs || 104488997 markings, 176983900 edges, 310484 markings/sec, 315 secs
lola: sara is running 320 secs || 106059403 markings, 179636795 edges, 314081 markings/sec, 320 secs
lola: sara is running 325 secs || 107641829 markings, 182281394 edges, 316485 markings/sec, 325 secs
lola: sara is running 330 secs || 109116428 markings, 184829784 edges, 294920 markings/sec, 330 secs
lola: sara is running 335 secs || 110599578 markings, 187332814 edges, 296630 markings/sec, 335 secs
lola: sara is running 340 secs || 112227743 markings, 190057904 edges, 325633 markings/sec, 340 secs
lola: sara is running 345 secs || 113826340 markings, 192810681 edges, 319719 markings/sec, 345 secs
lola: sara is running 350 secs || 115438714 markings, 195552045 edges, 322475 markings/sec, 350 secs
lola: sara is running 355 secs || 117067828 markings, 198278379 edges, 325823 markings/sec, 355 secs
lola: sara is running 360 secs || 118642949 markings, 200966216 edges, 315024 markings/sec, 360 secs
lola: sara is running 365 secs || 120177304 markings, 203595351 edges, 306871 markings/sec, 365 secs
lola: sara is running 370 secs || 121794440 markings, 206300739 edges, 323427 markings/sec, 370 secs
lola: sara is running 375 secs || 123392320 markings, 209011767 edges, 319576 markings/sec, 375 secs
lola: sara is running 380 secs || 124932703 markings, 211668106 edges, 308077 markings/sec, 380 secs
lola: sara is running 385 secs || 126486984 markings, 214263513 edges, 310856 markings/sec, 385 secs
lola: sara is running 390 secs || 128017717 markings, 216854497 edges, 306147 markings/sec, 390 secs
lola: sara is running 395 secs || 129400656 markings, 219237862 edges, 276588 markings/sec, 395 secs
lola: sara is running 400 secs || 130978698 markings, 221874865 edges, 315608 markings/sec, 400 secs
lola: sara is running 405 secs || 131285574 markings, 222411899 edges, 61375 markings/sec, 405 secs
lola: sara is running 410 secs || 131291433 markings, 222422152 edges, 1172 markings/sec, 410 secs
lola: sara is running 415 secs || 131294322 markings, 222427206 edges, 578 markings/sec, 415 secs
lola: sara is running 420 secs || 131298437 markings, 222434408 edges, 823 markings/sec, 420 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_a) 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 8 literals and 4 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 10 will run for 515 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_r) OR FIREABLE(transc_dr_a) OR FIREABLE(transc_da_a) OR FIREABLE(transl_r) OR FIREABLE(transc_dr_a) OR FIREABLE(deg_ma) OR FIREABLE(transc_da) OR FIREABLE(bind_r) OR (FIREABLE(transc_dr) AND 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 4608 literals and 512 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-11.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(deg_c) OR NOT FIREABLE(transc_da) OR NOT FIREABLE(rel_a) OR FIREABLE(transc_dr_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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-12.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1031 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(transc_dr) AND NOT FIREABLE(deactive) AND FIREABLE(transc_da_a) AND NOT 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 60 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100004 markings, 100003 edges
lola: ========================================
lola: subprocess 14 will run for 1546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(rel_a) AND ((FIREABLE(transc_dr) AND FIREABLE(rel_r)) OR (FIREABLE(rel_r) AND FIREABLE(transc_da)))) OR (NOT FIREABLE(transc_da_a) AND (FIREABLE(rel_a) OR FIREABLE(rel_r)) AND NOT FIREABLE(deg_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 24 literals and 5 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-14.sara
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3093 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(bind_a) OR FIREABLE(transc_da)) AND FIREABLE(transc_da) AND FIREABLE(transl_a) AND FIREABLE(rel_r) AND (FIREABLE(transl_r) OR FIREABLE(deg_r)) AND (((FIREABLE(rel_a) OR FIREABLE(bind_r)) AND (FIREABLE(bind_a) OR FIREABLE(deg_mr))) OR 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 208 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-15.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes yes unknown no no yes yes yes yes no
FORMULA CircadianClock-PT-100000-ReachabilityFireability-0 FALSE 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 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-6 TRUE 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 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is 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 r030-ebro-152646308700518"
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 ;