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 220K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 56K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261900351
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527430963707


BK_STOP 1527431218477

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Planning-PT-none as instance name.
Using Planning as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': False, 'Strongly Connected': False, 'Source Place': False, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 407692, 'Memory': 15949.38, 'Tool': 'lola'}, {'Time': 471837, 'Memory': 15952.84, 'Tool': 'lola'}, {'Time': 1479812, 'Memory': 15946.84, 'Tool': 'itstools'}, {'Time': 1498026, 'Memory': 15947.7, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola Planning-PT-none...

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


checking for too many tokens
===========================================================================================
Planning-PT-none: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ Planning-PT-none @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 2 (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: 254/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 126 places, 128 transitions, 82 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 124 transition conflict sets
lola: TASK
lola: reading formula from Planning-PT-none-LTLCardinality.task
lola: A (G ((3 <= p39))) : A (G ((F ((p10 <= p118)) U G ((1 <= p93))))) : A (F ((p26 <= p30))) : A ((X (X ((p61 <= p33))) U F ((1 <= p1)))) : A ((p25 <= p89)) : A ((p121 <= p108)) : A (G (X (F (X ((3 <= p11)))))) : A ((p117 <= p21)) : A (F (F (F (G ((1 <= p111)))))) : A ((G (X ((p64 <= p57))) U ((p54 <= p24) U (p55 <= p117)))) : A ((2 <= p42)) : A (G ((X ((3 <= p86)) U (3 <= p15)))) : A (G (X ((1 <= p17)))) : A (X (F (X (X ((p102 <= p118)))))) : A (X ((p10 <= p9))) : A (F (G ((1 <= p126))))
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 (G ((3 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p10 <= p118)) U G ((1 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((p10 <= p118)) U G ((1 <= p93)))))
lola: processed formula: A (G ((F ((p10 <= p118)) U G ((1 <= p93)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 29 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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p26 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p26 <= p30)))
lola: processed formula: A (F ((p26 <= p30)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p61 <= p33))) U F ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((p61 <= p33))) U F ((1 <= p1))))
lola: processed formula: A ((X (X ((p61 <= p33))) U F ((1 <= p1))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3168869 markings, 3168869 edges, 633774 markings/sec, 0 secs
lola: 6491170 markings, 6491170 edges, 664460 markings/sec, 5 secs
lola: 9796231 markings, 9796230 edges, 661012 markings/sec, 10 secs
lola: 13081031 markings, 13081030 edges, 656960 markings/sec, 15 secs
lola: 16319084 markings, 16319083 edges, 647611 markings/sec, 20 secs
lola: 19624691 markings, 19624691 edges, 661121 markings/sec, 25 secs
lola: 22859090 markings, 22859090 edges, 646880 markings/sec, 30 secs
lola: 26073691 markings, 26073690 edges, 642920 markings/sec, 35 secs
lola: 29272938 markings, 29272938 edges, 639849 markings/sec, 40 secs
lola: 32446715 markings, 32446714 edges, 634755 markings/sec, 45 secs
lola: 35664822 markings, 35664822 edges, 643621 markings/sec, 50 secs
lola: 37716750 markings, 37716749 edges, 410386 markings/sec, 55 secs
lola: 37719088 markings, 37719088 edges, 468 markings/sec, 60 secs
lola: 37720843 markings, 37720842 edges, 351 markings/sec, 65 secs
lola: 37722265 markings, 37722265 edges, 284 markings/sec, 70 secs
lola: 37722344 markings, 37722344 edges, 16 markings/sec, 75 secs
lola: 37725018 markings, 37725018 edges, 535 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p25 <= p89))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p25 <= p89)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.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: subprocess 5 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p121 <= p108))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p121 <= p108)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.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: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (X ((3 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F (X ((3 <= p11))))))
lola: processed formula: A (G (X (F (X ((3 <= p11))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3153446 markings, 3153446 edges, 630689 markings/sec, 0 secs
lola: 6481876 markings, 6481876 edges, 665686 markings/sec, 5 secs
lola: 9810284 markings, 9810283 edges, 665682 markings/sec, 10 secs
lola: 13089660 markings, 13089660 edges, 655875 markings/sec, 15 secs
lola: 16373578 markings, 16373577 edges, 656784 markings/sec, 20 secs
lola: 19725463 markings, 19725463 edges, 670377 markings/sec, 25 secs
lola: 22851447 markings, 22851447 edges, 625197 markings/sec, 30 secs
lola: 26142550 markings, 26142549 edges, 658221 markings/sec, 35 secs
lola: 29422525 markings, 29422524 edges, 655995 markings/sec, 40 secs
lola: 32636689 markings, 32636689 edges, 642833 markings/sec, 45 secs
lola: 35669063 markings, 35669063 edges, 606475 markings/sec, 50 secs
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: no no no unknown yes yes unknown
----- Kill lola and sara stderr -----
FORMULA Planning-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="Planning-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/Planning-PT-none.tgz
mv Planning-PT-none 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-structural"
echo " Input is Planning-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-smll-152732261900351"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;