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 6.1M
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.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 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Dekker-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949300105
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527404365026


BK_STOP 1527404408784

--------------------
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 Dekker-PT-100 as instance name.
Using Dekker as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1823, 'Memory': 196.52, 'Tool': 'lola'}, {'Time': 2006, 'Memory': 206.75, 'Tool': 'lola'}, {'Time': 25582, 'Memory': 1177.75, 'Tool': 'itstools'}, {'Time': 26968, 'Memory': 1127.89, 'Tool': 'itstools'}, {'Time': 627699, 'Memory': 2914.25, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Dekker-PT-100...

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


checking for too many tokens
===========================================================================================
Dekker-PT-100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Dekker-PT-100 @ 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: 10700/65536 symbol table entries, 4008 collisions
lola: preprocessing...
lola: finding significant places
lola: 500 places, 10200 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 20300 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-100-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(withdraw_81_28) AND FIREABLE(withdraw_3_9)) OR (FIREABLE(withdraw_42_49) AND FIREABLE(withdraw_20_98) AND FIREABLE(withdraw_92_67) AND FIREABLE(try_79)) OR FIREABLE(withdraw_32_48)))) : A (G (((NOT FIREABLE(withdraw_90_97) AND NOT FIREABLE(withdraw_28_91)) OR (NOT FIREABLE(withdraw_24_93) AND NOT FIREABLE(withdraw_67_20)) OR NOT FIREABLE(withdraw_70_66)))) : A (G (NOT FIREABLE(withdraw_62_46))) : E (F (FIREABLE(withdraw_60_39))) : A (G (((NOT FIREABLE(withdraw_60_63) AND NOT FIREABLE(withdraw_2_61)) OR NOT FIREABLE(withdraw_24_3) OR (FIREABLE(withdraw_30_45) AND (FIREABLE(withdraw_50_46) OR FIREABLE(enter_2)) AND FIREABLE(withdraw_98_93))))) : A (G ((NOT FIREABLE(withdraw_65_6) AND (NOT FIREABLE(withdraw_54_77) OR NOT FIREABLE(withdraw_87_57) OR FIREABLE(withdraw_23_9))))) : E (F (((NOT FIREABLE(withdraw_50_75) OR NOT FIREABLE(withdraw_53_44)) AND FIREABLE(withdraw_79_70) AND (FIREABLE(withdraw_30_94) OR FIREABLE(withdraw_47_72) OR (FIREABLE(withdraw_91_66) AND FIREABLE(withdraw_36_37)) OR FIREABLE(withdraw_12_53))))) : E (F ((FIREABLE(withdraw_16_74) AND FIREABLE(withdraw_78_17) AND (FIREABLE(withdraw_55_73) OR FIREABLE(withdraw_67_24)) AND FIREABLE(withdraw_67_73) AND FIREABLE(withdraw_87_79)))) : A (G (NOT FIREABLE(withdraw_75_79))) : A (G (NOT FIREABLE(withdraw_97_88))) : E (F ((NOT FIREABLE(withdraw_81_55) AND NOT FIREABLE(withdraw_97_63) AND (NOT FIREABLE(withdraw_26_78) OR FIREABLE(withdraw_11_12)) AND NOT FIREABLE(withdraw_38_1) AND NOT FIREABLE(withdraw_56_93) AND FIREABLE(withdraw_62_16)))) : E (F ((FIREABLE(withdraw_47_71) AND (FIREABLE(withdraw_34_40) OR FIREABLE(withdraw_65_71) OR (FIREABLE(withdraw_74_10) AND FIREABLE(withdraw_82_42))) AND FIREABLE(try_3)))) : E (F ((NOT FIREABLE(withdraw_88_15) AND (FIREABLE(withdraw_29_57) OR FIREABLE(withdraw_77_64)) AND NOT FIREABLE(withdraw_10_32) AND ((FIREABLE(withdraw_11_27) AND FIREABLE(withdraw_38_23)) OR (FIREABLE(withdraw_5_23) AND FIREABLE(withdraw_70_17)) OR (FIREABLE(withdraw_96_6) AND FIREABLE(withdraw_5_46) AND NOT FIREABLE(withdraw_82_51)))))) : A (G (((NOT FIREABLE(withdraw_65_70) AND NOT FIREABLE(withdraw_63_32) AND NOT FIREABLE(withdraw_24_80)) OR (FIREABLE(withdraw_77_79) AND (NOT FIREABLE(withdraw_48_65) OR NOT FIREABLE(withdraw_23_3)))))) : E (F ((FIREABLE(withdraw_20_57) AND FIREABLE(withdraw_76_13) AND (FIREABLE(withdraw_62_40) OR FIREABLE(withdraw_58_0)) AND (NOT FIREABLE(withdraw_8_44) OR (FIREABLE(withdraw_82_47) AND FIREABLE(withdraw_42_36))) AND (NOT FIREABLE(withdraw_59_85) OR NOT FIREABLE(withdraw_21_52)) AND (NOT FIREABLE(withdraw_19_99) OR NOT FIREABLE(withdraw_26_22))))) : A (G ((NOT FIREABLE(withdraw_59_98) OR FIREABLE(withdraw_60_43) OR NOT FIREABLE(withdraw_16_47) OR NOT FIREABLE(withdraw_41_37) OR ((NOT FIREABLE(withdraw_7_81) OR NOT FIREABLE(withdraw_36_79)) AND FIREABLE(withdraw_60_21)))))
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(withdraw_81_28) AND FIREABLE(withdraw_3_9)) OR (FIREABLE(withdraw_42_49) AND FIREABLE(withdraw_20_98) AND FIREABLE(withdraw_92_67) AND FIREABLE(try_79)) OR FIREABLE(withdraw_32_48))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(withdraw_90_97) AND NOT FIREABLE(withdraw_28_91)) OR (NOT FIREABLE(withdraw_24_93) AND NOT FIREABLE(withdraw_67_20)) OR NOT FIREABLE(withdraw_70_66))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(withdraw_62_46)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(withdraw_60_39)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(withdraw_60_63) AND NOT FIREABLE(withdraw_2_61)) OR NOT FIREABLE(withdraw_24_3) OR (FIREABLE(withdraw_30_45) AND (FIREABLE(withdraw_50_46) OR FIREABLE(enter_2)) AND FIREABLE(withdraw_98_93)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 4860 literals and 609 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_65_6) AND (NOT FIREABLE(withdraw_54_77) OR NOT FIREABLE(withdraw_87_57) OR FIREABLE(withdraw_23_9)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(withdraw_50_75) OR NOT FIREABLE(withdraw_53_44)) AND FIREABLE(withdraw_79_70) AND (FIREABLE(withdraw_30_94) OR FIREABLE(withdraw_47_72) OR (FIREABLE(withdraw_91_66) AND FIREABLE(withdraw_36_37)) OR FIREABLE(withdraw_12_53)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 179 literals and 23 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_16_74) AND FIREABLE(withdraw_78_17) AND (FIREABLE(withdraw_55_73) OR FIREABLE(withdraw_67_24)) AND FIREABLE(withdraw_67_73) AND FIREABLE(withdraw_87_79))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(withdraw_75_79)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(withdraw_97_88)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(withdraw_81_55) AND NOT FIREABLE(withdraw_97_63) AND (NOT FIREABLE(withdraw_26_78) OR FIREABLE(withdraw_11_12)) AND NOT FIREABLE(withdraw_38_1) AND NOT FIREABLE(withdraw_56_93) AND FIREABLE(withdraw_62_16))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: state equation: Generated DNF with 2754 literals and 324 conjunctive subformulas
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_47_71) AND (FIREABLE(withdraw_34_40) OR FIREABLE(withdraw_65_71) OR (FIREABLE(withdraw_74_10) AND FIREABLE(withdraw_82_42))) AND FIREABLE(try_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 28 bytes per marking, with 24 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(withdraw_88_15) AND (FIREABLE(withdraw_29_57) OR FIREABLE(withdraw_77_64)) AND NOT FIREABLE(withdraw_10_32) AND ((FIREABLE(withdraw_11_27) AND FIREABLE(withdraw_38_23)) OR (FIREABLE(withdraw_5_23) AND FIREABLE(withdraw_70_17)) OR (FIREABLE(withdraw_96_6) AND FIREABLE(withdraw_5_46) AND NOT FIREABLE(withdraw_82_51))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 1044 literals and 90 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(withdraw_65_70) AND NOT FIREABLE(withdraw_63_32) AND NOT FIREABLE(withdraw_24_80)) OR (FIREABLE(withdraw_77_79) AND (NOT FIREABLE(withdraw_48_65) OR NOT FIREABLE(withdraw_23_3))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 12 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_20_57) AND FIREABLE(withdraw_76_13) AND (FIREABLE(withdraw_62_40) OR FIREABLE(withdraw_58_0)) AND (NOT FIREABLE(withdraw_8_44) OR (FIREABLE(withdraw_82_47) AND FIREABLE(withdraw_42_36))) AND (NOT FIREABLE(withdraw_59_85) OR NOT FIREABLE(withdraw_21_52)) AND (NOT FIREABLE(withdraw_19_99) OR NOT FIREABLE(withdraw_26_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 28 bytes per marking, with 24 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 3816 literals and 288 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_59_98) OR FIREABLE(withdraw_60_43) OR NOT FIREABLE(withdraw_16_47) OR NOT FIREABLE(withdraw_41_37) OR ((NOT FIREABLE(withdraw_7_81) OR NOT FIREABLE(withdraw_36_79)) AND FIREABLE(withdraw_60_21)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 147 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes yes no no yes yes yes no yes no
FORMULA Dekker-PT-100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished 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="Dekker-PT-100"
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/Dekker-PT-100.tgz
mv Dekker-PT-100 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 Dekker-PT-100, 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-152649949300105"
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 ;