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 188K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K 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 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is SmallOperatingSystem-PT-MT8192DC4096, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516900129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527076494166


BK_STOP 1527076938616

--------------------
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 SmallOperatingSystem-PT-MT8192DC4096 as instance name.
Using SmallOperatingSystem 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': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 2000877, 'Memory': 15950.52, 'Tool': 'lola'}, {'Time': 2051916, 'Memory': 15946.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SmallOperatingSystem-PT-MT8192DC4096...

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


checking for too many tokens
===========================================================================================
SmallOperatingSystem-PT-MT8192DC4096: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SmallOperatingSystem-PT-MT8192DC4096 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: (NOT(A (G (((1 <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))) AND NOT(((ExecutingTask + 1 <= TransferToDisk) AND E (X ((CPUUnit <= FreeMemSegment)))))) : E (F ((A (G ((1 <= TaskOnDisk))) OR ((DiskControllerUnit <= 1) AND ((2 <= TransferToDisk) OR (3 <= TransferToDisk)))))) : E (G (A (X (((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk)))))) : E (F ((TaskOnDisk + 1 <= ExecutingTask))) : NOT(E (F ((TaskOnDisk + 1 <= DiskControllerUnit)))) : NOT((A (G (((ExecutingTask <= CPUUnit) AND (ExecutingTask <= CPUUnit)))) OR ((CPUUnit <= 2) OR ((CPUUnit <= TaskReady) AND (1 <= TransferToDisk)) OR ((2 <= TaskSuspended) AND (3 <= TaskReady) AND ((1 <= FreeMemSegment) OR (2 <= TaskOnDisk)))))) : A (G (E (F ((3 <= TaskReady))))) : NOT(NOT(A (G ((TaskSuspended + 1 <= FreeMemSegment))))) : ((TaskReady <= LoadingMem) AND E (F ((CPUUnit <= TaskReady)))) : ((A (G ((1 <= TransferToDisk))) AND (1 <= TaskSuspended)) OR (((TaskOnDisk + 1 <= ExecutingTask) AND (((3 <= FreeMemSegment) AND (2 <= TransferToDisk)) OR (TaskReady <= 0))) OR NOT(A (G ((1 <= DiskControllerUnit)))))) : A (G (A (((3 <= FreeMemSegment) U (TaskSuspended <= DiskControllerUnit))))) : A (F (A (G ((3 <= TaskOnDisk))))) : NOT((E (X ((1 <= TransferToDisk))) OR (A (G ((3 <= TaskOnDisk))) AND E (X ((TransferToDisk <= TaskReady)))))) : E ((((2 <= DiskControllerUnit) OR (ExecutingTask <= LoadingMem) OR ((TaskSuspended <= CPUUnit) AND (1 <= FreeMemSegment))) U E (F ((CPUUnit <= TaskReady))))) : (((TransferToDisk <= CPUUnit) OR (TaskReady <= FreeMemSegment)) AND E (G (A (G (TRUE))))) : (A (F (A (G ((DiskControllerUnit <= TaskOnDisk))))) AND A (F (E (F (TRUE)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((1 <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))) AND NOT(((ExecutingTask + 1 <= TransferToDisk) AND E (X ((CPUUnit <= FreeMemSegment))))))
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 (((FreeMemSegment <= 0) OR (DiskControllerUnit + 1 <= TaskSuspended))))
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 20 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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12289 markings, 12288 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (TransferToDisk <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TransferToDisk <= ExecutingTask)
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= TaskOnDisk))) OR ((DiskControllerUnit <= 1) AND ((2 <= TransferToDisk) OR (3 <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (TaskOnDisk <= 0))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 3804688 markings, 7593300 edges, 760938 markings/sec, 0 secs
lola: 7323712 markings, 14631635 edges, 703805 markings/sec, 5 secs
lola: 10764406 markings, 21513303 edges, 688139 markings/sec, 10 secs
lola: 14276526 markings, 28537829 edges, 702424 markings/sec, 15 secs
lola: 17715062 markings, 35402890 edges, 687707 markings/sec, 20 secs
lola: 20225097 markings, 40423163 edges, 502007 markings/sec, 25 secs
lola: 22677199 markings, 45327568 edges, 490420 markings/sec, 30 secs
lola: 25170899 markings, 50315172 edges, 498740 markings/sec, 35 secs
lola: 27634830 markings, 55243234 edges, 492786 markings/sec, 40 secs
lola: 30103765 markings, 60181305 edges, 493787 markings/sec, 45 secs
lola: 32613061 markings, 65200102 edges, 501859 markings/sec, 50 secs
lola: 35230018 markings, 70421938 edges, 523391 markings/sec, 55 secs
lola: 37558542 markings, 75079176 edges, 465705 markings/sec, 60 secs
lola: 39856326 markings, 79674930 edges, 459557 markings/sec, 65 secs
lola: 42142760 markings, 84247987 edges, 457287 markings/sec, 70 secs
lola: 44419668 markings, 88801987 edges, 455382 markings/sec, 75 secs
lola: 46702757 markings, 93368352 edges, 456618 markings/sec, 80 secs
lola: 49005821 markings, 97974666 edges, 460613 markings/sec, 85 secs
lola: 52026680 markings, 104004343 edges, 604172 markings/sec, 90 secs
lola: 55553114 markings, 111057497 edges, 705287 markings/sec, 95 secs
lola: 58903686 markings, 117758913 edges, 670114 markings/sec, 100 secs
lola: 62174496 markings, 124300801 edges, 654162 markings/sec, 105 secs
lola: 65390666 markings, 130733403 edges, 643234 markings/sec, 110 secs
lola: 68306190 markings, 136552398 edges, 583105 markings/sec, 115 secs
lola: 70709544 markings, 141359302 edges, 480671 markings/sec, 120 secs
lola: 73101314 markings, 146143037 edges, 478354 markings/sec, 125 secs
lola: 75344801 markings, 150630193 edges, 448697 markings/sec, 130 secs
lola: 77584773 markings, 155110322 edges, 447994 markings/sec, 135 secs
lola: 79827788 markings, 159596534 edges, 448603 markings/sec, 140 secs
lola: 82135738 markings, 164212620 edges, 461590 markings/sec, 145 secs
lola: 84840153 markings, 169609386 edges, 540883 markings/sec, 150 secs
lola: 88310006 markings, 176549373 edges, 693971 markings/sec, 155 secs
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: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((DiskControllerUnit <= LoadingMem) OR (ExecutingTask <= TransferToDisk))))))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14339 markings, 14339 edges
lola: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((TaskOnDisk + 1 <= ExecutingTask)))
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 20 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 SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3.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 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((TaskOnDisk + 1 <= DiskControllerUnit))))
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 20 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((ExecutingTask <= CPUUnit) AND (ExecutingTask <= CPUUnit)))) OR ((CPUUnit <= 2) OR ((CPUUnit <= TaskReady) AND (1 <= TransferToDisk)) OR ((2 <= TaskSuspended) AND (3 <= TaskReady) AND ((1 <= FreeMemSegment) OR (2 <= TaskOnDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit + 1 <= ExecutingTask) OR (CPUUnit + 1 <= ExecutingTask))))
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 20 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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4471312 markings, 6706967 edges, 894262 markings/sec, 0 secs
lola: sara is running 5 secs || 8181513 markings, 12272267 edges, 742040 markings/sec, 5 secs
lola: sara is running 10 secs || 11496722 markings, 17245080 edges, 663042 markings/sec, 10 secs
lola: sara is running 15 secs || 14570454 markings, 21855679 edges, 614746 markings/sec, 15 secs
lola: sara is running 20 secs || 17612042 markings, 26418060 edges, 608318 markings/sec, 20 secs
lola: sara is running 25 secs || 20622920 markings, 30934378 edges, 602176 markings/sec, 25 secs
lola: sara is running 30 secs || 23611426 markings, 35417137 edges, 597701 markings/sec, 30 secs
lola: sara is running 35 secs || 26568723 markings, 39853082 edges, 591459 markings/sec, 35 secs
lola: sara is running 40 secs || 29493602 markings, 44240401 edges, 584976 markings/sec, 40 secs
lola: sara is running 45 secs || 32411839 markings, 48617757 edges, 583647 markings/sec, 45 secs
lola: sara is running 50 secs || 35320338 markings, 52980505 edges, 581700 markings/sec, 50 secs
lola: sara is running 55 secs || 38199261 markings, 57298889 edges, 575785 markings/sec, 55 secs
lola: sara is running 60 secs || 41078414 markings, 61617618 edges, 575831 markings/sec, 60 secs
lola: sara is running 65 secs || 43947074 markings, 65920609 edges, 573732 markings/sec, 65 secs
lola: sara is running 70 secs || 46801485 markings, 70202224 edges, 570882 markings/sec, 70 secs
lola: sara is running 75 secs || 49642670 markings, 74464003 edges, 568237 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50360329 markings, 75540496 edges
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= CPUUnit) AND ((TaskReady + 1 <= CPUUnit) OR (TransferToDisk <= 0)) AND ((TaskSuspended <= 1) OR (TaskReady <= 2) OR ((FreeMemSegment <= 0) AND (TaskOnDisk <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= CPUUnit) AND ((TaskReady + 1 <= CPUUnit) OR (TransferToDisk <= 0)) AND ((TaskSuspended <= 1) OR (TaskReady <= 2) OR ((FreeMemSegment <= 0) AND (TaskOnDisk <= 1))))
lola: processed formula length: 173
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= TaskReady)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 3069738 markings, 9197178 edges, 3689329903141912576 markings/sec, 0 secs
lola: 5967819 markings, 17891654 edges, 579616 markings/sec, 5 secs
lola: 8827262 markings, 26470218 edges, 571889 markings/sec, 10 secs
lola: 11684833 markings, 35043162 edges, 571514 markings/sec, 15 secs
lola: 14569514 markings, 43697439 edges, 576936 markings/sec, 20 secs
lola: 17389980 markings, 52146788 edges, 564093 markings/sec, 25 secs
lola: 19555583 markings, 58643777 edges, 433121 markings/sec, 30 secs
lola: 21664082 markings, 64969443 edges, 421700 markings/sec, 35 secs
lola: 23758872 markings, 71253985 edges, 418958 markings/sec, 40 secs
lola: 25850899 markings, 77530237 edges, 418405 markings/sec, 45 secs
lola: 27929160 markings, 83765186 edges, 415652 markings/sec, 50 secs
lola: 30032189 markings, 90074443 edges, 420606 markings/sec, 55 secs
lola: 32169429 markings, 96486339 edges, 427448 markings/sec, 60 secs
lola: 34418690 markings, 103222029 edges, 449852 markings/sec, 65 secs
lola: 36489810 markings, 109435558 edges, 414224 markings/sec, 70 secs
lola: 38517459 markings, 115518668 edges, 405530 markings/sec, 75 secs
lola: 40534287 markings, 121569321 edges, 403366 markings/sec, 80 secs
lola: 42544327 markings, 127599601 edges, 402008 markings/sec, 85 secs
lola: 44560667 markings, 133648786 edges, 403268 markings/sec, 90 secs
lola: 46589517 markings, 139735502 edges, 405770 markings/sec, 95 secs
lola: 48689866 markings, 146036721 edges, 420070 markings/sec, 100 secs
lola: 51029038 markings, 153042150 edges, 467834 markings/sec, 105 secs
lola: 53990823 markings, 161927748 edges, 592357 markings/sec, 110 secs
lola: 56790686 markings, 170327566 edges, 559973 markings/sec, 115 secs
lola: 59525507 markings, 178532253 edges, 546964 markings/sec, 120 secs
lola: 62205760 markings, 186573228 edges, 536051 markings/sec, 125 secs
lola: 64853013 markings, 194515205 edges, 529451 markings/sec, 130 secs
lola: 67444439 markings, 202277418 edges, 518285 markings/sec, 135 secs
lola: 69540874 markings, 208566895 edges, 419287 markings/sec, 140 secs
lola: 71553633 markings, 214605336 edges, 402552 markings/sec, 145 secs
lola: 73529897 markings, 220534289 edges, 395253 markings/sec, 150 secs
lola: 75476348 markings, 226373799 edges, 389290 markings/sec, 155 secs
lola: 77414894 markings, 232189593 edges, 387709 markings/sec, 160 secs
lola: 79353336 markings, 238005079 edges, 387688 markings/sec, 165 secs
lola: 81297329 markings, 243837216 edges, 388799 markings/sec, 170 secs
lola: 83280261 markings, 249786174 edges, 396586 markings/sec, 175 secs
lola: 85964108 markings, 257825659 edges, 536769 markings/sec, 180 secs
lola: 88710458 markings, 266064934 edges, 549270 markings/sec, 185 secs
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 SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-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="SmallOperatingSystem-PT-MT8192DC4096"
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/SmallOperatingSystem-PT-MT8192DC4096.tgz
mv SmallOperatingSystem-PT-MT8192DC4096 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 SmallOperatingSystem-PT-MT8192DC4096, 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 r166-smll-152705516900129"
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 ;