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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463692206835

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Peterson-PT-5
FORMULA Peterson-COL-5-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-12 CANNOT_COMPUTE
FORMULA Peterson-COL-5-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-CTLCardinality-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: 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-CTLCardinality.task
lola: read: A(!(WantSection_3_F + WantSection_4_F + WantSection_1_F + WantSection_2_F + WantSection_5_F + WantSection_2_T + WantSection_1_T + WantSection_0_T + WantSection_0_F + WantSection_5_T + WantSection_4_T + WantSection_3_T <= IsEndLoop_0_0_0 + IsEndLoop_1_0_0 + IsEndLoop_2_0_0 + IsEndLoop_3_0_0 + IsEndLoop_4_0_0 + IsEndLoop_5_0_0 + IsEndLoop_0_1_0 + IsEndLoop_1_1_0 + IsEndLoop_2_1_0 + IsEndLoop_3_1_0 +... (shortened)
lola: formula length: 106659
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(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 + -IsEndLoop_2_4_5 + WantSection_5_F + WantSection_5_T + -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 + -IsEndLoop_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(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 + -IsEndLoop_2_4_5 + WantSection_5_F + WantSection_5_T + -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 + -IsEndLoop_... (shortened)
lola: processed formula length: 7076
lola: 740192 rewrites
lola: formula mentions 192 of 834 places; total mentions: 372
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-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 + -Tes... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -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 + -TestA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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 + -BeginLoop_1_3_0 + -BeginLoop_4_1_5 + -BeginLoop_4_1_4 + -BeginLoop_4_1_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (-Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(-Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 + -Idle_0 > -3))
lola: processed formula length: 76
lola: 740192 rewrites
lola: formula mentions 6 of 834 places; total mentions: 6
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG ((-Turn_2_5 + -Turn_3_5 + -Turn_4_5 + -Turn_0_5 + -Turn_1_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 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_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 + B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !((-Turn_2_5 + -Turn_3_5 + -Turn_4_5 + -Turn_0_5 + -Turn_1_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 + -Turn_1_4 + -Turn_1_3 + -Turn_1_2 + -Turn_1_1 + -Turn_1_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... (shortened)
lola: processed formula length: 7920
lola: 740192 rewrites
lola: formula mentions 390 of 834 places; total mentions: 420
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (A(-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 + -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 + -IsEndLoop_5_1_4 + -IsEndLoop_5_1_3 + -IsEndLoop_5_1_2 + -IsEndLoop_5_1_1 + -IsEndLoop_5_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(-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 + -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 + -IsEndLoop_5_1_4 + -IsEndLoop_5_1_3 + -IsEndLoop_5_1_2 + -IsEndLoop_5_1_1 + -IsEn... (shortened)
lola: processed formula length: 4107
lola: 740192 rewrites
lola: formula mentions 216 of 834 places; total mentions: 216
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (-EndTurn_0_4 + 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 + AskForSection_1_4 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(-EndTurn_0_4 + 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 + AskForSection_1_4 + AskForSection_1_3 + AskForSection_1_2 + AskForSect... (shortened)
lola: processed formula length: 1770
lola: 740193 rewrites
lola: formula mentions 66 of 834 places; total mentions: 96
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 346 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-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-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 + -BeginLoop_1_3_0 + -BeginLoop_4_1_5 + -BeginLoop_4_1_4 + -BeginLoop_4_1_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-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 + -BeginLoop_1_3_0 + -BeginLoop_4_1_5 + -BeginLoop_4_1_4 + -BeginL... (shortened)
lola: processed formula length: 3480
lola: 740191 rewrites
lola: formula mentions 186 of 834 places; total mentions: 186
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U -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_... (shortened)
lola: processed formula length: 3977
lola: 740192 rewrites
lola: formula mentions 180 of 834 places; total mentions: 180
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-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 AND EG (((TestAlone_1_4_5 + TestAlo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -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 initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((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_0 + TestAlone_4_0_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((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_0 + TestAlo... (shortened)
lola: processed formula length: 7656
lola: 740191 rewrites
lola: formula mentions 360 of 834 places; total mentions: 390
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-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 CTL
lola: processed formula: A(TRUE U (-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 + -Test... (shortened)
lola: processed formula length: 4593
lola: 740191 rewrites
lola: formula mentions 228 of 834 places; total mentions: 228
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-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 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_4 + -EndTu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -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 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_4 + -... (shortened)
lola: processed formula length: 463
lola: 740191 rewrites
lola: formula mentions 30 of 834 places; total mentions: 30
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (((-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 + -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 + -IsEndLoop_5_1_4 + -IsEndLoop_5_1_3 + -IsEndLoop_5_1_2 + -IsEndLoop_5_1_1 + -IsEndLoop_5_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-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 + -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 + -IsEndLoop_5_1_4 + -IsEndLoop_5_1_3 + -IsEndLoop_5_1_2 + -IsEndLoop_5_1_1 + -IsEndLoop_5_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AF (-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 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_4 + -E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U -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 + -EndTurn_2_2 + -EndTurn_2_1 + -EndTurn_2_0 + -EndTurn_1_4 ... (shortened)
lola: processed formula length: 467
lola: 740192 rewrites
lola: formula mentions 30 of 834 places; total mentions: 30
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-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 + -BeginLoop_1_3_0 + -BeginLoop_4_1_5 + -BeginLoop_4_1_4 + -BeginLoop_4_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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 + -BeginLoop_1_3_0 + -BeginLoop_4_1_5 + -BeginLoop_4_1_4 + -BeginLoop_4_1_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2415 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 + TestIdentity_3_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (IsEndLoop_2_4_5 + IsEndLoop_5_2_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 + 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 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + IsEn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (IsEndLoop_2_4_5 + IsEndLoop_5_2_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 + 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 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0 + IsEndL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(IsEndLoop_2_4_5 + IsEndLoop_5_2_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 + 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 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_4_2_3 + -BeginLoop_4_2_2 + -BeginLoop_4_2_1 + -BeginLoop_4_2_0... (shortened)
lola: processed formula length: 6678
lola: 740191 rewrites
lola: formula mentions 360 of 834 places; total mentions: 360
lola: closed formula file Peterson-COL-5-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: yes no no yes yes no yes yes yes yes no no unknown no no unknown

BK_STOP 1463693384287

--------------------
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="CTLCardinality"
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 CTLCardinality"
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-146369088100084"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;