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-3253
Executing tool lola
Input is S_TriangularGrid-PT-4022, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464300347
=====================================================================

--------------------
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 TriangularGrid-PT-4022-LTLCardinality-0
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-1
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-10
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-11
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-12
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-13
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-14
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-15
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-2
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-3
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-4
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-5
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-6
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-7
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-8
FORMULA_NAME TriangularGrid-PT-4022-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496574771050


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_TriangularGrid-PT-4022: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_TriangularGrid-PT-4022: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_TriangularGrid-PT-4022 @ 3540 seconds
----- Start make result stdout -----
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: 340/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 184 places, 156 transitions, 107 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-4022-LTLCardinality.task
lola: A ((1 <= pbl_3_3)) : A (F (F (X (F ((2 <= pb3_3_1)))))) : A ((1 <= po3_2_3)) : A ((2 <= pi3_3_5)) : A (G (((1 <= po1_2_1) U (pb2_3_4 <= pil1_2_1)))) : A (F (G ((po1_2_3 <= pi2_2_1)))) : A ((2 <= pil3_2_1)) : A (G (G (F (G ((pb1_3_1 <= pb3_3_4)))))) : A ((pol2_3_3 <= pol3_2_3)) : A (F ((X ((pil1_3_1 <= pol1_4_1)) U G ((pbl_1_1 <= pb3_2_2))))) : A ((3 <= pbl_2_1)) : A ((F (X ((pb1_3_3 <= pil2_4_1))) U X (G ((1 <= pil3_4_7))))) : A ((X (F ((1 <= pol1_4_1))) U F (F ((pil1_2_1 <= pol3_3_5))))) : A (G (G ((2 <= pb1_1_1)))) : A ((2 <= pol1_2_3)) : A (X ((pi3_4_5 <= pil3_1_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= pbl_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pbl_3_3)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((2 <= pb3_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= pb3_3_1)))))
lola: processed formula: A (F (X (F ((2 <= pb3_3_1)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= po3_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= po3_2_3)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pi3_3_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pi3_3_5)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= po1_2_1) U (pb2_3_4 <= pil1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((1 <= po1_2_1) U (pb2_3_4 <= pil1_2_1))))
lola: processed formula: A (G (((1 <= po1_2_1) U (pb2_3_4 <= pil1_2_1))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((po1_2_3 <= pi2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((po1_2_3 <= pi2_2_1))))
lola: processed formula: A (F (G ((po1_2_3 <= pi2_2_1))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 827849 markings, 1434024 edges, 165570 markings/sec, 0 secs
lola: 1645876 markings, 2818669 edges, 163605 markings/sec, 5 secs
lola: 2460569 markings, 4242225 edges, 162939 markings/sec, 10 secs
lola: 3228495 markings, 5685230 edges, 153585 markings/sec, 15 secs
lola: 3979990 markings, 7011876 edges, 150299 markings/sec, 20 secs
lola: 4706766 markings, 8340570 edges, 145355 markings/sec, 25 secs
lola: 5465443 markings, 9694623 edges, 151735 markings/sec, 30 secs
lola: 6213031 markings, 11059526 edges, 149518 markings/sec, 35 secs
lola: 7013272 markings, 12461412 edges, 160048 markings/sec, 40 secs
lola: 7769814 markings, 13783909 edges, 151308 markings/sec, 45 secs
lola: 8569811 markings, 15184919 edges, 159999 markings/sec, 50 secs
lola: 9375120 markings, 16592750 edges, 161062 markings/sec, 55 secs
lola: 10160301 markings, 17969067 edges, 157036 markings/sec, 60 secs
lola: 10908319 markings, 19284577 edges, 149604 markings/sec, 65 secs
lola: 11622564 markings, 20534980 edges, 142849 markings/sec, 70 secs
lola: 12353976 markings, 21871744 edges, 146282 markings/sec, 75 secs
lola: 13087783 markings, 23258188 edges, 146761 markings/sec, 80 secs
lola: 13801362 markings, 24608150 edges, 142716 markings/sec, 85 secs
lola: 14497188 markings, 25920873 edges, 139165 markings/sec, 90 secs
lola: 15170696 markings, 27178732 edges, 134702 markings/sec, 95 secs
lola: 15898737 markings, 28435532 edges, 145608 markings/sec, 100 secs
lola: 16559509 markings, 29590284 edges, 132154 markings/sec, 105 secs
lola: 17266922 markings, 30827604 edges, 141483 markings/sec, 110 secs
lola: 17906571 markings, 31945609 edges, 127930 markings/sec, 115 secs
lola: 18535330 markings, 33049459 edges, 125752 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pil3_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pil3_2_1)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((pb1_3_1 <= pb3_3_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pb1_3_1 <= pb3_3_4))))
lola: processed formula: A (F (G ((pb1_3_1 <= pb3_3_4))))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol2_3_3 <= pol3_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol2_3_3 <= pol3_2_3)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((pil1_3_1 <= pol1_4_1)) U G ((pbl_1_1 <= pb3_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((pil1_3_1 <= pol1_4_1)) U G ((pbl_1_1 <= pb3_2_2)))))
lola: processed formula: A (F ((X ((pil1_3_1 <= pol1_4_1)) U G ((pbl_1_1 <= pb3_2_2)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= pbl_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pbl_2_1)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((pb1_3_3 <= pil2_4_1))) U X (G ((1 <= pil3_4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((pb1_3_3 <= pil2_4_1))) U X (G ((1 <= pil3_4_7)))))
lola: processed formula: A ((F (X ((pb1_3_3 <= pil2_4_1))) U X (G ((1 <= pil3_4_7)))))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= pol1_4_1))) U F (F ((pil1_2_1 <= pol3_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= pol1_4_1))) U F ((pil1_2_1 <= pol3_3_5))))
lola: processed formula: A ((X (F ((1 <= pol1_4_1))) U F ((pil1_2_1 <= pol3_3_5))))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1138 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((2 <= pb1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((2 <= pb1_1_1))))
lola: processed formula: A (G (G ((2 <= pb1_1_1))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pol1_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pol1_2_3)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pi3_4_5 <= pil3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((pi3_4_5 <= pil3_1_1)))
lola: processed formula: A (X ((pi3_4_5 <= pil3_1_1)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: yes no no no no no no no yes no no no yes no no yes
lola: ========================================
FORMULA TriangularGrid-PT-4022-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496574897271

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_TriangularGrid-PT-4022"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/S_TriangularGrid-PT-4022.tgz
mv S_TriangularGrid-PT-4022 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_TriangularGrid-PT-4022, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-ebro-149443464300347"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;