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-3254
Executing tool lola
Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494618409195


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3540 seconds
----- Start make result stdout -----
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: 31833/65536 symbol table entries, 17230 collisions
lola: preprocessing...
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26973 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: A (G ((pil_d3_n1_3_3_2_3_3 <= pb_d4_n1_2_3_2_1_2))) : A (G ((((pil_d3_n1_2_3_3_1_1 <= pb_d1_n1_3_3_2_2_3) OR (pol_d4_n1_3_3_1_3_1 <= pb_d4_n2_3_2_2_3_3) OR ((po_d2_n1_3_3_3_2_2 <= po_d4_n1_2_1_3_3_3) AND (1 <= po_d1_n1_1_3_2_1_3))) AND ((pi_d4_n1_1_1_1_2_2 <= 2) OR (pb_d3_n1_2_1_2_1_1 <= 2))))) : E (F (((pol_d2_n1_3_3_1_1_2 + 1 <= pi_d2_n1_1_3_1_1_2) AND (pb_d1_n1_1_2_3_1_3 + 1 <= pil_d5_n1_3_1_2_3_1) AND (2 <= pi_d5_n1_3_3_3_1_1)))) : A (G ((1 <= pb_d3_n1_1_2_1_1_2))) : A (G (((pil_d4_n1_2_3_3_1_1 <= pbl_2_1_2_1_1) AND (pol_d1_n1_3_1_1_1_2 <= pil_d1_n1_3_1_2_2_1)))) : E (F (((pbl_1_1_2_2_3 <= pb_d3_n1_1_3_3_3_3) AND (pil_d1_n1_1_1_2_2_2 <= pi_d1_n1_3_3_1_2_3) AND (1 <= po_d2_n1_3_1_2_3_1)))) : E (F ((3 <= pb_d3_n1_1_3_2_3_3))) : E (F ((((pol_d4_n1_1_2_3_3_1 <= 1) AND (pol_d3_n1_3_1_1_2_3 + 1 <= po_d3_n1_2_3_1_3_3)) OR (3 <= pb_d3_n2_3_1_2_3_2)))) : E (F (((3 <= pb_d5_n2_3_2_1_2_3) AND ((pol_d1_n1_2_3_3_3_1 + 1 <= pol_d4_n1_2_3_2_3_3) OR (pil_d5_n1_1_2_3_1_3 <= po_d3_n1_2_1_2_1_2))))) : E (F (((3 <= pil_d3_n1_2_2_1_3_3) AND ((pil_d1_n1_3_2_3_2_3 <= po_d2_n1_3_1_3_3_2) OR (3 <= pil_d5_n1_3_2_3_3_3)) AND (1 <= pi_d4_n1_1_3_2_3_3)))) : E (F (((1 <= pb_d1_n2_3_1_1_3_2) AND (pb_d5_n2_3_2_1_1_3 <= 0) AND (3 <= pil_d5_n1_3_3_1_1_2)))) : A (G (((po_d3_n1_1_2_1_2_1 <= pil_d5_n1_3_2_3_3_3) OR (pbl_3_2_3_1_3 <= pb_d4_n1_2_1_2_3_3) OR ((po_d5_n1_3_1_2_3_2 <= pi_d4_n1_1_3_1_1_3) AND (pb_d5_n1_3_3_1_3_1 <= pb_d3_n2_3_2_1_1_2)) OR ((po_d2_n1_1_2_3_2_1 <= pb_d3_n1_2_1_1_2_1) AND (po_d1_n1_2_1_1_1_3 <= pol_d1_n1_1_2_2_3_3))))) : E (F ((3 <= pb_d5_n2_1_3_1_1_1))) : E (F ((pb_d3_n2_2_3_1_2_2 <= po_d4_n1_1_2_3_1_1))) : A (G (((pb_d2_n2_1_2_1_2_1 <= 2) OR (pol_d3_n1_1_1_1_1_3 + 1 <= po_d3_n1_2_1_2_3_3) OR (pb_d4_n1_1_3_3_1_3 <= pb_d4_n1_2_2_2_2_1)))) : A (G (((pol_d5_n1_2_2_1_1_1 + 1 <= pb_d4_n2_1_1_3_2_1) OR (pol_d2_n1_2_3_2_3_2 + 1 <= po_d5_n1_3_1_3_3_3) OR (2 <= pi_d4_n1_1_1_1_1_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pil_d3_n1_3_3_2_3_3 <= pb_d4_n1_2_3_2_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pil_d3_n1_2_3_3_1_1 <= pb_d1_n1_3_3_2_2_3) OR (pol_d4_n1_3_3_1_3_1 <= pb_d4_n2_3_2_2_3_3) OR ((po_d2_n1_3_3_3_2_2 <= po_d4_n1_2_1_3_3_3) AND (1 <= po_d1_n1_1_3_2_1_3))) AND ((pi_d4_n1_1_1_1_2_2 <= 2) OR (pb_d3_n1_2_1_2_1_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d2_n1_3_3_1_1_2 + 1 <= pi_d2_n1_1_3_1_1_2) AND (pb_d1_n1_1_2_3_1_3 + 1 <= pil_d5_n1_3_1_2_3_1) AND (2 <= pi_d5_n1_3_3_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 39807 markings, 41666 edges, 7961 markings/sec, 0 secs
lola: sara is running 5 secs || 70431 markings, 73191 edges, 6125 markings/sec, 5 secs
lola: sara is running 10 secs || 94371 markings, 97644 edges, 4788 markings/sec, 10 secs
lola: sara is running 15 secs || 116780 markings, 120088 edges, 4482 markings/sec, 15 secs
lola: sara is running 20 secs || 136518 markings, 139972 edges, 3948 markings/sec, 20 secs
lola: sara is running 25 secs || 155985 markings, 160229 edges, 3893 markings/sec, 25 secs
lola: sara is running 30 secs || 175489 markings, 179803 edges, 3901 markings/sec, 30 secs
lola: sara is running 35 secs || 195085 markings, 199745 edges, 3919 markings/sec, 35 secs
lola: sara is running 40 secs || 213544 markings, 218674 edges, 3692 markings/sec, 40 secs
lola: sara is running 45 secs || 234197 markings, 239391 edges, 4131 markings/sec, 45 secs
lola: sara is running 50 secs || 255936 markings, 261208 edges, 4348 markings/sec, 50 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 55 secs || 277553 markings, 283031 edges, 4323 markings/sec, 55 secs

lola: sara is running 60 secs || 299191 markings, 304669 edges, 4328 markings/sec, 60 secs
lola: sara is running 65 secs || 320708 markings, 326187 edges, 4303 markings/sec, 65 secs
lola: sara is running 70 secs || 342396 markings, 347886 edges, 4338 markings/sec, 70 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d3_n1_1_2_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d4_n1_2_3_3_1_1 <= pbl_2_1_2_1_1) AND (pol_d1_n1_3_1_1_1_2 <= pil_d1_n1_3_1_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pbl_1_1_2_2_3 <= pb_d3_n1_1_3_3_3_3) AND (pil_d1_n1_1_1_2_2_2 <= pi_d1_n1_3_3_1_2_3) AND (1 <= po_d2_n1_3_1_2_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pb_d3_n1_1_3_2_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d4_n1_1_2_3_3_1 <= 1) AND (pol_d3_n1_3_1_1_2_3 + 1 <= po_d3_n1_2_3_1_3_3)) OR (3 <= pb_d3_n2_3_1_2_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pb_d5_n2_3_2_1_2_3) AND ((pol_d1_n1_2_3_3_3_1 + 1 <= pol_d4_n1_2_3_2_3_3) OR (pil_d5_n1_1_2_3_1_3 <= po_d3_n1_2_1_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pil_d3_n1_2_2_1_3_3) AND ((pil_d1_n1_3_2_3_2_3 <= po_d2_n1_3_1_3_3_2) OR (3 <= pil_d5_n1_3_2_3_3_3)) AND (1 <= pi_d4_n1_1_3_2_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 55815 markings, 56878 edges, 11163 markings/sec, 0 secs
lola: sara is running 5 secs || 105866 markings, 107587 edges, 10010 markings/sec, 5 secs
lola: sara is running 10 secs || 142468 markings, 144338 edges, 7320 markings/sec, 10 secs
lola: sara is running 15 secs || 171412 markings, 173383 edges, 5789 markings/sec, 15 secs
lola: sara is running 20 secs || 200134 markings, 202443 edges, 5744 markings/sec, 20 secs
lola: sara is running 25 secs || 214473 markings, 217022 edges, 2868 markings/sec, 25 secs
lola: sara is running 30 secs || 224106 markings, 226921 edges, 1927 markings/sec, 30 secs
lola: sara is running 35 secs || 240884 markings, 243899 edges, 3356 markings/sec, 35 secs
lola: sara is running 40 secs || 256322 markings, 259833 edges, 3088 markings/sec, 40 secs
lola: sara is running 45 secs || 271445 markings, 276967 edges, 3025 markings/sec, 45 secs
lola: sara is running 50 secs || 286464 markings, 293987 edges, 3004 markings/sec, 50 secs
lola: sara is running 55 secs || 301690 markings, 311237 edges, 3045 markings/sec, 55 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 60 secs || 316559 markings, 328113 edges, 2974 markings/sec, 60 secs
lola: sara is running 65 secs || 331690 markings, 345370 edges, 3026 markings/sec, 65 secs

lola: sara is running 70 secs || 346972 markings, 362660 edges, 3056 markings/sec, 70 secs
lola: sara is running 75 secs || 362134 markings, 379764 edges, 3032 markings/sec, 75 secs
lola: sara is running 80 secs || 377354 markings, 396988 edges, 3044 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pb_d1_n2_3_1_1_3_2) AND (pb_d5_n2_3_2_1_1_3 <= 0) AND (3 <= pil_d5_n1_3_3_1_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 93522 markings, 94232 edges, 18704 markings/sec, 0 secs
lola: sara is running 5 secs || 189851 markings, 190689 edges, 19266 markings/sec, 5 secs
lola: sara is running 10 secs || 286517 markings, 287355 edges, 19333 markings/sec, 10 secs
lola: sara is running 15 secs || 380340 markings, 381178 edges, 18765 markings/sec, 15 secs
lola: sara is running 20 secs || 466967 markings, 467845 edges, 17325 markings/sec, 20 secs
lola: sara is running 25 secs || 551110 markings, 551997 edges, 16829 markings/sec, 25 secs
lola: sara is running 30 secs || 639490 markings, 640376 edges, 17676 markings/sec, 30 secs
lola: sara is running 35 secs || 728904 markings, 729790 edges, 17883 markings/sec, 35 secs
lola: sara is running 40 secs || 811066 markings, 811953 edges, 16432 markings/sec, 40 secs
lola: sara is running 45 secs || 896242 markings, 897128 edges, 17035 markings/sec, 45 secs
lola: sara is running 50 secs || 980826 markings, 981712 edges, 16917 markings/sec, 50 secs
lola: sara is running 55 secs || 1067501 markings, 1068387 edges, 17335 markings/sec, 55 secs
lola: sara is running 60 secs || 1154008 markings, 1154894 edges, 17301 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 1237739 markings, 1238626 edges, 16746 markings/sec, 65 secs

lola: sara is running 70 secs || 1321644 markings, 1322544 edges, 16781 markings/sec, 70 secs
lola: sara is running 75 secs || 1401667 markings, 1402590 edges, 16005 markings/sec, 75 secs
lola: sara is running 80 secs || 1485446 markings, 1486382 edges, 16756 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d3_n1_1_2_1_2_1 <= pil_d5_n1_3_2_3_3_3) OR (pbl_3_2_3_1_3 <= pb_d4_n1_2_1_2_3_3) OR ((po_d5_n1_3_1_2_3_2 <= pi_d4_n1_1_3_1_1_3) AND (pb_d5_n1_3_3_1_3_1 <= pb_d3_n2_3_2_1_1_2)) OR ((po_d2_n1_1_2_3_2_1 <= pb_d3_n1_2_1_1_2_1) AND (po_d1_n1_2_1_1_1_3 <= pol_d1_n1_1_2_2_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pb_d5_n2_1_3_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d3_n2_2_3_1_2_2 <= po_d4_n1_1_2_3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d2_n2_1_2_1_2_1 <= 2) OR (pol_d3_n1_1_1_1_1_3 + 1 <= po_d3_n1_2_1_2_3_3) OR (pb_d4_n1_1_3_3_1_3 <= pb_d4_n1_2_2_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d5_n1_2_2_1_1_1 + 1 <= pb_d4_n2_1_1_3_2_1) OR (pol_d2_n1_2_3_2_3_2 + 1 <= po_d5_n1_3_1_3_3_3) OR (2 <= pi_d4_n1_1_1_1_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes yes yes no no no yes yes no no
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494618660234

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440484500061"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;