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 964K
-rw-r--r-- 1 mcc users 4.1K 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.1K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 804K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Echo-PT-d02r15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-blw3-152649946200437
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527070231761


BK_STOP 1527070804612

--------------------
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 Echo-PT-d02r15 as instance name.
Using Echo 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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1219224, 'Memory': 15945.28, 'Tool': 'lola'}, {'Time': 3540101, 'Memory': 12757.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Echo-PT-d02r15...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Echo-PT-d02r15: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Echo-PT-d02r15 @ 3540 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 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: 3801/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 2127 places, 1674 transitions, 1062 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3336 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r15-CTLCardinality.task
lola: ((E (F (((2 <= p2030) OR (3 <= p1442)))) OR ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))) AND A (X (((p776 + 1 <= p2041) AND (p712 <= 2))))) : A ((((p905 <= p1445) OR (p527 <= 0)) U E (G ((1 <= p1621))))) : (A (G ((p567 <= p1197))) AND A (F (E (F ((p458 <= p2063)))))) : E (F (E (X ((1 <= p1584))))) : (A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397))))) OR ((2 <= p1363) OR A (G (((p1454 <= p123) OR (2 <= p1176)))))) : (A (G (A (G ((1 <= p2012))))) OR ((((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287)) OR (E (G ((1 <= p2119))) AND E (X ((2 <= p1867)))))) : E (X (A (G ((p714 <= p952))))) : E ((E (G ((p1363 <= p1619))) U (((1 <= p748) OR (1 <= p8)) AND (p1259 <= p1816)))) : ((1 <= p320) OR A (F (A (G ((p1116 <= p1540)))))) : E (F (E (G ((p187 <= p1552))))) : E (G (E (((p1637 <= p3) U (p1866 <= p1469))))) : ((((1 <= p890) AND (p671 <= p421) AND ((1 <= p867) OR (2 <= p782)) AND (1 <= p2071) AND (1 <= p522) AND (p1454 <= p207) AND (p744 <= p1641)) OR (1 <= p1236)) OR E (F ((((3 <= p1243) AND (p229 <= p1088)) OR (p1705 + 1 <= p411))))) : (A (F (((p901 + 1 <= p206) AND (p781 <= p1436)))) AND NOT(A (G ((1 <= p1482))))) : (A (X (A (G ((3 <= p2050))))) OR A (F (E (F ((2 <= p226)))))) : E ((((p1178 <= 1) AND ((p679 <= p1410) OR (p481 <= p1969))) U A (X ((1 <= p1251))))) : (NOT((A (F ((3 <= p553))) OR E (G ((p1656 <= p316))))) OR NOT(A (((p1528 <= p1968) U (p672 <= p1177)))))
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 (F (((2 <= p2030) OR (3 <= p1442)))) OR ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))) AND A (X (((p776 + 1 <= p2041) AND (p712 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2030) OR (3 <= p1442))))
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 136 bytes per marking, with 26 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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-CTLCardinality.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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))
lola: processed formula length: 99
lola: 0 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p905 <= p1445) OR (p527 <= 0)) U E (G ((1 <= p1621)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p905 <= p1445) OR (p527 <= 0)) U NOT(A(TRUE U (p1621 <= 0))))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 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: 451 markings, 901 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p567 <= p1197))) AND A (F (E (F ((p458 <= p2063))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p567 <= p1197)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((1 <= p1584)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((1 <= p1584)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: ========================================
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 234939 markings, 1557206 edges, 3096157948485828608 markings/sec, 0 secs
lola: 431912 markings, 3085006 edges, 39395 markings/sec, 5 secs
lola: 636559 markings, 4662956 edges, 40929 markings/sec, 10 secs
lola: 847930 markings, 6289520 edges, 42274 markings/sec, 15 secs
lola: 1040611 markings, 7782271 edges, 38536 markings/sec, 20 secs
lola: 1217724 markings, 9297054 edges, 35423 markings/sec, 25 secs
lola: 1394114 markings, 10834266 edges, 35278 markings/sec, 30 secs
lola: 1573612 markings, 12406875 edges, 35900 markings/sec, 35 secs
lola: 1764534 markings, 13924316 edges, 38184 markings/sec, 40 secs
lola: 1942120 markings, 15466135 edges, 35517 markings/sec, 45 secs
lola: 2121726 markings, 17033872 edges, 35921 markings/sec, 50 secs
lola: 2302331 markings, 18615606 edges, 36121 markings/sec, 55 secs
lola: 2497629 markings, 20158964 edges, 39060 markings/sec, 60 secs
lola: 2670515 markings, 21670733 edges, 34577 markings/sec, 65 secs
lola: 2851806 markings, 23253771 edges, 36258 markings/sec, 70 secs
lola: 3041101 markings, 24860796 edges, 37859 markings/sec, 75 secs
lola: 3233344 markings, 26430222 edges, 38449 markings/sec, 80 secs
lola: 3412404 markings, 27993528 edges, 35812 markings/sec, 85 secs
lola: 3596740 markings, 29588439 edges, 36867 markings/sec, 90 secs
lola: 3790685 markings, 31203983 edges, 38789 markings/sec, 95 secs
lola: 3981293 markings, 32807919 edges, 38122 markings/sec, 100 secs
lola: 4166215 markings, 34399068 edges, 36984 markings/sec, 105 secs
lola: 4348108 markings, 35991122 edges, 36379 markings/sec, 110 secs
lola: 4528449 markings, 37458989 edges, 36068 markings/sec, 115 secs
lola: 4691658 markings, 38855132 edges, 32642 markings/sec, 120 secs
lola: 4855413 markings, 40265030 edges, 32751 markings/sec, 125 secs
lola: 5020940 markings, 41701477 edges, 33105 markings/sec, 130 secs
lola: 5189288 markings, 43172526 edges, 33670 markings/sec, 135 secs
lola: 5348851 markings, 44654612 edges, 31913 markings/sec, 140 secs
lola: 5502702 markings, 46153042 edges, 30770 markings/sec, 145 secs
lola: 5658430 markings, 47665044 edges, 31146 markings/sec, 150 secs
lola: 5815700 markings, 49198277 edges, 31454 markings/sec, 155 secs
lola: 5987411 markings, 50703072 edges, 34342 markings/sec, 160 secs
lola: 6143564 markings, 52220291 edges, 31231 markings/sec, 165 secs
lola: 6300871 markings, 53748661 edges, 31461 markings/sec, 170 secs
lola: 6459961 markings, 55298394 edges, 31818 markings/sec, 175 secs
lola: 6628549 markings, 56831408 edges, 33718 markings/sec, 180 secs
lola: 6784771 markings, 58317183 edges, 31244 markings/sec, 185 secs
lola: 6931083 markings, 59739179 edges, 29262 markings/sec, 190 secs
lola: 7074368 markings, 61131581 edges, 28657 markings/sec, 195 secs
lola: 7218640 markings, 62532636 edges, 28854 markings/sec, 200 secs
lola: 7388848 markings, 64023871 edges, 34042 markings/sec, 205 secs
lola: 7547529 markings, 65564530 edges, 31736 markings/sec, 210 secs
lola: 7707483 markings, 67118957 edges, 31991 markings/sec, 215 secs
lola: 7869810 markings, 68699218 edges, 32465 markings/sec, 220 secs
lola: 8048664 markings, 70190101 edges, 35771 markings/sec, 225 secs
lola: 8219603 markings, 71655647 edges, 34188 markings/sec, 230 secs
lola: 8392227 markings, 73153046 edges, 34525 markings/sec, 235 secs
lola: 8559393 markings, 74613006 edges, 33433 markings/sec, 240 secs
lola: 8718809 markings, 76004387 edges, 31883 markings/sec, 245 secs
lola: 8862929 markings, 77357983 edges, 28824 markings/sec, 250 secs
lola: 9010658 markings, 78796211 edges, 29546 markings/sec, 255 secs
lola: 9161976 markings, 80263608 edges, 30264 markings/sec, 260 secs
lola: 9311713 markings, 81718831 edges, 29947 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397))))) OR ((2 <= p1363) OR A (G (((p1454 <= p123) OR (2 <= p1176))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397)))))
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 136 bytes per marking, with 26 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 244 markings, 243 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p1363)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1363)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1454 <= p123) OR (2 <= p1176))))
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 136 bytes per marking, with 26 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((1 <= p2012))))) OR ((((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287)) OR (E (G ((1 <= p2119))) AND E (X ((2 <= p1867))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p2012)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p2119)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p2119 <= 0)))
lola: processed formula length: 27
lola: 3 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 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: 701722 markings, 1739963 edges, 2893551765469265920 markings/sec, 0 secs
lola: 1328344 markings, 3410384 edges, 125324 markings/sec, 5 secs
lola: 1940049 markings, 5088160 edges, 122341 markings/sec, 10 secs
lola: 2552933 markings, 6769982 edges, 122577 markings/sec, 15 secs
lola: 3169191 markings, 8454146 edges, 123252 markings/sec, 20 secs
lola: 3772789 markings, 10126166 edges, 120720 markings/sec, 25 secs
lola: 4366684 markings, 11773689 edges, 118779 markings/sec, 30 secs
lola: 4917551 markings, 13278446 edges, 110173 markings/sec, 35 secs
lola: 5450444 markings, 14818940 edges, 106579 markings/sec, 40 secs
lola: 5975528 markings, 16383437 edges, 105017 markings/sec, 45 secs
lola: 6493049 markings, 17964206 edges, 103504 markings/sec, 50 secs
lola: 7026280 markings, 19552556 edges, 106646 markings/sec, 55 secs
lola: 7564884 markings, 21158195 edges, 107721 markings/sec, 60 secs
lola: 8104958 markings, 22721576 edges, 108015 markings/sec, 65 secs
lola: 8639362 markings, 24218311 edges, 106881 markings/sec, 70 secs
lola: 9141068 markings, 25716643 edges, 100341 markings/sec, 75 secs
lola: 9647408 markings, 27221705 edges, 101268 markings/sec, 80 secs
lola: 10137880 markings, 28694068 edges, 98094 markings/sec, 85 secs
lola: 10644828 markings, 30227638 edges, 101390 markings/sec, 90 secs
lola: 11161280 markings, 31769968 edges, 103290 markings/sec, 95 secs
lola: 11703103 markings, 33319718 edges, 108365 markings/sec, 100 secs
lola: 12250416 markings, 34850938 edges, 109463 markings/sec, 105 secs
lola: 12753146 markings, 36371221 edges, 100546 markings/sec, 110 secs
lola: 13264413 markings, 37899155 edges, 102253 markings/sec, 115 secs
lola: 13780068 markings, 39432511 edges, 103131 markings/sec, 120 secs
lola: 14296144 markings, 40992799 edges, 103215 markings/sec, 125 secs
lola: 14814128 markings, 42551781 edges, 103597 markings/sec, 130 secs
lola: 15380504 markings, 44137670 edges, 113275 markings/sec, 135 secs
lola: 15923448 markings, 45684578 edges, 108589 markings/sec, 140 secs
lola: 16436644 markings, 47229094 edges, 102639 markings/sec, 145 secs
lola: 16945988 markings, 48764139 edges, 101869 markings/sec, 150 secs
lola: 17467503 markings, 50320499 edges, 104303 markings/sec, 155 secs
lola: 17998856 markings, 51903225 edges, 106271 markings/sec, 160 secs
lola: 18528812 markings, 53491921 edges, 105991 markings/sec, 165 secs
lola: 19112900 markings, 55103811 edges, 116818 markings/sec, 170 secs
lola: 19636964 markings, 56646348 edges, 104813 markings/sec, 175 secs
lola: 20155528 markings, 58196265 edges, 103713 markings/sec, 180 secs
lola: 20674676 markings, 59756171 edges, 103830 markings/sec, 185 secs
lola: 21194792 markings, 61324204 edges, 104023 markings/sec, 190 secs
lola: 21701825 markings, 62838480 edges, 101407 markings/sec, 195 secs
lola: 22209467 markings, 64295106 edges, 101528 markings/sec, 200 secs
lola: 22680108 markings, 65614136 edges, 94128 markings/sec, 205 secs
lola: 23125736 markings, 66933349 edges, 89126 markings/sec, 210 secs
lola: 23594522 markings, 68321551 edges, 93757 markings/sec, 215 secs
lola: 24063444 markings, 69752430 edges, 93784 markings/sec, 220 secs
lola: 24553592 markings, 71210204 edges, 98030 markings/sec, 225 secs
lola: 25025585 markings, 72613529 edges, 94399 markings/sec, 230 secs
lola: 25496536 markings, 74051151 edges, 94190 markings/sec, 235 secs
lola: 25988652 markings, 75512583 edges, 98423 markings/sec, 240 secs
lola: 26454296 markings, 76955945 edges, 93129 markings/sec, 245 secs
lola: 26895110 markings, 78411275 edges, 88163 markings/sec, 250 secs
lola: 27346652 markings, 79866572 edges, 90308 markings/sec, 255 secs
lola: 27800900 markings, 81324404 edges, 90850 markings/sec, 260 secs
lola: 28245024 markings, 82789636 edges, 88825 markings/sec, 265 secs
lola: 28699692 markings, 84255421 edges, 90934 markings/sec, 270 secs
lola: 29166651 markings, 85733591 edges, 93392 markings/sec, 275 secs
lola: 29648194 markings, 87194102 edges, 96309 markings/sec, 280 secs
lola: 30109104 markings, 88657113 edges, 92182 markings/sec, 285 secs
lola: 30565156 markings, 90132498 edges, 91210 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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: '
'
Aborted (core dumped)
FORMULA Echo-PT-d02r15-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-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 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="Echo-PT-d02r15"
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/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 Echo-PT-d02r15, 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 r078-blw3-152649946200437"
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 ;