fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r218su-smll-146468020300093
Last Updated
June 30, 2016

About the Execution of LoLa for DES-PT-20a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15940.790 876888.00 873764.00 2955.90 T?FFTF??FTF?FTTF normal

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 DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218su-smll-146468020300093
=====================================================================


--------------------
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 DES-PT-20a-CTLCardinality-0
FORMULA_NAME DES-PT-20a-CTLCardinality-1
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15
FORMULA_NAME DES-PT-20a-CTLCardinality-2
FORMULA_NAME DES-PT-20a-CTLCardinality-3
FORMULA_NAME DES-PT-20a-CTLCardinality-4
FORMULA_NAME DES-PT-20a-CTLCardinality-5
FORMULA_NAME DES-PT-20a-CTLCardinality-6
FORMULA_NAME DES-PT-20a-CTLCardinality-7
FORMULA_NAME DES-PT-20a-CTLCardinality-8
FORMULA_NAME DES-PT-20a-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464725119981

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


in benchkit_head lolaszeit 3539
CTLCardinality @ DES-PT-20a
FORMULA DES-PT-20a-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-1 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-5 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-14 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-15 CANNOT_COMPUTE
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: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLCardinality.task
lola: read: EF ((EF (p43 <= p140) AND ((1 <= p147 AND p103 <= p1) OR (3 <= p64 AND p144 <= p96)))) : EG (EF (!(p149 <= p144))) : AF (3 <= p153) : ((p2 <= p179 AND EF ((3 <= p44 OR 1 <= p163))) OR (2 <= p42 OR !(((p92 <= p147 OR 2 <= p66) OR !(p88 <= p86))))) : !(EG ((!(3 <= p89) OR !(p92 <= p3)))) : ((AX ((p55 <= p48 AND p98 <= p102)) AND AG ((1 <= p18 OR p125 <= p92))) AND !(1 <= p6)) : EG (AG ((2 <= p148 OR... (shortened)
lola: formula length: 1338
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EF (p43 + -p140 <= 0) AND ((-p147 <= -1 AND p103 + -p1 <= 0) OR (-p64 <= -3 AND p144 + -p96 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U p43 + -p140 <= 0) AND ((-p147 <= -1 AND p103 + -p1 <= 0) OR (-p64 <= -3 AND p144 + -p96 <= 0))))
lola: processed formula length: 115
lola: 346 rewrites
lola: formula mentions 8 of 195 places; total mentions: 8
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (p149 + -p144 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U p149 + -p144 > 0))))
lola: processed formula length: 42
lola: 346 rewrites
lola: formula mentions 2 of 195 places; total mentions: 2
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p153 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p153 <= -3)
lola: processed formula length: 21
lola: 345 rewrites
lola: formula mentions 1 of 195 places; total mentions: 1
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-p179 + p2 <= 0 AND EF ((-p44 <= -3 OR -p163 <= -1))) OR (-p42 <= -2 OR (p92 + -p147 > 0 AND (-p66 > -2 AND -p86 + p88 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p179 + p2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p44 <= -3 OR -p163 <= -1))
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 544 bytes per marking, with 0 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-p89 <= -3 AND p92 + -p3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-p89 <= -3 AND p92 + -p3 <= 0))
lola: processed formula length: 41
lola: 345 rewrites
lola: formula mentions 3 of 195 places; total mentions: 3
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-p48 + p55 <= 0 AND p98 + -p102 <= 0)) AND (AG ((-p18 <= -1 OR -p92 + p125 <= 0)) AND -p6 > -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-p48 + p55 <= 0 AND p98 + -p102 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-p48 + p55 <= 0 AND p98 + -p102 <= 0))
lola: processed formula length: 42
lola: 345 rewrites
lola: formula mentions 4 of 195 places; total mentions: 4
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p18 <= -1 OR -p92 + p125 <= 0))
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 544 bytes per marking, with 0 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: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p6 > -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((-p148 <= -2 OR p35 + -p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((-p148 <= -2 OR p35 + -p15 <= 0)))))))
lola: processed formula length: 64
lola: 346 rewrites
lola: formula mentions 3 of 195 places; total mentions: 3
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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 7 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (p182 + -p191 > 0) AND p156 + -p63 > 0) OR (((p158 + -p26 <= 0 OR -p140 <= -3) AND ((-p13 + p45 <= 0 OR -p14 + p138 <= 0) AND AF (-p173 <= -1))) OR (-p149 <= -3 AND -p185 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (p182 + -p191 > 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 544 bytes per marking, with 0 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 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p156 + -p63 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p158 + -p26 <= 0 OR -p140 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p13 + p45 <= 0 OR -p14 + p138 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p173 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p173 <= -1)
lola: processed formula length: 21
lola: 345 rewrites
lola: formula mentions 1 of 195 places; total mentions: 1
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-p37 <= -1) OR AF (-p160 + p104 <= 0)) AND E((-p170 + p132 <= 0 OR -p83 <= -2) U (-p57 <= -1 AND p43 + -p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p37 <= -1)
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 544 bytes per marking, with 0 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 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-p170 + p132 <= 0 OR -p83 <= -2) U (-p57 <= -1 AND p43 + -p6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-p170 + p132 <= 0 OR -p83 <= -2) U (-p57 <= -1 AND p43 + -p6 <= 0))
lola: processed formula length: 70
lola: 345 rewrites
lola: formula mentions 6 of 195 places; total mentions: 6
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-p193 <= -2) AND (((-p44 > -3 AND -p59 > -2) OR ((-p64 <= -1 AND p72 + -p7 <= 0) OR -p13 + p146 > 0)) AND EF (p171 + -p64 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p193 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p193 <= -2)
lola: processed formula length: 21
lola: 345 rewrites
lola: formula mentions 1 of 195 places; total mentions: 1
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-p121 <= -2) AND (((p158 + -p167 <= 0 OR -p123 + p166 <= 0) AND -p140 > -2) OR ((-p28 + p68 > 0 AND -p23 > -3) OR (p183 + -p77 <= 0 AND ((p142 + -p4 <= 0 OR -p105 + p10 <= 0) AND (-p89 <= -3 AND (-p108 <= -2 OR p126 + -p97 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p121 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p121 <= -2)
lola: processed formula length: 21
lola: 345 rewrites
lola: formula mentions 1 of 195 places; total mentions: 1
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (p148 + -p73 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U p148 + -p73 > 0))))
lola: processed formula length: 41
lola: 346 rewrites
lola: formula mentions 2 of 195 places; total mentions: 2
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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 12 will run for 730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p117 + -p50 > 0 OR EF (EG (p180 + -p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p117 + -p50 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (p180 + -p28 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(p180 + -p28 <= 0))))
lola: processed formula length: 42
lola: 346 rewrites
lola: formula mentions 2 of 195 places; total mentions: 2
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-p0 <= -3) AND A(p139 + -p48 > 0 U (p37 + -p106 <= 0 OR -p169 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p0 <= -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 544 bytes per marking, with 0 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-p46 > -2 OR -p16 > -1) AND -p18 <= -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 544 bytes per marking, with 0 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((-p34 > -1 AND -p98 <= -3)) OR ((p56 + -p4 > 0 OR (-p105 > -1 OR (-p157 + p173 > 0 OR p152 + -p104 > 0))) AND EF (-p12 + p45 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-p34 > -1 AND -p98 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-p34 > -1 AND -p98 <= -3))
lola: processed formula length: 36
lola: 345 rewrites
lola: formula mentions 2 of 195 places; total mentions: 2
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p12 + p45 > 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 544 bytes per marking, with 0 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: yes unknown no yes no unknown no yes yes no no no yes no unknown unknown

BK_STOP 1464725996869

--------------------
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="DES-PT-20a"
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/DES-PT-20a.tgz
mv DES-PT-20a 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 DES-PT-20a, 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 r218su-smll-146468020300093"
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 ;