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 360K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 185K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is TriangularGrid-PT-5046, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-152708746600409
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527192936277


BK_STOP 1527193649894

--------------------
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 TriangularGrid-PT-5046 as instance name.
Using TriangularGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 590108, 'Memory': 7723.26, 'Tool': 'lola'}, {'Time': 590250, 'Memory': 7726.37, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola TriangularGrid-PT-5046...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-5046: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ TriangularGrid-PT-5046 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5046-CTLCardinality.task
lola: E (G (((po3_5_3 <= pol1_3_5) OR ((1 <= pb2_1_1) AND (pi1_2_3 <= pi3_1_1)) OR (3 <= pi1_5_5)))) : A (F (E (((1 <= pil1_3_5) U (pb3_3_5 <= po1_4_3))))) : A ((((2 <= pb1_2_3) OR (pb3_4_6 <= pol2_4_5) OR ((2 <= pb2_5_3) AND (3 <= po2_5_9))) U (((pol3_3_1 <= po1_2_3) AND (2 <= pol3_2_1)) OR (1 <= pi3_5_3)))) : (A ((((pb2_3_5 <= pb3_4_1) OR (2 <= pb2_4_4)) U ((3 <= po2_2_3) OR (2 <= pi3_5_3)))) OR E (G ((((pbl_3_3 <= pb3_3_4) AND (2 <= pil2_4_3)) OR (pb2_4_7 <= 2))))) : A (G (E (G ((pil1_3_3 + 1 <= pb2_5_7))))) : A ((((pbl_2_3 <= pil1_3_3) OR (po3_5_1 + 1 <= pil2_5_7)) U A (X ((3 <= po1_3_5))))) : (((((po3_3_3 <= pb1_5_1) OR (2 <= pi2_4_7) OR (pil2_5_7 <= pol3_5_9) OR (pol2_2_3 <= pb2_5_4)) AND E (F ((2 <= pol3_5_7)))) AND E (((1 <= pil3_1_1) U (pb1_3_5 <= pol1_5_5)))) AND (A (((po1_5_5 <= pb3_5_8) U (1 <= pil3_2_1))) OR ((pb1_5_3 <= pb2_5_3) AND E (G ((3 <= pol2_4_7)))))) : (A (F (E (G ((pbl_4_7 <= pol1_5_5))))) AND ((((po3_5_3 <= pb3_5_3) AND (1 <= pil1_3_5)) OR (pbl_2_3 <= pb1_3_4) OR (2 <= pi1_3_1)) OR A (((1 <= pb1_3_2) U (pb1_2_3 <= pol3_1_1))))) : (NOT(E (G (((pb3_3_1 <= pol2_3_1) OR (pb2_4_2 <= pbl_4_7))))) OR A (G ((3 <= po3_2_1)))) : (A (F (E (G ((pbl_5_1 <= pol3_5_7))))) AND E (X (((pb1_4_5 + 1 <= pi3_3_1) OR (pol3_2_1 <= 1))))) : E (G ((A (F ((pi2_5_7 <= pi2_2_1))) OR ((pb3_4_2 + 1 <= pol2_5_5) OR (pi3_5_7 + 1 <= pi1_5_5))))) : E (X (NOT(E (F ((2 <= pol3_5_3)))))) : E (F ((((pb3_1_1 + 1 <= pol1_4_1) OR (2 <= pi1_5_7)) AND (3 <= pol2_3_5)))) : A (X (NOT(A (G ((pol1_3_1 <= pil2_5_3)))))) : (A (F (E (X ((2 <= po2_5_5))))) AND E (X (E (F ((1 <= pbl_3_3)))))) : NOT(NOT(A (((2 <= pbl_4_3) U (2 <= pol1_4_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 (G (((po3_5_3 <= pol1_3_5) OR ((1 <= pb2_1_1) AND (pi1_2_3 <= pi3_1_1)) OR (3 <= pi1_5_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pol1_3_5 + 1 <= po3_5_3) AND ((pb2_1_1 <= 0) OR (pi3_1_1 + 1 <= pi1_2_3)) AND (pi1_5_5 <= 2))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 2304 markings, 2304 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= pil1_3_5) U (pb3_3_5 <= po1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((1 <= pil1_3_5) U (pb3_3_5 <= po1_4_3)))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 331 markings, 331 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= pb1_2_3) OR (pb3_4_6 <= pol2_4_5) OR ((2 <= pb2_5_3) AND (3 <= po2_5_9))) U (((pol3_3_1 <= po1_2_3) AND (2 <= pol3_2_1)) OR (1 <= pi3_5_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= pb1_2_3) OR (pb3_4_6 <= pol2_4_5) OR ((2 <= pb2_5_3) AND (3 <= po2_5_9))) U (((pol3_3_1 <= po1_2_3) AND (2 <= pol3_2_1)) OR (1 <= pi3_5_3))))
lola: processed formula: A ((((2 <= pb1_2_3) OR (pb3_4_6 <= pol2_4_5) OR ((2 <= pb2_5_3) AND (3 <= po2_5_9))) U (((pol3_3_1 <= po1_2_3) AND (2 <= pol3_2_1)) OR (1 <= pi3_5_3))))
lola: processed formula length: 155
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 2090 markings, 2090 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((pb2_3_5 <= pb3_4_1) OR (2 <= pb2_4_4)) U ((3 <= po2_2_3) OR (2 <= pi3_5_3)))) OR E (G ((((pbl_3_3 <= pb3_3_4) AND (2 <= pil2_4_3)) OR (pb2_4_7 <= 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: A ((((pb2_3_5 <= pb3_4_1) OR (2 <= pb2_4_4)) U ((3 <= po2_2_3) OR (2 <= pi3_5_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((pb2_3_5 <= pb3_4_1) OR (2 <= pb2_4_4)) U ((3 <= po2_2_3) OR (2 <= pi3_5_3))))
lola: processed formula: A ((((pb2_3_5 <= pb3_4_1) OR (2 <= pb2_4_4)) U ((3 <= po2_2_3) OR (2 <= pi3_5_3))))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 2056 markings, 2056 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((pbl_3_3 <= pb3_3_4) AND (2 <= pil2_4_3)) OR (pb2_4_7 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((pb3_3_4 + 1 <= pbl_3_3) OR (pil2_4_3 <= 1)) AND (3 <= pb2_4_7))))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((pil1_3_3 + 1 <= pb2_5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (pb2_5_7 <= pil1_3_3))))
lola: processed formula length: 46
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 1363 markings, 3248 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((pbl_2_3 <= pil1_3_3) OR (po3_5_1 + 1 <= pil2_5_7)) U A (X ((3 <= po1_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((pbl_2_3 <= pil1_3_3) OR (po3_5_1 + 1 <= pil2_5_7)) U AX((3 <= po1_3_5)))
lola: processed formula length: 77
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((po3_3_3 <= pb1_5_1) OR (2 <= pi2_4_7) OR (pil2_5_7 <= pol3_5_9) OR (pol2_2_3 <= pb2_5_4)) AND E (F ((2 <= pol3_5_7)))) AND E (((1 <= pil3_1_1) U (pb1_3_5 <= pol1_5_5)))) AND (A (((po1_5_5 <= pb3_5_8) U (1 <= pil3_2_1))) OR ((pb1_5_3 <= pb2_5_3) AND E (G ((3 <= pol2_4_7))))))
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: ((po3_3_3 <= pb1_5_1) OR (2 <= pi2_4_7) OR (pil2_5_7 <= pol3_5_9) OR (pol2_2_3 <= pb2_5_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((po3_3_3 <= pb1_5_1) OR (2 <= pi2_4_7) OR (pil2_5_7 <= pol3_5_9) OR (pol2_2_3 <= pb2_5_4))
lola: processed formula length: 94
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: processed formula with 4 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pol3_5_7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-5046-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
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: (A (F (E (G ((pbl_4_7 <= pol1_5_5))))) AND ((((po3_5_3 <= pb3_5_3) AND (1 <= pil1_3_5)) OR (pbl_2_3 <= pb1_3_4) OR (2 <= pi1_3_1)) OR A (((1 <= pb1_3_2) U (pb1_2_3 <= pol3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((pbl_4_7 <= pol1_5_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pol1_5_5 + 1 <= pbl_4_7))))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 3587 markings, 5359 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((pb3_3_1 <= pol2_3_1) OR (pb2_4_2 <= pbl_4_7))))) OR A (G ((3 <= po3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pol2_3_1 + 1 <= pb3_3_1) AND (pbl_4_7 + 1 <= pb2_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pol2_3_1 + 1 <= pb3_3_1) AND (pbl_4_7 + 1 <= pb2_4_2))))
lola: processed formula: A (F (((pol2_3_1 + 1 <= pb3_3_1) AND (pbl_4_7 + 1 <= pb2_4_2))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 bytes per marking, with 31 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: 2884 markings, 2884 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= po3_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-9.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((pbl_5_1 <= pol3_5_7))))) AND E (X (((pb1_4_5 + 1 <= pi3_3_1) OR (pol3_2_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((pbl_5_1 <= pol3_5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pol3_5_7 + 1 <= pbl_5_1))))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 2545 markings, 4095 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((pi2_5_7 <= pi2_2_1))) OR ((pb3_4_2 + 1 <= pol2_5_5) OR (pi3_5_7 + 1 <= pi1_5_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (pi2_5_7 <= pi2_2_1))) AND ((pol2_5_5 <= pb3_4_2) AND (pi1_5_5 <= pi3_5_7)))))
lola: processed formula length: 105
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 14026 markings, 16441 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (F ((2 <= pol3_5_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (2 <= pol3_5_3))))
lola: processed formula length: 34
lola: 6 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 502503 markings, 2838279 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1101626 markings, 5266162 edges, 119825 markings/sec, 5 secs
lola: 1210702 markings, 7537588 edges, 21815 markings/sec, 10 secs
lola: 1563932 markings, 10267725 edges, 70646 markings/sec, 15 secs
lola: 2142838 markings, 12769124 edges, 115781 markings/sec, 20 secs
lola: 2684981 markings, 14867140 edges, 108429 markings/sec, 25 secs
lola: 3142706 markings, 16848092 edges, 91545 markings/sec, 30 secs
lola: 3505422 markings, 18817372 edges, 72543 markings/sec, 35 secs
lola: 3705327 markings, 20835193 edges, 39981 markings/sec, 40 secs
lola: 3708701 markings, 22734939 edges, 675 markings/sec, 45 secs
lola: 3710416 markings, 24659153 edges, 343 markings/sec, 50 secs
lola: 3711210 markings, 26657635 edges, 159 markings/sec, 55 secs
lola: 3936633 markings, 29131687 edges, 45085 markings/sec, 60 secs
lola: 4367241 markings, 31748461 edges, 86122 markings/sec, 65 secs
lola: 4689929 markings, 34038228 edges, 64538 markings/sec, 70 secs
lola: 5144106 markings, 36368561 edges, 90835 markings/sec, 75 secs
lola: 5632207 markings, 38553741 edges, 97620 markings/sec, 80 secs
lola: 6108074 markings, 40729348 edges, 95173 markings/sec, 85 secs
lola: 6619602 markings, 42661667 edges, 102306 markings/sec, 90 secs
lola: 7089638 markings, 44532241 edges, 94007 markings/sec, 95 secs
lola: 7537442 markings, 46413681 edges, 89561 markings/sec, 100 secs
lola: 7956735 markings, 48195209 edges, 83859 markings/sec, 105 secs
lola: 8351830 markings, 49953843 edges, 79019 markings/sec, 110 secs
lola: 8723954 markings, 51724409 edges, 74425 markings/sec, 115 secs
lola: 9064598 markings, 53480055 edges, 68129 markings/sec, 120 secs
lola: 9380224 markings, 55227074 edges, 63125 markings/sec, 125 secs
lola: 9673222 markings, 56980200 edges, 58600 markings/sec, 130 secs
lola: 9947533 markings, 58738181 edges, 54862 markings/sec, 135 secs
lola: 10223843 markings, 60541743 edges, 55262 markings/sec, 140 secs
lola: 10238889 markings, 62273132 edges, 3009 markings/sec, 145 secs
lola: 10242009 markings, 63936996 edges, 624 markings/sec, 150 secs
lola: 10244351 markings, 65601288 edges, 468 markings/sec, 155 secs
lola: 10246505 markings, 67265491 edges, 431 markings/sec, 160 secs
lola: 10248050 markings, 68940596 edges, 309 markings/sec, 165 secs
lola: 10249250 markings, 70627712 edges, 240 markings/sec, 170 secs
lola: 10250112 markings, 72328427 edges, 172 markings/sec, 175 secs
lola: 10250890 markings, 74046833 edges, 156 markings/sec, 180 secs
lola: 10251493 markings, 75792268 edges, 121 markings/sec, 185 secs
lola: 10251998 markings, 77566915 edges, 101 markings/sec, 190 secs
lola: 10252362 markings, 79363886 edges, 73 markings/sec, 195 secs
lola: 10252656 markings, 81226835 edges, 59 markings/sec, 200 secs
lola: 10350102 markings, 83323058 edges, 19489 markings/sec, 205 secs
lola: 10783228 markings, 86013755 edges, 86625 markings/sec, 210 secs
lola: 11170732 markings, 88401702 edges, 77501 markings/sec, 215 secs
lola: 11432106 markings, 90567279 edges, 52275 markings/sec, 220 secs
lola: 11759113 markings, 92637009 edges, 65401 markings/sec, 225 secs
lola: 12245572 markings, 94674023 edges, 97292 markings/sec, 230 secs
lola: 12373672 markings, 96741880 edges, 25620 markings/sec, 235 secs
lola: 12819596 markings, 98865695 edges, 89185 markings/sec, 240 secs
lola: 13069175 markings, 100884723 edges, 49916 markings/sec, 245 secs
lola: 13395685 markings, 103090787 edges, 65302 markings/sec, 250 secs
lola: 13769602 markings, 105269326 edges, 74783 markings/sec, 255 secs
lola: 14098996 markings, 107301241 edges, 65879 markings/sec, 260 secs
lola: 14512659 markings, 109365573 edges, 82733 markings/sec, 265 secs
lola: 15013756 markings, 111177891 edges, 100219 markings/sec, 270 secs
lola: 15394879 markings, 113222161 edges, 76225 markings/sec, 275 secs
lola: 15852398 markings, 114997932 edges, 91504 markings/sec, 280 secs
lola: 16197618 markings, 116839596 edges, 69044 markings/sec, 285 secs
lola: 16642182 markings, 118541829 edges, 88913 markings/sec, 290 secs
lola: 17059345 markings, 120405306 edges, 83433 markings/sec, 295 secs
lola: 17469669 markings, 122131906 edges, 82065 markings/sec, 300 secs
lola: 17884130 markings, 123785858 edges, 82892 markings/sec, 305 secs
lola: 18278660 markings, 125415703 edges, 78906 markings/sec, 310 secs
lola: 18666979 markings, 127034451 edges, 77664 markings/sec, 315 secs
lola: 19048876 markings, 128643698 edges, 76379 markings/sec, 320 secs
lola: 19412416 markings, 130324489 edges, 72708 markings/sec, 325 secs
lola: 19779536 markings, 131914497 edges, 73424 markings/sec, 330 secs
lola: 20137354 markings, 133496117 edges, 71564 markings/sec, 335 secs
lola: 20491647 markings, 135069390 edges, 70859 markings/sec, 340 secs
lola: 20837597 markings, 136641643 edges, 69190 markings/sec, 345 secs
lola: 21173190 markings, 138201939 edges, 67119 markings/sec, 350 secs
lola: 21496088 markings, 139851544 edges, 64580 markings/sec, 355 secs
lola: 21817323 markings, 141403730 edges, 64247 markings/sec, 360 secs
lola: 22132598 markings, 142952272 edges, 63055 markings/sec, 365 secs
----- Kill lola and sara stderr -----
lola: 22439094 markings, 144498167 edges, 61299 markings/sec, 370 secs
lola: 22735856 markings, 146040376 edges, 59352 markings/sec, 375 secs
lola: 23025702 markings, 147587776 edges, 57969 markings/sec, 380 secs
lola: 23308804 markings, 149129505 edges, 56620 markings/sec, 385 secs
lola: 23585613 markings, 150670237 edges, 55362 markings/sec, 390 secs
lola: 23852502 markings, 152210766 edges, 53378 markings/sec, 395 secs
lola: 24107818 markings, 153754103 edges, 51063 markings/sec, 400 secs
lola: 24361466 markings, 155292418 edges, 50730 markings/sec, 405 secs
lola: 24606931 markings, 156846871 edges, 49093 markings/sec, 410 secs
lola: 24845987 markings, 158391280 edges, 47811 markings/sec, 415 secs
lola: 25079442 markings, 159934288 edges, 46691 markings/sec, 420 secs
lola: 25306865 markings, 161485865 edges, 45485 markings/sec, 425 secs
lola: 25542633 markings, 163056838 edges, 47154 markings/sec, 430 secs
lola: 25775285 markings, 164669599 edges, 46530 markings/sec, 435 secs
lola: 25824953 markings, 166279819 edges, 9934 markings/sec, 440 secs
lola: 25828994 markings, 167768069 edges, 808 markings/sec, 445 secs
lola: 25832175 markings, 169232300 edges, 636 markings/sec, 450 secs
lola: 25834490 markings, 170692355 edges, 463 markings/sec, 455 secs
lola: 25836278 markings, 172150785 edges, 358 markings/sec, 460 secs
lola: 25838077 markings, 173614883 edges, 360 markings/sec, 465 secs
lola: 25839557 markings, 175081173 edges, 296 markings/sec, 470 secs
lola: 25840962 markings, 176548702 edges, 281 markings/sec, 475 secs
lola: 25842585 markings, 178017421 edges, 325 markings/sec, 480 secs
lola: 25843980 markings, 179488371 edges, 279 markings/sec, 485 secs
lola: 25845306 markings, 180961490 edges, 265 markings/sec, 490 secs
lola: 25846503 markings, 182439777 edges, 239 markings/sec, 495 secs
lola: 25847583 markings, 183918601 edges, 216 markings/sec, 500 secs
lola: 25848643 markings, 185403953 edges, 212 markings/sec, 505 secs
lola: 25849553 markings, 186894623 edges, 182 markings/sec, 510 secs
lola: 25850375 markings, 188385589 edges, 164 markings/sec, 515 secs
lola: 25851178 markings, 189877906 edges, 161 markings/sec, 520 secs
lola: 25851934 markings, 191379107 edges, 151 markings/sec, 525 secs
lola: 25852572 markings, 192884163 edges, 128 markings/sec, 530 secs
lola: 25853230 markings, 194391804 edges, 132 markings/sec, 535 secs
lola: 25853784 markings, 195906168 edges, 111 markings/sec, 540 secs
lola: 25854318 markings, 197424662 edges, 107 markings/sec, 545 secs
lola: 25854867 markings, 198948356 edges, 110 markings/sec, 550 secs
lola: 25855347 markings, 200482960 edges, 96 markings/sec, 555 secs
lola: 25855794 markings, 202023298 edges, 89 markings/sec, 560 secs
lola: 25856190 markings, 203571488 edges, 79 markings/sec, 565 secs
lola: 25856584 markings, 205124993 edges, 79 markings/sec, 570 secs
lola: 25856899 markings, 206690382 edges, 63 markings/sec, 575 secs
lola: 25857255 markings, 208261616 edges, 71 markings/sec, 580 secs
lola: 25857558 markings, 209840299 edges, 61 markings/sec, 585 secs
lola: 25857845 markings, 211434914 edges, 57 markings/sec, 590 secs
lola: 25858060 markings, 213047515 edges, 43 markings/sec, 595 secs
lola: 25858281 markings, 214673421 edges, 44 markings/sec, 600 secs
lola: 25858491 markings, 216312804 edges, 42 markings/sec, 605 secs
lola: 25858651 markings, 217976127 edges, 32 markings/sec, 610 secs
lola: 25858780 markings, 219676795 edges, 26 markings/sec, 615 secs
lola: 25858896 markings, 221493760 edges, 23 markings/sec, 620 secs
lola: 26290275 markings, 223963388 edges, 86276 markings/sec, 625 secs
lola: 26699751 markings, 226416970 edges, 81895 markings/sec, 630 secs
lola: 26966140 markings, 228568075 edges, 53278 markings/sec, 635 secs
lola: 27420053 markings, 230799777 edges, 90783 markings/sec, 640 secs
lola: 27763027 markings, 232836676 edges, 68595 markings/sec, 645 secs
lola: 27925154 markings, 234866591 edges, 32425 markings/sec, 650 secs
lola: 28306059 markings, 236767010 edges, 76181 markings/sec, 655 secs
lola: 28381904 markings, 238648570 edges, 15169 markings/sec, 660 secs
lola: 28783610 markings, 240827540 edges, 80341 markings/sec, 665 secs
lola: 29127562 markings, 242773035 edges, 68790 markings/sec, 670 secs
lola: 29324801 markings, 244595638 edges, 39448 markings/sec, 675 secs
lola: 29483331 markings, 246331506 edges, 31706 markings/sec, 680 secs
lola: 29939630 markings, 248357993 edges, 91260 markings/sec, 685 secs
lola: 30362961 markings, 250097423 edges, 84666 markings/sec, 690 secs
lola: 30526923 markings, 251810999 edges, 32792 markings/sec, 695 secs
lola: 30529472 markings, 253481164 edges, 510 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA TriangularGrid-PT-5046-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="TriangularGrid-PT-5046"
export BK_EXAMINATION="CTLCardinality"
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/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 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 TriangularGrid-PT-5046, 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 r175-smll-152708746600409"
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 ;