About the Execution of LoLa for Solitaire-PT-EngNC7x7
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4177.250 | 2701075.00 | 2711070.00 | 3627.50 | ???F??T??TFT???T | 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 Solitaire-PT-EngNC7x7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368000273
=====================================================================
--------------------
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 Solitaire-PT-EngNC7x7-CTLCardinality-0
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-1
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-10
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-11
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-12
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-13
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-14
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-15
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-2
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-3
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-4
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-5
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-6
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-7
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-8
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463781071109
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Solitaire-PT-EngNC7x7
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-0 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-2 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-6 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-7 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-10 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-12 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-13 CANNOT_COMPUTE
FORMULA Solitaire-PT-EngNC7x7-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-EngNC7x7-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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 66 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: read: EX (EF ((2 <= F42 AND 2 <= T65))) : E((!(T57 <= F13) AND !(T51 <= F13)) U ((3 <= F64 OR 3 <= F47) AND F65 <= T42)) : EF (2 <= F51) : (AF ((!(F57 <= F14) OR (T41 <= F41 OR F13 <= F63))) AND AX (EG (F65 <= F75))) : A(EF (1 <= F36) U ((2 <= F55 AND F23 <= T52) AND (2 <= F43 OR 1 <= T73))) : (((AF (1 <= T65) AND EG (F43 <= F14)) OR E(2 <= F73 U 3 <= T35)) AND (A(T47 <= F54 U F23 <= F55) AND !(((F57 <=... (shortened)
lola: formula length: 912
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EF ((-F42 <= -2 AND -T65 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (-F42 <= -2 AND -T65 <= -2)))
lola: processed formula length: 41
lola: 218 rewrites
lola: formula mentions 2 of 66 places; total mentions: 2
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: local time limit reached - aborting
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: E((-F13 + T57 > 0 AND -F13 + T51 > 0) U ((-F64 <= -3 OR -F47 <= -3) AND F65 + -T42 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-F13 + T57 > 0 AND -F13 + T51 > 0) U ((-F64 <= -3 OR -F47 <= -3) AND F65 + -T42 <= 0))
lola: processed formula length: 89
lola: 217 rewrites
lola: formula mentions 7 of 66 places; total mentions: 8
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-F51 <= -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 132 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((F57 + -F14 > 0 OR (-F41 + T41 <= 0 OR -F63 + F13 <= 0))) AND AX (EG (-F75 + F65 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((F57 + -F14 > 0 OR (-F41 + T41 <= 0 OR -F63 + F13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (F57 + -F14 > 0 OR (-F41 + T41 <= 0 OR -F63 + F13 <= 0)))
lola: processed formula length: 66
lola: 217 rewrites
lola: formula mentions 6 of 66 places; total mentions: 6
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (-F75 + F65 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(-F75 + F65 <= 0))))
lola: processed formula length: 35
lola: 218 rewrites
lola: formula mentions 2 of 66 places; total mentions: 2
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-F36 <= -1) U (-F55 <= -2 AND (F23 + -T52 <= 0 AND (-F43 <= -2 OR -T73 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -F36 <= -1) U (-F55 <= -2 AND (F23 + -T52 <= 0 AND (-F43 <= -2 OR -T73 <= -1))))
lola: processed formula length: 91
lola: 218 rewrites
lola: formula mentions 6 of 66 places; total mentions: 6
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((AF (-T65 <= -1) AND EG (F43 + -F14 <= 0)) OR E(-F73 <= -2 U -T35 <= -3)) AND (A(-F54 + T47 <= 0 U -F55 + F23 <= 0) AND ((F57 + -F45 > 0 AND -T45 > -2) OR (-F44 + T15 > 0 OR -F54 > -2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-T65 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -T65 <= -1)
lola: processed formula length: 20
lola: 217 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (F43 + -F14 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(F43 + -F14 <= 0)))
lola: processed formula length: 31
lola: 217 rewrites
lola: formula mentions 2 of 66 places; total mentions: 2
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-F54 + T47 <= 0 U -F55 + F23 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-F54 + T47 <= 0 U -F55 + F23 <= 0)
lola: processed formula length: 36
lola: 217 rewrites
lola: formula mentions 4 of 66 places; total mentions: 4
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F57 + -F45 > 0 AND -T45 > -2) OR (-F44 + T15 > 0 OR -F54 > -2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG (-T32 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(-T32 > -2))))))
lola: processed formula length: 41
lola: 218 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 7 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-T63 + T44 > 0 AND -T47 + T15 > 0)) AND AG (EF (-T57 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-T63 + T44 > 0 AND -T47 + T15 > 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 132 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 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-T57 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -T57 <= -2))))
lola: processed formula length: 36
lola: 218 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 8 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-T53 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -T53 <= -3))
lola: processed formula length: 30
lola: 218 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 9 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-F45 + T37 <= 0) OR AX (EG (F46 + -T54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-F45 + T37 <= 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 132 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: subprocess 10 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (F46 + -T54 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(F46 + -T54 <= 0))))
lola: processed formula length: 35
lola: 218 rewrites
lola: formula mentions 2 of 66 places; total mentions: 2
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 10 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (F42 + -T73 <= 0) U (-T24 <= -3 AND -T57 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(F42 + -T73 <= 0) U (-T24 <= -3 AND -T57 <= -2))
lola: processed formula length: 52
lola: 218 rewrites
lola: formula mentions 4 of 66 places; total mentions: 4
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AX (-F75 <= -2)) AND (E(-F52 + T43 <= 0 U -T74 <= -2) OR (EX (-T33 <= -2) OR AF (-T13 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (-F75 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(-F75 <= -2))
lola: processed formula length: 24
lola: 218 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 12 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-F52 + T43 <= 0 U -T74 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-F52 + T43 <= 0 U -T74 <= -2)
lola: processed formula length: 31
lola: 217 rewrites
lola: formula mentions 3 of 66 places; total mentions: 3
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-T33 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-T33 <= -2)
lola: processed formula length: 14
lola: 217 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-T13 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -T13 <= -3)
lola: processed formula length: 20
lola: 217 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 12 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (F57 + -F45 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(F57 + -F45 > 0))
lola: processed formula length: 28
lola: 218 rewrites
lola: formula mentions 2 of 66 places; total mentions: 2
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (F51 + -F13 <= 0) U (-T73 <= -1 AND (-F73 <= -1 AND -F36 + T74 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U F51 + -F13 <= 0) U (-T73 <= -1 AND (-F73 <= -1 AND -F36 + T74 > 0)))
lola: processed formula length: 79
lola: 218 rewrites
lola: formula mentions 6 of 66 places; total mentions: 6
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 14 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-F56 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-F56 > -3)))
lola: processed formula length: 25
lola: 217 rewrites
lola: formula mentions 1 of 66 places; total mentions: 1
lola: closed formula file Solitaire-PT-EngNC7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 15 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-F42 <= -2 OR AF ((F45 + -T55 > 0 AND -F47 + T54 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -F42 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Solitaire-PT-EngNC7x7-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: RESULT
lola: summary: unknown unknown unknown yes no yes unknown unknown unknown yes unknown no unknown unknown yes unknown
lola: ========================================
BK_STOP 1463783772184
--------------------
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="Solitaire-PT-EngNC7x7"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 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 Solitaire-PT-EngNC7x7, 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 r122kn-qhx2-146373368000273"
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 '
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 ;