fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143600267
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P50N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
719.136 59672.00 80816.00 197.80 50 1 1 1 50 1 50 50 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 '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143600267.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P50N50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143600267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 538K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.1K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 182K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 519K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 23 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 23 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 146K Mar 22 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Mar 22 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.0M May 5 16:51 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 BridgeAndVehicles-PT-V50P50N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620535089724

Running Version 0
[2021-05-09 04:38:12] [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]
[2021-05-09 04:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 04:38:13] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2021-05-09 04:38:13] [INFO ] Transformed 168 places.
[2021-05-09 04:38:13] [INFO ] Transformed 5408 transitions.
[2021-05-09 04:38:13] [INFO ] Parsed PT model containing 168 places and 5408 transitions in 495 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 85 ms.
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 410 out of 5408 initially.
// Phase 1: matrix 410 rows 168 cols
[2021-05-09 04:38:13] [INFO ] Computed 7 place invariants in 50 ms
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 12) seen :114
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :51
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :3
[2021-05-09 04:38:14] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2021-05-09 04:38:14] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-09 04:38:14] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-09 04:38:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-09 04:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 04:38:15] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-09 04:38:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 04:38:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-09 04:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 04:38:15] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2021-05-09 04:38:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-09 04:38:15] [INFO ] [Nat]Added 102 Read/Feed constraints in 66 ms returned sat
[2021-05-09 04:38:16] [INFO ] Deduced a trap composed of 54 places in 805 ms of which 3 ms to minimize.
[2021-05-09 04:38:17] [INFO ] Deduced a trap composed of 5 places in 731 ms of which 1 ms to minimize.
[2021-05-09 04:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1657 ms
[2021-05-09 04:38:17] [INFO ] Computed and/alt/rep : 150/298/150 causal constraints (skipped 257 transitions) in 341 ms.
[2021-05-09 04:38:18] [INFO ] Added : 147 causal constraints over 30 iterations in 1244 ms. Result :sat
Minimization took 250 ms.
[2021-05-09 04:38:18] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 50, 1] Max seen :[1, 49, 1]
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1474300 steps, including 4273 resets, run finished after 26277 ms. (steps per millisecond=56 ) properties (out of 1) seen :48 could not realise parikh vector
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 1542 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 5407
Applied a total of 3 rules in 1336 ms. Remains 165 /168 variables (removed 3) and now considering 5407/5408 (removed 1) transitions.
[2021-05-09 04:38:46] [INFO ] Flow matrix only has 409 transitions (discarded 4998 similar events)
// Phase 1: matrix 409 rows 165 cols
[2021-05-09 04:38:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 04:38:48] [INFO ] Dead Transitions using invariants and state equation in 1791 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/168 places, 5407/5408 transitions.
Normalized transition count is 409 out of 5407 initially.
// Phase 1: matrix 409 rows 165 cols
[2021-05-09 04:38:48] [INFO ] Computed 5 place invariants in 9 ms
Incomplete random walk after 1000003 steps, including 2733 resets, run finished after 15355 ms. (steps per millisecond=65 ) properties (out of 1) seen :8
Interrupted Best-First random walk after 988225 steps, including 1030 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{0=50}
FORMULA BridgeAndVehicles-PT-V50P50N50-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620535149396

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BridgeAndVehicles-PT-V50P50N50"
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 BridgeAndVehicles-PT-V50P50N50, 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 r026-tajo-162038143600267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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