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-full
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 r174-smll-152708745200409
=====================================================================

--------------------
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 1527191562367


BK_STOP 1527192275876

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TriangularGrid-PT-5046...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
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: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-9.sara
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: lola: state equation: calling and running sara
========================================
========================================
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: sara: try reading problem file TriangularGrid-PT-5046-CTLCardinality-9.sara.
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).
sara: place or transition ordering is non-deterministic

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: 450739 markings, 2644051 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1030550 markings, 4898284 edges, 115962 markings/sec, 5 secs
lola: 1209986 markings, 6833280 edges, 35887 markings/sec, 10 secs
lola: 1368066 markings, 9182025 edges, 31616 markings/sec, 15 secs
lola: 1879750 markings, 11815701 edges, 102337 markings/sec, 20 secs
lola: 2454482 markings, 13950794 edges, 114946 markings/sec, 25 secs
lola: 2904728 markings, 15764726 edges, 90049 markings/sec, 30 secs
lola: 3268880 markings, 17483074 edges, 72830 markings/sec, 35 secs
lola: 3575401 markings, 19246576 edges, 61304 markings/sec, 40 secs
lola: 3705796 markings, 21026267 edges, 26079 markings/sec, 45 secs
lola: 3708599 markings, 22665591 edges, 561 markings/sec, 50 secs
lola: 3710189 markings, 24295296 edges, 318 markings/sec, 55 secs
lola: 3711021 markings, 25936850 edges, 166 markings/sec, 60 secs
lola: 3711372 markings, 27631727 edges, 70 markings/sec, 65 secs
lola: 4121310 markings, 30103241 edges, 81988 markings/sec, 70 secs
lola: 4433560 markings, 32359186 edges, 62450 markings/sec, 75 secs
lola: 4815850 markings, 34439694 edges, 76458 markings/sec, 80 secs
lola: 5203808 markings, 36568954 edges, 77592 markings/sec, 85 secs
lola: 5632656 markings, 38555403 edges, 85770 markings/sec, 90 secs
lola: 6063280 markings, 40568751 edges, 86125 markings/sec, 95 secs
lola: 6537744 markings, 42355221 edges, 94893 markings/sec, 100 secs
lola: 6975701 markings, 44085137 edges, 87591 markings/sec, 105 secs
lola: 7394981 markings, 45828778 edges, 83856 markings/sec, 110 secs
lola: 7790778 markings, 47478881 edges, 79159 markings/sec, 115 secs
lola: 8165255 markings, 49113670 edges, 74895 markings/sec, 120 secs
lola: 8519645 markings, 50735119 edges, 70878 markings/sec, 125 secs
lola: 8851549 markings, 52377781 edges, 66381 markings/sec, 130 secs
lola: 9159084 markings, 53993289 edges, 61507 markings/sec, 135 secs
lola: 9446574 markings, 55614162 edges, 57498 markings/sec, 140 secs
lola: 9715575 markings, 57245604 edges, 53800 markings/sec, 145 secs
lola: 9967836 markings, 58867449 edges, 50452 markings/sec, 150 secs
lola: 10223123 markings, 60536657 edges, 51057 markings/sec, 155 secs
lola: 10238448 markings, 62112812 edges, 3065 markings/sec, 160 secs
lola: 10241527 markings, 63629464 edges, 616 markings/sec, 165 secs
lola: 10243712 markings, 65140018 edges, 437 markings/sec, 170 secs
lola: 10245694 markings, 66655523 edges, 396 markings/sec, 175 secs
lola: 10247413 markings, 68178978 edges, 344 markings/sec, 180 secs
lola: 10248634 markings, 69703252 edges, 244 markings/sec, 185 secs
lola: 10249587 markings, 71239014 edges, 191 markings/sec, 190 secs
lola: 10250373 markings, 72796584 edges, 157 markings/sec, 195 secs
lola: 10251002 markings, 74368783 edges, 126 markings/sec, 200 secs
lola: 10251537 markings, 75957708 edges, 107 markings/sec, 205 secs
lola: 10251998 markings, 77563538 edges, 92 markings/sec, 210 secs
lola: 10252313 markings, 79118319 edges, 63 markings/sec, 215 secs
lola: 10252605 markings, 80818463 edges, 58 markings/sec, 220 secs
lola: 10252780 markings, 82592730 edges, 35 markings/sec, 225 secs
lola: 10658727 markings, 85044501 edges, 81189 markings/sec, 230 secs
lola: 10980890 markings, 87340996 edges, 64433 markings/sec, 235 secs
lola: 11334414 markings, 89437584 edges, 70705 markings/sec, 240 secs
lola: 11667523 markings, 91430148 edges, 66622 markings/sec, 245 secs
lola: 11950806 markings, 93338475 edges, 56657 markings/sec, 250 secs
lola: 12252619 markings, 95140095 edges, 60363 markings/sec, 255 secs
lola: 12436580 markings, 97118144 edges, 36792 markings/sec, 260 secs
lola: 12851825 markings, 99044491 edges, 83049 markings/sec, 265 secs
lola: 13075167 markings, 100940298 edges, 44668 markings/sec, 270 secs
lola: 13395284 markings, 102971101 edges, 64023 markings/sec, 275 secs
lola: 13699990 markings, 105035877 edges, 60941 markings/sec, 280 secs
lola: 14043565 markings, 106916275 edges, 68715 markings/sec, 285 secs
lola: 14379276 markings, 108895050 edges, 67142 markings/sec, 290 secs
lola: 14860279 markings, 110622930 edges, 96201 markings/sec, 295 secs
lola: 15238766 markings, 112410253 edges, 75697 markings/sec, 300 secs
lola: 15654423 markings, 114201879 edges, 83131 markings/sec, 305 secs
lola: 15972122 markings, 115981461 edges, 63540 markings/sec, 310 secs
lola: 16398253 markings, 117603331 edges, 85226 markings/sec, 315 secs
lola: 16836314 markings, 119254229 edges, 87612 markings/sec, 320 secs
lola: 17195203 markings, 121033688 edges, 71778 markings/sec, 325 secs
lola: 17592693 markings, 122616792 edges, 79498 markings/sec, 330 secs
lola: 17979858 markings, 124178808 edges, 77433 markings/sec, 335 secs
lola: 18352598 markings, 125721719 edges, 74548 markings/sec, 340 secs
lola: 18720179 markings, 127255296 edges, 73516 markings/sec, 345 secs
lola: 19081111 markings, 128779413 edges, 72186 markings/sec, 350 secs
lola: 19423581 markings, 130372292 edges, 68494 markings/sec, 355 secs
lola: 19772378 markings, 131883151 edges, 69759 markings/sec, 360 secs
lola: 20112446 markings, 133387389 edges, 68014 markings/sec, 365 secs
lola: 20450672 markings, 134885275 edges, 67645 markings/sec, 370 secs
lola: 20781238 markings, 136382872 edges, 66113 markings/sec, 375 secs
lola: 21102631 markings, 137870853 edges, 64279 markings/sec, 380 secs
lola: 21415311 markings, 139356032 edges, 62536 markings/sec, 385 secs
lola: 21719323 markings, 140931138 edges, 60802 markings/sec, 390 secs
lola: 22021560 markings, 142402478 edges, 60447 markings/sec, 395 secs
lola: 22317541 markings, 143876462 edges, 59196 markings/sec, 400 secs
lola: 22602708 markings, 145345194 edges, 57033 markings/sec, 405 secs
lola: 22883323 markings, 146815226 edges, 56123 markings/sec, 410 secs
lola: 23155267 markings, 148287473 edges, 54389 markings/sec, 415 secs
lola: 23421597 markings, 149753804 edges, 53266 markings/sec, 420 secs
lola: 23683685 markings, 151222306 edges, 52418 markings/sec, 425 secs
lola: 23933019 markings, 152692804 edges, 49867 markings/sec, 430 secs
lola: 24176983 markings, 154165134 edges, 48793 markings/sec, 435 secs
lola: 24387077 markings, 155453735 edges, 42019 markings/sec, 440 secs
lola: 24620653 markings, 156941211 edges, 46715 markings/sec, 445 secs
lola: 24849947 markings, 158416622 edges, 45859 markings/sec, 450 secs
lola: 25072734 markings, 159891602 edges, 44557 markings/sec, 455 secs
lola: 25291110 markings, 161377410 edges, 43675 markings/sec, 460 secs
lola: 25515080 markings, 162875797 edges, 44794 markings/sec, 465 secs
lola: 25728186 markings, 164334809 edges, 42621 markings/sec, 470 secs
lola: 25823542 markings, 165874478 edges, 19071 markings/sec, 475 secs
lola: 25827776 markings, 167290371 edges, 847 markings/sec, 480 secs
lola: 25831181 markings, 168678594 edges, 681 markings/sec, 485 secs
lola: 25833498 markings, 170063787 edges, 463 markings/sec, 490 secs
lola: 25835415 markings, 171441060 edges, 383 markings/sec, 495 secs
lola: 25837084 markings, 172823627 edges, 334 markings/sec, 500 secs
lola: 25838707 markings, 174208619 edges, 325 markings/sec, 505 secs
lola: 25840026 markings, 175593783 edges, 264 markings/sec, 510 secs
lola: 25841418 markings, 176984540 edges, 278 markings/sec, 515 secs
lola: 25842868 markings, 178372827 edges, 290 markings/sec, 520 secs
lola: 25844224 markings, 179759176 edges, 271 markings/sec, 525 secs
lola: 25845437 markings, 181069886 edges, 243 markings/sec, 530 secs
lola: 25846521 markings, 182454330 edges, 217 markings/sec, 535 secs
lola: 25847525 markings, 183845525 edges, 201 markings/sec, 540 secs
lola: 25848538 markings, 185249150 edges, 203 markings/sec, 545 secs
lola: 25849429 markings, 186648293 edges, 178 markings/sec, 550 secs
lola: 25850194 markings, 188047850 edges, 153 markings/sec, 555 secs
lola: 25850879 markings, 189270362 edges, 137 markings/sec, 560 secs
lola: 25851602 markings, 190661033 edges, 145 markings/sec, 565 secs
lola: 25852197 markings, 192078702 edges, 119 markings/sec, 570 secs
lola: 25852872 markings, 193501432 edges, 135 markings/sec, 575 secs
lola: 25853424 markings, 194927236 edges, 110 markings/sec, 580 secs
lola: 25853947 markings, 196352097 edges, 105 markings/sec, 585 secs
lola: 25854423 markings, 197781895 edges, 95 markings/sec, 590 secs
lola: 25854962 markings, 199214705 edges, 108 markings/sec, 595 secs
lola: 25855385 markings, 200660185 edges, 85 markings/sec, 600 secs
lola: 25855808 markings, 202107729 edges, 85 markings/sec, 605 secs
lola: 25856186 markings, 203563622 edges, 76 markings/sec, 610 secs
lola: 25856560 markings, 205024113 edges, 75 markings/sec, 615 secs
lola: 25856870 markings, 206497307 edges, 62 markings/sec, 620 secs
lola: 25857193 markings, 207972136 edges, 65 markings/sec, 625 secs
lola: 25857470 markings, 209451783 edges, 55 markings/sec, 630 secs
lola: 25857773 markings, 210944885 edges, 61 markings/sec, 635 secs
lola: 25857988 markings, 212456297 edges, 43 markings/sec, 640 secs
lola: 25858188 markings, 213968002 edges, 40 markings/sec, 645 secs
lola: 25858394 markings, 215473000 edges, 41 markings/sec, 650 secs
lola: 25858572 markings, 217038449 edges, 36 markings/sec, 655 secs
lola: 25858695 markings, 218615031 edges, 25 markings/sec, 660 secs
lola: 25858825 markings, 220231206 edges, 26 markings/sec, 665 secs
lola: 25966466 markings, 222034157 edges, 21528 markings/sec, 670 secs
lola: 26367376 markings, 224459422 edges, 80182 markings/sec, 675 secs
lola: 26755533 markings, 226685851 edges, 77631 markings/sec, 680 secs
lola: 26966240 markings, 228653886 edges, 42141 markings/sec, 685 secs
lola: 27414755 markings, 230756714 edges, 89703 markings/sec, 690 secs
lola: 27716813 markings, 232654277 edges, 60412 markings/sec, 695 secs
lola: 27924880 markings, 234545832 edges, 41613 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 -----
----- Kill lola and sara stderr -----
----- 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="TriangularGrid-PT-5046"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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-full"
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 r174-smll-152708745200409"
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 ;