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 QuasiCertifProtocol-PT-28, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300126
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-28-ReachabilityFireability-0
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-1
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-15
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-3
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-4
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-5
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-6
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-7
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-8
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1463713818125

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ QuasiCertifProtocol-PT-28
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-15 CANNOT_COMPUTE
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3444/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 2998 places, 446 transitions, 445 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 591 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-28-ReachabilityFireability.task
lola: read: AG (((((((((((((((((((((((((((((FIREABLE(malS1_26) OR FIREABLE(malS1_25)) OR FIREABLE(malS1_28)) OR FIREABLE(malS1_27)) OR FIREABLE(malS1_24)) OR FIREABLE(malS1_23)) OR FIREABLE(malS1_22)) OR FIREABLE(malS1_21)) OR FIREABLE(malS1_20)) OR FIREABLE(malS1_19)) OR FIREABLE(malS1_18)) OR FIREABLE(malS1_17)) OR FIREABLE(malS1_16)) OR FIREABLE(malS1_15)) OR FIREABLE(malS1_14)) OR FIREABLE(malS1_13)) OR F... (shortened)
lola: formula length: 40125
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(malS1_26) OR (FIREABLE(malS1_25) OR (FIREABLE(malS1_28) OR (FIREABLE(malS1_27) OR (FIREABLE(malS1_24) OR (FIREABLE(malS1_23) OR (FIREABLE(malS1_22) OR (FIREABLE(malS1_21) OR (FIREABLE(malS1_20) OR (FIREABLE(malS1_19) OR (FIREABLE(malS1_18) OR (FIREABLE(malS1_17) OR (FIREABLE(malS1_16) OR (FIREABLE(malS1_15) OR (FIREABLE(malS1_14) OR (FIREABLE(malS1_13) OR (FIREABLE(malS1_12) OR (FIRE... (shortened)
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 1780 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: Transformation into DNF: expect 2147483586 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(malS1_26) OR (FIREABLE(malS1_25) OR (FIREABLE(malS1_28) OR (FIREABLE(malS1_27) OR (FIREABLE(malS1_24) OR (FIREABLE(malS1_23) OR (FIREABLE(malS1_22) OR (FIREABLE(malS1_21) OR (FIREABLE(malS1_20) OR (FIREABLE(malS1_19) OR (FIREABLE(malS1_18) OR (FIREABLE(malS1_17) OR (FIREABLE(malS1_16) OR (FIREABLE(malS1_15) OR (FIREABLE(malS1_14) OR (FIREABLE(malS1_13) OR (FIREABLE(malS1_12) OR (FIRE... (shortened)
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 1780 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: Transformation into DNF: expect 2147483586 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(malA5) AND (FIREABLE(malA3) OR (FIREABLE(ScertCS_11) OR (FIREABLE(ScertCS_10) OR (FIREABLE(ScertCS_9) OR (FIREABLE(ScertCS_8) OR (FIREABLE(ScertCS_7) OR (FIREABLE(ScertCS_6) OR (FIREABLE(ScertCS_5) OR (FIREABLE(ScertCS_4) OR (FIREABLE(ScertCS_3) OR (FIREABLE(ScertCS_2) OR (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR (FIREABLE(ScertCS_24) OR (FIREABLE(ScertCS_25) OR (FIREABLE(Sce... (shortened)
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 1780 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: Transformation into DNF: expect 60 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(AstartCS) AND (((! FIREABLE(SgetTS_23) AND (! FIREABLE(SgetTS_24) AND (! FIREABLE(SgetTS_21) AND (! FIREABLE(SgetTS_22) AND (! FIREABLE(SgetTS_19) AND (! FIREABLE(SgetTS_20) AND (! FIREABLE(SgetTS_17) AND (! FIREABLE(SgetTS_18) AND (! FIREABLE(SgetTS_15) AND (! FIREABLE(SgetTS_16) AND (! FIREABLE(SgetTS_13) AND (! FIREABLE(SgetTS_14) AND (! FIREABLE(SgetTS_11) AND (! FIREABLE(SgetTS_... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(malA5) AND ! FIREABLE(AreqCS)) OR ((! FIREABLE(CsendTS1_27) AND (! FIREABLE(CsendTS1_26) AND (! FIREABLE(CsendTS1_28) AND (! FIREABLE(CsendTS1_12) AND (! FIREABLE(CsendTS1_13) AND (! FIREABLE(CsendTS1_10) AND (! FIREABLE(CsendTS1_11) AND (! FIREABLE(CsendTS1_16) AND (! FIREABLE(CsendTS1_17) AND (! FIREABLE(CsendTS1_14) AND (! FIREABLE(CsendTS1_15) AND (! FIREABLE(CsendTS1_20) AND... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(CgenCertif_7) AND (! FIREABLE(CgenCertif_8) AND (! FIREABLE(CgenCertif_9) AND (! FIREABLE(CgenCertif_10) AND (! FIREABLE(CgenCertif_11) AND (! FIREABLE(CgenCertif_12) AND (! FIREABLE(CgenCertif_13) AND (! FIREABLE(CgenCertif_14) AND (! FIREABLE(CgenCertif_15) AND (! FIREABLE(CgenCertif_16) AND (! FIREABLE(CgenCertif_17) AND (! FIREABLE(CgenCertif_18) AND (! FIREABLE(CgenCertif_19)... (shortened)
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 1780 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: Transformation into DNF: expect 3776 literals
lola: write sara problem file to QuasiCertifProtocol-COL-28-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-28-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(malC1_3) OR (FIREABLE(malC1_4) OR (FIREABLE(malC1_5) OR (FIREABLE(malC1_6) OR (FIREABLE(malC1_0) OR (FIREABLE(malC1_1) OR (FIREABLE(malC1_2) OR (FIREABLE(malC1_18) OR (FIREABLE(malC1_17) OR (FIREABLE(malC1_16) OR (FIREABLE(malC1_15) OR (FIREABLE(malC1_22) OR (FIREABLE(malC1_21) OR (FIREABLE(malC1_20) OR (FIREABLE(malC1_19) OR (FIREABLE(malC1_10) OR (FIREABLE(malC1_9) OR (FIREABLE(m... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(AgetTS) OR ((FIREABLE(Sperform_1) OR (FIREABLE(Sperform_2) OR (FIREABLE(Sperform_0) OR (FIREABLE(Sperform_13) OR (FIREABLE(Sperform_14) OR (FIREABLE(Sperform_11) OR (FIREABLE(Sperform_12) OR (FIREABLE(Sperform_17) OR (FIREABLE(Sperform_18) OR (FIREABLE(Sperform_15) OR (FIREABLE(Sperform_16) OR (FIREABLE(Sperform_5) OR (FIREABLE(Sperform_6) OR (FIREABLE(Sperform_3) OR (FIREABLE(Sper... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(AgetTS) AND (! FIREABLE(SackCS_22) AND (! FIREABLE(SackCS_23) AND (! FIREABLE(SackCS_20) AND (! FIREABLE(SackCS_21) AND (! FIREABLE(SackCS_18) AND (! FIREABLE(SackCS_19) AND (! FIREABLE(SackCS_16) AND (! FIREABLE(SackCS_17) AND (! FIREABLE(SackCS_28) AND (! FIREABLE(SackCS_26) AND (! FIREABLE(SackCS_27) AND (! FIREABLE(SackCS_24) AND (! FIREABLE(SackCS_25) AND (! FIREABLE(SackCS_7... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(malA1) OR (! FIREABLE(malA2) AND ((! FIREABLE(SgetTS_23) AND (! FIREABLE(SgetTS_24) AND (! FIREABLE(SgetTS_21) AND (! FIREABLE(SgetTS_22) AND (! FIREABLE(SgetTS_19) AND (! FIREABLE(SgetTS_20) AND (! FIREABLE(SgetTS_17) AND (! FIREABLE(SgetTS_18) AND (! FIREABLE(SgetTS_15) AND (! FIREABLE(SgetTS_16) AND (! FIREABLE(SgetTS_13) AND (! FIREABLE(SgetTS_14) AND (! FIREABLE(SgetTS_11) AND (... (shortened)
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 1780 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: Transformation into DNF: expect 26971 literals
lola: write sara problem file to QuasiCertifProtocol-COL-28-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-28-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malC1_3) OR (FIREABLE(malC1_4) OR (FIREABLE(malC1_5) OR (FIREABLE(malC1_6) OR (FIREABLE(malC1_0) OR (FIREABLE(malC1_1) OR (FIREABLE(malC1_2) OR (FIREABLE(malC1_18) OR (FIREABLE(malC1_17) OR (FIREABLE(malC1_16) OR (FIREABLE(malC1_15) OR (FIREABLE(malC1_22) OR (FIREABLE(malC1_21) OR (FIREABLE(malC1_20) OR (FIREABLE(malC1_19) OR (FIREABLE(malC1_10) OR (FIREABLE(malC1_9) OR (FIREABLE(mal... (shortened)
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 1780 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: Transformation into DNF: expect 1037629354146162278400 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malA3) AND ((! FIREABLE(CgenCertif_7) AND (! FIREABLE(CgenCertif_8) AND (! FIREABLE(CgenCertif_9) AND (! FIREABLE(CgenCertif_10) AND (! FIREABLE(CgenCertif_11) AND (! FIREABLE(CgenCertif_12) AND (! FIREABLE(CgenCertif_13) AND (! FIREABLE(CgenCertif_14) AND (! FIREABLE(CgenCertif_15) AND (! FIREABLE(CgenCertif_16) AND (! FIREABLE(CgenCertif_17) AND (! FIREABLE(CgenCertif_18) AND (! FI... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(malS4_9) OR (FIREABLE(malS4_8) OR (FIREABLE(malS4_11) OR (FIREABLE(malS4_10) OR (FIREABLE(malS4_13) OR (FIREABLE(malS4_12) OR (FIREABLE(malS4_15) OR (FIREABLE(malS4_14) OR (FIREABLE(malS4_1) OR (FIREABLE(malS4_0) OR (FIREABLE(malS4_3) OR (FIREABLE(malS4_2) OR (FIREABLE(malS4_5) OR (FIREABLE(malS4_4) OR (FIREABLE(malS4_7) OR (FIREABLE(malS4_6) OR (FIREABLE(malS4_26) OR (FIREABLE(mal... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 952 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(SsendTS_17) AND (! FIREABLE(SsendTS_18) AND (! FIREABLE(SsendTS_19) AND (! FIREABLE(SsendTS_20) AND (! FIREABLE(SsendTS_13) AND (! FIREABLE(SsendTS_14) AND (! FIREABLE(SsendTS_15) AND (! FIREABLE(SsendTS_16) AND (! FIREABLE(SsendTS_25) AND (! FIREABLE(SsendTS_26) AND (! FIREABLE(SsendTS_27) AND (! FIREABLE(SsendTS_28) AND (! FIREABLE(SsendTS_21) AND (! FIREABLE(SsendTS_22) AND (!... (shortened)
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 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SsendTS_17) OR (FIREABLE(SsendTS_18) OR (FIREABLE(SsendTS_19) OR (FIREABLE(SsendTS_20) OR (FIREABLE(SsendTS_13) OR (FIREABLE(SsendTS_14) OR (FIREABLE(SsendTS_15) OR (FIREABLE(SsendTS_16) OR (FIREABLE(SsendTS_25) OR (FIREABLE(SsendTS_26) OR (FIREABLE(SsendTS_27) OR (FIREABLE(SsendTS_28) OR (FIREABLE(SsendTS_21) OR (FIREABLE(SsendTS_22) OR (FIREABLE(SsendTS_23) OR (FIREABLE(SsendTS_24... (shortened)
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 1780 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: Transformation into DNF: expect 3007358 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((((FIREABLE(SsendTS_17) OR (FIREABLE(SsendTS_18) OR (FIREABLE(SsendTS_19) OR (FIREABLE(SsendTS_20) OR (FIREABLE(SsendTS_13) OR (FIREABLE(SsendTS_14) OR (FIREABLE(SsendTS_15) OR (FIREABLE(SsendTS_16) OR (FIREABLE(SsendTS_25) OR (FIREABLE(SsendTS_26) OR (FIREABLE(SsendTS_27) OR (FIREABLE(SsendTS_28) OR (FIREABLE(SsendTS_21) OR (FIREABLE(SsendTS_22) OR (FIREABLE(SsendTS_23) OR (FIREABLE(SsendTS... (shortened)
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 1780 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: Transformation into DNF: expect 5680094489347 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no no yes yes yes yes no no no no unknown yes yes yes unknown unknown

BK_STOP 1463716066637

--------------------
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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 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 QuasiCertifProtocol-PT-28, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098kn-smll-146369140300126"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;