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 FMS-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050kn-smll-146358762600075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463598554400

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ FMS-PT-010
FORMULA FMS-PT-010-CTLCardinality-0 CANNOT_COMPUTE
FORMULA FMS-PT-010-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-11 CANNOT_COMPUTE
FORMULA FMS-PT-010-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-010-CTLCardinality-14 CANNOT_COMPUTE
FORMULA FMS-PT-010-CTLCardinality-15 CANNOT_COMPUTE
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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-010-CTLCardinality.task
lola: read: ((2 <= P1 OR EX ((1 <= P1wM1 AND 1 <= P1M1))) AND EF (AG (P2wP1 <= P1M1))) : EF (((P3 <= P2wM2 AND (P3s <= P1 AND P2wP1 <= M2)) AND AF (P3M2 <= P3M2))) : E(((P2wP1 <= P1wP2 OR 1 <= M3) OR (P1d <= P3s AND P12s <= P3)) U 3 <= P12s) : (!(AG (!(M3 <= P2s))) AND !(AG ((3 <= P3 OR P1 <= P2s)))) : !(AG (!((3 <= P1wM1 AND 3 <= M3)))) : AG ((!((1 <= M1 AND 1 <= P12wM3)) OR EG (1 <= M2))) : EF (AX (!(2 <= P... (shortened)
lola: formula length: 926
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-P1 <= -2 OR EX ((-P1wM1 <= -1 AND -P1M1 <= -1))) AND EF (AG (-P1M1 + P2wP1 <= 0)))
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: -P1 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file FMS-PT-010-CTLCardinality.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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-P1M1 + P2wP1 <= 0))
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 !(-P1M1 + P2wP1 <= 0))))
lola: processed formula length: 44
lola: 256 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P2wM2 + P3 <= 0 AND (P3s + -P1 <= 0 AND P2wP1 + -M2 <= 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 64 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-P1wP2 + P2wP1 <= 0 OR (-M3 <= -1 OR (-P3s + P1d <= 0 AND P12s + -P3 <= 0))) U -P12s <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-P1wP2 + P2wP1 <= 0 OR (-M3 <= -1 OR (-P3s + P1d <= 0 AND P12s + -P3 <= 0))) U -P12s <= -3)
lola: processed formula length: 94
lola: 255 rewrites
lola: formula mentions 7 of 22 places; total mentions: 8
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-P2s + M3 <= 0) AND EF ((-P3 > -3 AND -P2s + P1 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P2s + M3 <= 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 64 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 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P3 > -3 AND -P2s + P1 > 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 64 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 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P1wM1 <= -3 AND -M3 <= -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 64 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: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-M1 > -1 OR (-P12wM3 > -1 OR EG (-M2 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((-M1 > -1 OR (-P12wM3 > -1 OR !(A(TRUE U !(-M2 <= -1))))))))
lola: processed formula length: 73
lola: 256 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (-P3 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(-P3 > -2))
lola: processed formula length: 22
lola: 256 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(P1wM1 + -M2 <= 0 U -P1d <= -2) AND (E(P12wM3 + -P12s <= 0 U P3s + -P1s <= 0) AND AG (-P1wP2 + P12M3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(P1wM1 + -M2 <= 0 U -P1d <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(P1wM1 + -M2 <= 0 U -P1d <= -2)
lola: processed formula length: 32
lola: 255 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(P12wM3 + -P12s <= 0 U P3s + -P1s <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(P12wM3 + -P12s <= 0 U P3s + -P1s <= 0)
lola: processed formula length: 40
lola: 255 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P1wP2 + P12M3 <= 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 64 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 not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-P2 <= -2 U (P2wP1 + -P12s > 0 AND -P3 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-P2 <= -2 U (P2wP1 + -P12s > 0 AND -P3 > -1))
lola: processed formula length: 47
lola: 255 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P12 <= -2)
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 64 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 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((P3s + -P2M2 <= 0 OR -P2s + M1 <= 0) U P1wP2 + -P1 > 0) AND E((-P2wP1 <= -1 OR -P12M3 + P12s <= 0) U P1s + -M1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((P3s + -P2M2 <= 0 OR -P2s + M1 <= 0) U P1wP2 + -P1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P3s + -P2M2 <= 0 OR -P2s + M1 <= 0) U P1wP2 + -P1 > 0)
lola: processed formula length: 57
lola: 255 rewrites
lola: formula mentions 6 of 22 places; total mentions: 6
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-P2wP1 <= -1 OR -P12M3 + P12s <= 0) U P1s + -M1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-P2wP1 <= -1 OR -P12M3 + P12s <= 0) U P1s + -M1 <= 0)
lola: processed formula length: 56
lola: 255 rewrites
lola: formula mentions 5 of 22 places; total mentions: 5
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 11 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-P1wP2 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -P1wP2 <= -1))))
lola: processed formula length: 38
lola: 256 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 12 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-P2s > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-P2s > -3))))
lola: processed formula length: 29
lola: 256 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 13 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EF (P2 + -M2 <= 0) AND (P1 + -M2 > 0 OR -P1wP2 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U P2 + -M2 <= 0) AND (P1 + -M2 > 0 OR -P1wP2 > -3)))
lola: processed formula length: 69
lola: 256 rewrites
lola: formula mentions 4 of 22 places; total mentions: 5
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 14 will run for 1327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX (-P2s > -3) AND (P2s + -P12s > 0 AND -P1wM1 + P1 > 0)) OR AG ((-P2 <= -3 OR (-P12M3 <= -3 OR (-M2 <= -1 AND -P3 <= -1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-P2s > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-P2s > -3)
lola: processed formula length: 13
lola: 255 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 15 will run for 2655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P2s + -P12s > 0 AND -P1wM1 + P1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file FMS-PT-010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-P12M3 <= -3) OR -P12wM3 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P12M3 <= -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 64 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: unknown yes yes yes no no yes no yes yes yes unknown no yes unknown unknown

BK_STOP 1463599439755

--------------------
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="FMS-PT-010"
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/FMS-PT-010.tgz
mv FMS-PT-010 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 FMS-PT-010, 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 r050kn-smll-146358762600075"
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 ;