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)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 16 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DNAwalker-PT-02track12Block2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r067-smll-152649739800235
=====================================================================

--------------------
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 DNAwalker-PT-02track12Block2-CTLFireability-00
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-01
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-02
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-03
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-04
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-05
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-06
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-07
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-08
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-09
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-10
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-11
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-12
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-13
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-14
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1526662180583


BK_STOP 1526662226312

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DNAwalker-PT-02track12Block2 as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 200, 'Memory': 110.99, 'Tool': 'lola'}, {'Time': 252, 'Memory': 110.98, 'Tool': 'lola'}, {'Time': 2410, 'Memory': 164.11, 'Tool': 'gspn'}, {'Time': 2632, 'Memory': 292.25, 'Tool': 'itstools'}, {'Time': 2683, 'Memory': 232.89, 'Tool': 'itstools'}, {'Time': 4009, 'Memory': 205.51, 'Tool': 'gspn'}, {'Time': 6298, 'Memory': 7483.59, 'Tool': 'marcie'}, {'Time': 6375, 'Memory': 7483.13, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DNAwalker-PT-02track12Block2...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DNAwalker-PT-02track12Block2: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DNAwalker-PT-02track12Block2: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ DNAwalker-PT-02track12Block2 @ 3540 seconds
----- Start make result stderr -----
----- 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: 98/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 84 transitions, 14 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 57 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-02track12Block2-CTLFireability.task
lola: (E (((FIREABLE(t9_1) AND (FIREABLE(t5_2) OR FIREABLE(t1_9))) U A (F (FIREABLE(t5_9))))) OR (A (G (FIREABLE(t7_6))) AND E (G (A (G (FIREABLE(t1_2))))))) : (NOT(A (X (A (F (FIREABLE(t4_5)))))) OR FIREABLE(t11_5)) : (NOT(A (F (FIREABLE(t9_4)))) AND (E ((FIREABLE(tb5) U (FIREABLE(t3_6) OR FIREABLE(t10_9)))) OR E ((NOT FIREABLE(t10_5) U NOT FIREABLE(t6_3))))) : E (X ((A (G (NOT FIREABLE(t9_4))) OR E (X ((FIREABLE(t4_1) AND FIREABLE(t10_2))))))) : NOT(((FIREABLE(t7_3) AND ((FIREABLE(t7_4) AND FIREABLE(t10_2) AND FIREABLE(t3_9)) OR A (F (FIREABLE(t9_6))))) OR E (G (A (F (FIREABLE(t7_5))))))) : A (G (NOT((A (G (FIREABLE(t3_6))) AND NOT FIREABLE(t4_6))))) : (A (F (A (G ((FIREABLE(t5_9) AND FIREABLE(t7_4)))))) AND NOT(NOT(A (F (FIREABLE(t5_6)))))) : E (X (A (X (E (F (FIREABLE(t2_4))))))) : E (G ((NOT(A (F (FIREABLE(t2_9)))) OR NOT(E (F (FIREABLE(t6_4))))))) : E (F (E (F ((FIREABLE(t1_3) AND FIREABLE(t7_5) AND FIREABLE(t5_3) AND FIREABLE(t3_1)))))) : ((FIREABLE(t5_11) OR E ((NOT FIREABLE(t4_1) U (FIREABLE(t1_3) AND FIREABLE(t9_7))))) OR (A ((FIREABLE(t5_3) U (FIREABLE(t1_5) OR FIREABLE(t9_3)))) AND FIREABLE(t6_2))) : NOT((A (X (FIREABLE(t3_7))) OR (FIREABLE(t10_6) OR (A (F (FIREABLE(t7_9))) OR FIREABLE(t10_6))))) : E (G (E (G (E (X (FIREABLE(t3_7))))))) : NOT(A (F (E ((FIREABLE(t5_3) U FIREABLE(t10_6)))))) : E (X (NOT(A (F ((FIREABLE(t5_8) AND FIREABLE(t3_11))))))) : (E (F (NOT(A (F (FIREABLE(t10_12)))))) AND (NOT(A (X (NOT FIREABLE(t2_6)))) OR E (G ((NOT FIREABLE(t11_3) OR NOT FIREABLE(t4_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: (E (((FIREABLE(t9_1) AND (FIREABLE(t5_2) OR FIREABLE(t1_9))) U A (F (FIREABLE(t5_9))))) OR (A (G (FIREABLE(t7_6))) AND E (G (A (G (FIREABLE(t1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t9_1) AND (FIREABLE(t5_2) OR FIREABLE(t1_9))) U A (F (FIREABLE(t5_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(t9_1) AND (FIREABLE(t5_2) OR FIREABLE(t1_9))) U A(TRUE U FIREABLE(t5_9)))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t7_6)))
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 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (X (A (F (FIREABLE(t4_5)))))) OR FIREABLE(t11_5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (NOT FIREABLE(t4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U FIREABLE(t4_5))))
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (FIREABLE(t9_4)))) AND (E ((FIREABLE(tb5) U (FIREABLE(t3_6) OR FIREABLE(t10_9)))) OR E ((NOT FIREABLE(t10_5) U NOT FIREABLE(t6_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t9_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t9_4)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(tb5) U (FIREABLE(t3_6) OR FIREABLE(t10_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(tb5) U (FIREABLE(t3_6) OR FIREABLE(t10_9)))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 658 markings, 850 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G (NOT FIREABLE(t9_4))) OR E (X ((FIREABLE(t4_1) AND FIREABLE(t10_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (NOT FIREABLE(t9_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U FIREABLE(t9_4))))
lola: processed formula length: 33
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2694 markings, 9866 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(t7_3) AND ((FIREABLE(t7_4) AND FIREABLE(t10_2) AND FIREABLE(t3_9)) OR A (F (FIREABLE(t9_6))))) OR E (G (A (F (FIREABLE(t7_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t7_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t7_3)
lola: processed formula length: 18
lola: 13 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (NOT FIREABLE(t7_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U FIREABLE(t7_5))))
lola: processed formula length: 39
lola: 16 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT((A (G (FIREABLE(t3_6))) AND NOT FIREABLE(t4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U NOT FIREABLE(t3_6))) AND NOT FIREABLE(t4_6))))
lola: processed formula length: 73
lola: 9 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5459 markings, 27249 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((FIREABLE(t5_9) AND FIREABLE(t7_4)))))) AND NOT(NOT(A (F (FIREABLE(t5_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((FIREABLE(t5_9) AND FIREABLE(t7_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((FIREABLE(t5_9) AND FIREABLE(t7_4))))))
lola: processed formula: A (F (A (G ((FIREABLE(t5_9) AND FIREABLE(t7_4))))))
lola: processed formula length: 51
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 6 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (E (F (FIREABLE(t2_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(E(TRUE U FIREABLE(t2_4))))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3356 markings, 12058 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT(A (F (FIREABLE(t2_9)))) OR NOT(E (F (FIREABLE(t6_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U FIREABLE(t2_9)) AND E(TRUE U FIREABLE(t6_4)))))
lola: processed formula length: 70
lola: 14 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((FIREABLE(t1_3) AND FIREABLE(t7_5) AND FIREABLE(t5_3) AND FIREABLE(t3_1))))))
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 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 53 markings, 56 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t5_11) OR E ((NOT FIREABLE(t4_1) U (FIREABLE(t1_3) AND FIREABLE(t9_7))))) OR (A ((FIREABLE(t5_3) U (FIREABLE(t1_5) OR FIREABLE(t9_3)))) AND FIREABLE(t6_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t5_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t5_11)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t4_1) U (FIREABLE(t1_3) AND FIREABLE(t9_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(t4_1) U (FIREABLE(t1_3) AND FIREABLE(t9_7)))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5459 markings, 21642 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t5_3) U (FIREABLE(t1_5) OR FIREABLE(t9_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(t5_3) U (FIREABLE(t1_5) OR FIREABLE(t9_3))))
lola: processed formula: A ((FIREABLE(t5_3) U (FIREABLE(t1_5) OR FIREABLE(t9_3))))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (FIREABLE(t3_7))) OR (FIREABLE(t10_6) OR (A (F (FIREABLE(t7_9))) OR FIREABLE(t10_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(t3_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT FIREABLE(t3_7))
lola: processed formula length: 22
lola: 12 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t10_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t10_6)
lola: processed formula length: 19
lola: 11 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t7_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t7_9)))
lola: processed formula length: 29
lola: 13 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t10_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t10_6)
lola: processed formula length: 19
lola: 11 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (E (X (FIREABLE(t3_7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U NOT(EX(FIREABLE(t3_7))))))
lola: processed formula length: 48
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2130 markings, 5213 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E ((FIREABLE(t5_3) U FIREABLE(t10_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(FIREABLE(t5_3) U FIREABLE(t10_6))))
lola: processed formula length: 50
lola: 11 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F ((FIREABLE(t5_8) AND FIREABLE(t3_11)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (FIREABLE(t5_8) AND FIREABLE(t3_11)))))
lola: processed formula length: 55
lola: 6 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT(A (F (FIREABLE(t10_12)))))) AND (NOT(A (X (NOT FIREABLE(t2_6)))) OR E (G ((NOT FIREABLE(t11_3) OR NOT FIREABLE(t4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (NOT FIREABLE(t10_12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U FIREABLE(t10_12))))
lola: processed formula length: 41
lola: 9 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t11_3) OR NOT FIREABLE(t4_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t11_3) AND FIREABLE(t4_1))))
lola: processed formula length: 51
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file DNAwalker-PT-02track12Block2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no no yes no no yes no yes yes yes
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="DNAwalker-PT-02track12Block2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
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/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is DNAwalker-PT-02track12Block2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r067-smll-152649739800235"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;