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 376K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 174K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is IBM319-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636800175
=====================================================================

--------------------
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 IBM319-PT-none-ReachabilityFireability-00
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-01
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-02
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-03
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-04
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-05
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-06
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-07
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-08
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-09
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-10
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-11
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-12
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-13
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-14
FORMULA_NAME IBM319-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526777065639


BK_STOP 1526777111076

--------------------
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 IBM319-PT-none as instance name.
Using IBM319 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 157, 'Memory': 110.52, 'Tool': 'lola'}, {'Time': 278, 'Memory': 111.85, 'Tool': 'lola'}, {'Time': 867, 'Memory': 101.03, 'Tool': 'gspn'}, {'Time': 1677, 'Memory': 1981.3, 'Tool': 'marcie'}, {'Time': 1745, 'Memory': 1947.1, 'Tool': 'marcie'}, {'Time': 2612, 'Memory': 260.46, 'Tool': 'itstools'}, {'Time': 2674, 'Memory': 256.51, 'Tool': 'itstools'}, {'Time': 2793, 'Memory': 166.37, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola IBM319-PT-none...

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


checking for too many tokens
===========================================================================================
IBM319-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ IBM319-PT-none @ 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: 431/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 253 places, 178 transitions, 169 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from IBM319-PT-none-ReachabilityFireability.task
lola: A (G (((FIREABLE(decision_s00002761_activate_s00001072) AND FIREABLE(callToTask_s00002956_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002965_inputCriterion_s00001053) OR FIREABLE(decision_s00001840_activate_s00001072))) OR ((FIREABLE(merge_s00002240_activate_s00001062) OR FIREABLE(merge_s00002238_activate_s00001064)) AND (FIREABLE(callToProcess_s00002499_inputCriterion_s00001053) OR FIREABLE(decision_s00002762_activate_s00001072))) OR NOT FIREABLE(callToTask_s00002956_outputCriterion_s00001055) OR NOT FIREABLE(callToProcess_s00002802_inputCriterion_s00001053) OR (NOT FIREABLE(callToProcess_s00002802_inputCriterion_s00001053) AND NOT FIREABLE(merge_s00001162_activate_s00001064))))) : E (F ((FIREABLE(callToTask_s00002930_outputCriterion_s00001055) AND FIREABLE(callToTask_s00002955_inputCriterion_s00001053) AND FIREABLE(merge_s00002240_activate_s00001064) AND FIREABLE(callToTask_s00002959_inputCriterion_s00001053)))) : E (F (FIREABLE(decision_s00003021_activate_s00001072))) : E (F (((FIREABLE(callToTask_s00002959_inputCriterion_s00001053) OR (FIREABLE(callToTask_s00002824_inputCriterion_s00001053) AND FIREABLE(join_s00001163_activate_s00001062) AND NOT FIREABLE(callToProcess_s00002499_inputCriterion_s00001053))) AND FIREABLE(decision_s00001157_activate_s00001072)))) : E (F (((FIREABLE(decision_s00001841_fire_s00001075) AND FIREABLE(callToTask_s00001406_outputCriterion_s00001055)) OR ((FIREABLE(callToTask_s00002964_inputCriterion_s00001053) OR FIREABLE(callToProcess_s00002802_outputCriterion_s00001055)) AND FIREABLE(fork_s00001403_fire_s00001073) AND ((FIREABLE(callToTask_s00001852_inputCriterion_s00001053) AND FIREABLE(merge_s00001061_activate_s00001064)) OR FIREABLE(callToTask_s00002960_inputCriterion_s00001053)))))) : E (F (FIREABLE(callToTask_s00002951_outputCriterion_s00001055))) : A (G ((NOT FIREABLE(decision_s00002056_fire_s00001075) OR NOT FIREABLE(fork_s00001403_activate_s00001072)))) : E (F ((NOT FIREABLE(decision_s00001126_fire_s00001073) AND (NOT FIREABLE(callToTask_s00002951_outputCriterion_s00001055) OR NOT FIREABLE(merge_s00002241_activate_s00001062)) AND (FIREABLE(merge_s00002239_activate_s00001062) OR FIREABLE(callToTask_s00002952_outputCriterion_s00001055)) AND NOT FIREABLE(callToTask_s00002952_outputCriterion_s00001055) AND NOT FIREABLE(fork_s00001071_activate_s00001072) AND FIREABLE(decision_s00002056_activate_s00001072)))) : E (F ((FIREABLE(callToTask_s00002949_outputCriterion_s00001055) AND (FIREABLE(merge_s00001161_activate_s00001064) OR FIREABLE(callToProcess_s00002121_outputCriterion_s00001055)) AND FIREABLE(callToTask_s00002063_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00001852_inputCriterion_s00001053) AND ((FIREABLE(decision_s00003021_fire_s00001078) AND FIREABLE(decision_s00001157_fire_s00001075)) OR FIREABLE(decision_s00001841_fire_s00001073) OR ((FIREABLE(decision_s00003022_fire_s00001073) OR FIREABLE(decision_s00001159_fire_s00001075)) AND FIREABLE(callToProcess_s00002802_outputCriterion_s00001055)))))) : A (G ((NOT FIREABLE(decision_s00001158_fire_s00001075) OR NOT FIREABLE(callToTask_s00002956_outputCriterion_s00001055) OR (NOT FIREABLE(decision_s00001157_activate_s00001072)) OR NOT FIREABLE(decision_s00001841_activate_s00001072)))) : E (F (((FIREABLE(callToTask_s00002956_inputCriterion_s00001053) AND FIREABLE(decision_s00001157_fire_s00001073)) OR (FIREABLE(decision_s00002055_activate_s00001072) AND FIREABLE(callToTask_s00002952_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002960_inputCriterion_s00001053) AND (FIREABLE(decision_s00001840_activate_s00001072) OR FIREABLE(callToProcess_s00002499_inputCriterion_s00001053)))))) : A (G (((NOT FIREABLE(callToTask_s00002063_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002869_inputCriterion_s00001053)) OR NOT FIREABLE(decision_s00002056_fire_s00001073) OR FIREABLE(callToProcess_s00002882_outputCriterion_s00001055)))) : A (G (NOT FIREABLE(callToTask_s00002953_inputCriterion_s00001053))) : A (G (((NOT FIREABLE(callToTask_s00002953_outputCriterion_s00001055) OR NOT FIREABLE(callToTask_s00002932_outputCriterion_s00001055) OR (FIREABLE(decision_s00002948_fire_s00001075) AND FIREABLE(callToProcess_s00002038_inputCriterion_s00001053))) AND (NOT FIREABLE(decision_s00003021_activate_s00001072) OR FIREABLE(fork_s00001403_fire_s00001075) OR (FIREABLE(callToTask_s00001168_outputCriterion_s00001055) AND FIREABLE(callToTask_s00002931_outputCriterion_s00001055) AND NOT FIREABLE(decision_s00001123_fire_s00001073)))))) : E (F (FIREABLE(decision_s00003021_fire_s00001073))) : E (F ((NOT FIREABLE(callToTask_s00002954_inputCriterion_s00001053) AND NOT FIREABLE(callToTask_s00002824_inputCriterion_s00001053) AND (FIREABLE(decision_s00001158_fire_s00001073) OR NOT FIREABLE(callToTask_s00002954_inputCriterion_s00001053)) AND FIREABLE(decision_s00003022_fire_s00001075))))
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 (((FIREABLE(decision_s00002761_activate_s00001072) AND FIREABLE(callToTask_s00002956_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002965_inputCriterion_s00001053) OR FIREABLE(decision_s00001840_activate_s00001072))) OR ((FIREABLE(merge_s00002240_activate_s00001062) OR FIREABLE(merge_s00002238_activate_s00001064)) AND (FIREABLE(callToProcess_s00002499_inputCriterion_s00001053) OR ... (shortened)
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 676 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 624 literals and 72 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 84 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002930_outputCriterion_s00001055) AND FIREABLE(callToTask_s00002955_inputCriterion_s00001053) AND FIREABLE(merge_s00002240_activate_s00001064) AND FIREABLE(callToTask_s00002959_inputCriterion_s00001053))))
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 676 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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 78 markings, 79 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(decision_s00003021_activate_s00001072)))
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 676 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 94 markings, 93 edges
lola: ========================================
sara: try reading problem file IBM319-PT-none-ReachabilityFireability.sara.
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask_s00002959_inputCriterion_s00001053) OR (FIREABLE(callToTask_s00002824_inputCriterion_s00001053) AND FIREABLE(join_s00001163_activate_s00001062) AND NOT FIREABLE(callToProcess_s00002499_inputCriterion_s00001053))) AND FIREABLE(decision_s00001157_activate_s00001072))))
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 676 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 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision_s00001841_fire_s00001075) AND FIREABLE(callToTask_s00001406_outputCriterion_s00001055)) OR ((FIREABLE(callToTask_s00002964_inputCriterion_s00001053) OR FIREABLE(callToProcess_s00002802_outputCriterion_s00001055)) AND FIREABLE(fork_s00001403_fire_s00001073) AND ((FIREABLE(callToTask_s00001852_inputCriterion_s00001053) AND FIREABLE(merge_s00001061_activate_s00001064)) OR ... (shortened)
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 676 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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 234 markings, 299 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(callToTask_s00002951_outputCriterion_s00001055)))
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 676 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: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_s00002056_fire_s00001075) OR NOT FIREABLE(fork_s00001403_activate_s00001072))))
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 676 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(decision_s00001126_fire_s00001073) AND (NOT FIREABLE(callToTask_s00002951_outputCriterion_s00001055) OR NOT FIREABLE(merge_s00002241_activate_s00001062)) AND (FIREABLE(merge_s00002239_activate_s00001062) OR FIREABLE(callToTask_s00002952_outputCriterion_s00001055)) AND NOT FIREABLE(callToTask_s00002952_outputCriterion_s00001055) AND NOT FIREABLE(fork_s00001071_activate_s000010... (shortened)
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 676 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 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 250 markings, 263 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002949_outputCriterion_s00001055) AND (FIREABLE(merge_s00001161_activate_s00001064) OR FIREABLE(callToProcess_s00002121_outputCriterion_s00001055)) AND FIREABLE(callToTask_s00002063_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00001852_inputCriterion_s00001053) AND ((FIREABLE(decision_s00003021_fire_s00001078) AND FIREABLE(decision_s00001157_fire_s00001075... (shortened)
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 676 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 100 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_s00001158_fire_s00001075) OR NOT FIREABLE(callToTask_s00002956_outputCriterion_s00001055) OR (NOT FIREABLE(decision_s00001157_activate_s00001072)) OR NOT FIREABLE(decision_s00001841_activate_s00001072))))
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 676 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask_s00002956_inputCriterion_s00001053) AND FIREABLE(decision_s00001157_fire_s00001073)) OR (FIREABLE(decision_s00002055_activate_s00001072) AND FIREABLE(callToTask_s00002952_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002960_inputCriterion_s00001053) AND (FIREABLE(decision_s00001840_activate_s00001072) OR FIREABLE(callToProcess_s00002499_inputCriterion_s000... (shortened)
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 676 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 63 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 84 markings, 85 edges
lola: lola: state equation: calling and running sara========================================

lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(callToTask_s00002063_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002869_inputCriterion_s00001053)) OR NOT FIREABLE(decision_s00002056_fire_s00001073) OR FIREABLE(callToProcess_s00002882_outputCriterion_s00001055))))
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 676 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-11.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file IBM319-PT-none-ReachabilityFireability-10.sara.
sara: try reading problem file IBM319-PT-none-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(callToTask_s00002953_inputCriterion_s00001053)))
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 676 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 96 markings, 95 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(callToTask_s00002953_outputCriterion_s00001055) OR NOT FIREABLE(callToTask_s00002932_outputCriterion_s00001055) OR (FIREABLE(decision_s00002948_fire_s00001075) AND FIREABLE(callToProcess_s00002038_inputCriterion_s00001053))) AND (NOT FIREABLE(decision_s00003021_activate_s00001072) OR FIREABLE(fork_s00001403_fire_s00001075) OR (FIREABLE(callToTask_s00001168_outputCriterion_... (shortened)
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 676 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 21 literals and 6 conjunctive subformulas

lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 96 markings, 95 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(decision_s00003021_fire_s00001073)))
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 676 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 95 markings, 94 edges
lola: ========================================
sara: try reading problem file IBM319-PT-none-ReachabilityFireability-13.sara.
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(callToTask_s00002954_inputCriterion_s00001053) AND NOT FIREABLE(callToTask_s00002824_inputCriterion_s00001053) AND (FIREABLE(decision_s00001158_fire_s00001073) OR NOT FIREABLE(callToTask_s00002954_inputCriterion_s00001053)) AND FIREABLE(decision_s00003022_fire_s00001075))))
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 676 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)
sara: place or transition ordering is non-deterministic
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 48 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 218 markings, 227 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no no yes no yes no no yes no
sara: place or transition ordering is non-deterministic


FORMULA IBM319-PT-none-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-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 stdout -----
----- 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="IBM319-PT-none"
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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 IBM319-PT-none, 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 r106-smll-152658636800175"
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 ;