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-SqrNC5x5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368000310
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463789687300

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ Solitaire-PT-SqrNC5x5
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-2 CANNOT_COMPUTE
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrNC5x5-CTLFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 134/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 50 places, 84 transitions, 25 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 168 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: read: AF ((((FIREABLE(right55) OR (FIREABLE(left35) AND FIREABLE(right36))) AND !((FIREABLE(up25) OR FIREABLE(right32)))) AND (FIREABLE(right53) AND EF (FIREABLE(down34))))) : AX ((AF (!(FIREABLE(up33))) OR FIREABLE(down44))) : (FIREABLE(right44) OR EF (AG (FIREABLE(right44)))) : !(E((FIREABLE(down36) OR (FIREABLE(up56) OR FIREABLE(left23))) U AF (FIREABLE(down55)))) : (AF (EG ((FIREABLE(left24) AND FIR... (shortened)
lola: formula length: 1460
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((FIREABLE(right55) OR (FIREABLE(left35) AND FIREABLE(right36))) AND (! FIREABLE(up25) AND (! FIREABLE(right32) AND (FIREABLE(right53) AND EF (FIREABLE(down34)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(right55) OR (FIREABLE(left35) AND FIREABLE(right36))) AND (! FIREABLE(up25) AND (! FIREABLE(right32) AND (FIREABLE(right53) AND E(TRUE U FIREABLE(down34)))))))
lola: processed formula length: 179
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((AF (! FIREABLE(up33)) OR FIREABLE(down44)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((A(TRUE U ! FIREABLE(up33)) OR FIREABLE(down44)))
lola: processed formula length: 52
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(right44) OR EF (AG (FIREABLE(right44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(right44)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (FIREABLE(right44)))
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 !(FIREABLE(right44)))))
lola: processed formula length: 43
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((! FIREABLE(down36) AND (! FIREABLE(up56) AND ! FIREABLE(left23))) R EG (! FIREABLE(down55)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((! FIREABLE(down36) AND (! FIREABLE(up56) AND ! FIREABLE(left23)))) U !(!(A(TRUE U !(! FIREABLE(down55)))))))
lola: processed formula length: 115
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (EG ((FIREABLE(left24) AND FIREABLE(left36)))) OR FIREABLE(up56))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((FIREABLE(left24) AND FIREABLE(left36))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((FIREABLE(left24) AND FIREABLE(left36))))))
lola: processed formula length: 65
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(up56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (E((FIREABLE(left42) AND FIREABLE(left56)) U (FIREABLE(down36) OR FIREABLE(left25))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((FIREABLE(left42) AND FIREABLE(left56)) U (FIREABLE(down36) OR FIREABLE(left25))))
lola: processed formula length: 93
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (! FIREABLE(down33)) U FIREABLE(right63))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U ! FIREABLE(down33)) U FIREABLE(right63))
lola: processed formula length: 51
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EX (FIREABLE(left33)) OR (! FIREABLE(up54) OR E(FIREABLE(right25) U FIREABLE(up36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((EX(FIREABLE(left33)) OR (! FIREABLE(up54) OR E(FIREABLE(right25) U FIREABLE(up36)))))))
lola: processed formula length: 101
lola: 78 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 8 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((! FIREABLE(right42) OR ((FIREABLE(up34) AND (FIREABLE(down23) OR FIREABLE(up45))) OR FIREABLE(left45))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (! FIREABLE(right42) OR ((FIREABLE(up34) AND (FIREABLE(down23) OR FIREABLE(up45))) OR FIREABLE(left45))))
lola: processed formula length: 114
lola: 76 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (EG ((FIREABLE(right23) AND FIREABLE(down53)))) OR ((! FIREABLE(right52) OR (! FIREABLE(up32) OR ! FIREABLE(left46))) AND (! FIREABLE(up35) AND (! FIREABLE(down24) AND AF (! FIREABLE(left32))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((FIREABLE(right23) AND FIREABLE(down53))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((FIREABLE(right23) AND FIREABLE(down53))))))
lola: processed formula length: 66
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 10 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(right52) OR (! FIREABLE(up32) OR ! FIREABLE(left46)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.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 621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(up35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(down24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((! FIREABLE(left44) OR (! FIREABLE(right52) AND ! FIREABLE(down35))) U AX ((FIREABLE(down34) OR FIREABLE(down32))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((! FIREABLE(left44) OR (! FIREABLE(right52) AND ! FIREABLE(down35))) U AX((FIREABLE(down34) OR FIREABLE(down32))))
lola: processed formula length: 116
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (! FIREABLE(left64)) OR AG (FIREABLE(up23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (! FIREABLE(left64))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(! FIREABLE(left64))))
lola: processed formula length: 34
lola: 76 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 12 will run for 776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX (FIREABLE(right23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(FIREABLE(right23)))
lola: processed formula length: 31
lola: 77 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 1035 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((EX (FIREABLE(left23)) AND (! FIREABLE(right45) AND ! FIREABLE(down54))) U AG (! FIREABLE(right54)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((EX(FIREABLE(left23)) AND (! FIREABLE(right45) AND ! FIREABLE(down54))) U !(E(TRUE U !(! FIREABLE(right54)))))
lola: processed formula length: 112
lola: 78 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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 1553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (EG (FIREABLE(right56))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(E(TRUE U !(!(A(TRUE U !(FIREABLE(right56))))))))
lola: processed formula length: 59
lola: 78 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (! FIREABLE(left53)) AND (AG ((! FIREABLE(left52) AND ! FIREABLE(right52))) OR EF ((! FIREABLE(up54) OR ! FIREABLE(left24)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (! FIREABLE(left53))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(! FIREABLE(left53))))
lola: processed formula length: 34
lola: 76 rewrites
lola: formula mentions 0 of 50 places; total mentions: 0
lola: closed formula file Solitaire-PT-SqrNC5x5-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 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: 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 ((! FIREABLE(up54) OR ! FIREABLE(left24)))
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 100 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: RESULT
lola: summary: no yes unknown yes no no no no yes no yes yes no yes no yes

BK_STOP 1463790791123

--------------------
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-SqrNC5x5"
export BK_EXAMINATION="CTLFireability"
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-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 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-SqrNC5x5, examination is CTLFireability"
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-146373368000310"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;