Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r280-smll-167863550300181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is NoC3x3-PT-5A, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-smll-167863550300181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 09:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 09:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 248K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1678913804577

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-5A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 20:56:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-15 20:56:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:56:48] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2023-03-15 20:56:48] [INFO ] Transformed 417 places.
[2023-03-15 20:56:48] [INFO ] Transformed 933 transitions.
[2023-03-15 20:56:48] [INFO ] Found NUPN structural information;
[2023-03-15 20:56:48] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 392 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 10 ms.27424KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 417/417 places, 933/933 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 338 transition count 744
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 338 transition count 744
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 162 place count 334 transition count 728
Iterating global reduction 0 with 4 rules applied. Total rules applied 166 place count 334 transition count 728
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 8 rules applied. Total rules applied 174 place count 334 transition count 720
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 192 place count 334 transition count 702
Reduce places removed 2 places and 0 transitions.
Computed a total of 8 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 194 place count 332 transition count 702
Computed a total of 8 stabilizing places and 1 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 330 transition count 696
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 330 transition count 696
Computed a total of 8 stabilizing places and 1 stable transitions
Computed a total of 8 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 329 transition count 695
Reduce places removed 7 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 206 place count 322 transition count 695
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 206 rules in 386 ms. Remains 322 /417 variables (removed 95) and now considering 695/933 (removed 238) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 388 ms. Remains : 322/417 places, 695/933 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3790 ms (no deadlock found). (steps per millisecond=329 )
Random directed walk for 1250000 steps, including 0 resets, run took 4310 ms (no deadlock found). (steps per millisecond=290 )
// Phase 1: matrix 695 rows 322 cols
[2023-03-15 20:56:56] [INFO ] Computed 57 place invariants in 25 ms
[2023-03-15 20:56:57] [INFO ] [Real]Absence check using 57 positive place invariants in 56 ms returned sat
[2023-03-15 20:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:56:58] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2023-03-15 20:56:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:56:58] [INFO ] [Nat]Absence check using 57 positive place invariants in 35 ms returned sat
[2023-03-15 20:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:56:59] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2023-03-15 20:56:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 20:56:59] [INFO ] [Nat]Added 18 Read/Feed constraints in 89 ms returned sat
[2023-03-15 20:56:59] [INFO ] Computed and/alt/rep : 630/2391/630 causal constraints (skipped 34 transitions) in 74 ms.
[2023-03-15 20:57:07] [INFO ] Added : 400 causal constraints over 80 iterations in 7621 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
Parikh directed walk for 92000 steps, including 653 resets, run took 781 ms. (steps per millisecond=117 )
Random directed walk for 500006 steps, including 0 resets, run took 2129 ms (no deadlock found). (steps per millisecond=234 )
Random walk for 500000 steps, including 0 resets, run took 1811 ms (no deadlock found). (steps per millisecond=276 )
Random directed walk for 500000 steps, including 0 resets, run took 2156 ms (no deadlock found). (steps per millisecond=231 )
Random walk for 500000 steps, including 0 resets, run took 1660 ms (no deadlock found). (steps per millisecond=301 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 322/322 places, 695/695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 23 ms. Remains 322 /322 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2023-03-15 20:57:16] [INFO ] Invariant cache hit.
[2023-03-15 20:57:16] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-15 20:57:16] [INFO ] Invariant cache hit.
[2023-03-15 20:57:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 20:57:17] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-03-15 20:57:17] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-15 20:57:17] [INFO ] Invariant cache hit.
[2023-03-15 20:57:18] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1972 ms. Remains : 322/322 places, 695/695 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3248 ms (no deadlock found). (steps per millisecond=384 )
Random directed walk for 1250008 steps, including 0 resets, run took 5117 ms (no deadlock found). (steps per millisecond=244 )
[2023-03-15 20:57:26] [INFO ] Invariant cache hit.
[2023-03-15 20:57:26] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-15 20:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:57:27] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-15 20:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:57:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 39 ms returned sat
[2023-03-15 20:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:57:28] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-15 20:57:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-15 20:57:29] [INFO ] [Nat]Added 18 Read/Feed constraints in 240 ms returned sat
[2023-03-15 20:57:29] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-15 20:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-15 20:57:29] [INFO ] Computed and/alt/rep : 630/2391/630 causal constraints (skipped 34 transitions) in 91 ms.
[2023-03-15 20:57:36] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2023-03-15 20:57:36] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2023-03-15 20:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-03-15 20:57:36] [INFO ] Added : 441 causal constraints over 89 iterations in 7694 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Parikh directed walk for 104900 steps, including 634 resets, run took 597 ms. (steps per millisecond=175 )
Random directed walk for 500001 steps, including 0 resets, run took 1482 ms (no deadlock found). (steps per millisecond=337 )
Random walk for 500000 steps, including 0 resets, run took 1313 ms (no deadlock found). (steps per millisecond=380 )
Random directed walk for 500003 steps, including 0 resets, run took 1598 ms (no deadlock found). (steps per millisecond=312 )
Random walk for 500000 steps, including 0 resets, run took 1081 ms (no deadlock found). (steps per millisecond=462 )
[2023-03-15 20:57:43] [INFO ] Flatten gal took : 180 ms
[2023-03-15 20:57:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2023-03-15 20:57:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 417 places, 933 transitions and 3585 arcs took 9 ms.
Total runtime 55720 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: NoC3x3_PT_5A
(NrP: 417 NrTr: 933 NrArc: 3585)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.045sec

net check time: 0m 0.000sec

init dd package: 0m 3.461sec


before gc: list nodes free: 1557488

after gc: idd nodes used:15662, unused:63984338; list nodes free:270460587
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 6545156 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16152956 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec

2319 2436 2440 2343 2504 2725 2643 2736 2861 2841 2806 3159 3319 3378 3468 3696 3792 3639 3451 3638 3495 4054 3839 3665 3666 3601 3527 3708 3711 3830 3902 3926 4251 4306 4600 4206 4662 4306 4402 4600 4506 4425 4479 4451 8285 13921 13711 8649 15578 16251 16120 28460 27421 36178 55319 46375 37025 52774 43969 55693 56043 52196 81889 108060 95756 74225 80490

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="NoC3x3-PT-5A"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is NoC3x3-PT-5A, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-smll-167863550300181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5A.tgz
mv NoC3x3-PT-5A execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;