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 S_QuasiCertifProtocol-PT-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182kn-smll-146444115300135
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464476603753

bkconf 3600
===========================================================================================
===========================================================================================
S_QuasiCertifProtocol-PT-32: translating formula ReachabilityFireability into LoLA format
S_QuasiCertifProtocol-PT-32: translating Petri net model.pnml into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityFireability.xml
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 3537
ReachabilityFireability @ S_QuasiCertifProtocol-PT-32
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-ReachabilityFireability-15 CANNOT_COMPUTE
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-32-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((((((((((((((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3)) OR FIREABLE(SackCS_0)) OR FIREABLE(SackCS_1)) OR FIREABLE(SackCS_6)) OR FIREABLE(SackCS_7)) OR FIREABLE(SackCS_4)) OR FIREABLE(SackCS_5)) OR FIREABLE(SackCS_10)) OR FIREABLE(SackCS_11)) OR FIREABLE(SackCS_8)) OR FIREABLE(SackCS_9)) OR FIREABLE(SackCS_14)) OR FIREABLE(SackCS_15)) OR FIREABLE(SackCS_12)) OR FIREABLE(SackCS... (shortened)
lola: formula length: 31625
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SackCS_2) OR (FIREABLE(SackCS_3) OR (FIREABLE(SackCS_0) OR (FIREABLE(SackCS_1) OR (FIREABLE(SackCS_6) OR (FIREABLE(SackCS_7) OR (FIREABLE(SackCS_4) OR (FIREABLE(SackCS_5) OR (FIREABLE(SackCS_10) OR (FIREABLE(SackCS_11) OR (FIREABLE(SackCS_8) OR (FIREABLE(SackCS_9) OR (FIREABLE(SackCS_14) OR (FIREABLE(SackCS_15) OR (FIREABLE(SackCS_12) OR (FIREABLE(SackCS_13) OR (FIREABLE(SackCS_21) O... (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 2020 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 66 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SackCS_2) OR (FIREABLE(SackCS_3) OR (FIREABLE(SackCS_0) OR (FIREABLE(SackCS_1) OR (FIREABLE(SackCS_6) OR (FIREABLE(SackCS_7) OR (FIREABLE(SackCS_4) OR (FIREABLE(SackCS_5) OR (FIREABLE(SackCS_10) OR (FIREABLE(SackCS_11) OR (FIREABLE(SackCS_8) OR (FIREABLE(SackCS_9) OR (FIREABLE(SackCS_14) OR (FIREABLE(SackCS_15) OR (FIREABLE(SackCS_12) OR (FIREABLE(SackCS_13) OR (FIREABLE(SackCS_21) O... (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 2020 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 66 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malS6_30) OR (FIREABLE(malS6_31) OR (FIREABLE(malS6_32) OR (FIREABLE(malS6_12) OR (FIREABLE(malS6_13) OR (FIREABLE(malS6_10) OR (FIREABLE(malS6_11) OR (FIREABLE(malS6_8) OR (FIREABLE(malS6_9) OR (FIREABLE(malS6_6) OR (FIREABLE(malS6_7) OR (FIREABLE(malS6_4) OR (FIREABLE(malS6_5) OR (FIREABLE(malS6_2) OR (FIREABLE(malS6_3) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_1) OR (FIREABLE(malS6... (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 2020 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 66 literals
lola: write sara problem file to QuasiCertifProtocol-COL-32-ReachabilityFireability-2.sara
lola: calling and running sara
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(ScertCS_7) AND (! FIREABLE(ScertCS_6) AND (! FIREABLE(ScertCS_5) AND (! FIREABLE(ScertCS_4) AND (! FIREABLE(ScertCS_11) AND (! FIREABLE(ScertCS_10) AND (! FIREABLE(ScertCS_9) AND (! FIREABLE(ScertCS_8) AND (! FIREABLE(ScertCS_3) AND (! FIREABLE(ScertCS_2) AND (! FIREABLE(ScertCS_1) AND (! FIREABLE(ScertCS_0) AND (! FIREABLE(ScertCS_24) AND (! FIREABLE(ScertCS_25) AND (! FIREABLE(... (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 2020 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 1349306927050863 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 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AreqCS))
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 2020 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 1 literals
lola: write sara problem file to QuasiCertifProtocol-COL-32-ReachabilityFireability-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AgetTS))
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 2020 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 34 literals
lola: write sara problem file to QuasiCertifProtocol-COL-32-ReachabilityFireability-5.sara
lola: lola: SUBRESULT
calling and running sara
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(malS1_28) AND (! FIREABLE(malS1_27) AND (! FIREABLE(malS1_26) AND (! FIREABLE(malS1_25) AND (! FIREABLE(malS1_32) AND (! FIREABLE(malS1_31) AND (! FIREABLE(malS1_30) AND (! FIREABLE(malS1_29) AND (! FIREABLE(malS1_0) AND (! FIREABLE(malS1_6) AND (! FIREABLE(malS1_5) AND (! FIREABLE(malS1_8) AND (! FIREABLE(malS1_7) AND (! FIREABLE(malS1_2) AND (! FIREABLE(malS1_1) AND (! FIREABLE(m... (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 2020 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 1151051235194 literals
lola: DNF formula is too big, sara cannot be used
sara: try reading problem file QuasiCertifProtocol-COL-32-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(malA2))
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 2020 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 1 literals
lola: write sara problem file to QuasiCertifProtocol-COL-32-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(CgenCertif_20) OR (FIREABLE(CgenCertif_19) OR (FIREABLE(CgenCertif_22) OR (FIREABLE(CgenCertif_21) OR (FIREABLE(CgenCertif_24) OR (FIREABLE(CgenCertif_23) OR (FIREABLE(CgenCertif_26) OR (FIREABLE(CgenCertif_25) OR (FIREABLE(CgenCertif_28) OR (FIREABLE(CgenCertif_27) OR (FIREABLE(CgenCertif_30) OR (FIREABLE(CgenCertif_29) OR (FIREABLE(CgenCertif_32) OR (FIREABLE(CgenCertif_31) OR (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 2020 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 1452990 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 9 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malC1_17) OR (FIREABLE(malC1_18) OR (FIREABLE(malC1_15) OR (FIREABLE(malC1_16) OR (FIREABLE(malC1_21) OR (FIREABLE(malC1_22) OR (FIREABLE(malC1_19) OR (FIREABLE(malC1_20) OR (FIREABLE(malC1_25) OR (FIREABLE(malC1_26) OR (FIREABLE(malC1_23) OR (FIREABLE(malC1_24) OR (FIREABLE(malC1_29) OR (FIREABLE(malC1_30) OR (FIREABLE(malC1_27) OR (FIREABLE(malC1_28) OR (FIREABLE(malC1_2) OR (FIREA... (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 2020 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 66 literals
lola: write sara problem file to QuasiCertifProtocol-COL-32-ReachabilityFireability-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(malA4) OR (FIREABLE(SgetTS_23) OR (FIREABLE(SgetTS_24) OR (FIREABLE(SgetTS_21) OR (FIREABLE(SgetTS_22) OR (FIREABLE(SgetTS_27) OR (FIREABLE(SgetTS_28) OR (FIREABLE(SgetTS_25) OR (FIREABLE(SgetTS_26) OR (FIREABLE(SgetTS_15) OR (FIREABLE(SgetTS_16) OR (FIREABLE(SgetTS_13) OR (FIREABLE(SgetTS_14) OR (FIREABLE(SgetTS_19) OR (FIREABLE(SgetTS_20) OR (FIREABLE(SgetTS_17) OR (FIREABLE(Sget... (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 2020 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 11 will run for 514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(AendCS) OR ((FIREABLE(malS6_30) OR (FIREABLE(malS6_31) OR (FIREABLE(malS6_32) OR (FIREABLE(malS6_12) OR (FIREABLE(malS6_13) OR (FIREABLE(malS6_10) OR (FIREABLE(malS6_11) OR (FIREABLE(malS6_8) OR (FIREABLE(malS6_9) OR (FIREABLE(malS6_6) OR (FIREABLE(malS6_7) OR (FIREABLE(malS6_4) OR (FIREABLE(malS6_5) OR (FIREABLE(malS6_2) OR (FIREABLE(malS6_3) OR (FIREABLE(malS6_0) OR (FIREABLE(mal... (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 2020 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 12 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(ScertCS_7) AND (! FIREABLE(ScertCS_6) AND (! FIREABLE(ScertCS_5) AND (! FIREABLE(ScertCS_4) AND (! FIREABLE(ScertCS_11) AND (! FIREABLE(ScertCS_10) AND (! FIREABLE(ScertCS_9) AND (! FIREABLE(ScertCS_8) AND (! FIREABLE(ScertCS_3) AND (! FIREABLE(ScertCS_2) AND (! FIREABLE(ScertCS_1) AND (! FIREABLE(ScertCS_0) AND (! FIREABLE(ScertCS_24) AND (! FIREABLE(ScertCS_25) AND (! FIREABLE(... (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 2020 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 9967 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SackCS_2) OR (FIREABLE(SackCS_3) OR (FIREABLE(SackCS_0) OR (FIREABLE(SackCS_1) OR (FIREABLE(SackCS_6) OR (FIREABLE(SackCS_7) OR (FIREABLE(SackCS_4) OR (FIREABLE(SackCS_5) OR (FIREABLE(SackCS_10) OR (FIREABLE(SackCS_11) OR (FIREABLE(SackCS_8) OR (FIREABLE(SackCS_9) OR (FIREABLE(SackCS_14) OR (FIREABLE(SackCS_15) OR (FIREABLE(SackCS_12) OR (FIREABLE(SackCS_13) OR (FIREABLE(SackCS_21) ... (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 2020 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 11000338331225017084708651008 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 14 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(CgenCertif_20) AND (! FIREABLE(CgenCertif_19) AND (! FIREABLE(CgenCertif_22) AND (! FIREABLE(CgenCertif_21) AND (! FIREABLE(CgenCertif_24) AND (! FIREABLE(CgenCertif_23) AND (! FIREABLE(CgenCertif_26) AND (! FIREABLE(CgenCertif_25) AND (! FIREABLE(CgenCertif_28) AND (! FIREABLE(CgenCertif_27) AND (! FIREABLE(CgenCertif_30) AND (! FIREABLE(CgenCertif_29) AND (! FIREABLE(CgenCertif_... (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 2020 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 15 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(SsendTS_20) OR (FIREABLE(SsendTS_19) OR (FIREABLE(SsendTS_18) OR (FIREABLE(SsendTS_17) OR (FIREABLE(SsendTS_24) OR (FIREABLE(SsendTS_23) OR (FIREABLE(SsendTS_22) OR (FIREABLE(SsendTS_21) OR (FIREABLE(SsendTS_28) OR (FIREABLE(SsendTS_27) OR (FIREABLE(SsendTS_26) OR (FIREABLE(SsendTS_25) OR (FIREABLE(SsendTS_32) OR (FIREABLE(SsendTS_31) OR (FIREABLE(SsendTS_30) OR (FIREABLE(SsendTS_29)... (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 2020 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 69466801045238 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: yes yes yes unknown yes yes unknown yes unknown yes yes no no unknown no unknown

BK_STOP 1464478729330

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

parsing of model.pnml complete

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="S_QuasiCertifProtocol-PT-32"
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/S_QuasiCertifProtocol-PT-32.tgz
mv S_QuasiCertifProtocol-PT-32 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 S_QuasiCertifProtocol-PT-32, 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 r182kn-smll-146444115300135"
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 ;