Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r586-smll-171734923700052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is MedleyA-PT-11, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923700052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16: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 1717352089865

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:53] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-06-02 18:14:53] [INFO ] Transformed 150 places.
[2024-06-02 18:14:53] [INFO ] Transformed 478 transitions.
[2024-06-02 18:14:53] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:53] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 554 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 150/150 places, 478/478 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 150 transition count 469
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 145 transition count 464
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 1 with 46 rules applied. Total rules applied 65 place count 122 transition count 568
Applied a total of 65 rules in 150 ms. Remains 122 /150 variables (removed 28) and now considering 568/478 (removed -90) transitions.
[2024-06-02 18:14:53] [INFO ] Flow matrix only has 496 transitions (discarded 72 similar events)
// Phase 1: matrix 496 rows 122 cols
[2024-06-02 18:14:53] [INFO ] Computed 23 invariants in 42 ms
[2024-06-02 18:14:54] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-02 18:14:54] [INFO ] Flow matrix only has 496 transitions (discarded 72 similar events)
[2024-06-02 18:14:54] [INFO ] Invariant cache hit.
[2024-06-02 18:14:54] [INFO ] State equation strengthened by 243 read => feed constraints.
[2024-06-02 18:14:55] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-06-02 18:14:55] [INFO ] Flow matrix only has 496 transitions (discarded 72 similar events)
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
[2024-06-02 18:14:55] [INFO ] State equation strengthened by 243 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/122 variables, 9/144 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/145 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:06] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 40 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 5 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-06-02 18:15:07] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 15/160 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:11] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:15:11] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/162 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:15] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/163 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:17] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/164 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/164 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 10 (OVERLAPS) 496/618 variables, 122/286 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 243/529 constraints. Problems are: Problem set: 108 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/618 variables, and 529 constraints, problems are : Problem set: 108 solved, 452 unsolved in 30043 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/122 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 108 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 14/135 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/135 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 9/144 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/145 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 19/164 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 4/168 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/168 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 8 (OVERLAPS) 496/618 variables, 122/290 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 243/533 constraints. Problems are: Problem set: 108 solved, 452 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 452/985 constraints. Problems are: Problem set: 108 solved, 452 unsolved
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-06-02 18:15:55] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:15:56] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 2 ms to minimize.
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
SMT process timed out in 62086ms, After SMT, problems are : Problem set: 108 solved, 452 unsolved
Search for dead transitions found 108 dead transitions in 62145ms
Found 108 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 64686 ms.
ITS solved all properties within timeout

BK_STOP 1717352157341

--------------------
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="MedleyA-PT-11"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-11, 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 r586-smll-171734923700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-11.tgz
mv MedleyA-PT-11 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;