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 mcc4mcc-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 r178-smll-152708748600409
=====================================================================

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


BK_STOP 1527214200863

--------------------
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 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
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: 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 236 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 295 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 295 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 354 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 354 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: ========================================
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 590 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: 507240 markings, 2857021 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1105545 markings, 5286051 edges, 119661 markings/sec, 5 secs
lola: 1210706 markings, 7556971 edges, 21032 markings/sec, 10 secs
lola: 1567414 markings, 10278065 edges, 71342 markings/sec, 15 secs
lola: 2146135 markings, 12783766 edges, 115744 markings/sec, 20 secs
lola: 2688267 markings, 14880398 edges, 108426 markings/sec, 25 secs
lola: 3145262 markings, 16861426 edges, 91399 markings/sec, 30 secs
lola: 3508229 markings, 18833895 edges, 72593 markings/sec, 35 secs
lola: 3705382 markings, 20851527 edges, 39431 markings/sec, 40 secs
lola: 3708708 markings, 22749908 edges, 665 markings/sec, 45 secs
lola: 3710423 markings, 24670514 edges, 343 markings/sec, 50 secs
lola: 3711214 markings, 26670406 edges, 158 markings/sec, 55 secs
lola: 3943110 markings, 29148460 edges, 46379 markings/sec, 60 secs
lola: 4367326 markings, 31760747 edges, 84843 markings/sec, 65 secs
lola: 4693214 markings, 34048260 edges, 65178 markings/sec, 70 secs
lola: 5146854 markings, 36377785 edges, 90728 markings/sec, 75 secs
lola: 5634533 markings, 38562207 edges, 97536 markings/sec, 80 secs
lola: 6110716 markings, 40739083 edges, 95237 markings/sec, 85 secs
lola: 6623405 markings, 42675997 edges, 102538 markings/sec, 90 secs
lola: 7093929 markings, 44548790 edges, 94105 markings/sec, 95 secs
lola: 7541623 markings, 46431043 edges, 89539 markings/sec, 100 secs
lola: 7960613 markings, 48211658 edges, 83798 markings/sec, 105 secs
lola: 8355181 markings, 49968261 edges, 78914 markings/sec, 110 secs
lola: 8724010 markings, 51742327 edges, 73766 markings/sec, 115 secs
lola: 9055087 markings, 53433128 edges, 66215 markings/sec, 120 secs
lola: 9371835 markings, 55177909 edges, 63350 markings/sec, 125 secs
lola: 9665506 markings, 56926981 edges, 58734 markings/sec, 130 secs
lola: 9938814 markings, 58685561 edges, 54662 markings/sec, 135 secs
lola: 10214876 markings, 60479691 edges, 55212 markings/sec, 140 secs
lola: 10238787 markings, 62221125 edges, 4782 markings/sec, 145 secs
lola: 10241940 markings, 63883768 edges, 631 markings/sec, 150 secs
lola: 10244289 markings, 65546380 edges, 470 markings/sec, 155 secs
lola: 10246429 markings, 67209715 edges, 428 markings/sec, 160 secs
lola: 10248009 markings, 68884221 edges, 316 markings/sec, 165 secs
lola: 10249228 markings, 70569570 edges, 244 markings/sec, 170 secs
lola: 10250078 markings, 72267604 edges, 170 markings/sec, 175 secs
lola: 10250861 markings, 73987566 edges, 157 markings/sec, 180 secs
lola: 10251472 markings, 75732333 edges, 122 markings/sec, 185 secs
lola: 10251998 markings, 77507263 edges, 105 markings/sec, 190 secs
lola: 10252350 markings, 79310980 edges, 70 markings/sec, 195 secs
lola: 10252647 markings, 81176398 edges, 59 markings/sec, 200 secs
lola: 10323475 markings, 83244606 edges, 14166 markings/sec, 205 secs
lola: 10773141 markings, 85870486 edges, 89933 markings/sec, 210 secs
lola: 11170271 markings, 88307802 edges, 79426 markings/sec, 215 secs
lola: 11408820 markings, 90494468 edges, 47710 markings/sec, 220 secs
lola: 11759087 markings, 92586659 edges, 70053 markings/sec, 225 secs
lola: 12242051 markings, 94650276 edges, 96593 markings/sec, 230 secs
lola: 12372874 markings, 96739453 edges, 26165 markings/sec, 235 secs
lola: 12793379 markings, 98743942 edges, 84101 markings/sec, 240 secs
lola: 13045771 markings, 100752363 edges, 50478 markings/sec, 245 secs
lola: 13395366 markings, 102990700 edges, 69919 markings/sec, 250 secs
lola: 13752918 markings, 105212607 edges, 71510 markings/sec, 255 secs
lola: 14089465 markings, 107269560 edges, 67309 markings/sec, 260 secs
lola: 14509798 markings, 109355528 edges, 84067 markings/sec, 265 secs
lola: 15015116 markings, 111182421 edges, 101064 markings/sec, 270 secs
lola: 15400315 markings, 113256356 edges, 77040 markings/sec, 275 secs
lola: 15859991 markings, 115053088 edges, 91935 markings/sec, 280 secs
lola: 16216639 markings, 116910524 edges, 71330 markings/sec, 285 secs
lola: 16665554 markings, 118632405 edges, 89783 markings/sec, 290 secs
lola: 17081413 markings, 120578238 edges, 83172 markings/sec, 295 secs
lola: 17503244 markings, 122263458 edges, 84366 markings/sec, 300 secs
lola: 17919851 markings, 123935328 edges, 83321 markings/sec, 305 secs
lola: 18318774 markings, 125584260 edges, 79785 markings/sec, 310 secs
lola: 18712193 markings, 127222001 edges, 78684 markings/sec, 315 secs
lola: 19097549 markings, 128849097 edges, 77071 markings/sec, 320 secs
lola: 19464189 markings, 130549939 edges, 73328 markings/sec, 325 secs
lola: 19835125 markings, 132158389 edges, 74187 markings/sec, 330 secs
lola: 20197261 markings, 133760082 edges, 72427 markings/sec, 335 secs
lola: 20554959 markings, 135352427 edges, 71540 markings/sec, 340 secs
lola: 20903977 markings, 136943432 edges, 69804 markings/sec, 345 secs
lola: 21242836 markings, 138524498 edges, 67772 markings/sec, 350 secs
lola: 21566798 markings, 140191536 edges, 64792 markings/sec, 355 secs
lola: 21891458 markings, 141764497 edges, 64932 markings/sec, 360 secs
lola: 22209533 markings, 143334012 edges, 63615 markings/sec, 365 secs
lola: 22516930 markings, 144902948 edges, 61479 markings/sec, 370 secs
lola: 22817753 markings, 146466969 edges, 60165 markings/sec, 375 secs
lola: 23109162 markings, 148034461 edges, 58282 markings/sec, 380 secs
lola: 23393409 markings, 149598279 edges, 56849 markings/sec, 385 secs
lola: 23672897 markings, 151161292 edges, 55898 markings/sec, 390 secs
lola: 23938314 markings, 152725057 edges, 53083 markings/sec, 395 secs
lola: 24197206 markings, 154286340 edges, 51778 markings/sec, 400 secs
lola: 24451973 markings, 155854400 edges, 50953 markings/sec, 405 secs
lola: 24697487 markings, 157427102 edges, 49103 markings/sec, 410 secs
lola: 24936213 markings, 158989426 edges, 47745 markings/sec, 415 secs
lola: 25172073 markings, 160559244 edges, 47172 markings/sec, 420 secs
lola: 25406846 markings, 162143306 edges, 46955 markings/sec, 425 secs
lola: 25638613 markings, 163742579 edges, 46353 markings/sec, 430 secs
lola: 25821255 markings, 165416183 edges, 36528 markings/sec, 435 secs
lola: 25826756 markings, 166967052 edges, 1100 markings/sec, 440 secs
lola: 25830714 markings, 168459688 edges, 792 markings/sec, 445 secs
lola: 25833272 markings, 169946894 edges, 512 markings/sec, 450 secs
lola: 25835392 markings, 171426244 edges, 424 markings/sec, 455 secs
lola: 25837211 markings, 172910270 edges, 364 markings/sec, 460 secs
lola: 25838893 markings, 174396237 edges, 336 markings/sec, 465 secs
lola: 25840280 markings, 175883587 edges, 277 markings/sec, 470 secs
lola: 25841928 markings, 177374394 edges, 330 markings/sec, 475 secs
lola: 25843290 markings, 178865188 edges, 272 markings/sec, 480 secs
lola: 25844830 markings, 180360887 edges, 308 markings/sec, 485 secs
lola: 25845999 markings, 181858853 edges, 234 markings/sec, 490 secs
lola: 25847123 markings, 183360794 edges, 225 markings/sec, 495 secs
lola: 25848270 markings, 184864790 edges, 229 markings/sec, 500 secs
lola: 25849266 markings, 186378019 edges, 199 markings/sec, 505 secs
lola: 25850074 markings, 187890150 edges, 162 markings/sec, 510 secs
lola: 25850944 markings, 189408673 edges, 174 markings/sec, 515 secs
lola: 25851744 markings, 190928485 edges, 160 markings/sec, 520 secs
lola: 25852372 markings, 192455428 edges, 126 markings/sec, 525 secs
lola: 25853086 markings, 193991620 edges, 143 markings/sec, 530 secs
lola: 25853659 markings, 195526644 edges, 115 markings/sec, 535 secs
lola: 25854180 markings, 197068493 edges, 104 markings/sec, 540 secs
lola: 25854734 markings, 198612953 edges, 111 markings/sec, 545 secs
lola: 25855254 markings, 200170531 edges, 104 markings/sec, 550 secs
lola: 25855713 markings, 201735747 edges, 92 markings/sec, 555 secs
lola: 25856126 markings, 203306072 edges, 83 markings/sec, 560 secs
lola: 25856536 markings, 204883492 edges, 82 markings/sec, 565 secs
lola: 25856865 markings, 206473036 edges, 66 markings/sec, 570 secs
lola: 25857212 markings, 208069876 edges, 69 markings/sec, 575 secs
lola: 25857523 markings, 209672917 edges, 62 markings/sec, 580 secs
lola: 25857834 markings, 211292753 edges, 62 markings/sec, 585 secs
lola: 25858045 markings, 212931102 edges, 42 markings/sec, 590 secs
lola: 25858266 markings, 214583171 edges, 44 markings/sec, 595 secs
lola: 25858482 markings, 216250497 edges, 43 markings/sec, 600 secs
lola: 25858649 markings, 217938816 edges, 33 markings/sec, 605 secs
lola: 25858780 markings, 219667750 edges, 26 markings/sec, 610 secs
lola: 25858900 markings, 221521117 edges, 24 markings/sec, 615 secs
lola: 26290430 markings, 224022065 edges, 86306 markings/sec, 620 secs
lola: 26722568 markings, 226514187 edges, 86428 markings/sec, 625 secs
lola: 26966264 markings, 228682701 edges, 48739 markings/sec, 630 secs
lola: 27423658 markings, 230943940 edges, 91479 markings/sec, 635 secs
lola: 27802972 markings, 233010537 edges, 75863 markings/sec, 640 secs
lola: 27940925 markings, 235095553 edges, 27591 markings/sec, 645 secs
lola: 28316994 markings, 236979827 edges, 75214 markings/sec, 650 secs
lola: 28407277 markings, 238981553 edges, 18057 markings/sec, 655 secs
lola: 28792559 markings, 241136142 edges, 77056 markings/sec, 660 secs
lola: 29177403 markings, 243073585 edges, 76969 markings/sec, 665 secs
lola: 29368804 markings, 244897362 edges, 38280 markings/sec, 670 secs
lola: 29550717 markings, 246756532 edges, 36383 markings/sec, 675 secs
lola: 30044607 markings, 248731896 edges, 98778 markings/sec, 680 secs
lola: 30429406 markings, 250477384 edges, 76960 markings/sec, 685 secs
lola: 30527961 markings, 252190402 edges, 19711 markings/sec, 690 secs
lola: 30541534 markings, 253937578 edges, 2715 markings/sec, 695 secs
lola: 31048132 markings, 255969768 edges, 101320 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="mcc4mcc-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 mcc4mcc-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 r178-smll-152708748600409"
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 ;