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 mcc4mcc-full
Input is Peterson-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478600556
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527297174397


BK_STOP 1527297218706

--------------------
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 Peterson-PT-2 as instance name.
Using Peterson as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 486, 'Memory': 106.93, 'Tool': 'lola'}, {'Time': 932, 'Memory': 116.08, 'Tool': 'lola'}, {'Time': 18016, 'Memory': 567.21, 'Tool': 'gspn'}, {'Time': 20391, 'Memory': 595, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Peterson-PT-2...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: A (G (A (F (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2)))))) : ((NOT(A (F ((CS_0 + CS_1 + CS_2 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1)))) AND (2 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2)) OR A (G ((((3 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)) OR ((BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F) AND (BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2 <= CS_0 + CS_1 + CS_2)))))) : E ((E (F ((1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))) U (3 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1))) : E (F ((((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2) OR (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1)) AND ((IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_0 + IsEndLoop_2_1_1 + IsEndLoop_2_1_2 <= 1) OR (CS_0 + CS_1 + CS_2 <= 1))))) : NOT((E (((CS_0 + CS_1 + CS_2 <= Idle_0 + Idle_1 + Idle_2) U (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1))) AND A (((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= Idle_0 + Idle_1 + Idle_2))))) : A (F ((Idle_0 + Idle_1 + Idle_2 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1))) : NOT(A (G ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))) : A (F (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= 2) AND (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2)))) : A (X (E (F ((3 <= Turn_0_1))))) : (E (F ((WantSection_1_T + 1 <= IsEndLoop_1_0_0))) OR (E (((CS_2 <= TestIdentity_1_1_2) U (TestAlone_0_1_2 <= TestTurn_0_1))) AND (E (G ((3 <= BeginLoop_1_1_2))) AND ((2 <= IsEndLoop_0_1_1) AND (WantSection_1_T <= TestAlone_1_1_0) AND (TestIdentity_2_0_0 <= TestAlone_2_0_1))))) : E (F ((3 <= EndTurn_2_0))) : E ((((2 <= TestTurn_0_1) AND (3 <= WantSection_0_F) AND ((1 <= BeginLoop_0_0_2) OR (2 <= TestIdentity_2_0_1))) U E (F ((2 <= IsEndLoop_1_1_1))))) : E (X (E (F ((2 <= IsEndLoop_0_1_1))))) : (E (F ((((2 <= Idle_1) OR (IsEndLoop_2_0_1 <= AskForSection_0_1)) AND (Idle_0 <= BeginLoop_2_1_2)))) AND (((BeginLoop_1_0_0 + 1 <= TestTurn_1_1) AND (IsEndLoop_0_0_0 + 1 <= Turn_0_0) AND (TestIdentity_1_1_0 + 1 <= BeginLoop_0_0_0) AND (BeginLoop_0_1_2 + 1 <= TestIdentity_2_1_1)) OR E (F (((3 <= AskForSection_0_1) AND (IsEndLoop_2_0_0 <= BeginLoop_2_0_2)))))) : A (((BeginLoop_1_1_2 <= BeginLoop_1_1_1) U A (G ((TestIdentity_0_1_2 <= IsEndLoop_2_1_0))))) : (A (X (((Turn_1_2 <= WantSection_1_T) OR (TestAlone_2_0_1 <= TestIdentity_1_0_2)))) AND E ((((3 <= EndTurn_1_1) OR (TestTurn_2_0 <= BeginLoop_2_1_2)) U ((3 <= EndTurn_0_0) OR (2 <= WantSection_2_T)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + Test... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestAlone_0_1_2 + TestAlone_1_0_0 + TestAlone_1_0_2 + TestAlone_1_1_0 + TestAlone_1_1_2 <= Turn_1_1 + Turn_1_0 + Turn_0_1 + Turn_0_0 + Turn_0_2 + Turn_1_2) AND (1 <= TestAlone_2_0_0 + TestAlone_2_0_1 + TestAlone_2_1_0 + TestAlone_2_1_1 + TestAlon... (shortened)
lola: processed formula length: 539
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 989 markings, 1422 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((CS_0 + CS_1 + CS_2 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1)))) AND (2 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 + 1 <= CS_0 + CS_1 + CS_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (CS_0 + CS_1 + CS_2 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1)))
lola: processed formula length: 120
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)) OR ((BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + Be... (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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F))) U (3 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)) U (3 <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1))
lola: processed formula length: 216
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8712 markings, 25350 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F + 1 <= IsEndLoop_0_0_0 + IsEndLoop_0_0_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_0 + IsEndLoop_0_1_1 + IsEndLoop_0_1_2 + IsEndLoop_1_0_0 + IsEndLoop_1_0_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_0 + IsEndLoop_1_1_1 + IsEndLoop_1_1_2 + IsEndLoop_2_0_0 + IsEndLoop_2_0_1 + IsEndLoop_2_0_2 + IsEndLoo... (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: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLCardinality-3.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: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((CS_0 + CS_1 + CS_2 <= Idle_0 + Idle_1 + Idle_2) U (WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F <= EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1))) AND A (((3 <= TestTurn_0_0 + TestTurn_0_1 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_2_0 + TestTurn_2_1) U (2 <= Idle_0 + Idle_1 + Idle_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Idle_0 + Idle_1 + Idle_2 + 1 <= CS_0 + CS_1 + CS_2) R (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((Idle_0 + Idle_1 + Idle_2 + 1 <= CS_0 + CS_1 + CS_2) R (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))
lola: processed formula: A (((Idle_0 + Idle_1 + Idle_2 + 1 <= CS_0 + CS_1 + CS_2) R (EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 + 1 <= WantSection_2_T + WantSection_2_F + WantSection_1_T + WantSection_1_F + WantSection_0_T + WantSection_0_F)))
lola: processed formula length: 257
lola: 9 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5685 markings, 9647 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Idle_0 + Idle_1 + Idle_2 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Idle_0 + Idle_1 + Idle_2 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1)))
lola: processed formula: A (F ((Idle_0 + Idle_1 + Idle_2 <= AskForSection_2_0 + AskForSection_0_0 + AskForSection_0_1 + AskForSection_1_0 + AskForSection_1_1 + AskForSection_2_1)))
lola: processed formula length: 155
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 52 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 <= WantSectio... (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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLCardinality-6.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= 2) AND (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= 2) AND (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2))))
lola: processed formula: A (F (((EndTurn_1_0 + EndTurn_1_1 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_0_0 + EndTurn_0_1 <= 2) AND (1 <= TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + ... (shortened)
lola: processed formula length: 485
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 377 markings, 471 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= Turn_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= Turn_0_1)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 62262 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((WantSection_1_T + 1 <= IsEndLoop_1_0_0))) OR (E (((CS_2 <= TestIdentity_1_1_2) U (TestAlone_0_1_2 <= TestTurn_0_1))) AND (E (G ((3 <= BeginLoop_1_1_2))) AND ((2 <= IsEndLoop_0_1_1) AND (WantSection_1_T <= TestAlone_1_1_0) AND (TestIdentity_2_0_0 <= TestAlone_2_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((WantSection_1_T + 1 <= IsEndLoop_1_0_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLCardinality-9.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: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((CS_2 <= TestIdentity_1_1_2) U (TestAlone_0_1_2 <= TestTurn_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((CS_2 <= TestIdentity_1_1_2) U (TestAlone_0_1_2 <= TestTurn_0_1))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= BeginLoop_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (BeginLoop_1_1_2 <= 2)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= EndTurn_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLCardinality-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: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= TestTurn_0_1) AND (3 <= WantSection_0_F) AND ((1 <= BeginLoop_0_0_2) OR (2 <= TestIdentity_2_0_1))) U E (F ((2 <= IsEndLoop_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= TestTurn_0_1) AND (3 <= WantSection_0_F) AND ((1 <= BeginLoop_0_0_2) OR (2 <= TestIdentity_2_0_1))) U E(TRUE U (2 <= IsEndLoop_1_1_1)))
lola: processed formula length: 145
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8758 markings, 16899 edges
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= IsEndLoop_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (2 <= IsEndLoop_0_1_1)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 62264 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((2 <= Idle_1) OR (IsEndLoop_2_0_1 <= AskForSection_0_1)) AND (Idle_0 <= BeginLoop_2_1_2)))) AND (((BeginLoop_1_0_0 + 1 <= TestTurn_1_1) AND (IsEndLoop_0_0_0 + 1 <= Turn_0_0) AND (TestIdentity_1_1_0 + 1 <= BeginLoop_0_0_0) AND (BeginLoop_0_1_2 + 1 <= TestIdentity_2_1_1)) OR E (F (((3 <= AskForSection_0_1) AND (IsEndLoop_2_0_0 <= BeginLoop_2_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= Idle_1) OR (IsEndLoop_2_0_1 <= AskForSection_0_1)) AND (Idle_0 <= BeginLoop_2_1_2))))
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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((BeginLoop_1_0_0 + 1 <= TestTurn_1_1) AND (IsEndLoop_0_0_0 + 1 <= Turn_0_0) AND (TestIdentity_1_1_0 + 1 <= BeginLoop_0_0_0) AND (BeginLoop_0_1_2 + 1 <= TestIdentity_2_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((BeginLoop_1_0_0 + 1 <= TestTurn_1_1) AND (IsEndLoop_0_0_0 + 1 <= Turn_0_0) AND (TestIdentity_1_1_0 + 1 <= BeginLoop_0_0_0) AND (BeginLoop_0_1_2 + 1 <= TestIdentity_2_1_1))
lola: processed formula length: 173
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= AskForSection_0_1) AND (IsEndLoop_2_0_0 <= BeginLoop_2_0_2))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 12161 markings, 29726 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((BeginLoop_1_1_2 <= BeginLoop_1_1_1) U A (G ((TestIdentity_0_1_2 <= IsEndLoop_2_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((BeginLoop_1_1_2 <= BeginLoop_1_1_1) U A (G ((TestIdentity_0_1_2 <= IsEndLoop_2_1_0)))))
lola: processed formula: A (((BeginLoop_1_1_2 <= BeginLoop_1_1_1) U A (G ((TestIdentity_0_1_2 <= IsEndLoop_2_1_0)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 80 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((Turn_1_2 <= WantSection_1_T) OR (TestAlone_2_0_1 <= TestIdentity_1_0_2)))) AND E ((((3 <= EndTurn_1_1) OR (TestTurn_2_0 <= BeginLoop_2_1_2)) U ((3 <= EndTurn_0_0) OR (2 <= WantSection_2_T)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((Turn_1_2 <= WantSection_1_T) OR (TestAlone_2_0_1 <= TestIdentity_1_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((Turn_1_2 <= WantSection_1_T) OR (TestAlone_2_0_1 <= TestIdentity_1_0_2))))
lola: processed formula: A (X (((Turn_1_2 <= WantSection_1_T) OR (TestAlone_2_0_1 <= TestIdentity_1_0_2))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no no no no no no unknown
FORMULA Peterson-PT-2-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="CTLCardinality"
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/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 mcc4mcc-full"
echo " Input is Peterson-PT-2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478600556"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;