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 FlexibleBarrier-PT-16b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034300124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496492857815


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-16b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-16b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ FlexibleBarrier-PT-16b @ 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: 7473/65536 symbol table entries, 1468 collisions
lola: preprocessing...
lola: finding significant places
lola: 3472 places, 4001 transitions, 3454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4035 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-16b-ReachabilityCardinality.task
lola: A (G ((p1130 <= p70))) : A (G ((p2609 <= p1417))) : A (G ((p627 <= p1439))) : A (G (((p912 <= p3146) OR ((p1677 <= p1020) AND (1 <= p677) AND (p1605 + 1 <= p465))))) : A (G ((((p3363 <= 0) AND ((1 <= p1428) OR (p604 <= p1193))) OR (p580 <= p3027)))) : A (G ((((1 <= p3307) OR (p2317 <= p2652) OR (p649 + 1 <= p1656)) AND (((p1091 <= p1216) AND (p452 <= p2606)) OR (p3137 + 1 <= p1887))))) : E (F ((((p2180 + 1 <= p3381) AND (p1298 <= 1)) OR (p3437 + 1 <= p875)))) : A (G ((p597 <= 0))) : E (F ((3 <= p2373))) : A (G (((p594 <= 1) OR (p322 <= 1) OR ((p1892 <= p1086) AND (1 <= p849) AND ((p3057 <= p2570) OR (p628 <= p681)))))) : A (G (((p1081 <= 0) OR (p2646 + 1 <= p231) OR (p2522 <= p2815)))) : A (G ((p297 <= p3467))) : A (G (((p3337 <= p2932) OR (p1473 <= p1826) OR (p2672 + 1 <= p2849) OR ((2 <= p1416) AND (2 <= p1532) AND ((p3124 <= p3002) OR (1 <= p117)))))) : A (G ((p1868 <= p2161))) : E (F ((((p676 + 1 <= p2786) AND (p631 <= 1)) OR ((p780 + 1 <= p1079) AND (p1032 <= 0))))) : A (G ((((p332 + 1 <= p3035) AND (p350 + 1 <= p1567)) OR ((p2286 <= 2) AND (p2136 <= 2)))))
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 ((p1130 <= p70)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2609 <= p1417)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 52682 markings, 140929 edges, 10536 markings/sec, 0 secs
lola: sara is running 5 secs || 105413 markings, 281842 edges, 10546 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p627 <= p1439)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p912 <= p3146) OR ((p1677 <= p1020) AND (1 <= p677) AND (p1605 + 1 <= p465)))))
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 432 bytes per marking, with 2 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-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 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3363 <= 0) AND ((1 <= p1428) OR (p604 <= p1193))) OR (p580 <= p3027))))
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 432 bytes per marking, with 2 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 52879 markings, 141937 edges, 10576 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p3307) OR (p2317 <= p2652) OR (p649 + 1 <= p1656)) AND (((p1091 <= p1216) AND (p452 <= p2606)) OR (p3137 + 1 <= p1887)))))
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 432 bytes per marking, with 2 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2180 + 1 <= p3381) AND (p1298 <= 1)) OR (p3437 + 1 <= p875))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 54557 markings, 135936 edges, 10911 markings/sec, 0 secs
lola: sara is running 5 secs || 109684 markings, 271893 edges, 11025 markings/sec, 5 secs
lola: sara is running 10 secs || 164549 markings, 409223 edges, 10973 markings/sec, 10 secs
lola: sara is running 15 secs || 219640 markings, 548980 edges, 11018 markings/sec, 15 secs
lola: sara is running 20 secs || 265356 markings, 707666 edges, 9143 markings/sec, 20 secs
lola: sara is running 25 secs || 309588 markings, 870450 edges, 8846 markings/sec, 25 secs
lola: sara is running 30 secs || 351068 markings, 1060086 edges, 8296 markings/sec, 30 secs
lola: sara is running 35 secs || 390249 markings, 1267378 edges, 7836 markings/sec, 35 secs
lola: sara is running 40 secs || 432012 markings, 1453391 edges, 8353 markings/sec, 40 secs
lola: sara is running 45 secs || 485795 markings, 1587957 edges, 10757 markings/sec, 45 secs
lola: sara is running 50 secs || 539261 markings, 1721196 edges, 10693 markings/sec, 50 secs
lola: sara is running 55 secs || 592992 markings, 1854877 edges, 10746 markings/sec, 55 secs
lola: sara is running 60 secs || 647497 markings, 1990567 edges, 10901 markings/sec, 60 secs
lola: sara is running 65 secs || 690502 markings, 2147348 edges, 8601 markings/sec, 65 secs
lola: sara is running 70 secs || 733004 markings, 2303296 edges, 8500 markings/sec, 70 secs
lola: sara is running 75 secs || 769106 markings, 2464324 edges, 7220 markings/sec, 75 secs
lola: sara is running 80 secs || 802070 markings, 2648196 edges, 6593 markings/sec, 80 secs
lola: sara is running 85 secs || 841070 markings, 2833274 edges, 7800 markings/sec, 85 secs
lola: sara is running 90 secs || 892835 markings, 2974025 edges, 10353 markings/sec, 90 secs
lola: sara is running 95 secs || 940755 markings, 3100644 edges, 9584 markings/sec, 95 secs
lola: sara is running 100 secs || 990441 markings, 3231535 edges, 9937 markings/sec, 100 secs
lola: sara is running 105 secs || 1042316 markings, 3371221 edges, 10375 markings/sec, 105 secs
lola: sara is running 110 secs || 1088001 markings, 3527321 edges, 9137 markings/sec, 110 secs
lola: sara is running 115 secs || 1128330 markings, 3680730 edges, 8066 markings/sec, 115 secs
lola: sara is running 120 secs || 1168184 markings, 3856532 edges, 7971 markings/sec, 120 secs
lola: sara is running 125 secs || 1206788 markings, 4051863 edges, 7721 markings/sec, 125 secs
lola: sara is running 130 secs || 1242851 markings, 4264564 edges, 7213 markings/sec, 130 secs
lola: sara is running 135 secs || 1295803 markings, 4399029 edges, 10590 markings/sec, 135 secs
lola: sara is running 140 secs || 1348306 markings, 4532555 edges, 10501 markings/sec, 140 secs
lola: sara is running 145 secs || 1401547 markings, 4665982 edges, 10648 markings/sec, 145 secs
lola: sara is running 150 secs || 1452616 markings, 4806668 edges, 10214 markings/sec, 150 secs
lola: sara is running 155 secs || 1493509 markings, 4962270 edges, 8179 markings/sec, 155 secs
lola: sara is running 160 secs || 1536133 markings, 5124480 edges, 8525 markings/sec, 160 secs
lola: sara is running 165 secs || 1575815 markings, 5324572 edges, 7936 markings/sec, 165 secs
lola: sara is running 170 secs || 1612316 markings, 5531438 edges, 7300 markings/sec, 170 secs
lola: sara is running 175 secs || 1666206 markings, 5664303 edges, 10778 markings/sec, 175 secs
lola: sara is running 180 secs || 1718484 markings, 5797413 edges, 10456 markings/sec, 180 secs
lola: sara is running 185 secs || 1771541 markings, 5932107 edges, 10611 markings/sec, 185 secs
lola: sara is running 190 secs || 1823607 markings, 6070932 edges, 10413 markings/sec, 190 secs
lola: sara is running 195 secs || 1864362 markings, 6228050 edges, 8151 markings/sec, 195 secs
lola: sara is running 200 secs || 1907834 markings, 6392876 edges, 8694 markings/sec, 200 secs
lola: sara is running 205 secs || 1947802 markings, 6594581 edges, 7994 markings/sec, 205 secs
lola: sara is running 210 secs || 1984771 markings, 6799535 edges, 7394 markings/sec, 210 secs
lola: sara is running 215 secs || 2038076 markings, 6935295 edges, 10661 markings/sec, 215 secs
lola: sara is running 220 secs || 2090700 markings, 7067959 edges, 10525 markings/sec, 220 secs
lola: sara is running 225 secs || 2143412 markings, 7203094 edges, 10542 markings/sec, 225 secs
lola: sara is running 230 secs || 2195665 markings, 7340517 edges, 10451 markings/sec, 230 secs
lola: sara is running 235 secs || 2236470 markings, 7496569 edges, 8161 markings/sec, 235 secs
lola: sara is running 240 secs || 2279169 markings, 7658818 edges, 8540 markings/sec, 240 secs
lola: sara is running 245 secs || 2319015 markings, 7859910 edges, 7969 markings/sec, 245 secs
lola: sara is running 250 secs || 2355798 markings, 8064700 edges, 7357 markings/sec, 250 secs
lola: sara is running 255 secs || 2408310 markings, 8201643 edges, 10502 markings/sec, 255 secs
sara: warning, failure of lp_solve (at job 737)
lola: sara is running 260 secs || 2461220 markings, 8334688 edges, 10582 markings/sec, 260 secs
lola: sara is running 265 secs || 2514051 markings, 8468452 edges, 10566 markings/sec, 265 secs
lola: sara is running 270 secs || 2566495 markings, 8606002 edges, 10489 markings/sec, 270 secs
lola: sara is running 275 secs || 2610341 markings, 8773059 edges, 8769 markings/sec, 275 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p597 <= 0)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2373)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 52576 markings, 139975 edges, 10515 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p594 <= 1) OR (p322 <= 1) OR ((p1892 <= p1086) AND (1 <= p849) AND ((p3057 <= p2570) OR (p628 <= p681))))))
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 432 bytes per marking, with 2 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 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 51733 markings, 139269 edges, 10347 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1081 <= 0) OR (p2646 + 1 <= p231) OR (p2522 <= p2815))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p297 <= p3467)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-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 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3337 <= p2932) OR (p1473 <= p1826) OR (p2672 + 1 <= p2849) OR ((2 <= p1416) AND (2 <= p1532) AND ((p3124 <= p3002) OR (1 <= p117))))))
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 432 bytes per marking, with 2 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 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 54835 markings, 134652 edges, 10967 markings/sec, 0 secs
lola: sara is running 5 secs || 108823 markings, 270612 edges, 10798 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1068 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1868 <= p2161)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p676 + 1 <= p2786) AND (p631 <= 1)) OR ((p780 + 1 <= p1079) AND (p1032 <= 0)))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3200 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p332 + 1 <= p3035) AND (p350 + 1 <= p1567)) OR ((p2286 <= 2) AND (p2136 <= 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 432 bytes per marking, with 2 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 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 55027 markings, 134199 edges, 11005 markings/sec, 0 secs

lola: sara is running 5 secs || 109155 markings, 272068 edges, 10826 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes no no no no yes yes
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496493208106

--------------------
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="FlexibleBarrier-PT-16b"
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/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 FlexibleBarrier-PT-16b, 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 r188-blw3-149581034300124"
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 ;