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 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 7.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K 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.1K 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 193K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is IBM703-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-152658637500189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526819123190


BK_STOP 1526819168255

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using IBM703-PT-none as instance name.
Using IBM703 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': True, 'Live': False}.
Known tools are: [{'Time': 180, 'Memory': 111.5, 'Tool': 'lola'}, {'Time': 249, 'Memory': 112.43, 'Tool': 'lola'}, {'Time': 479, 'Memory': 103.84, 'Tool': 'gspn'}, {'Time': 1562, 'Memory': 2115.52, 'Tool': 'marcie'}, {'Time': 1621, 'Memory': 2010.13, 'Tool': 'marcie'}, {'Time': 2994, 'Memory': 297.69, 'Tool': 'itstools'}, {'Time': 3066, 'Memory': 291.25, 'Tool': 'itstools'}, {'Time': 3386, 'Memory': 160.42, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola IBM703-PT-none...

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


checking for too many tokens
===========================================================================================
IBM703-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ IBM703-PT-none @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 546/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 262 places, 284 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 261 transition conflict sets
lola: TASK
lola: reading formula from IBM703-PT-none-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(merge_s00000341_fire_s00000287) AND NOT FIREABLE(task_s00000722_inputCriterion_s00000257) AND NOT FIREABLE(merge_s00000461_activate_s00000286) AND NOT FIREABLE(task_s00000739_outputCriterion_s00000258) AND (FIREABLE(decision_s00000768_fire_s00000421) OR FIREABLE(decision_s00000768_fire_s00000280)) AND (FIREABLE(decision_s00000773_activate_s00000271) OR FIREABLE(decision_s00000774_activate_s00000271))))) : A (G ((NOT FIREABLE(decision_s00000783_fire_s00000272) OR NOT FIREABLE(fork_s00000465_fire_s00000274)))) : A (G ((NOT FIREABLE(task_s00000719_outputCriterion_s00000258) OR NOT FIREABLE(merge_s00000446_activate_s00000286)))) : E (F ((FIREABLE(decision_s00000793_activate_s00000271) AND FIREABLE(decision_s00000787_fire_s00000272) AND ((FIREABLE(task_s00000749_outputCriterion_s00000258) AND FIREABLE(merge_s00000283_activate_s00000284) AND NOT FIREABLE(decision_s00000780_fire_s00000272)) OR FIREABLE(task_s00000704_outputCriterion_s00000258))))) : E (F ((FIREABLE(task_s00000718_inputCriterion_s00000257) AND FIREABLE(decision_s00000792_fire_s00000272) AND NOT FIREABLE(merge_s00000455_activate_s00000286) AND (FIREABLE(task_s00000726_inputCriterion_s00000257) OR FIREABLE(decision_s00000772_fire_s00000272) OR (FIREABLE(decision_s00000773_fire_s00000272) AND FIREABLE(decision_s00000774_activate_s00000271))) AND (FIREABLE(merge_s00000288_activate_s00000286) OR FIREABLE(decision_s00000775_fire_s00000272)) AND NOT FIREABLE(task_s00000720_outputCriterion_s00000258) AND NOT FIREABLE(merge_s00000462_fire_s00000287)))) : A (G ((FIREABLE(callToProcess_s00000808_outputCriterion_s00000258) OR FIREABLE(decision_s00000775_activate_s00000271) OR FIREABLE(decision_s00000780_fire_s00000274) OR FIREABLE(decision_s00000778_fire_s00000272) OR NOT FIREABLE(merge_s00000457_fire_s00000287) OR (FIREABLE(decision_s00000789_fire_s00000274) AND FIREABLE(decision_s00000768_fire_s00000272)) OR NOT FIREABLE(decision_s00000803_fire_s00000272) OR FIREABLE(task_s00000728_outputCriterion_s00000258)))) : E (F ((FIREABLE(decision_s00000803_activate_s00000271) AND FIREABLE(task_s00000754_inputCriterion_s00000257) AND FIREABLE(decision_s00000764_fire_s00000274) AND FIREABLE(decision_s00000772_activate_s00000271) AND FIREABLE(decision_s00000768_activate_s00000271) AND NOT FIREABLE(task_s00000758_outputCriterion_s00000258) AND FIREABLE(decision_s00000775_fire_s00000274)))) : A (G ((FIREABLE(decision_s00000804_fire_s00000272) OR FIREABLE(task_s00000736_inputCriterion_s00000257) OR (FIREABLE(task_s00000763_outputCriterion_s00000258) AND FIREABLE(task_s00000705_outputCriterion_s00000258)) OR (NOT FIREABLE(merge_s00000450_activate_s00000286) AND NOT FIREABLE(task_s00000756_inputCriterion_s00000257)) OR ((NOT FIREABLE(task_s00000732_inputCriterion_s00000257) OR NOT FIREABLE(merge_s00000456_activate_s00000286)) AND (FIREABLE(task_s00000725_outputCriterion_s00000258) OR FIREABLE(merge_s00000457_activate_s00000286) OR NOT FIREABLE(decision_s00000796_fire_s00000274)))))) : A (G ((FIREABLE(decision_s00000768_fire_s00000441) OR FIREABLE(task_s00000757_outputCriterion_s00000258) OR (FIREABLE(decision_s00000787_fire_s00000274) AND FIREABLE(decision_s00000793_fire_s00000274)) OR FIREABLE(task_s00000715_outputCriterion_s00000258) OR (NOT FIREABLE(decision_s00000774_fire_s00000274) AND NOT FIREABLE(task_s00000735_inputCriterion_s00000257)) OR NOT FIREABLE(task_s00000743_outputCriterion_s00000258)))) : E (F ((NOT FIREABLE(task_s00000715_outputCriterion_s00000258) AND NOT FIREABLE(fork_s00000465_fire_s00000274) AND (FIREABLE(merge_s00000456_activate_s00000289) OR FIREABLE(callToProcess_s00000348_outputCriterion_s00000258)) AND FIREABLE(task_s00000727_inputCriterion_s00000257) AND NOT FIREABLE(task_s00000762_inputCriterion_s00000257) AND (FIREABLE(decision_s00000778_fire_s00000274) OR FIREABLE(task_s00000753_inputCriterion_s00000257) OR FIREABLE(callToProcess_s00000348_outputCriterion_s00000258) OR FIREABLE(decision_s00000776_fire_s00000274))))) : A (G (((NOT FIREABLE(merge_s00000341_activate_s00000284) OR NOT FIREABLE(merge_s00000454_activate_s00000284) OR FIREABLE(task_s00000742_outputCriterion_s00000258) OR NOT FIREABLE(merge_s00000461_activate_s00000284)) AND ((FIREABLE(decision_s00000768_fire_s00000421) AND FIREABLE(task_s00000762_outputCriterion_s00000258)) OR NOT FIREABLE(merge_s00000445_activate_s00000286) OR NOT FIREABLE(task_s00000730_outputCriterion_s00000258))))) : E (F ((FIREABLE(fork_s00000465_fire_s00000274) AND FIREABLE(decision_s00000768_fire_s00000274) AND (FIREABLE(decision_s00000789_fire_s00000274) OR FIREABLE(merge_s00000446_activate_s00000286)) AND ((FIREABLE(task_s00000736_inputCriterion_s00000257) AND FIREABLE(merge_s00000446_activate_s00000448)) OR NOT FIREABLE(decision_s00000802_fire_s00000274)) AND NOT FIREABLE(decision_s00000778_fire_s00000272) AND FIREABLE(task_s00000729_outputCriterion_s00000258)))) : E (F (((FIREABLE(task_s00000704_outputCriterion_s00000258) OR FIREABLE(decision_s00000805_activate_s00000271)) AND (FIREABLE(task_s00000755_outputCriterion_s00000258) OR FIREABLE(task_s00000746_inputCriterion_s00000257))))) : E (F (((((FIREABLE(decision_s00000784_activate_s00000271) OR FIREABLE(merge_s00000457_activate_s00000284)) AND FIREABLE(decision_s00000773_fire_s00000274)) OR (FIREABLE(decision_s00000805_fire_s00000274) AND FIREABLE(merge_s00000449_activate_s00000286))) AND ((FIREABLE(merge_s00000283_fire_s00000287) AND FIREABLE(fork_s00000464_fire_s00000272) AND NOT FIREABLE(task_s00000718_inputCriterion_s00000257)) OR (NOT FIREABLE(decision_s00000802_activate_s00000271) AND FIREABLE(task_s00000732_inputCriterion_s00000257)))))) : E (F ((FIREABLE(merge_s00000806_fire_s00000287) AND FIREABLE(decision_s00000783_fire_s00000272) AND (FIREABLE(task_s00000732_inputCriterion_s00000257) OR FIREABLE(task_s00000750_outputCriterion_s00000258))))) : E (F ((NOT FIREABLE(task_s00000755_outputCriterion_s00000258) AND NOT FIREABLE(decision_s00000775_fire_s00000274) AND FIREABLE(task_s00000709_inputCriterion_s00000257) AND FIREABLE(decision_s00000778_fire_s00000274) AND FIREABLE(merge_s00000456_activate_s00000289) AND ((FIREABLE(decision_s00000788_fire_s00000272) AND FIREABLE(task_s00000761_outputCriterion_s00000258)) OR (FIREABLE(decision_s00000788_fire_s00000274) AND FIREABLE(task_s00000718_inputCriterion_s00000257))))))
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 ((NOT FIREABLE(merge_s00000341_fire_s00000287) AND NOT FIREABLE(task_s00000722_inputCriterion_s00000257) AND NOT FIREABLE(merge_s00000461_activate_s00000286) AND NOT FIREABLE(task_s00000739_outputCriterion_s00000258) AND (FIREABLE(decision_s00000768_fire_s00000421) OR FIREABLE(decision_s00000768_fire_s00000280)) AND (FIREABLE(decision_s00000773_activate_s00000271) OR FIREABLE(decision_s0000... (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 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_s00000783_fire_s00000272) OR NOT FIREABLE(fork_s00000465_fire_s00000274))))
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 1044 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 IBM703-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 104 markings, 108 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(task_s00000719_outputCriterion_s00000258) OR NOT FIREABLE(merge_s00000446_activate_s00000286))))
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 1044 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 IBM703-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 invariant.
lola: 130 markings, 136 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00000793_activate_s00000271) AND FIREABLE(decision_s00000787_fire_s00000272) AND ((FIREABLE(task_s00000749_outputCriterion_s00000258) AND FIREABLE(merge_s00000283_activate_s00000284) AND NOT FIREABLE(decision_s00000780_fire_s00000272)) OR FIREABLE(task_s00000704_outputCriterion_s00000258)))))
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 1044 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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 90 markings, 94 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(task_s00000718_inputCriterion_s00000257) AND FIREABLE(decision_s00000792_fire_s00000272) AND NOT FIREABLE(merge_s00000455_activate_s00000286) AND (FIREABLE(task_s00000726_inputCriterion_s00000257) OR FIREABLE(decision_s00000772_fire_s00000272) OR (FIREABLE(decision_s00000773_fire_s00000272) AND FIREABLE(decision_s00000774_activate_s00000271))) AND (FIREABLE(merge_s00000288_activa... (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 1044 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 44 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-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: 107 markings, 110 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(callToProcess_s00000808_outputCriterion_s00000258) OR FIREABLE(decision_s00000775_activate_s00000271) OR FIREABLE(decision_s00000780_fire_s00000274) OR FIREABLE(decision_s00000778_fire_s00000272) OR NOT FIREABLE(merge_s00000457_fire_s00000287) OR (FIREABLE(decision_s00000789_fire_s00000274) AND FIREABLE(decision_s00000768_fire_s00000272)) OR NOT FIREABLE(decision_s00000803_fi... (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 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 126 markings, 130 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00000803_activate_s00000271) AND FIREABLE(task_s00000754_inputCriterion_s00000257) AND FIREABLE(decision_s00000764_fire_s00000274) AND FIREABLE(decision_s00000772_activate_s00000271) AND FIREABLE(decision_s00000768_activate_s00000271) AND NOT FIREABLE(task_s00000758_outputCriterion_s00000258) AND FIREABLE(decision_s00000775_fire_s00000274))))
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 1044 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 IBM703-PT-none-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(decision_s00000804_fire_s00000272) OR FIREABLE(task_s00000736_inputCriterion_s00000257) OR (FIREABLE(task_s00000763_outputCriterion_s00000258) AND FIREABLE(task_s00000705_outputCriterion_s00000258)) OR (NOT FIREABLE(merge_s00000450_activate_s00000286) AND NOT FIREABLE(task_s00000756_inputCriterion_s00000257)) OR ((NOT FIREABLE(task_s00000732_inputCriterion_s00000257) OR NOT FI... (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 1044 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 52 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 304 markings, 326 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(decision_s00000768_fire_s00000441) OR FIREABLE(task_s00000757_outputCriterion_s00000258) OR (FIREABLE(decision_s00000787_fire_s00000274) AND FIREABLE(decision_s00000793_fire_s00000274)) OR FIREABLE(task_s00000715_outputCriterion_s00000258) OR (NOT FIREABLE(decision_s00000774_fire_s00000274) AND NOT FIREABLE(task_s00000735_inputCriterion_s00000257)) OR NOT FIREABLE(task_s000007... (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 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 74 markings, 73 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(task_s00000715_outputCriterion_s00000258) AND NOT FIREABLE(fork_s00000465_fire_s00000274) AND (FIREABLE(merge_s00000456_activate_s00000289) OR FIREABLE(callToProcess_s00000348_outputCriterion_s00000258)) AND FIREABLE(task_s00000727_inputCriterion_s00000257) AND NOT FIREABLE(task_s00000762_inputCriterion_s00000257) AND (FIREABLE(decision_s00000778_fire_s00000274) OR FIREABLE(t... (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 1044 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 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 378 markings, 405 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(merge_s00000341_activate_s00000284) OR NOT FIREABLE(merge_s00000454_activate_s00000284) OR FIREABLE(task_s00000742_outputCriterion_s00000258) OR NOT FIREABLE(merge_s00000461_activate_s00000284)) AND ((FIREABLE(decision_s00000768_fire_s00000421) AND FIREABLE(task_s00000762_outputCriterion_s00000258)) OR NOT FIREABLE(merge_s00000445_activate_s00000286) OR NOT FIREABLE(task_... (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 1044 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 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 77 markings, 80 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(fork_s00000465_fire_s00000274) AND FIREABLE(decision_s00000768_fire_s00000274) AND (FIREABLE(decision_s00000789_fire_s00000274) OR FIREABLE(merge_s00000446_activate_s00000286)) AND ((FIREABLE(task_s00000736_inputCriterion_s00000257) AND FIREABLE(merge_s00000446_activate_s00000448)) OR NOT FIREABLE(decision_s00000802_fire_s00000274)) AND NOT FIREABLE(decision_s00000778_fire_s00000... (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 1044 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 26 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 10 markings, 9 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(task_s00000704_outputCriterion_s00000258) OR FIREABLE(decision_s00000805_activate_s00000271)) AND (FIREABLE(task_s00000755_outputCriterion_s00000258) OR FIREABLE(task_s00000746_inputCriterion_s00000257)))))
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 1044 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 IBM703-PT-none-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: lola: state equation: calling and running sara
47 markings, 48 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(decision_s00000784_activate_s00000271) OR FIREABLE(merge_s00000457_activate_s00000284)) AND FIREABLE(decision_s00000773_fire_s00000274)) OR (FIREABLE(decision_s00000805_fire_s00000274) AND FIREABLE(merge_s00000449_activate_s00000286))) AND ((FIREABLE(merge_s00000283_fire_s00000287) AND FIREABLE(fork_s00000464_fire_s00000272) AND NOT FIREABLE(task_s00000718_inputCriterion_s0000... (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 1044 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 27 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-13.sara
sara: try reading problem file IBM703-PT-none-ReachabilityFireability-11.sara.
sara: try reading problem file IBM703-PT-none-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 182 markings, 188 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge_s00000806_fire_s00000287) AND FIREABLE(decision_s00000783_fire_s00000272) AND (FIREABLE(task_s00000732_inputCriterion_s00000257) OR FIREABLE(task_s00000750_outputCriterion_s00000258)))))
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 1044 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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 63 markings, 66 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file IBM703-PT-none-ReachabilityFireability-14.sara.
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(task_s00000755_outputCriterion_s00000258) AND NOT FIREABLE(decision_s00000775_fire_s00000274) AND FIREABLE(task_s00000709_inputCriterion_s00000257) AND FIREABLE(decision_s00000778_fire_s00000274) AND FIREABLE(merge_s00000456_activate_s00000289) AND ((FIREABLE(decision_s00000788_fire_s00000272) AND FIREABLE(task_s00000761_outputCriterion_s00000258)) OR (FIREABLE(decision_s00000... (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 1044 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 IBM703-PT-none-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 53 markings, 54 edges
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes no no yes no no no no no
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



FORMULA IBM703-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-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="IBM703-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-structural"
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/IBM703-PT-none.tgz
mv IBM703-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-structural"
echo " Input is IBM703-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 r107-smll-152658637500189"
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 ;