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 Peterson-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463691927652

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Peterson-PT-2
FORMULA Peterson-COL-2-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-ReachabilityCardinality.task
lola: read: AG ((!((1 <= WantSection_1_T + WantSection_2_T + WantSection_0_T + WantSection_2_F + WantSection_1_F + WantSection_0_F AND BeginLoop_0_0_0 + BeginLoop_2_0_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + BeginLoop_0_1_0 + BeginLoop_1_0_1 + BeginLoop_2_0_1 + BeginLoop_2_1_0 + BeginLoop_0_0_1 + BeginLoop_2_1_1 + BeginLoop_0_0_2 + BeginLoop_0_1_1 + BeginLoop_1_1_1 + BeginLoop_0_1_2 + BeginLoop_1_1_2 + BeginLo... (shortened)
lola: formula length: 11446
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 ((-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T > -1 OR (BeginLoop_1_1_2 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + BeginLoop_1_0_2 + BeginLoop_1_0_1 + BeginLoop_1_0_0 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_1 + -TestTurn_1_0 + -TestTurn_0_1 + -TestTurn_0_0 + BeginLoop_0_1_2 + BeginLoop_0_1_1 + BeginLoop_0_1_0 + BeginLoop_0_0_2 ... (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 12 bytes per marking, with 5 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 4 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-TestIdentity_0_1_2 + -TestIdentity_0_1_1 + -TestIdentity_0_1_0 + -TestIdentity_0_0_2 + -TestIdentity_0_0_1 + -TestIdentity_0_0_0 + TestTurn_2_1 + TestTurn_2_0 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_0_1 + TestTurn_0_0 + -TestIdentity_2_1_2 + -TestIdentity_2_1_1 + -TestIdentity_2_1_0 + -TestIdentity_2_0_2 + -TestIdentity_2_0_1 + -TestIdentity_2_0_0 + -TestIdentity_1_1_2 + -TestIdentity_1_1_1... (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 12 bytes per marking, with 5 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 2 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality.sara
lola: calling and running sara
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 (((Turn_1_2 + Turn_0_2 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + Turn_0_0 + Turn_0_1 + Turn_1_0 + Turn_1_1 + -IsEndLoop_1_1_2 + -IsEndLoop_1_1_1 + -IsEndLoop_1_1_0 + -IsEndLoop_1_0_2 + -IsEndLoop_1_0_1 + -IsEndLoop_1_0_0 + -IsEndLoop_0_1_2 + -IsEndLoop_0_1_1 + -IsEndLoop_0_1_0 + -IsEndLoop_0_0_2 + -IsEndLoop_0_0_1 + -IsEn... (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 12 bytes per marking, with 5 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 6 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + -TestAlone_1_1_2 + -TestAlone_1_1_0 + -TestAlone_1_0_2 + -TestAlone_1_0_0 + -TestAlone_0_1_2 + -TestAlone_0_1_1 + -TestAlone_0_0_2 + -TestAlone_0_0_1 + -TestAlone_2_1_1 + -TestAlone_2_1_0 + -TestAlone_2_0_1 + -TestAlone_2_0_0 <= 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 12 bytes per marking, with 5 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 Peterson-COL-2-ReachabilityCardinality-4.sara
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 ((EndTurn_0_1 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_1 + -TestTurn_1_0 + -TestTurn_0_1 + -TestTurn_0_0 + EndTurn_0_0 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_1_1 + EndTurn_1_0 > 0 OR (-IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + -IsEndLoop_2_0_2 + -IsEndLoop_2_0_1 + -IsEndLoop_2_0_0 + -IsEndLoop_1_1_2 + -IsEndLoop_1_1_1 + -IsEndLoop_1_1_0 + -IsEndLoop_1_0_2 + -IsEndLoop_1_0_1 + ... (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 12 bytes per marking, with 5 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 3 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Turn_1_2 + -Turn_0_2 + TestAlone_1_1_2 + TestAlone_1_1_0 + TestAlone_1_0_2 + TestAlone_1_0_0 + -Turn_0_0 + -Turn_0_1 + -Turn_1_0 + -Turn_1_1 + TestAlone_0_1_2 + TestAlone_0_1_1 + TestAlone_0_0_2 + TestAlone_0_0_1 + TestAlone_2_1_1 + TestAlone_2_1_0 + TestAlone_2_0_1 + TestAlone_2_0_0 <= 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 12 bytes per marking, with 5 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 Peterson-COL-2-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T <= -1 OR (WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + -Idle_2 + -Idle_1 + -Idle_0 > 0 OR -Turn_1_2 + -Turn_0_2 + AskForSection_2_1 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_0_1 + AskForSection_0_0 + AskFor... (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 12 bytes per marking, with 5 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 3 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-AskForSection_2_1 + -AskForSection_1_1 + -AskForSection_1_0 + -AskForSection_0_1 + -AskForSection_0_0 + TestTurn_2_1 + TestTurn_2_0 + -AskForSection_2_0 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_0_1 + TestTurn_0_0 <= 0 OR (-Turn_1_2 + -Turn_0_2 + -Turn_0_0 + -Turn_0_1 + -Turn_1_0 + -Turn_1_1 <= -1 OR (AskForSection_2_1 + -IsEndLoop_2_1_2 + -IsEndLoop_2_1_1 + -IsEndLoop_2_1_0 + AskForSection_1... (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 12 bytes per marking, with 5 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 invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Idle_2 + -Idle_1 + -Idle_0 > -2 OR (-TestIdentity_0_1_2 + -TestIdentity_0_1_1 + -TestIdentity_0_1_0 + -TestIdentity_0_0_2 + -TestIdentity_0_0_1 + -TestIdentity_0_0_0 + -TestIdentity_2_1_2 + -TestIdentity_2_1_1 + -TestIdentity_2_1_0 + -TestIdentity_2_0_2 + -TestIdentity_2_0_1 + -TestIdentity_2_0_0 + -TestIdentity_1_1_2 + -TestIdentity_1_1_1 + -TestIdentity_1_1_0 + -TestIdentity_1_0_2 + -TestI... (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 12 bytes per marking, with 5 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 3 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-9.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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Turn_1_2 + -Turn_0_2 + TestTurn_2_1 + TestTurn_2_0 + -Turn_0_0 + TestTurn_1_1 + TestTurn_1_0 + -Turn_0_1 + -Turn_1_0 + TestTurn_0_1 + TestTurn_0_0 + -Turn_1_1 <= 0 AND (-EndTurn_0_1 + CS_2 + CS_1 + CS_0 + -EndTurn_0_0 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_1 + -EndTurn_1_0 <= 0 AND (-EndTurn_0_1 + -EndTurn_0_0 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_1 + -EndTurn_1_0 <= -3 AND (-AskFor... (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 12 bytes per marking, with 5 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 8 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((IsEndLoop_2_1_2 + IsEndLoop_2_1_1 + IsEndLoop_2_1_0 + IsEndLoop_2_0_2 + IsEndLoop_2_0_1 + IsEndLoop_2_0_0 + IsEndLoop_1_1_2 + IsEndLoop_1_1_1 + IsEndLoop_1_1_0 + IsEndLoop_1_0_2 + IsEndLoop_1_0_1 + IsEndLoop_1_0_0 + -Idle_2 + -Idle_1 + -Idle_0 + IsEndLoop_0_1_2 + IsEndLoop_0_1_1 + IsEndLoop_0_1_0 + IsEndLoop_0_0_2 + IsEndLoop_0_0_1 + IsEndLoop_0_0_0 <= 0 OR (-BeginLoop_1_1_2 + -BeginLoop_1_1_... (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 12 bytes per marking, with 5 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 4 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-BeginLoop_1_1_2 + -BeginLoop_1_1_1 + -BeginLoop_1_1_0 + CS_2 + CS_1 + CS_0 + -BeginLoop_1_0_2 + -BeginLoop_1_0_1 + -BeginLoop_1_0_0 + -BeginLoop_0_1_2 + -BeginLoop_0_1_1 + -BeginLoop_0_1_0 + -BeginLoop_0_0_2 + -BeginLoop_0_0_1 + -BeginLoop_0_0_0 + -BeginLoop_2_1_2 + -BeginLoop_2_1_1 + -BeginLoop_2_1_0 + -BeginLoop_2_0_2 + -BeginLoop_2_0_1 + -BeginLoop_2_0_0 <= 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 12 bytes per marking, with 5 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 Peterson-COL-2-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EndTurn_0_1 + -TestIdentity_0_1_2 + -TestIdentity_0_1_1 + -TestIdentity_0_1_0 + -TestIdentity_0_0_2 + -TestIdentity_0_0_1 + -TestIdentity_0_0_0 + EndTurn_0_0 + -TestIdentity_2_1_2 + -TestIdentity_2_1_1 + -TestIdentity_2_1_0 + -TestIdentity_2_0_2 + -TestIdentity_2_0_1 + -TestIdentity_2_0_0 + EndTurn_2_1 + EndTurn_2_0 + -TestIdentity_1_1_2 + -TestIdentity_1_1_1 + -TestIdentity_1_1_0 + EndTurn_1... (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 12 bytes per marking, with 5 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 3 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + TestTurn_2_1 + TestTurn_2_0 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_0_1 + TestTurn_0_0 <= 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 12 bytes per marking, with 5 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 Peterson-COL-2-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityCardinality-14.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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Turn_1_2 + -Turn_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_1_1 + IsEndLoop_2_1_0 + IsEndLoop_2_0_2 + IsEndLoop_2_0_1 + IsEndLoop_2_0_0 + -Turn_0_0 + -Turn_0_1 + -Turn_1_0 + -Turn_1_1 + IsEndLoop_1_1_2 + IsEndLoop_1_1_1 + IsEndLoop_1_1_0 + IsEndLoop_1_0_2 + IsEndLoop_1_0_1 + IsEndLoop_1_0_0 + IsEndLoop_0_1_2 + IsEndLoop_0_1_1 + IsEndLoop_0_1_0 + IsEndLoop_0_0_2 + IsEndLoop_0_0_1 + IsEndLoop_0_0_0 <=... (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 12 bytes per marking, with 5 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 Peterson-COL-2-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes no yes yes yes no yes yes yes no yes no no yes no

BK_STOP 1463691928903

--------------------
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="Peterson-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, 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 r086kn-ebro-146369088100061"
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 ;