About the Execution of ITS-Tools for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 1222.115 | 16713.00 | 28498.00 | 94.30 | T | 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.r319-tall-165472290000306.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 FunctionPointer-PT-c008, examination is ReachabilityDeadlock
    Time confinement is 1800 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r319-tall-165472290000306
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.4K Jun  7 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users  49K Jun  7 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun  7 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users  54K Jun  7 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun  6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users  26K Jun  6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun  6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users  18K Jun  6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users    1 Jun  6 12:11 NewModel
-rw-r--r-- 1 mcc users  14K Jun  7 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun  7 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users  11K Jun  7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users  93K Jun  7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun  6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun  6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users    6 Jun  6 12:11 equiv_col
-rw-r--r-- 1 mcc users    5 Jun  6 12:11 instance
-rw-r--r-- 1 mcc users    6 Jun  6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun  6 12:11 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 1654724215989
Running Version 202205111006
[2022-06-08 21:36:57] [INFO   ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800] 
[2022-06-08 21:36:57] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-06-08 21:36:57] [INFO   ] Load time of PNML (sax parser for PT used): 392 ms 
[2022-06-08 21:36:57] [INFO   ] Transformed 2826 places. 
[2022-06-08 21:36:57] [INFO   ] Transformed 8960 transitions. 
[2022-06-08 21:36:57] [INFO   ] Parsed PT model containing 2826 places and 8960 transitions in 529 ms. 
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 51 ms
Reduce places removed 1198 places and 2998 transitions. 
Built sparse matrix representations for Structural reductions in 15 ms.23265KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 9876 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.50 ms
Discarding 17 places :
Also discarding 0 output transitions 
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules  303 place count 1309 transition count 3662
Iterating global reduction 0 with 302 rules applied. Total rules applied 605 place count 1309 transition count 3662
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Iterating post reduction 0 with 352 rules applied. Total rules applied 957 place count 1309 transition count 3310
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules  1115 place count 1151 transition count 2994
Iterating global reduction 1 with 158 rules applied. Total rules applied 1273 place count 1151 transition count 2994
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Iterating post reduction 1 with 64 rules applied. Total rules applied 1337 place count 1151 transition count 2930
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1351 place count 1137 transition count 2902
Iterating global reduction 2 with 14 rules applied. Total rules applied 1365 place count 1137 transition count 2902
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1379 place count 1123 transition count 2874
Iterating global reduction 2 with 14 rules applied. Total rules applied 1393 place count 1123 transition count 2874
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1407 place count 1109 transition count 2846
Iterating global reduction 2 with 14 rules applied. Total rules applied 1421 place count 1109 transition count 2846
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1435 place count 1095 transition count 2818
Iterating global reduction 2 with 14 rules applied. Total rules applied 1449 place count 1095 transition count 2818
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1463 place count 1081 transition count 2790
Iterating global reduction 2 with 14 rules applied. Total rules applied 1477 place count 1081 transition count 2790
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1491 place count 1067 transition count 2762
Iterating global reduction 2 with 14 rules applied. Total rules applied 1505 place count 1067 transition count 2762
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules  1519 place count 1053 transition count 2734
Iterating global reduction 2 with 14 rules applied. Total rules applied 1533 place count 1053 transition count 2734
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  1596 place count 990 transition count 2496
Iterating global reduction 2 with 63 rules applied. Total rules applied 1659 place count 990 transition count 2496
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  1722 place count 927 transition count 2244
Iterating global reduction 2 with 63 rules applied. Total rules applied 1785 place count 927 transition count 2244
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  1848 place count 864 transition count 2104
Iterating global reduction 2 with 63 rules applied. Total rules applied 1911 place count 864 transition count 2104
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  1974 place count 801 transition count 1978
Iterating global reduction 2 with 63 rules applied. Total rules applied 2037 place count 801 transition count 1978
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  2100 place count 738 transition count 1852
Iterating global reduction 2 with 63 rules applied. Total rules applied 2163 place count 738 transition count 1852
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  2226 place count 675 transition count 1726
Iterating global reduction 2 with 63 rules applied. Total rules applied 2289 place count 675 transition count 1726
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules  2352 place count 612 transition count 1600
Iterating global reduction 2 with 63 rules applied. Total rules applied 2415 place count 612 transition count 1600
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules  2422 place count 605 transition count 1586
Iterating global reduction 2 with 7 rules applied. Total rules applied 2429 place count 605 transition count 1586
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Drop transitions removed 2 transitions 
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2431 place count 605 transition count 1584
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Applied a total of 2431 rules in 1918 ms. Remains 605 /1628 variables (removed 1023) and now considering 1584/5962 (removed 4378) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/1628 places, 1584/5962 transitions.
Random walk for 1250001  steps, including 0 resets, run took 2718 ms (no deadlock found). (steps per millisecond=459 )
Random directed walk for 1250017  steps, including 0 resets, run took 2888 ms (no deadlock found). (steps per millisecond=432 )
[2022-06-08 21:37:05] [INFO   ] Flow matrix only has 1057 transitions (discarded 527 similar events) 
// Phase 1: matrix 1057 rows 605 cols
[2022-06-08 21:37:05] [INFO   ] Computed 2 place invariants in 27 ms 
[2022-06-08 21:37:05] [INFO   ] [Real]Absence check using  1 positive place invariants in 4 ms returned sat 
[2022-06-08 21:37:05] [INFO   ] [Real]Absence check using  1 positive and 1 generalized place invariants in 4 ms returned sat 
[2022-06-08 21:37:05] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-06-08 21:37:07] [INFO   ] [Real]Absence check using state equation in 1354 ms returned sat 
[2022-06-08 21:37:07] [INFO   ] Solution in real domain found non-integer solution. 
[2022-06-08 21:37:07] [INFO   ] [Nat]Absence check using  1 positive place invariants in 36 ms returned sat 
[2022-06-08 21:37:07] [INFO   ] [Nat]Absence check using  1 positive and 1 generalized place invariants in 26 ms returned sat 
[2022-06-08 21:37:07] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-06-08 21:37:08] [INFO   ] [Nat]Absence check using state equation in 440 ms returned sat 
[2022-06-08 21:37:08] [INFO   ] State equation strengthened by 262 read => feed constraints. 
[2022-06-08 21:37:08] [INFO   ] [Nat]Added 262 Read/Feed constraints in 128 ms returned sat 
[2022-06-08 21:37:08] [INFO   ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 230 ms. 
[2022-06-08 21:37:09] [INFO   ] Added : 21 causal constraints over 7 iterations in 1020 ms. Result :sat 
Attempting to minimize the solution found.
Minimization took 38 ms.
Parikh directed walk for 34100  steps, including 34100 resets, run took 969 ms. (steps per millisecond=35 )
Random directed walk for 500006  steps, including 0 resets, run took 1176 ms (no deadlock found). (steps per millisecond=425 )
Random walk for 500000  steps, including 0 resets, run took 1000 ms (no deadlock found). (steps per millisecond=500 )
Finished random directed  walk after 44  steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=22 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 15547 ms.
BK_STOP 1654724232702
--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="FunctionPointer-PT-c008"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-4028"
echo "    Executing tool itstools"
echo "    Input is FunctionPointer-PT-c008, 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 r319-tall-165472290000306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 '
		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 ;
