fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r276-smll-165307353300365
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ViralEpidemic-PT-S04D1C1A04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
326.884 30387.00 40634.00 144.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353300365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ViralEpidemic-PT-S04D1C1A04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353300365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.8K Apr 29 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 12:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 09:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 11 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653224735018

Running Version 202205111006
[2022-05-22 13:05:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 13:05:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 13:05:37] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2022-05-22 13:05:38] [INFO ] Transformed 2047 places.
[2022-05-22 13:05:38] [INFO ] Transformed 3069 transitions.
[2022-05-22 13:05:38] [INFO ] Parsed PT model containing 2047 places and 3069 transitions in 774 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
// Phase 1: matrix 3069 rows 2047 cols
[2022-05-22 13:05:38] [INFO ] Computed 1 place invariants in 427 ms
Incomplete random walk after 10000 steps, including 77 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 16) seen :4
// Phase 1: matrix 3069 rows 2047 cols
[2022-05-22 13:05:41] [INFO ] Computed 1 place invariants in 259 ms
[2022-05-22 13:05:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 44 ms returned sat
[2022-05-22 13:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:43] [INFO ] [Real]Absence check using state equation in 786 ms returned unsat
[2022-05-22 13:05:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 37 ms returned sat
[2022-05-22 13:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:44] [INFO ] [Real]Absence check using state equation in 968 ms returned unsat
[2022-05-22 13:05:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 37 ms returned sat
[2022-05-22 13:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:46] [INFO ] [Real]Absence check using state equation in 1744 ms returned unsat
[2022-05-22 13:05:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 37 ms returned sat
[2022-05-22 13:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:48] [INFO ] [Real]Absence check using state equation in 1287 ms returned unsat
[2022-05-22 13:05:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 37 ms returned sat
[2022-05-22 13:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:49] [INFO ] [Real]Absence check using state equation in 1186 ms returned unsat
[2022-05-22 13:05:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 40 ms returned sat
[2022-05-22 13:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:51] [INFO ] [Real]Absence check using state equation in 1115 ms returned unsat
[2022-05-22 13:05:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 38 ms returned sat
[2022-05-22 13:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:52] [INFO ] [Real]Absence check using state equation in 873 ms returned unsat
[2022-05-22 13:05:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 36 ms returned sat
[2022-05-22 13:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:54] [INFO ] [Real]Absence check using state equation in 1325 ms returned unsat
[2022-05-22 13:05:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 57 ms returned sat
[2022-05-22 13:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:56] [INFO ] [Real]Absence check using state equation in 1319 ms returned unsat
[2022-05-22 13:05:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 59 ms returned sat
[2022-05-22 13:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:57] [INFO ] [Real]Absence check using state equation in 494 ms returned unsat
[2022-05-22 13:05:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 58 ms returned sat
[2022-05-22 13:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:58] [INFO ] [Real]Absence check using state equation in 529 ms returned unsat
[2022-05-22 13:05:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 58 ms returned sat
[2022-05-22 13:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:05:59] [INFO ] [Real]Absence check using state equation in 717 ms returned unsat
[2022-05-22 13:05:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 36 ms returned sat
[2022-05-22 13:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:06:00] [INFO ] [Real]Absence check using state equation in 1181 ms returned unsat
[2022-05-22 13:06:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 35 ms returned sat
[2022-05-22 13:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:06:02] [INFO ] [Real]Absence check using state equation in 872 ms returned unsat
[2022-05-22 13:06:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 53 ms returned sat
[2022-05-22 13:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:06:03] [INFO ] [Real]Absence check using state equation in 1366 ms returned unsat
[2022-05-22 13:06:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 59 ms returned sat
[2022-05-22 13:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 13:06:05] [INFO ] [Real]Absence check using state equation in 1000 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ViralEpidemic-PT-S04D1C1A04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 28142 ms.

BK_STOP 1653224765405

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ViralEpidemic-PT-S04D1C1A04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S04D1C1A04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-165307353300365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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