Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902009900257.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SieveSingleMsgMbox-PT-d1m06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009900257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K May 29 14:33 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749107272139

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:07:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:07:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:07:53] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-05 07:07:53] [INFO ] Transformed 1295 places.
[2025-06-05 07:07:53] [INFO ] Transformed 749 transitions.
[2025-06-05 07:07:53] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 203 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1295/1295 places, 749/749 transitions.
Reduce places removed 1053 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 1293 rules applied. Total rules applied 1293 place count 242 transition count 509
Applied a total of 1293 rules in 36 ms. Remains 242 /1295 variables (removed 1053) and now considering 509/749 (removed 240) transitions.
// Phase 1: matrix 509 rows 242 cols
[2025-06-05 07:07:53] [INFO ] Computed 5 invariants in 28 ms
[2025-06-05 07:07:54] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-06-05 07:07:54] [INFO ] Invariant cache hit.
[2025-06-05 07:07:54] [INFO ] State equation strengthened by 347 read => feed constraints.
[2025-06-05 07:07:55] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2025-06-05 07:07:55] [INFO ] Invariant cache hit.
[2025-06-05 07:07:55] [INFO ] State equation strengthened by 347 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/242 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-06-05 07:08:03] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 14 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 119 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:08:05] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:08:06] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-06-05 07:08:07] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:08:07] [INFO ] Deduced a trap composed of 98 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 2 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:08:09] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:08:10] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:08:10] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 3 ms to minimize.
[2025-06-05 07:08:10] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:08:10] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:08:10] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 509/751 variables, 242/285 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 347/632 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2025-06-05 07:08:20] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:08:20] [INFO ] Deduced a trap composed of 95 places in 42 ms of which 2 ms to minimize.
[2025-06-05 07:08:20] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 3/635 constraints. Problems are: Problem set: 3 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 635 constraints, problems are : Problem set: 3 solved, 505 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 3 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 7/8 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 4/242 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 34/46 constraints. Problems are: Problem set: 3 solved, 505 unsolved
[2025-06-05 07:08:31] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:08:31] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:08:31] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 3/49 constraints. Problems are: Problem set: 3 solved, 505 unsolved
[2025-06-05 07:08:31] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 505 unsolved
[2025-06-05 07:08:36] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:08:36] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:08:36] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 3/53 constraints. Problems are: Problem set: 3 solved, 505 unsolved
[2025-06-05 07:08:38] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:08:39] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/55 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 11 (OVERLAPS) 509/751 variables, 242/297 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 347/644 constraints. Problems are: Problem set: 3 solved, 505 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 505/1149 constraints. Problems are: Problem set: 3 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 1149 constraints, problems are : Problem set: 3 solved, 505 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 505/508 constraints, Known Traps: 50/50 constraints]
After SMT, in 61344ms problems are : Problem set: 3 solved, 505 unsolved
Search for dead transitions found 3 dead transitions in 61363ms
Found 3 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 63097 ms.
ITS solved all properties within timeout

BK_STOP 1749107336657

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="SieveSingleMsgMbox-PT-d1m06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SieveSingleMsgMbox-PT-d1m06, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009900257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m06.tgz
mv SieveSingleMsgMbox-PT-d1m06 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;