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 SharedMemory-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288900363
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463780197950

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SharedMemory-PT-000010
FORMULA SharedMemory-COL-000010-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-CTLCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 341/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 131 places, 210 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 240 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-CTLCardinality.task
lola: read: (AG ((1 <= Active_7 + Active_8 + Active_5 + Active_6 + Active_3 + Active_4 + Active_1 + Active_2 + Active_10 + Active_9 OR (OwnMemAcc_4 + OwnMemAcc_3 + OwnMemAcc_2 + OwnMemAcc_1 + OwnMemAcc_6 + OwnMemAcc_5 + OwnMemAcc_8 + OwnMemAcc_7 + OwnMemAcc_10 + OwnMemAcc_9 <= Memory_2 + Memory_1 + Memory_9 + Memory_10 + Memory_7 + Memory_8 + Memory_5 + Memory_6 + Memory_3 + Memory_4 OR 2 <= OwnMemAcc_4 + Own... (shortened)
lola: formula length: 23735
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -1 OR (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + OwnMemAcc_9 + OwnMemAcc_8 + OwnMemAcc_7 + OwnMemAcc_6 + OwnMemAcc_5 + OwnMemAcc_4 + OwnMemAcc_3 + OwnMemAcc_2 + OwnMemAcc_1 + OwnMemAcc_10 <= 0 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -1 OR (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + OwnMemAcc_9 + OwnMemAcc_8 + OwnMemAcc_7 + OwnMemAcc_6 + OwnMemAcc_5 + OwnMemAcc_4 + OwnMemAcc_3 + OwnMemAcc_2 + OwnMemAcc_1 + OwnMemAcc_10 <= 0 O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E(AX (-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -2) U EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX(-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -2) U E(TRUE U -Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_... (shortened)
lola: processed formula length: 1875
lola: 77235 rewrites
lola: formula mentions 100 of 131 places; total mentions: 100
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (E(-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Ac... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -E... (shortened)
lola: processed formula length: 3624
lola: 77234 rewrites
lola: formula mentions 100 of 131 places; total mentions: 190
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (Ext_Mem_Acc_8_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(Ext_Mem_Acc_8_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_7_8... (shortened)
lola: processed formula length: 1817
lola: 77234 rewrites
lola: formula mentions 100 of 131 places; total mentions: 100
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (AF (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + Ext_Bus <= 0)) OR (EX ((-Ext_Mem_Acc_8_10 + Active_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + Active_9 + Active_8 + Active_7 + Active_6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + Ext_Bus <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + Ext_Bus <= 0))))
lola: processed formula length: 159
lola: 77234 rewrites
lola: formula mentions 11 of 131 places; total mentions: 11
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)========================================

lola: ========================================
lola: ...considering subproblem: ((EF (-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 > -3) OR -Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 > -1) AND AF (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 > -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= -1)
lola: processed formula length: 134
lola: 77233 rewrites
lola: formula mentions 10 of 131 places; total mentions: 10
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -1) AND -Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (A(-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Ac... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -E... (shortened)
lola: processed formula length: 1907
lola: 77234 rewrites
lola: formula mentions 101 of 131 places; total mentions: 101
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -1) OR (EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Memory_10 + -Memory_9 + -Memory_8 + -Memory_7 + -Memory_6 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -1)
lola: processed formula length: 127
lola: 77233 rewrites
lola: formula mentions 10 of 131 places; total mentions: 10
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (Ext_Bus + -OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U Ext_Bus + -OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 > 0))))
lola: processed formula length: 188
lola: 77234 rewrites
lola: formula mentions 11 of 131 places; total mentions: 11
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 <= -2 AND (Active_10 + Active_9 + Active_8 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1 + Active_3 + -Queue_10 + -Queue_9 + -Queue_8 + -Queue_7 + -Queue_6 + -Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 <= 0 OR -Ext_Bu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-Ext_Mem_Acc_8_10 + -Ext_Mem_Acc_3_10 + -Ext_Mem_Acc_9_8 + -Ext_Mem_Acc_9_7 + -Ext_Mem_Acc_9_6 + -Ext_Mem_Acc_9_5 + -Ext_Mem_Acc_9_4 + -Ext_Mem_Acc_9_3 + -Ext_Mem_Acc_9_2 + -Ext_Mem_Acc_9_1 + -Ext_Mem_Acc_8_9 + -Ext_Mem_Acc_8_7 + -Ext_Mem_Acc_8_6 + -Ext_Mem_Acc_8_5 + -Ext_Mem_Acc_8_4 + -Ext_Mem_Acc_8_3 + -Ext_Mem_Acc_8_2 + -Ext_Mem_Acc_8_1 + -Ext_Mem_Acc_9_10 + -Ext_Mem_Acc_7_9 + -Ext_Mem_Acc_7... (shortened)
lola: processed formula length: 2121
lola: 77233 rewrites
lola: formula mentions 120 of 131 places; total mentions: 120
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Active_10 + -Active_9 + -Active_8 + -Active_7 + -Active_6 + -Active_5 + -Active_4 + -Active_2 + -Active_1 + -Active_3 > -3 AND Ext_Mem_Acc_8_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Memory_10 + Memory_9 + Memory_8 + Memory_7 + Memory_6 + Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -OwnMemAcc_9 + -OwnMemAcc_8 + -OwnMemAcc_7 + -OwnMemAcc_6 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 + -OwnMemAcc_10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: yes no no no yes yes no no yes no no yes yes yes no yes
lola: ========================================

BK_STOP 1463780452422

--------------------
content from 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="SharedMemory-PT-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 SharedMemory-PT-000010, 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 r110kn-smll-146373288900363"
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 ;