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.r298-tajo-171654455300301.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 greatspnxred
Input is PolyORBNT-PT-S10J20, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455300301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717105062951

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:37:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-30 21:37:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:37:45] [INFO ] Load time of PNML (sax parser for PT used): 1003 ms
[2024-05-30 21:37:45] [INFO ] Transformed 474 places.
[2024-05-30 21:37:45] [INFO ] Transformed 11760 transitions.
[2024-05-30 21:37:45] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 1401 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 6 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Built sparse matrix representations for Structural reductions in 13 ms.44433KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Ensure Unique test removed 10 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1599
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1596
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 118 rules in 622 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
Running 1585 sub problems to find dead transitions.
[2024-05-30 21:37:46] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2024-05-30 21:37:46] [INFO ] Computed 62 invariants in 74 ms
[2024-05-30 21:37:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 2.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 4.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 4.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1997 variables, and 53 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 20130 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
[2024-05-30 21:38:26] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1997 variables, and 53 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/585 constraints, Known Traps: 1/1 constraints]
After SMT, in 58378ms problems are : Problem set: 66 solved, 1519 unsolved
Search for dead transitions found 66 dead transitions in 58473ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 410/474 places, 1530/1650 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 101 ms. Remains 410 /410 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 59322 ms. Remains : 410/474 places, 1530/1650 transitions.
Finished random walk after 10 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=3 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 61061 ms.
ITS solved all properties within timeout

BK_STOP 1717105125536

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityDeadlock -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="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S10J20, 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 r298-tajo-171654455300301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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