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 180K
-rw-r--r-- 1 mcc users 4.4K 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 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K 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 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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-MT4096DC1024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516800108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527068288006


BK_STOP 1527068420658

--------------------
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-MT4096DC1024 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': 1274205, 'Memory': 15941.1, 'Tool': 'lola'}, {'Time': 1285157, 'Memory': 15949.05, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SmallOperatingSystem-PT-MT4096DC1024...

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


checking for too many tokens
===========================================================================================
SmallOperatingSystem-PT-MT4096DC1024: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ SmallOperatingSystem-PT-MT4096DC1024 @ 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-MT4096DC1024-CTLCardinality.task
lola: (A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment)))) OR A (X (E (F ((FreeMemSegment <= TaskSuspended)))))) : (E ((TRUE U ((1 <= TaskReady) OR (1 <= DiskControllerUnit)))) AND A (G (((TaskReady <= TaskOnDisk) OR (TaskSuspended <= DiskControllerUnit) OR (TaskOnDisk <= ExecutingTask))))) : E (F (A (X (FALSE)))) : E (F ((((CPUUnit <= TaskOnDisk) OR (3 <= DiskControllerUnit)) AND ((DiskControllerUnit <= CPUUnit) OR (CPUUnit <= TaskOnDisk)) AND ((TaskOnDisk + 1 <= ExecutingTask) OR (FreeMemSegment + 1 <= TaskSuspended))))) : NOT(NOT(NOT(A (G ((ExecutingTask <= CPUUnit)))))) : ((NOT(E (G ((3 <= LoadingMem)))) OR (DiskControllerUnit <= LoadingMem)) AND ((3 <= LoadingMem) OR E (F ((CPUUnit <= TransferToDisk))))) : ((3 <= ExecutingTask) OR (E (X ((DiskControllerUnit <= TransferToDisk))) OR E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit)))))) : A (G (NOT(A (X ((CPUUnit <= ExecutingTask)))))) : A (G (A (G ((TransferToDisk + 1 <= CPUUnit))))) : A (X (A (G ((TaskReady <= DiskControllerUnit))))) : E (F (A (G (((TransferToDisk <= LoadingMem) AND (TaskOnDisk <= DiskControllerUnit)))))) : A (G ((((TaskOnDisk + 1 <= ExecutingTask) AND (ExecutingTask + 1 <= TransferToDisk)) OR (TransferToDisk + 1 <= CPUUnit)))) : (E (((LoadingMem <= FreeMemSegment) U ((TaskOnDisk <= TransferToDisk) AND (TaskReady <= FreeMemSegment)))) OR A (X ((2 <= ExecutingTask)))) : A (G (TRUE)) : (A (G (())) AND A (F (A (F ((LoadingMem <= TaskReady)))))) : (NOT(A (G (TRUE))) AND (A (X (TRUE)) AND (1 <= DiskControllerUnit)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment)))) OR A (X (E (F ((FreeMemSegment <= TaskSuspended))))))
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: A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment))))
lola: processed formula: A (((ExecutingTask <= 2) U ((2 <= TaskSuspended) AND (CPUUnit <= FreeMemSegment))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 8193 markings, 8193 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((FreeMemSegment <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (FreeMemSegment <= TaskSuspended)))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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: 7168 markings, 7167 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((TRUE U ((1 <= TaskReady) OR (1 <= DiskControllerUnit)))) AND A (G (((TaskReady <= TaskOnDisk) OR (TaskSuspended <= DiskControllerUnit) OR (TaskOnDisk <= ExecutingTask)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= TaskReady) OR (1 <= DiskControllerUnit))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskReady <= TaskOnDisk) OR (TaskSuspended <= DiskControllerUnit) OR (TaskOnDisk <= ExecutingTask))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((CPUUnit <= TaskOnDisk) OR (3 <= DiskControllerUnit)) AND ((DiskControllerUnit <= CPUUnit) OR (CPUUnit <= TaskOnDisk)) AND ((TaskOnDisk + 1 <= ExecutingTask) OR (FreeMemSegment + 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 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2368004 markings, 3549954 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (G ((ExecutingTask <= CPUUnit))))))
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-MT4096DC1024-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((3 <= LoadingMem)))) OR (DiskControllerUnit <= LoadingMem)) AND ((3 <= LoadingMem) OR E (F ((CPUUnit <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((LoadingMem <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((LoadingMem <= 2)))
lola: processed formula: A (F ((LoadingMem <= 2)))
lola: processed formula length: 25
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= LoadingMem)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= LoadingMem)
lola: processed formula length: 17
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit <= TransferToDisk)))
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-MT4096DC1024-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35333 markings, 55827 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= ExecutingTask) OR (E (X ((DiskControllerUnit <= TransferToDisk))) OR E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ExecutingTask)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((DiskControllerUnit <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((DiskControllerUnit <= TransferToDisk))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= LoadingMem) AND (1 <= DiskControllerUnit))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4099 markings, 4098 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((CPUUnit <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((ExecutingTask + 1 <= CPUUnit)))))
lola: processed formula length: 54
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC1024-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: 3547739 markings, 7081266 edges, 709548 markings/sec, 0 secs
lola: 6727475 markings, 13434601 edges, 635947 markings/sec, 5 secs
lola: 10147543 markings, 20268682 edges, 684014 markings/sec, 10 secs
lola: 13155839 markings, 26279084 edges, 601659 markings/sec, 15 secs
lola: 16480739 markings, 32922801 edges, 664980 markings/sec, 20 secs
lola: 19411481 markings, 38778071 edges, 586148 markings/sec, 25 secs
lola: 22703997 markings, 45357011 edges, 658503 markings/sec, 30 secs
lola: 25575501 markings, 51093785 edges, 574301 markings/sec, 35 secs
lola: 28845198 markings, 57627083 edges, 653939 markings/sec, 40 secs
lola: 31641257 markings, 63212947 edges, 559212 markings/sec, 45 secs
lola: 34951967 markings, 69828285 edges, 662142 markings/sec, 50 secs
lola: 37699993 markings, 75325237 edges, 549605 markings/sec, 55 secs
lola: 41017839 markings, 81947684 edges, 663569 markings/sec, 60 secs
lola: 43744498 markings, 87401894 edges, 545332 markings/sec, 65 secs
lola: 47017839 markings, 93942484 edges, 654668 markings/sec, 70 secs
lola: 49753635 markings, 99407808 edges, 547159 markings/sec, 75 secs
lola: 52953334 markings, 105801092 edges, 639940 markings/sec, 80 secs
lola: 55730068 markings, 111348307 edges, 555347 markings/sec, 85 secs
lola: 58863422 markings, 117608882 edges, 626671 markings/sec, 90 secs
lola: 61684757 markings, 123245316 edges, 564267 markings/sec, 95 secs
lola: 64722168 markings, 129313976 edges, 607482 markings/sec, 100 secs
lola: 67585402 markings, 135034224 edges, 572647 markings/sec, 105 secs
lola: 70533352 markings, 140923931 edges, 589590 markings/sec, 110 secs
lola: 73474171 markings, 146799380 edges, 588164 markings/sec, 115 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-MT4096DC1024-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC1024-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-MT4096DC1024"
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-MT4096DC1024.tgz
mv SmallOperatingSystem-PT-MT4096DC1024 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-MT4096DC1024, 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-152705516800108"
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 ;