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

About the Execution of LTSMin+red for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15787.563 140018.00 202946.00 79.60 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.r518-tajo-171654455800199.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 ltsminxred
Input is PolyORBLF-PT-S06J04T04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455800199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 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 6.8M 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 1717269818188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:23:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:23:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:23:39] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2024-06-01 19:23:39] [INFO ] Transformed 454 places.
[2024-06-01 19:23:40] [INFO ] Transformed 6994 transitions.
[2024-06-01 19:23:40] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 566 ms.
Discarding 5380 transitions out of 6994. Remains 1614
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Built sparse matrix representations for Structural reductions in 11 ms.52151KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 454/454 places, 1614/1614 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 108 ms. Remains 454 /454 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 19:23:40] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-06-01 19:23:40] [INFO ] Computed 50 invariants in 89 ms
[2024-06-01 19:23:40] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 107 places in 672 ms of which 49 ms to minimize.
[2024-06-01 19:24:12] [INFO ] Deduced a trap composed of 11 places in 491 ms of which 2 ms to minimize.
[2024-06-01 19:24:12] [INFO ] Deduced a trap composed of 210 places in 302 ms of which 3 ms to minimize.
[2024-06-01 19:24:13] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 4 ms to minimize.
[2024-06-01 19:24:13] [INFO ] Deduced a trap composed of 203 places in 298 ms of which 6 ms to minimize.
[2024-06-01 19:24:14] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2044 variables, and 43 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20107 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 91 places in 322 ms of which 2 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 3 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 0 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:24:25] [INFO ] Deduced a trap composed of 192 places in 263 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2044 variables, and 50 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 13/13 constraints]
After SMT, in 56931ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 56980ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 57138 ms. Remains : 454/454 places, 1614/1614 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 454/454 places, 1614/1614 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 114 ms. Remains 454 /454 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-06-01 19:24:37] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 19:24:37] [INFO ] Invariant cache hit.
[2024-06-01 19:24:38] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-06-01 19:24:38] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 19:24:38] [INFO ] Invariant cache hit.
[2024-06-01 19:24:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 19:24:39] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-06-01 19:24:39] [INFO ] Redundant transitions in 103 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-06-01 19:24:39] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 19:24:39] [INFO ] Invariant cache hit.
[2024-06-01 19:24:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 3 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 107 places in 235 ms of which 2 ms to minimize.
[2024-06-01 19:25:09] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2024-06-01 19:25:10] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 2 ms to minimize.
[2024-06-01 19:25:10] [INFO ] Deduced a trap composed of 211 places in 249 ms of which 2 ms to minimize.
[2024-06-01 19:25:10] [INFO ] Deduced a trap composed of 212 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:25:10] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2024-06-01 19:25:11] [INFO ] Deduced a trap composed of 206 places in 271 ms of which 2 ms to minimize.
[2024-06-01 19:25:15] [INFO ] Deduced a trap composed of 210 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 82 places in 227 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2044 variables, and 47 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 19:25:31] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:25:32] [INFO ] Deduced a trap composed of 189 places in 330 ms of which 3 ms to minimize.
[2024-06-01 19:25:33] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:25:33] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:25:40] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2044 variables, and 52 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 15/15 constraints]
After SMT, in 78488ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 78513ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 80408 ms. Remains : 454/454 places, 1614/1614 transitions.
Finished random walk after 7 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=3 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 138626 ms.
ITS solved all properties within timeout

BK_STOP 1717269958206

--------------------
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-S06J04T04"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r518-tajo-171654455800199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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