fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r298-tajo-171654455000174
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S04J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9059.604 124441.00 172140.00 151.30 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455000174.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.3M May 18 16:43 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 Liveness

=== Now, execution of the tool begins

BK_START 1717103965546

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:19:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:19:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:19:27] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-05-30 21:19:27] [INFO ] Transformed 712 places.
[2024-05-30 21:19:27] [INFO ] Transformed 4012 transitions.
[2024-05-30 21:19:27] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 451 ms.
Discarding 2168 transitions out of 4012. Remains 1844
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Built sparse matrix representations for Structural reductions in 14 ms.30809KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 126 ms. Remains 712 /712 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-30 21:19:28] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2024-05-30 21:19:28] [INFO ] Computed 54 invariants in 119 ms
[2024-05-30 21:19:28] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-30 21:19:56] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20112 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-30 21:19:59] [INFO ] Deduced a trap composed of 41 places in 423 ms of which 4 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 5 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 2 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-30 21:20:00] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-30 21:20:02] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-30 21:20:07] [INFO ] Deduced a trap composed of 146 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 51 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 10/10 constraints]
After SMT, in 48692ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48748ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 48926 ms. Remains : 712/712 places, 1844/1844 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 100 ms. Remains 712 /712 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
[2024-05-30 21:20:16] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-30 21:20:16] [INFO ] Invariant cache hit.
[2024-05-30 21:20:17] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-30 21:20:17] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-30 21:20:17] [INFO ] Invariant cache hit.
[2024-05-30 21:20:18] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-30 21:20:19] [INFO ] Implicit Places using invariants and state equation in 2550 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2024-05-30 21:20:19] [INFO ] Redundant transitions in 158 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-30 21:20:19] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-30 21:20:19] [INFO ] Invariant cache hit.
[2024-05-30 21:20:19] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-30 21:20:49] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-30 21:20:59] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 43 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-30 21:21:12] [INFO ] Deduced a trap composed of 61 places in 453 ms of which 3 ms to minimize.
[2024-05-30 21:21:12] [INFO ] Deduced a trap composed of 41 places in 455 ms of which 3 ms to minimize.
[2024-05-30 21:21:12] [INFO ] Deduced a trap composed of 75 places in 346 ms of which 4 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 4 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 2 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-30 21:21:13] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-30 21:21:17] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 3 ms to minimize.
[2024-05-30 21:21:17] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-30 21:21:17] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 55 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 14/14 constraints]
After SMT, in 69948ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 69979ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 72973 ms. Remains : 712/712 places, 1844/1844 transitions.
Finished random walk after 14296 steps, including 0 resets, run found a deadlock after 86 ms. (steps per millisecond=166 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 122842 ms.
ITS solved all properties within timeout

BK_STOP 1717104089987

--------------------
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 Liveness -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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-PT-S04J04T08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455000174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;