fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r586-smll-171734923700037
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MedleyA-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
603.436 40814.00 61093.00 320.20 F normal

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-171734923700037.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-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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 1717351911907

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:11:54] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-06-02 18:11:54] [INFO ] Transformed 147 places.
[2024-06-02 18:11:54] [INFO ] Transformed 312 transitions.
[2024-06-02 18:11:54] [INFO ] Found NUPN structural information;
[2024-06-02 18:11:55] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 446 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 145 transition count 289
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 122 transition count 283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 122 transition count 281
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 120 transition count 281
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 138 place count 80 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 80 transition count 239
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 178 place count 61 transition count 352
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 207 place count 61 transition count 323
Applied a total of 207 rules in 198 ms. Remains 61 /147 variables (removed 86) and now considering 323/312 (removed -11) transitions.
[2024-06-02 18:11:55] [INFO ] Flow matrix only has 271 transitions (discarded 52 similar events)
// Phase 1: matrix 271 rows 61 cols
[2024-06-02 18:11:55] [INFO ] Computed 10 invariants in 31 ms
[2024-06-02 18:11:55] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-02 18:11:55] [INFO ] Flow matrix only has 271 transitions (discarded 52 similar events)
[2024-06-02 18:11:55] [INFO ] Invariant cache hit.
[2024-06-02 18:11:56] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-06-02 18:11:56] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 18:11:56] [INFO ] Flow matrix only has 271 transitions (discarded 52 similar events)
[2024-06-02 18:11:56] [INFO ] Invariant cache hit.
[2024-06-02 18:11:56] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/61 variables, 4/70 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/71 constraints. Problems are: Problem set: 56 solved, 259 unsolved
[2024-06-02 18:12:01] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/72 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 271/332 variables, 61/133 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 128/261 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/261 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/261 constraints. Problems are: Problem set: 56 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 261 constraints, problems are : Problem set: 56 solved, 259 unsolved in 15269 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 56 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 6/66 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/66 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 4/70 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/71 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/72 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 271/332 variables, 61/133 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 128/261 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 259/520 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/520 constraints. Problems are: Problem set: 56 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/520 constraints. Problems are: Problem set: 56 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 520 constraints, problems are : Problem set: 56 solved, 259 unsolved in 19413 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 259/315 constraints, Known Traps: 1/1 constraints]
After SMT, in 36230ms problems are : Problem set: 56 solved, 259 unsolved
Search for dead transitions found 56 dead transitions in 36281ms
Found 56 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 38197 ms.
ITS solved all properties within timeout

BK_STOP 1717351952721

--------------------
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-08"
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-08, 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-171734923700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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