About the Execution of M4M.full for CircadianClock-PT-100000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.370 | 492487.00 | 426670.00 | 1530.10 | FTFFTTTT?FFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
/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 mcc4mcc-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 r034-ebro-152646312700518
=====================================================================
--------------------
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 1527054569053
BK_STOP 1527055061540
--------------------
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 stdout -----
----- Start make result stderr -----
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: ========================================
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: 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 || 2194856 markings, 3490997 edges, 438971 markings/sec, 0 secs
lola: sara is running 5 secs || 3969842 markings, 6487020 edges, 354997 markings/sec, 5 secs
lola: sara is running 10 secs || 5711335 markings, 9473117 edges, 348299 markings/sec, 10 secs
lola: sara is running 15 secs || 7427248 markings, 12397697 edges, 343183 markings/sec, 15 secs
lola: sara is running 20 secs || 9114142 markings, 15224781 edges, 337379 markings/sec, 20 secs
lola: sara is running 25 secs || 10822621 markings, 18109834 edges, 341696 markings/sec, 25 secs
lola: sara is running 30 secs || 12514194 markings, 21014275 edges, 338315 markings/sec, 30 secs
lola: sara is running 35 secs || 14188997 markings, 23855839 edges, 334961 markings/sec, 35 secs
lola: sara is running 40 secs || 15891356 markings, 26710009 edges, 340472 markings/sec, 40 secs
lola: sara is running 45 secs || 17566648 markings, 29554786 edges, 335058 markings/sec, 45 secs
lola: sara is running 50 secs || 19211321 markings, 32382516 edges, 328935 markings/sec, 50 secs
lola: sara is running 55 secs || 20944250 markings, 35302681 edges, 346586 markings/sec, 55 secs
lola: sara is running 60 secs || 22644963 markings, 38153997 edges, 340143 markings/sec, 60 secs
lola: sara is running 65 secs || 24321163 markings, 41016998 edges, 335240 markings/sec, 65 secs
lola: sara is running 70 secs || 25965859 markings, 43840638 edges, 328939 markings/sec, 70 secs
lola: sara is running 75 secs || 27618842 markings, 46608440 edges, 330597 markings/sec, 75 secs
lola: sara is running 80 secs || 29306588 markings, 49447934 edges, 337549 markings/sec, 80 secs
lola: sara is running 85 secs || 30963477 markings, 52295708 edges, 331378 markings/sec, 85 secs
lola: sara is running 90 secs || 32589276 markings, 55056885 edges, 325160 markings/sec, 90 secs
lola: sara is running 95 secs || 34249992 markings, 57838243 edges, 332143 markings/sec, 95 secs
lola: sara is running 100 secs || 35879340 markings, 60612878 edges, 325870 markings/sec, 100 secs
lola: sara is running 105 secs || 37466129 markings, 63341593 edges, 317358 markings/sec, 105 secs
lola: sara is running 110 secs || 39203251 markings, 66256678 edges, 347424 markings/sec, 110 secs
lola: sara is running 115 secs || 40919112 markings, 69134562 edges, 343172 markings/sec, 115 secs
lola: sara is running 120 secs || 42592238 markings, 72007249 edges, 334625 markings/sec, 120 secs
lola: sara is running 125 secs || 44240380 markings, 74821916 edges, 329628 markings/sec, 125 secs
lola: sara is running 130 secs || 45893947 markings, 77590802 edges, 330713 markings/sec, 130 secs
lola: sara is running 135 secs || 47564328 markings, 80416537 edges, 334076 markings/sec, 135 secs
lola: sara is running 140 secs || 49217381 markings, 83258120 edges, 330611 markings/sec, 140 secs
lola: sara is running 145 secs || 50841157 markings, 85998728 edges, 324755 markings/sec, 145 secs
lola: sara is running 150 secs || 52478725 markings, 88739640 edges, 327514 markings/sec, 150 secs
lola: sara is running 155 secs || 54049004 markings, 91437617 edges, 314056 markings/sec, 155 secs
lola: sara is running 160 secs || 55608424 markings, 94091787 edges, 311884 markings/sec, 160 secs
lola: sara is running 165 secs || 57302653 markings, 96931871 edges, 338846 markings/sec, 165 secs
lola: sara is running 170 secs || 58963322 markings, 99752477 edges, 332134 markings/sec, 170 secs
lola: sara is running 175 secs || 60579336 markings, 102533504 edges, 323203 markings/sec, 175 secs
lola: sara is running 180 secs || 62208949 markings, 105268276 edges, 325923 markings/sec, 180 secs
lola: sara is running 185 secs || 63836617 markings, 108000251 edges, 325534 markings/sec, 185 secs
lola: sara is running 190 secs || 65430250 markings, 110744676 edges, 318727 markings/sec, 190 secs
lola: sara is running 195 secs || 67065937 markings, 113518423 edges, 327137 markings/sec, 195 secs
lola: sara is running 200 secs || 68692387 markings, 116239930 edges, 325290 markings/sec, 200 secs
lola: sara is running 205 secs || 70303014 markings, 118991646 edges, 322125 markings/sec, 205 secs
lola: sara is running 210 secs || 71881502 markings, 121696112 edges, 315698 markings/sec, 210 secs
lola: sara is running 215 secs || 73467528 markings, 124346892 edges, 317205 markings/sec, 215 secs
lola: sara is running 220 secs || 75102202 markings, 127118263 edges, 326935 markings/sec, 220 secs
lola: sara is running 225 secs || 76792024 markings, 130020144 edges, 337964 markings/sec, 225 secs
lola: sara is running 230 secs || 78468611 markings, 132849284 edges, 335317 markings/sec, 230 secs
lola: sara is running 235 secs || 80159349 markings, 135683333 edges, 338148 markings/sec, 235 secs
lola: sara is running 240 secs || 81798437 markings, 138485920 edges, 327818 markings/sec, 240 secs
lola: sara is running 245 secs || 83414603 markings, 141255296 edges, 323233 markings/sec, 245 secs
lola: sara is running 250 secs || 85095182 markings, 144071585 edges, 336116 markings/sec, 250 secs
lola: sara is running 255 secs || 86743514 markings, 146851371 edges, 329666 markings/sec, 255 secs
lola: sara is running 260 secs || 88341943 markings, 149603754 edges, 319686 markings/sec, 260 secs
lola: sara is running 265 secs || 89928681 markings, 152280781 edges, 317348 markings/sec, 265 secs
lola: sara is running 270 secs || 91514539 markings, 154932055 edges, 317172 markings/sec, 270 secs
lola: sara is running 275 secs || 93098223 markings, 157660330 edges, 316737 markings/sec, 275 secs
lola: sara is running 280 secs || 94760653 markings, 160487336 edges, 332486 markings/sec, 280 secs
lola: sara is running 285 secs || 96408408 markings, 163246222 edges, 329551 markings/sec, 285 secs
lola: sara is running 290 secs || 98046183 markings, 166030609 edges, 327555 markings/sec, 290 secs
lola: sara is running 295 secs || 99640279 markings, 168775953 edges, 318819 markings/sec, 295 secs
lola: sara is running 300 secs || 101202038 markings, 171385724 edges, 312352 markings/sec, 300 secs
lola: sara is running 305 secs || 102825390 markings, 174124788 edges, 324670 markings/sec, 305 secs
lola: sara is running 310 secs || 104429047 markings, 176885800 edges, 320731 markings/sec, 310 secs
lola: sara is running 315 secs || 106010522 markings, 179551253 edges, 316295 markings/sec, 315 secs
lola: sara is running 320 secs || 107618452 markings, 182241684 edges, 321586 markings/sec, 320 secs
lola: sara is running 325 secs || 109172282 markings, 184921181 edges, 310766 markings/sec, 325 secs
lola: sara is running 330 secs || 110716837 markings, 187538017 edges, 308911 markings/sec, 330 secs
lola: sara is running 335 secs || 112384135 markings, 190331157 edges, 333460 markings/sec, 335 secs
lola: sara is running 340 secs || 114041259 markings, 193162367 edges, 331425 markings/sec, 340 secs
lola: sara is running 345 secs || 115661449 markings, 195941831 edges, 324038 markings/sec, 345 secs
lola: sara is running 350 secs || 117300841 markings, 198686151 edges, 327878 markings/sec, 350 secs
lola: sara is running 355 secs || 118911538 markings, 201405724 edges, 322139 markings/sec, 355 secs
lola: sara is running 360 secs || 120455359 markings, 204068898 edges, 308764 markings/sec, 360 secs
lola: sara is running 365 secs || 122078216 markings, 206797349 edges, 324571 markings/sec, 365 secs
lola: sara is running 370 secs || 123693974 markings, 209505382 edges, 323152 markings/sec, 370 secs
lola: sara is running 375 secs || 125259530 markings, 212204145 edges, 313111 markings/sec, 375 secs
lola: sara is running 380 secs || 126831476 markings, 214866373 edges, 314389 markings/sec, 380 secs
lola: sara is running 385 secs || 128412361 markings, 217508345 edges, 316177 markings/sec, 385 secs
lola: sara is running 390 secs || 129984283 markings, 220209480 edges, 314384 markings/sec, 390 secs
lola: sara is running 395 secs || 131271882 markings, 222387936 edges, 257520 markings/sec, 395 secs
lola: sara is running 400 secs || 131283182 markings, 222407712 edges, 2260 markings/sec, 400 secs
lola: sara is running 405 secs || 131289709 markings, 222419132 edges, 1305 markings/sec, 405 secs
lola: sara is running 410 secs || 131292897 markings, 222424714 edges, 638 markings/sec, 410 secs
lola: sara is running 415 secs || 131299971 markings, 222437092 edges, 1415 markings/sec, 415 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: 7 markings, 8 edges
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-14.sara
lola: subprocess 15 will run for 3093 seconds at most (--localtimelimit=-1)
lola: ========================================
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 stderr -----
----- Kill lola and sara stdout -----
----- 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="mcc4mcc-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 mcc4mcc-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 r034-ebro-152646312700518"
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 '
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 ;