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.r028-smll-174853774400002.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 BlocksWorld-PT-01, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774400002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K 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 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 87K May 29 14:32 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 1748541690285

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:01:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:01:33] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2025-05-29 18:01:33] [INFO ] Transformed 109 places.
[2025-05-29 18:01:33] [INFO ] Transformed 181 transitions.
[2025-05-29 18:01:33] [INFO ] Found NUPN structural information;
[2025-05-29 18:01:33] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2025-05-29 18:01:33] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 445 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 26 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2025-05-29 18:01:33] [INFO ] Computed 19 invariants in 22 ms
[2025-05-29 18:01:34] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-05-29 18:01:34] [INFO ] Invariant cache hit.
[2025-05-29 18:01:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-29 18:01:34] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-29 18:01:34] [INFO ] Invariant cache hit.
[2025-05-29 18:01:34] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2025-05-29 18:01:36] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 28 ms to minimize.
[2025-05-29 18:01:37] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2025-05-29 18:01:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/109 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:01:39] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
[2025-05-29 18:01:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2025-05-29 18:01:40] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:01:40] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 180/289 variables, 109/135 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 14/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/290 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 150 constraints, problems are : Problem set: 18 solved, 161 unsolved in 13207 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:01:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 180/289 variables, 109/136 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 14/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 161/311 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:01:53] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2025-05-29 18:01:53] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 3 ms to minimize.
[2025-05-29 18:01:53] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 5 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2025-05-29 18:01:54] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-05-29 18:01:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-05-29 18:01:56] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 3 ms to minimize.
[2025-05-29 18:01:56] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2025-05-29 18:01:56] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/331 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:01:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2025-05-29 18:01:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2025-05-29 18:01:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-05-29 18:01:59] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2025-05-29 18:01:59] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-29 18:01:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
[2025-05-29 18:02:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2025-05-29 18:02:00] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/339 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:02:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2025-05-29 18:02:03] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2025-05-29 18:02:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-05-29 18:02:05] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:02:07] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2025-05-29 18:02:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2025-05-29 18:02:08] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/346 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:02:12] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2025-05-29 18:02:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/348 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2025-05-29 18:02:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2025-05-29 18:02:18] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 350 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 47/47 constraints]
After SMT, in 44337ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 44371ms
Found 18 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 46227 ms.
ITS solved all properties within timeout

BK_STOP 1748541739042

--------------------
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="BlocksWorld-PT-01"
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 BlocksWorld-PT-01, 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 r028-smll-174853774400002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-01.tgz
mv BlocksWorld-PT-01 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 ;