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 372K
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K 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 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 98K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Peterson-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474200560
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527154971940


BK_STOP 1527155016111

--------------------
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 Peterson-PT-2 as instance name.
Using Peterson as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': True, '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': 620, 'Memory': 106.67, 'Tool': 'lola'}, {'Time': 671, 'Memory': 107.28, 'Tool': 'lola'}, {'Time': 3140, 'Memory': 2205.98, 'Tool': 'marcie'}, {'Time': 3215, 'Memory': 2206.16, 'Tool': 'marcie'}, {'Time': 4467, 'Memory': 291.64, 'Tool': 'itstools'}, {'Time': 4682, 'Memory': 310.84, 'Tool': 'itstools'}, {'Time': 22885, 'Memory': 649.27, 'Tool': 'gspn'}, {'Time': 25287, 'Memory': 687.7, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 7.20483870967742x far from the best tool lola.
ReachabilityFireability lola Peterson-PT-2...

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


checking for too many tokens
===========================================================================================
Peterson-PT-2: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Peterson-PT-2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-PT-2-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0) AND NOT FIREABLE(ContinueLoop_2_1_0) AND NOT FIREABLE(ContinueLoop_0_2_0) AND NOT FIREABLE(ContinueLoop_1_2_0) AND NOT FIREABLE(ContinueLoop_2_2_0) AND NOT FIREABLE(ContinueLoop_0_0_1) AND NOT FIREABLE(ContinueLoop_1_0_1) AND NOT FIREABLE(ContinueLoop_2_0_1) AND NOT FIREABLE(ContinueLoop_0_1_1) AND NOT FIREABLE(ContinueLoop_0_0_0) AND NOT FIREABLE(ContinueLoop_1_0_0) AND NOT FIREABLE(ContinueLoop_2_0_0) AND NOT FIREABLE(ContinueLoop_0_1_0) AND NOT FIREABLE(ContinueLoop_1_1_0) AND NOT FIREABLE(ContinueLoop_1_2_1) AND NOT FIREABLE(ContinueLoop_0_2_1) AND NOT FIREABLE(ContinueLoop_2_1_1) AND NOT FIREABLE(ContinueLoop_1_1_1) AND NOT FIREABLE(ContinueLoop_2_2_1) AND (FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0)) AND ((NOT FIREABLE(Loop_0_0_0) AND NOT FIREABLE(Loop_2_0_1) AND NOT FIREABLE(Loop_1_0_1) AND NOT FIREABLE(Loop_0_0_1) AND NOT FIREABLE(Loop_2_1_0) AND NOT FIREABLE(Loop_1_1_0) AND NOT FIREABLE(Loop_0_1_0) AND NOT FIREABLE(Loop_2_0_0) AND NOT FIREABLE(Loop_1_0_0) AND NOT FIREABLE(Loop_2_1_1) AND NOT FIREABLE(Loop_1_1_1) AND NOT FIREABLE(Loop_0_1_1) AND NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0)) OR (NOT FIREABLE(NotAlone_0_1_0) AND NOT FIREABLE(NotAlone_2_0_0) AND NOT FIREABLE(NotAlone_0_2_0) AND NOT FIREABLE(NotAlone_2_1_0) AND NOT FIREABLE(NotAlone_1_0_1) AND NOT FIREABLE(NotAlone_1_2_0) AND NOT FIREABLE(NotAlone_0_1_1) AND NOT FIREABLE(NotAlone_2_0_1) AND NOT FIREABLE(NotAlone_1_0_0) AND NOT FIREABLE(NotAlone_2_1_1) AND NOT FIREABLE(NotAlone_0_2_1) AND NOT FIREABLE(NotAlone_1_2_1) AND NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIREABLE(UpdateTurn_1_0_1) AND NOT FIREABLE(UpdateTurn_1_1_1) AND NOT FIREABLE(UpdateTurn_0_1_1) AND NOT FIREABLE(UpdateTurn_1_2_0) AND NOT FIREABLE(UpdateTurn_0_2_0) AND NOT FIREABLE(UpdateTurn_0_0_1) AND NOT FIREABLE(UpdateTurn_2_2_0)))))) : E (F (((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1) OR (NOT FIREABLE(NoIdentity_2_0_0) AND NOT FIREABLE(NoIdentity_1_0_0) AND NOT FIREABLE(NoIdentity_2_1_0) AND NOT FIREABLE(NoIdentity_0_1_0) AND NOT FIREABLE(NoIdentity_0_1_1) AND NOT FIREABLE(NoIdentity_2_1_1) AND NOT FIREABLE(NoIdentity_0_2_1) AND NOT FIREABLE(NoIdentity_1_2_1) AND NOT FIREABLE(NoIdentity_0_2_0) AND NOT FIREABLE(NoIdentity_1_2_0) AND NOT FIREABLE(NoIdentity_1_0_1) AND NOT FIREABLE(NoIdentity_2_0_1))) AND (FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_0_0) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1)) AND NOT FIREABLE(Identity_1_1) AND NOT FIREABLE(Identity_2_1) AND NOT FIREABLE(Identity_0_0) AND NOT FIREABLE(Identity_1_0) AND NOT FIREABLE(Identity_2_0) AND NOT FIREABLE(Identity_0_1) AND (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1)) AND (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)) AND (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1) OR FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1) OR FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) OR FIREABLE(UpdateTurn_0_1_1) OR FIREABLE(UpdateTurn_1_2_0) OR FIREABLE(UpdateTurn_0_2_0) OR FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_2_2_0))))) : E (F ((NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIREABLE(UpdateTurn_1_0_1) AND NOT FIREABLE(UpdateTurn_1_1_1) AND NOT FIREABLE(UpdateTurn_0_1_1) AND NOT FIREABLE(UpdateTurn_1_2_0) AND NOT FIREABLE(UpdateTurn_0_2_0) AND NOT FIREABLE(UpdateTurn_0_0_1) AND NOT FIREABLE(UpdateTurn_2_2_0) AND (FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)) AND (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1)) AND ((NOT FIREABLE(Ask_1) AND NOT FIREABLE(Ask_2) AND NOT FIREABLE(Ask_0) AND (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))) OR (NOT FIREABLE(NoIdentity_2_0_0) AND NOT FIREABLE(NoIdentity_1_0_0) AND NOT FIREABLE(NoIdentity_2_1_0) AND NOT FIREABLE(NoIdentity_0_1_0) AND NOT FIREABLE(NoIdentity_0_1_1) AND NOT FIREABLE(NoIdentity_2_1_1) AND NOT FIREABLE(NoIdentity_0_2_1) AND NOT FIREABLE(NoIdentity_1_2_1) AND NOT FIREABLE(NoIdentity_0_2_0) AND NOT FIREABLE(NoIdentity_1_2_0) AND NOT FIREABLE(NoIdentity_1_0_1) AND NOT FIREABLE(NoIdentity_2_0_1) AND (FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) OR FIREABLE(UpdateTurn_0_1_1) OR FIREABLE(UpdateTurn_1_2_0) OR FIREABLE(UpdateTurn_0_2_0) OR FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_2_2_0) OR FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(NoIdentity_1_2_1) OR FIREABLE(NoIdentity_0_2_0) OR FIREABLE(NoIdentity_1_2_0) OR FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1))))))) : A (G (((NOT FIREABLE(EndLoop_2_1) AND NOT FIREABLE(EndLoop_0_1) AND NOT FIREABLE(EndLoop_1_1) AND NOT FIREABLE(EndLoop_1_0) AND NOT FIREABLE(EndLoop_2_0) AND NOT FIREABLE(EndLoop_0_0)) OR (NOT FIREABLE(BecomeIdle_2) AND NOT FIREABLE(BecomeIdle_1) AND NOT FIREABLE(BecomeIdle_0)) OR FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) OR FIREABLE(UpdateTurn_0_1_1) OR FIREABLE(UpdateTurn_1_2_0) OR FIREABLE(UpdateTurn_0_2_0) OR FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_2_2_0) OR (NOT FIREABLE(Alone1_0_2_0) AND NOT FIREABLE(Alone1_2_1_0) AND NOT FIREABLE(Alone1_0_1_0) AND NOT FIREABLE(Alone1_2_0_0) AND NOT FIREABLE(Alone1_1_0_0) AND NOT FIREABLE(Alone1_1_0_1) AND NOT FIREABLE(Alone1_1_2_0) AND NOT FIREABLE(Alone1_0_1_1) AND NOT FIREABLE(Alone1_2_0_1) AND NOT FIREABLE(Alone1_0_2_1) AND NOT FIREABLE(Alone1_2_1_1) AND NOT FIREABLE(Alone1_1_2_1)) OR (NOT FIREABLE(TurnDiff_1_0_1) AND NOT FIREABLE(TurnDiff_1_2_0) AND NOT FIREABLE(TurnDiff_0_2_0) AND NOT FIREABLE(TurnDiff_2_1_0) AND NOT FIREABLE(TurnDiff_0_2_1) AND NOT FIREABLE(TurnDiff_2_1_1) AND NOT FIREABLE(TurnDiff_0_1_1) AND NOT FIREABLE(TurnDiff_2_0_1) AND NOT FIREABLE(TurnDiff_0_1_0) AND NOT FIREABLE(TurnDiff_2_0_0) AND NOT FIREABLE(TurnDiff_1_0_0) AND NOT FIREABLE(TurnDiff_1_2_1) AND (FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0))) OR (NOT FIREABLE(BecomeIdle_2) AND NOT FIREABLE(BecomeIdle_1) AND NOT FIREABLE(BecomeIdle_0) AND NOT FIREABLE(ContinueLoop_2_1_0) AND NOT FIREABLE(ContinueLoop_0_2_0) AND NOT FIREABLE(ContinueLoop_1_2_0) AND NOT FIREABLE(ContinueLoop_2_2_0) AND NOT FIREABLE(ContinueLoop_0_0_1) AND NOT FIREABLE(ContinueLoop_1_0_1) AND NOT FIREABLE(ContinueLoop_2_0_1) AND NOT FIREABLE(ContinueLoop_0_1_1) AND NOT FIREABLE(ContinueLoop_0_0_0) AND NOT FIREABLE(ContinueLoop_1_0_0) AND NOT FIREABLE(ContinueLoop_2_0_0) AND NOT FIREABLE(ContinueLoop_0_1_0) AND NOT FIREABLE(ContinueLoop_1_1_0) AND NOT FIREABLE(ContinueLoop_1_2_1) AND NOT FIREABLE(ContinueLoop_0_2_1) AND NOT FIREABLE(ContinueLoop_2_1_1) AND NOT FIREABLE(ContinueLoop_1_1_1) AND NOT FIREABLE(ContinueLoop_2_2_1))))) : E (F ((NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND (FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1)) AND NOT FIREABLE(NoIdentity_2_0_0) AND NOT FIREABLE(NoIdentity_1_0_0) AND NOT FIREABLE(NoIdentity_2_1_0) AND NOT FIREABLE(NoIdentity_0_1_0) AND NOT FIREABLE(NoIdentity_0_1_1) AND NOT FIREABLE(NoIdentity_2_1_1) AND NOT FIREABLE(NoIdentity_0_2_1) AND NOT FIREABLE(NoIdentity_1_2_1) AND NOT FIREABLE(NoIdentity_0_2_0) AND NOT FIREABLE(NoIdentity_1_2_0) AND NOT FIREABLE(NoIdentity_1_0_1) AND NOT FIREABLE(NoIdentity_2_0_1)))) : E (F ((NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0) AND NOT FIREABLE(Ask_1) AND NOT FIREABLE(Ask_2) AND NOT FIREABLE(Ask_0) AND (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1)) AND (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))) : E (F ((FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0)))) : E (F ((NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIREABLE(UpdateTurn_1_0_1) AND NOT FIREABLE(UpdateTurn_1_1_1) AND NOT FIREABLE(UpdateTurn_0_1_1) AND NOT FIREABLE(UpdateTurn_1_2_0) AND NOT FIREABLE(UpdateTurn_0_2_0) AND NOT FIREABLE(UpdateTurn_0_0_1) AND NOT FIREABLE(UpdateTurn_2_2_0) AND NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIREABLE(UpdateTurn_1_0_1) AND NOT FIREABLE(UpdateTurn_1_1_1) AND NOT FIREABLE(UpdateTurn_0_1_1) AND NOT FIREABLE(UpdateTurn_1_2_0) AND NOT FIREABLE(UpdateTurn_0_2_0) AND NOT FIREABLE(UpdateTurn_0_0_1) AND NOT FIREABLE(UpdateTurn_2_2_0) AND (FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))))) : E (F ((NOT FIREABLE(EndLoop_1_0) AND FIREABLE(NotAlone_1_2_1)))) : E (F (FIREABLE(ContinueLoop_0_2_1))) : E (F ((FIREABLE(ContinueLoop_0_2_0) AND FIREABLE(UpdateTurn_1_1_0) AND FIREABLE(NoIdentity_0_2_1)))) : A (G ((NOT FIREABLE(ContinueLoop_2_1_1) OR NOT FIREABLE(NotAlone_0_1_1) OR NOT FIREABLE(NoIdentity_1_2_0) OR NOT FIREABLE(UpdateTurn_1_2_0)))) : E (F ((FIREABLE(ContinueLoop_0_0_1) AND FIREABLE(UpdateTurn_1_1_0) AND (FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_0_1_0)) AND FIREABLE(ContinueLoop_1_1_1) AND FIREABLE(Alone1_1_2_1)))) : A (G ((FIREABLE(NoIdentity_2_0_0) OR FIREABLE(Loop_0_0_0) OR NOT FIREABLE(TurnDiff_2_0_0) OR NOT FIREABLE(TurnDiff_1_2_1) OR NOT FIREABLE(NotAlone_2_1_1) OR NOT FIREABLE(Alone1_1_2_0)))) : E (F ((NOT FIREABLE(ContinueLoop_2_1_1) AND NOT FIREABLE(TurnEqual_2_0) AND ((FIREABLE(EndLoop_0_0) AND FIREABLE(TurnEqual_2_1)) OR FIREABLE(Identity_2_1)) AND FIREABLE(ContinueLoop_1_1_0) AND (FIREABLE(Alone1_2_1_1) OR FIREABLE(NotAlone_0_2_0)) AND FIREABLE(TurnDiff_1_2_0)))) : E (F (FIREABLE(ContinueLoop_1_2_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(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0) AND NOT FIREABLE(ContinueLoop_2_1_0) AND NOT FIREABLE(ContinueLoop_0_2_0) AND NOT FIREABLE(ContinueLoop_1_2_0) AND NOT FIREABLE(ContinueLoop_2_2_0) AND NOT FIREABLE(ContinueLoop_0_0_1) AND NOT FIREABLE(ContinueLoop_1_0_1) AND NOT FIREABLE(ContinueLoop_2_0_1) AND NOT FIREABLE(ContinueLoop_0_1... (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 12 bytes per marking, with 5 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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) ... (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 12 bytes per marking, with 5 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIRE... (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 12 bytes per marking, with 5 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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 20754 markings, 60915 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(EndLoop_2_1) AND NOT FIREABLE(EndLoop_0_1) AND NOT FIREABLE(EndLoop_1_1) AND NOT FIREABLE(EndLoop_1_0) AND NOT FIREABLE(EndLoop_2_0) AND NOT FIREABLE(EndLoop_0_0)) OR (NOT FIREABLE(BecomeIdle_2) AND NOT FIREABLE(BecomeIdle_1) AND NOT FIREABLE(BecomeIdle_0)) OR FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1... (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 12 bytes per marking, with 5 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 invariant.
lola: 15923 markings, 42726 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND (FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDi... (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 12 bytes per marking, with 5 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0) AND NOT FIREABLE(Ask_1) AND NOT FIREABLE(Ask_2) AND NOT FIREABLE(Ask_0) AND (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(Continue... (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 12 bytes per marking, with 5 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0))))
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 12 bytes per marking, with 5 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(UpdateTurn_1_0_0) AND NOT FIREABLE(UpdateTurn_1_1_0) AND NOT FIREABLE(UpdateTurn_2_1_0) AND NOT FIREABLE(UpdateTurn_2_0_0) AND NOT FIREABLE(UpdateTurn_0_1_0) AND NOT FIREABLE(UpdateTurn_0_2_1) AND NOT FIREABLE(UpdateTurn_2_1_1) AND NOT FIREABLE(UpdateTurn_2_2_1) AND NOT FIREABLE(UpdateTurn_1_2_1) AND NOT FIREABLE(UpdateTurn_2_0_1) AND NOT FIRE... (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 12 bytes per marking, with 5 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(EndLoop_1_0) AND FIREABLE(NotAlone_1_2_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 12 bytes per marking, with 5 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 Peterson-PT-2-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ContinueLoop_0_2_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 12 bytes per marking, with 5 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 Peterson-PT-2-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1399 markings, 3221 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ContinueLoop_0_2_0) AND FIREABLE(UpdateTurn_1_1_0) AND FIREABLE(NoIdentity_0_2_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 12 bytes per marking, with 5 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ContinueLoop_2_1_1) OR NOT FIREABLE(NotAlone_0_1_1) OR NOT FIREABLE(NoIdentity_1_2_0) OR NOT FIREABLE(UpdateTurn_1_2_0))))
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 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ContinueLoop_0_0_1) AND FIREABLE(UpdateTurn_1_1_0) AND (FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_0_1_0)) AND FIREABLE(ContinueLoop_1_1_1) AND FIREABLE(Alone1_1_2_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 12 bytes per marking, with 5 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 Peterson-PT-2-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(NoIdentity_2_0_0) OR FIREABLE(Loop_0_0_0) OR NOT FIREABLE(TurnDiff_2_0_0) OR NOT FIREABLE(TurnDiff_1_2_1) OR NOT FIREABLE(NotAlone_2_1_1) OR NOT FIREABLE(Alone1_1_2_0))))
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 12 bytes per marking, with 5 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ContinueLoop_2_1_1) AND NOT FIREABLE(TurnEqual_2_0) AND ((FIREABLE(EndLoop_0_0) AND FIREABLE(TurnEqual_2_1)) OR FIREABLE(Identity_2_1)) AND FIREABLE(ContinueLoop_1_1_0) AND (FIREABLE(Alone1_2_1_1) OR FIREABLE(NotAlone_0_2_0)) AND FIREABLE(TurnDiff_1_2_0))))
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 12 bytes per marking, with 5 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 Peterson-PT-2-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ContinueLoop_1_2_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 12 bytes per marking, with 5 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 Peterson-PT-2-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes yes yes yes yes no yes no yes no yeslola:
state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA Peterson-PT-2-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-ReachabilityFireability-15 CANNOT_COMPUTE 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="Peterson-PT-2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 irma4mcc-structural"
echo " Input is Peterson-PT-2, 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 r115-csrt-152666474200560"
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 ;