fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r345-tall-167889216500006
Last Updated
May 14, 2023

About the Execution of Smart+red for RERS17pb113-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2323.867 1800000.00 1837518.00 22020.20 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r345-tall-167889216500006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is RERS17pb113-PT-2, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r345-tall-167889216500006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679120804904

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb113-PT-2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 06:26:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 06:26:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:26:47] [INFO ] Load time of PNML (sax parser for PT used): 639 ms
[2023-03-18 06:26:47] [INFO ] Transformed 639 places.
[2023-03-18 06:26:47] [INFO ] Transformed 31353 transitions.
[2023-03-18 06:26:47] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 869 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 23 ms.108419KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
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 13 rules in 910 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 916 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 1112960 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=37 )
[2023-03-18 06:27:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-18 06:27:19] [INFO ] Computed 13 place invariants in 108 ms
[2023-03-18 06:27:22] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-18 06:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:38] [INFO ] [Real]Absence check using state equation in 15807 ms returned sat
[2023-03-18 06:27:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:27:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-18 06:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:59] [INFO ] [Nat]Absence check using state equation in 16854 ms returned sat
[2023-03-18 06:27:59] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:28:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:28:05] [INFO ] [Nat]Added 268 Read/Feed constraints in 5925 ms returned sat
[2023-03-18 06:28:07] [INFO ] Deduced a trap composed of 24 places in 1262 ms of which 6 ms to minimize.
[2023-03-18 06:28:08] [INFO ] Deduced a trap composed of 65 places in 1259 ms of which 1 ms to minimize.
[2023-03-18 06:28:10] [INFO ] Deduced a trap composed of 40 places in 1255 ms of which 2 ms to minimize.
[2023-03-18 06:28:12] [INFO ] Deduced a trap composed of 64 places in 1353 ms of which 6 ms to minimize.
[2023-03-18 06:28:14] [INFO ] Deduced a trap composed of 48 places in 1516 ms of which 1 ms to minimize.
[2023-03-18 06:28:15] [INFO ] Deduced a trap composed of 64 places in 1377 ms of which 0 ms to minimize.
[2023-03-18 06:28:17] [INFO ] Deduced a trap composed of 40 places in 1238 ms of which 1 ms to minimize.
[2023-03-18 06:28:19] [INFO ] Deduced a trap composed of 40 places in 1224 ms of which 1 ms to minimize.
[2023-03-18 06:28:20] [INFO ] Deduced a trap composed of 48 places in 1418 ms of which 1 ms to minimize.
[2023-03-18 06:28:22] [INFO ] Deduced a trap composed of 64 places in 1707 ms of which 0 ms to minimize.
[2023-03-18 06:28:24] [INFO ] Deduced a trap composed of 40 places in 1523 ms of which 0 ms to minimize.
[2023-03-18 06:28:26] [INFO ] Deduced a trap composed of 40 places in 946 ms of which 0 ms to minimize.
[2023-03-18 06:28:27] [INFO ] Deduced a trap composed of 40 places in 751 ms of which 1 ms to minimize.
[2023-03-18 06:28:29] [INFO ] Deduced a trap composed of 64 places in 1418 ms of which 1 ms to minimize.
[2023-03-18 06:28:31] [INFO ] Deduced a trap composed of 64 places in 1326 ms of which 1 ms to minimize.
[2023-03-18 06:28:32] [INFO ] Deduced a trap composed of 48 places in 631 ms of which 0 ms to minimize.
[2023-03-18 06:28:34] [INFO ] Deduced a trap composed of 64 places in 953 ms of which 0 ms to minimize.
[2023-03-18 06:28:35] [INFO ] Deduced a trap composed of 48 places in 721 ms of which 0 ms to minimize.
[2023-03-18 06:28:36] [INFO ] Deduced a trap composed of 64 places in 745 ms of which 1 ms to minimize.
[2023-03-18 06:28:38] [INFO ] Deduced a trap composed of 48 places in 728 ms of which 0 ms to minimize.
[2023-03-18 06:28:39] [INFO ] Deduced a trap composed of 64 places in 548 ms of which 1 ms to minimize.
[2023-03-18 06:28:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 36345 ms
[2023-03-18 06:28:44] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2429 ms.
[2023-03-18 06:28:46] [INFO ] Added : 1 causal constraints over 1 iterations in 4304 ms. Result :sat
Interrupted Parikh directed walk after 44100 steps, including 44100 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 44100 steps, including 44100 resets, run took 30001 ms. (steps per millisecond=1 )
Random directed walk for 500001 steps, including 0 resets, run took 18898 ms (no deadlock found). (steps per millisecond=26 )
Random walk for 500000 steps, including 0 resets, run took 12576 ms (no deadlock found). (steps per millisecond=39 )
Random directed walk for 500009 steps, including 0 resets, run took 18698 ms (no deadlock found). (steps per millisecond=26 )
Random walk for 500000 steps, including 0 resets, run took 13059 ms (no deadlock found). (steps per millisecond=38 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 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 260 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-18 06:30:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:20] [INFO ] Invariant cache hit.
[2023-03-18 06:30:22] [INFO ] Implicit Places using invariants in 1857 ms returned []
Implicit Place search using SMT only with invariants took 1859 ms to find 0 implicit places.
[2023-03-18 06:30:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:22] [INFO ] Invariant cache hit.
[2023-03-18 06:30:30] [INFO ] Dead Transitions using invariants and state equation in 8195 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 10317 ms. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 1121704 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=37 )
[2023-03-18 06:31:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:31:00] [INFO ] Invariant cache hit.
[2023-03-18 06:31:03] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-18 06:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:19] [INFO ] [Real]Absence check using state equation in 15995 ms returned sat
[2023-03-18 06:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:31:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-18 06:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:39] [INFO ] [Nat]Absence check using state equation in 16276 ms returned sat
[2023-03-18 06:31:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:31:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:31:43] [INFO ] [Nat]Added 268 Read/Feed constraints in 3730 ms returned sat
[2023-03-18 06:31:45] [INFO ] Deduced a trap composed of 48 places in 1394 ms of which 0 ms to minimize.
[2023-03-18 06:31:47] [INFO ] Deduced a trap composed of 48 places in 1554 ms of which 1 ms to minimize.
[2023-03-18 06:31:49] [INFO ] Deduced a trap composed of 40 places in 1380 ms of which 1 ms to minimize.
[2023-03-18 06:31:50] [INFO ] Deduced a trap composed of 48 places in 1474 ms of which 0 ms to minimize.
[2023-03-18 06:31:53] [INFO ] Deduced a trap composed of 64 places in 1937 ms of which 1 ms to minimize.
[2023-03-18 06:31:55] [INFO ] Deduced a trap composed of 40 places in 1943 ms of which 1 ms to minimize.
[2023-03-18 06:31:57] [INFO ] Deduced a trap composed of 24 places in 1584 ms of which 1 ms to minimize.
[2023-03-18 06:31:59] [INFO ] Deduced a trap composed of 40 places in 1271 ms of which 1 ms to minimize.
[2023-03-18 06:32:00] [INFO ] Deduced a trap composed of 48 places in 1181 ms of which 1 ms to minimize.
[2023-03-18 06:32:02] [INFO ] Deduced a trap composed of 48 places in 1081 ms of which 0 ms to minimize.
[2023-03-18 06:32:03] [INFO ] Deduced a trap composed of 64 places in 990 ms of which 0 ms to minimize.
[2023-03-18 06:32:05] [INFO ] Deduced a trap composed of 40 places in 999 ms of which 0 ms to minimize.
[2023-03-18 06:32:06] [INFO ] Deduced a trap composed of 64 places in 1277 ms of which 1 ms to minimize.
[2023-03-18 06:32:08] [INFO ] Deduced a trap composed of 64 places in 1035 ms of which 3 ms to minimize.
[2023-03-18 06:32:10] [INFO ] Deduced a trap composed of 40 places in 852 ms of which 0 ms to minimize.
[2023-03-18 06:32:11] [INFO ] Deduced a trap composed of 40 places in 715 ms of which 0 ms to minimize.
[2023-03-18 06:32:14] [INFO ] Deduced a trap composed of 64 places in 945 ms of which 1 ms to minimize.
[2023-03-18 06:32:15] [INFO ] Deduced a trap composed of 64 places in 904 ms of which 1 ms to minimize.
[2023-03-18 06:32:16] [INFO ] Deduced a trap composed of 65 places in 487 ms of which 0 ms to minimize.
[2023-03-18 06:32:17] [INFO ] Deduced a trap composed of 64 places in 715 ms of which 1 ms to minimize.
[2023-03-18 06:32:18] [INFO ] Deduced a trap composed of 64 places in 586 ms of which 0 ms to minimize.
[2023-03-18 06:32:19] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 35833 ms
[2023-03-18 06:32:21] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2196 ms.
[2023-03-18 06:32:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3395 ms. Result :sat
Parikh directed walk for 362800 steps, including 1000 resets, run took 11094 ms. (steps per millisecond=32 )
Random directed walk for 500002 steps, including 0 resets, run took 19069 ms (no deadlock found). (steps per millisecond=26 )
Random walk for 500000 steps, including 0 resets, run took 12893 ms (no deadlock found). (steps per millisecond=38 )
Random directed walk for 500010 steps, including 0 resets, run took 19107 ms (no deadlock found). (steps per millisecond=26 )
Random walk for 500000 steps, including 0 resets, run took 13322 ms (no deadlock found). (steps per millisecond=37 )
[2023-03-18 06:33:40] [INFO ] Flatten gal took : 1008 ms
[2023-03-18 06:33:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 3 ms.
[2023-03-18 06:33:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 639 places, 31353 transitions and 125418 arcs took 87 ms.
Total runtime 413432 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running RERS17pb113 (PT), instance 2
Examination ReachabilityDeadlock
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/DeadlockParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 639 places, 31353 transitions, 125418 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15487428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16111544 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="RERS17pb113-PT-2"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is RERS17pb113-PT-2, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r345-tall-167889216500006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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