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)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is S_Peterson-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433133600608
=====================================================================

--------------------
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-COL-3-LTLCardinality-0
FORMULA_NAME Peterson-COL-3-LTLCardinality-1
FORMULA_NAME Peterson-COL-3-LTLCardinality-10
FORMULA_NAME Peterson-COL-3-LTLCardinality-11
FORMULA_NAME Peterson-COL-3-LTLCardinality-12
FORMULA_NAME Peterson-COL-3-LTLCardinality-13
FORMULA_NAME Peterson-COL-3-LTLCardinality-14
FORMULA_NAME Peterson-COL-3-LTLCardinality-15
FORMULA_NAME Peterson-COL-3-LTLCardinality-2
FORMULA_NAME Peterson-COL-3-LTLCardinality-3
FORMULA_NAME Peterson-COL-3-LTLCardinality-4
FORMULA_NAME Peterson-COL-3-LTLCardinality-5
FORMULA_NAME Peterson-COL-3-LTLCardinality-6
FORMULA_NAME Peterson-COL-3-LTLCardinality-7
FORMULA_NAME Peterson-COL-3-LTLCardinality-8
FORMULA_NAME Peterson-COL-3-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464474088330

bkconf 3600
===========================================================================================
===========================================================================================
S_Peterson-PT-3: translating Petri net model.pnml into LoLA format
S_Peterson-PT-3: translating formula LTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py LTLCardinality.xml
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 3539
LTLCardinality @ S_Peterson-PT-3
FORMULA Peterson-COL-3-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-3-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 576/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 244 places, 332 transitions, 229 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-3-LTLCardinality.task
lola: read: ABeginLoop_0_0_0 + BeginLoop_1_1_0 + BeginLoop_2_1_0 + BeginLoop_3_1_0 + BeginLoop_0_2_0 + BeginLoop_1_0_0 + BeginLoop_2_0_0 + BeginLoop_3_0_0 + BeginLoop_0_1_0 + BeginLoop_1_0_1 + BeginLoop_2_0_1 + BeginLoop_3_0_1 + BeginLoop_0_1_1 + BeginLoop_1_2_0 + BeginLoop_2_2_0 + BeginLoop_3_2_0 + BeginLoop_0_0_1 + BeginLoop_2_2_1 + BeginLoop_1_2_1 + BeginLoop_0_0_2 + BeginLoop_3_2_1 + BeginLoop_2_1_1 + Beg... (shortened)
lola: formula length: 18162
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -AskForSection_3_2 + -AskForSection_3_0 + BeginLoop_1_2_3 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_2_0 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + BeginLoop_1_1_3 + BeginLoop_1_1_2 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + -AskForSection_1_2 + -AskForSection_1_1 + -AskForSection_1_0 + BeginLoop_1_0_3 + BeginLoop_1_0_2 + BeginLoop_1_0_1 + BeginLoop_1_0_0 + -AskForSection_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-3-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (-TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 + -TestAlone_1_0_3 + -TestAlone_1_0_2 + -TestAlone_1_0_0 + -TestAlone_3_2_2 + -TestAlone_3_2_1 + -TestAlone_3_2_0 + -TestAlone_3_1_2 + -TestAlone_3_1_1 + -TestAlone_3_1_0 + -TestAlone_0_2_3 + -TestAlone_0_2_2 + -TestAlone_0_2_1 + -TestAlone_3_0_2 + -TestAlone_3_0_1 + -TestAlone_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-EndTurn_0_2 + BeginLoop_1_2_3 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_2_0 + BeginLoop_1_1_3 + BeginLoop_1_1_2 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + BeginLoop_1_0_3 + BeginLoop_1_0_2 + BeginLoop_1_0_1 + BeginLoop_1_0_0 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_2_1 + BeginLoop_3_2_0 + BeginLoop_3_1_3 + BeginLoop_3_1_2 + BeginLoop_3_1_1 + BeginLoop_3_1_0 + -EndTurn_0_0 + Begin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (X (-BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + -BeginLoop_1_1_3 + -BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + -BeginLoop_1_0_3 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_3_2_3 + -BeginLoop_3_2_2 + -BeginLoop_3_2_1 + -BeginLoop_3_2_0 + -BeginLoop_3_1_3 + -BeginLoop_3_1_2 + -BeginLoop_3_1_1 + -BeginLoop_3_1_0 + -BeginLoop_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (EndTurn_0_2 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 + -TestAlone_1_0_3 + -TestAlone_1_0_2 + -TestAlone_1_0_0 + -TestAlone_3_2_2 + -TestAlone_3_2_1 + -TestAlone_3_2_0 + -TestAlone_3_1_2 + -TestAlone_3_1_1 + -TestAlone_3_1_0 + -TestAlone_0_2_3 + -TestAlone_0_2_2 + -TestAlone_0_2_1 + EndTurn_0_0 + -TestAlone_3_0_2 + -Te... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (F (-BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + -BeginLoop_1_1_3 + -BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + -BeginLoop_1_0_3 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_3_2_3 + -BeginLoop_3_2_2 + -BeginLoop_3_2_1 + -BeginLoop_3_2_0 + -BeginLoop_3_1_3 + -BeginLoop_3_1_2 + -BeginLoop_3_1_1 + -BeginLoop_3_1_0 + -BeginLoop... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-AskForSection_3_2 + TestAlone_1_2_3 + TestAlone_1_2_2 + TestAlone_1_2_0 + -AskForSection_3_0 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + TestAlone_1_1_3 + TestAlone_1_1_2 + TestAlone_1_1_0 + -AskForSection_1_2 + -AskForSection_1_1 + -AskForSection_1_0 + TestAlone_1_0_3 + TestAlone_1_0_2 + TestAlone_1_0_0 + -AskForSection_0_2 + -AskForSection_0_1 + -AskForSection_0_0 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + -BeginLoop_1_1_3 + -BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + -BeginLoop_1_0_3 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_3_2_3 + -BeginLoop_3_2_2 + -BeginLoop_3_2_1 + -BeginLoop_3_2_0 + -BeginLoop_3_1_3 + -BeginLoop_3_1_2 + -BeginLoop_3_1_1 + -BeginLoop_3_1_0 + -BeginLoop_0_2_3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (G (-Turn_2_3 + -Turn_1_3 + -Turn_0_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + -Turn_0_0 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + -Turn_0_1 + -Turn_0_2 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + -Turn_1_0 + -Turn_1_1 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + -Turn_1_2 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (G (G (-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Turn_2_3 + -Turn_1_3 + -Turn_0_3 + AskForSection_3_2 + AskForSection_3_0 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + AskForSection_3_1 + -Turn_0_0 + -Turn_0_1 + -Turn_0_2 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Turn_2_3 + -Turn_1_3 + -Turn_0_3 + AskForSection_3_2 + AskForSection_3_0 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + AskForSection_3_1 + -Turn_0_0 + -Turn_0_1 + -Turn_0_2 + -Turn_1_0 + -Turn_1_1 + -Turn_1_2 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= 0)
lola: processed formula length: 396
lola: 33967 rewrites
lola: formula mentions 24 of 244 places; total mentions: 24
lola: closed formula file Peterson-COL-3-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X ((-TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_2 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_2 + -TestTurn_1_1 + -TestTurn_1_0 + -TestTurn_0_2 + -TestTurn_0_1 + -TestTurn_0_0 <= -2 U IsEndLoop_2_2_3 + IsEndLoop_2_2_2 + IsEndLoop_2_2_1 + IsEndLoop_2_2_0 + -BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + IsEndLoop_2_1_3 + IsEndLoop_2_1_2 + IsEndLoop_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((F (-Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 <= -2) U G (-BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + -BeginLoop_1_1_3 + -BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + -BeginLoop_1_0_3 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_3_2_3 + -BeginLoop_3_2_2 + -BeginLoop_3_2_1 + -BeginLoop_3_2_0 + -BeginLoop_3_1_3 + -BeginLoop_3_1_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((EndTurn_0_2 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 + -TestAlone_1_0_3 + -TestAlone_1_0_2 + -TestAlone_1_0_0 + -TestAlone_3_2_2 + -TestAlone_3_2_1 + -TestAlone_3_2_0 + -TestAlone_3_1_2 + -TestAlone_3_1_1 + -TestAlone_3_1_0 + -TestAlone_0_2_3 + -TestAlone_0_2_2 + -TestAlone_0_2_1 + EndTurn_0_0 + -TestAlone_3_0_2 + -TestAlo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (X (-BeginLoop_1_2_3 + -BeginLoop_1_2_2 + -BeginLoop_1_2_1 + -BeginLoop_1_2_0 + -BeginLoop_1_1_3 + -BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + -BeginLoop_1_0_3 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_3_2_3 + -BeginLoop_3_2_2 + -BeginLoop_3_2_1 + -BeginLoop_3_2_0 + -BeginLoop_3_1_3 + -BeginLoop_3_1_2 + -BeginLoop_3_1_1 + -BeginLoop_3_1_0 + -BeginLoop... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (G (-EndTurn_0_2 + -EndTurn_0_0 + -EndTurn_3_2 + -EndTurn_3_1 + -EndTurn_3_0 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_2 + -EndTurn_1_1 + -EndTurn_1_0 + -EndTurn_0_1 <= -2)) U F (X (-TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_2_0 + -TestAlone_1_1_3 + -TestAlone_1_1_2 + -TestAlone_1_1_0 + -TestAlone_1_0_3 + -TestAlone_1_0_2 + -TestAlone_1_0_0 + -TestAlone_3_2_2 + -TestAlo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 916 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola: summary: yes no yes no no no no no no yes yes yes no no no no
lola: ========================================

BK_STOP 1464474292948

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

parsing of model.pnml complete

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="S_Peterson-PT-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/S_Peterson-PT-3.tgz
mv S_Peterson-PT-3 execution

# this is for BenchKit: explicit launching of the test

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