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 4.8M
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 4.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Diffusion2D-PT-D40N010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949600266
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527408885730


BK_STOP 1527408929254

--------------------
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 Diffusion2D-PT-D40N010 as instance name.
Using Diffusion2D 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': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 2979, 'Memory': 144.11, 'Tool': 'lola'}, {'Time': 3227, 'Memory': 153.66, 'Tool': 'lola'}, {'Time': 65707, 'Memory': 1703.12, 'Tool': 'itstools'}, {'Time': 67077, 'Memory': 1733.52, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Diffusion2D-PT-D40N010...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Diffusion2D-PT-D40N010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Diffusion2D-PT-D40N010 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 13924/65536 symbol table entries, 3777 collisions
lola: preprocessing...
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1600 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D40N010-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t1_6_36_6_37) AND NOT FIREABLE(t1_9_33_10_32) AND NOT FIREABLE(t1_2_25_3_24) AND (FIREABLE(t1_21_32_20_33) OR FIREABLE(t1_3_21_2_22))))) : E (F (FIREABLE(t1_11_37_12_37))) : E (F ((FIREABLE(t1_29_24_28_25) AND FIREABLE(t1_29_15_28_14) AND (FIREABLE(t1_8_29_7_30) OR FIREABLE(t1_12_6_13_5)) AND FIREABLE(t1_23_26_23_25) AND FIREABLE(t1_6_21_6_22)))) : E (F (((FIREABLE(t1_6_5_7_4) AND FIREABLE(t1_16_27_15_26) AND NOT FIREABLE(t1_24_22_24_23) AND NOT FIREABLE(t1_15_27_16_26) AND NOT FIREABLE(t1_39_1_40_2)) OR FIREABLE(t1_33_5_32_6)))) : A (G (NOT FIREABLE(t1_14_20_13_19))) : E (F (FIREABLE(t1_9_29_8_30))) : A (G ((NOT FIREABLE(t1_9_25_10_26) OR NOT FIREABLE(t1_29_14_30_14) OR (FIREABLE(t1_29_21_30_20) AND (NOT FIREABLE(t1_15_26_16_25) OR NOT FIREABLE(t1_36_22_37_23)))))) : E (F ((((FIREABLE(t1_18_32_17_33) AND FIREABLE(t1_2_1_1_2)) OR FIREABLE(t1_22_36_21_35) OR (FIREABLE(t1_15_19_15_20) AND FIREABLE(t1_23_30_22_30) AND NOT FIREABLE(t1_22_5_21_6))) AND FIREABLE(t1_28_25_27_26)))) : A (G ((NOT FIREABLE(t1_37_23_36_22) OR FIREABLE(t1_23_30_24_30) OR FIREABLE(t1_10_35_11_35) OR NOT FIREABLE(t1_23_29_23_28) OR (FIREABLE(t1_14_2_13_2) AND FIREABLE(t1_3_37_4_36) AND (FIREABLE(t1_37_5_36_6) OR FIREABLE(t1_23_12_24_11)) AND FIREABLE(t1_31_36_31_35) AND FIREABLE(t1_20_6_21_7) AND (FIREABLE(t1_32_14_31_13) OR FIREABLE(t1_3_19_3_20)))))) : E (F (((NOT FIREABLE(t1_31_3_31_2) OR NOT FIREABLE(t1_19_33_18_32) OR FIREABLE(t1_10_21_10_22)) AND FIREABLE(t1_28_9_28_10)))) : A (G ((NOT FIREABLE(t1_13_10_14_10) OR NOT FIREABLE(t1_28_31_27_31) OR (NOT FIREABLE(t1_30_13_30_14) AND NOT FIREABLE(t1_20_7_19_6)) OR FIREABLE(t1_29_38_28_37)))) : E (F ((FIREABLE(t1_27_3_26_4) AND ((FIREABLE(t1_17_25_17_24) AND FIREABLE(t1_5_27_5_28)) OR FIREABLE(t1_15_35_14_35) OR (NOT FIREABLE(t1_2_34_3_33) AND NOT FIREABLE(t1_17_25_17_24)))))) : A (G (NOT FIREABLE(t1_2_33_1_34))) : E (F (((NOT FIREABLE(t1_26_38_25_38) OR NOT FIREABLE(t1_9_30_8_31)) AND FIREABLE(t1_13_26_14_25) AND NOT FIREABLE(t1_17_3_18_3)))) : E (F (FIREABLE(t1_30_4_30_3))) : E (F (((NOT FIREABLE(t1_32_20_33_20) OR NOT FIREABLE(t1_3_27_2_26)) AND (NOT FIREABLE(t1_2_27_3_28) OR NOT FIREABLE(t1_22_26_22_25)) AND FIREABLE(t1_38_13_39_13) AND FIREABLE(t1_15_1_14_1))))
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(t1_6_36_6_37) AND NOT FIREABLE(t1_9_33_10_32) AND NOT FIREABLE(t1_2_25_3_24) AND (FIREABLE(t1_21_32_20_33) OR FIREABLE(t1_3_21_2_22)))))
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 6396 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_11_37_12_37)))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_29_24_28_25) AND FIREABLE(t1_29_15_28_14) AND (FIREABLE(t1_8_29_7_30) OR FIREABLE(t1_12_6_13_5)) AND FIREABLE(t1_23_26_23_25) AND FIREABLE(t1_6_21_6_22))))
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 6396 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 477 markings, 1608 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_6_5_7_4) AND FIREABLE(t1_16_27_15_26) AND NOT FIREABLE(t1_24_22_24_23) AND NOT FIREABLE(t1_15_27_16_26) AND NOT FIREABLE(t1_39_1_40_2)) OR FIREABLE(t1_33_5_32_6))))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_14_20_13_19)))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_9_29_8_30)))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_9_25_10_26) OR NOT FIREABLE(t1_29_14_30_14) OR (FIREABLE(t1_29_21_30_20) AND (NOT FIREABLE(t1_15_26_16_25) OR NOT FIREABLE(t1_36_22_37_23))))))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1_18_32_17_33) AND FIREABLE(t1_2_1_1_2)) OR FIREABLE(t1_22_36_21_35) OR (FIREABLE(t1_15_19_15_20) AND FIREABLE(t1_23_30_22_30) AND NOT FIREABLE(t1_22_5_21_6))) AND FIREABLE(t1_28_25_27_26))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 75 markings, 195 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_37_23_36_22) OR FIREABLE(t1_23_30_24_30) OR FIREABLE(t1_10_35_11_35) OR NOT FIREABLE(t1_23_29_23_28) OR (FIREABLE(t1_14_2_13_2) AND FIREABLE(t1_3_37_4_36) AND (FIREABLE(t1_37_5_36_6) OR FIREABLE(t1_23_12_24_11)) AND FIREABLE(t1_31_36_31_35) AND FIREABLE(t1_20_6_21_7) AND (FIREABLE(t1_32_14_31_13) OR FIREABLE(t1_3_19_3_20))))))
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 6396 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 6 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 104 markings, 313 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1_31_3_31_2) OR NOT FIREABLE(t1_19_33_18_32) OR FIREABLE(t1_10_21_10_22)) AND FIREABLE(t1_28_9_28_10))))
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 6396 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_13_10_14_10) OR NOT FIREABLE(t1_28_31_27_31) OR (NOT FIREABLE(t1_30_13_30_14) AND NOT FIREABLE(t1_20_7_19_6)) OR FIREABLE(t1_29_38_28_37))))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_27_3_26_4) AND ((FIREABLE(t1_17_25_17_24) AND FIREABLE(t1_5_27_5_28)) OR FIREABLE(t1_15_35_14_35) OR (NOT FIREABLE(t1_2_34_3_33) AND NOT FIREABLE(t1_17_25_17_24))))))
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 6396 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_2_33_1_34)))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1_26_38_25_38) OR NOT FIREABLE(t1_9_30_8_31)) AND FIREABLE(t1_13_26_14_25) AND NOT FIREABLE(t1_17_3_18_3))))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_30_4_30_3)))
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 6396 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 Diffusion2D-PT-D40N010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1_32_20_33_20) OR NOT FIREABLE(t1_3_27_2_26)) AND (NOT FIREABLE(t1_2_27_3_28) OR NOT FIREABLE(t1_22_26_22_25)) AND FIREABLE(t1_38_13_39_13) AND FIREABLE(t1_15_1_14_1))))
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 6396 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 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N010-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 37 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no yes no yes no yes no yes yes yes
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N010-ReachabilityFireability-15 TRUE 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="Diffusion2D-PT-D40N010"
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/Diffusion2D-PT-D40N010.tgz
mv Diffusion2D-PT-D40N010 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 Diffusion2D-PT-D40N010, 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 r082-blw3-152649949600266"
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 ;