About the Execution of ITS-Tools for SupplyChain-PT-00200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 557.659 | 43077.00 | 62824.00 | 218.40 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r360-tall-178024403900131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is SupplyChain-PT-00200, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r360-tall-178024403900131
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 27 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 820K May 26 18:17 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 1780293545840
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SupplyChain-PT-00200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202604301425
[2026-06-01 05:59:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-01 05:59:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 05:59:07] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2026-06-01 05:59:07] [INFO ] Transformed 2604 places.
[2026-06-01 05:59:07] [INFO ] Transformed 1603 transitions.
[2026-06-01 05:59:07] [INFO ] Parsed PT model containing 2604 places and 1603 transitions and 7206 arcs in 253 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 18 ms.9184KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2604/2604 places, 1603/1603 transitions.
Computed a total of 2604 stabilizing places and 1602 stable transitions
Ensure Unique test removed 690 places
Computed a total of 1914 stabilizing places and 1602 stable transitions
Iterating post reduction 0 with 690 rules applied. Total rules applied 690 place count 1914 transition count 1603
Computed a total of 1914 stabilizing places and 1602 stable transitions
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 690 place count 1914 transition count 1403
Deduced a syphon composed of 200 places in 3 ms
Ensure Unique test removed 200 places
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 1 with 600 rules applied. Total rules applied 1290 place count 1514 transition count 1403
Computed a total of 1514 stabilizing places and 1402 stable transitions
Computed a total of 1514 stabilizing places and 1402 stable transitions
Reduce places removed 200 places and 200 transitions.
Iterating global reduction 1 with 200 rules applied. Total rules applied 1490 place count 1314 transition count 1203
Computed a total of 1314 stabilizing places and 1202 stable transitions
Computed a total of 1314 stabilizing places and 1202 stable transitions
Applied a total of 1490 rules in 468 ms. Remains 1314 /2604 variables (removed 1290) and now considering 1203/1603 (removed 400) transitions.
Running 803 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-177132022600127775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6412181757722369230.kers'
[2026-06-01 05:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-177132022600127775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6412181757722369230.kers]
Normalized transition count is 1202 out of 1203 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1202 rows 1314 cols 3404 entries
Finished phase 1 with 912 SingleSign rule and 0 generalized
[2026-06-01 05:59:07] [INFO ] Computed 402 invariants in 6 ms
Computed 402 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6412181757722369230.kers
Total runtime 8 ms.
[2026-06-01 05:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1114 variables, 202/202 constraints. Problems are: Problem set: 110 solved, 693 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD791 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/2517 variables, and 204 constraints, problems are : Problem set: 199 solved, 604 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 202/402 constraints, State Equation: 0/1314 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 803/802 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 199 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 2/2 constraints. Problems are: Problem set: 199 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/806 variables, 1/3 constraints. Problems are: Problem set: 199 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 0/3 constraints. Problems are: Problem set: 199 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 508/1314 variables, 400/403 constraints. Problems are: Problem set: 199 solved, 604 unsolved
Problem TDEAD557 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 1/404 constraints. Problems are: Problem set: 200 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/2517 variables, and 404 constraints, problems are : Problem set: 200 solved, 603 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 402/402 constraints, State Equation: 0/1314 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/802 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40842ms problems are : Problem set: 200 solved, 603 unsolved
Search for dead transitions found 200 dead transitions in 40871ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 200 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 1314/2604 places, 1003/1603 transitions.
Computed a total of 1314 stabilizing places and 1002 stable transitions
Graph (complete) has 1894 edges and 1314 vertex of which 1004 are kept as prefixes of interest. Removing 310 places using SCC suffix rule.4 ms
Discarding 310 places :
Also discarding 0 output transitions
Computed a total of 1004 stabilizing places and 1002 stable transitions
Computed a total of 1004 stabilizing places and 1002 stable transitions
Applied a total of 1 rules in 76 ms. Remains 1004 /1314 variables (removed 310) and now considering 1003/1003 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 41475 ms. Remains : 1004/2604 places, 1003/1603 transitions.
Finished random walk after 409 steps, including 0 resets, run found a deadlock after 21 ms. (steps per millisecond=19 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 41851 ms.
BK_STOP 1780293588917
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="SupplyChain-PT-00200"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is SupplyChain-PT-00200, 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 r360-tall-178024403900131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00200.tgz
mv SupplyChain-PT-00200 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.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 '
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 ;
