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

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

=== Now, execution of the tool begins

BK_START 1463692564736

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Peterson-PT-5
FORMULA Peterson-COL-5-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-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: 2076/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 834 places, 1242 transitions, 811 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1908 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-5-ReachabilityCardinality.task
lola: read: AG (CS_0 + CS_3 + CS_4 + CS_1 + CS_2 + CS_5 <= TestTurn_3_0 + TestTurn_4_0 + TestTurn_1_0 + TestTurn_2_0 + TestTurn_0_0 + TestTurn_0_2 + TestTurn_5_1 + TestTurn_4_1 + TestTurn_3_1 + TestTurn_2_1 + TestTurn_1_1 + TestTurn_0_1 + TestTurn_5_0 + TestTurn_2_3 + TestTurn_1_3 + TestTurn_0_3 + TestTurn_5_2 + TestTurn_4_2 + TestTurn_3_2 + TestTurn_2_2 + TestTurn_1_2 + TestTurn_3_3 + TestTurn_4_3 + TestTurn... (shortened)
lola: formula length: 107129
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-TestTurn_5_4 + -TestTurn_5_3 + -TestTurn_5_2 + -TestTurn_5_1 + -TestTurn_5_0 + CS_5 + CS_4 + CS_3 + CS_2 + CS_1 + CS_0 + -TestTurn_4_4 + -TestTurn_4_3 + -TestTurn_4_2 + -TestTurn_4_1 + -TestTurn_4_0 + -TestTurn_3_4 + -TestTurn_3_3 + -TestTurn_3_2 + -TestTurn_3_1 + -TestTurn_3_0 + -TestTurn_2_4 + -TestTurn_2_3 + -TestTurn_2_2 + -TestTurn_2_1 + -TestTurn_2_0 + -TestTurn_1_4 + -TestTurn_1_3 + -T... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Turn_2_5 + -Turn_3_5 + -Turn_4_5 + -Turn_0_5 + -Turn_1_5 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_0 + -Turn_0_4 + -Turn_0_3 + -Turn_0_2 + -Turn_0_1 + -Turn_0_0 + -Turn_4_4 + -Turn_4_3 + -Turn_4_2 + -Turn_4_1 + -Turn_4_0 + -Turn_3_4 + -Turn_3_3 + -Turn_3_2 + -Turn_3_1 + -Turn_3_0 + -Turn_2_4 + -Turn_2_3 + -Turn_2_2 + -Turn_2_1 + -Turn_2_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 21 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: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: write sara problem file to Peterson-COL-5-ReachabilityCardinality.sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: lola: lola: calling and running sara========================================

========================================
lola: ...considering subproblem: EF ((-Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 > -2 AND -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + -BeginLoop_1_3_5 + -BeginLoop_1_3_4 + -BeginLoop_1_3_3 + -BeginLoop_1_3_2 + -BeginLoop_1_3_1 + -Begi... (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 104 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-TestIdentity_3_4_5 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_0_4_5 + -TestIdentity_0_4_4 + -TestIdentity_0_4_3 + -TestIdentity_0_4_2 + -TestIdentity_0_4_1 + -TestIdentity_0_4_0 + -TestIdentity_3_2_5 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((TestIdentity_3_4_5 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + TestIdentity_3_3_5 + TestIdentity_3_3_4 + TestIdentity_3_3_3 + TestIdentity_3_3_2 + TestIdentity_3_3_1 + TestIdentity_3_3_0 + -BeginLoop_1_3_5 + -... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-TestIdentity_3_4_5 + WantSection_0_F + WantSection_0_T + WantSection_1_F + WantSection_1_T + WantSection_2_F + WantSection_2_T + WantSection_3_F + WantSection_3_T + WantSection_4_F + WantSection_4_T + WantSection_5_F + WantSection_5_T + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_0_4_5 + -Tes... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_4 + -AskForSection_2_3 + -AskForSection_2_2 + -AskForSection_2_1 + -AskForSection_2_0 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + -AskF... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-6.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 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-TestIdentity_3_4_5 + Turn_2_5 + Turn_3_5 + Turn_4_5 + Turn_0_5 + Turn_1_5 + Turn_1_4 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + Turn_0_4 + Turn_0_3 + Turn_0_2 + Turn_0_1 + Turn_0_0 + -TestIdentity_0_4_5 + -TestIdentity_0_4_4 + -TestIdentity_0_4_3 + -TestIdent... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((IsEndLoop_2_4_5 + IsEndLoop_5_2_5 + IsEndLoop_2_4_0 + IsEndLoop_5_2_4 + IsEndLoop_5_2_3 + IsEndLoop_5_2_2 + IsEndLoop_5_2_1 + IsEndLoop_5_2_0 + IsEndLoop_2_4_1 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + IsEndLoop_2_3_5 + IsEndLoop_2_3_4 + IsEndLoop_2_3_3 + IsEndLoop_2_3_2 + IsEndLoop_2_3_1 + IsEndLoop_2_3_0 + IsEndLoop_5_1_5 + Is... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-TestIdentity_3_4_5 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -TestIdentity_3_3_3 + -TestIdentity_3_3_2 + -TestIdentity_3_3_1 + -TestIdentity_3_3_0 + -TestIdentity_0_4_5 + -TestIdentity_0_4_4 + -TestIdentity_0_4_3 + -TestIdentity_0_4_2 + -TestIdentity_0_4_1 + -TestIdentity_0_4_0 + -TestIdentity_3_2_5 + -TestIdentity_3_2_4 + -TestIdentity_3_2_3 + -TestIdentity_3_2_2 + -TestIdentity_3_2_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 104 bytes per marking, with 21 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 5 literals
lola: write sara problem file to Peterson-COL-5-ReachabilityCardinality-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-TestAlone_1_4_5 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_5 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_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 104 bytes per marking, with 21 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 9 literals
lola: write sara problem file to Peterson-COL-5-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-10.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 11 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 > -3 AND (-EndTurn_0_4 + -EndTurn_0_0 + -EndTurn_0_1 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -EndTurn_5_1 + -EndTurn_5_0 + -EndTurn_4_4 + -EndTurn_4_3 + -EndTurn_4_2 + -EndTurn_4_1 + -EndTurn_4_0 + -EndTurn_3_4 + -EndTurn_3_3 + -EndTurn_3_2 + -EndTurn_3_1 + -EndTurn_3_0 + -EndTurn_2_4 + -EndTurn_2_3... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-11.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 12 will run for 735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((TestAlone_1_4_5 + -EndTurn_0_4 + TestAlone_4_2_5 + TestAlone_4_2_3 + TestAlone_4_2_2 + TestAlone_4_2_1 + TestAlone_4_2_0 + TestAlone_1_3_5 + TestAlone_1_3_4 + TestAlone_1_3_3 + TestAlone_1_3_2 + TestAlone_1_3_0 + TestAlone_4_1_5 + TestAlone_4_1_3 + TestAlone_4_1_2 + TestAlone_4_1_1 + TestAlone_4_1_0 + TestAlone_1_2_5 + TestAlone_1_2_4 + TestAlone_1_2_3 + TestAlone_1_2_2 + TestAlone_1_2_0 + T... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-12.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 13 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-TestAlone_1_4_5 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_5 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-13.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 14 will run for 1470 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 + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + -WantSection_5_F + -WantSection_5_T + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestTurn_3_4 + Te... (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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-5-ReachabilityCardinality-14.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 15 will run for 2940 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-TestAlone_1_4_5 + -TestAlone_4_2_5 + -TestAlone_4_2_3 + -TestAlone_4_2_2 + -TestAlone_4_2_1 + -TestAlone_4_2_0 + -TestAlone_1_3_5 + -TestAlone_1_3_4 + -TestAlone_1_3_3 + -TestAlone_1_3_2 + -TestAlone_1_3_0 + -TestAlone_4_1_5 + -TestAlone_4_1_3 + -TestAlone_4_1_2 + -TestAlone_4_1_1 + -TestAlone_4_1_0 + -TestAlone_1_2_5 + -TestAlone_1_2_4 + -TestAlone_1_2_3 + -TestAlone_1_2_2 + -TestAlone_1_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 104 bytes per marking, with 21 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-5-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: RESULT
lola: summary: no yes yes no no yes no yes no yes unknown no no yes no no
lola: ========================================

BK_STOP 1463693165207

--------------------
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-5"
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-5.tgz
mv Peterson-PT-5 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-5, 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-146369088100088"
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 ;