About the Execution of ITS-Tools for PolyORBLF-PT-S04J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5896.663 | 115592.00 | 155136.00 | 70.20 | F | 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/mcc2024-input.r299-tajo-171654455800184.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 itstools
Input is PolyORBLF-PT-S04J06T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455800184
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 Liveness
=== Now, execution of the tool begins
BK_START 1717141735842
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-31 07:48:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:48:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:48:57] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-05-31 07:48:57] [INFO ] Transformed 618 places.
[2024-05-31 07:48:57] [INFO ] Transformed 3190 transitions.
[2024-05-31 07:48:57] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 363 ms.
Discarding 1626 transitions out of 3190. Remains 1564
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Built sparse matrix representations for Structural reductions in 9 ms.24415KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 618/618 places, 1564/1564 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 97 ms. Remains 618 /618 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2024-05-31 07:48:57] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-05-31 07:48:58] [INFO ] Computed 54 invariants in 82 ms
[2024-05-31 07:48:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-31 07:49:18] [INFO ] Deduced a trap composed of 84 places in 313 ms of which 62 ms to minimize.
[2024-05-31 07:49:18] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 2 ms to minimize.
[2024-05-31 07:49:18] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2024-05-31 07:49:18] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 2 ms to minimize.
[2024-05-31 07:49:18] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-31 07:49:19] [INFO ] Deduced a trap composed of 84 places in 628 ms of which 5 ms to minimize.
[2024-05-31 07:49:19] [INFO ] Deduced a trap composed of 148 places in 511 ms of which 4 ms to minimize.
[2024-05-31 07:49:20] [INFO ] Deduced a trap composed of 354 places in 426 ms of which 4 ms to minimize.
[2024-05-31 07:49:21] [INFO ] Deduced a trap composed of 359 places in 703 ms of which 4 ms to minimize.
[2024-05-31 07:49:21] [INFO ] Deduced a trap composed of 351 places in 540 ms of which 4 ms to minimize.
[2024-05-31 07:49:21] [INFO ] Deduced a trap composed of 343 places in 346 ms of which 4 ms to minimize.
[2024-05-31 07:49:22] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 3 ms to minimize.
[2024-05-31 07:49:22] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2158 variables, and 59 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20153 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-31 07:49:36] [INFO ] Deduced a trap composed of 315 places in 336 ms of which 4 ms to minimize.
[2024-05-31 07:49:37] [INFO ] Deduced a trap composed of 294 places in 389 ms of which 4 ms to minimize.
[2024-05-31 07:49:37] [INFO ] Deduced a trap composed of 327 places in 418 ms of which 4 ms to minimize.
[2024-05-31 07:49:38] [INFO ] Deduced a trap composed of 42 places in 371 ms of which 4 ms to minimize.
[2024-05-31 07:49:38] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 2 ms to minimize.
[2024-05-31 07:49:39] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 2 ms to minimize.
[2024-05-31 07:49:42] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 3 ms to minimize.
[2024-05-31 07:49:42] [INFO ] Deduced a trap composed of 280 places in 416 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2158 variables, and 67 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 21/21 constraints]
After SMT, in 45517ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 45565ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 45707 ms. Remains : 618/618 places, 1564/1564 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 618/618 places, 1564/1564 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 67 ms. Remains 618 /618 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2024-05-31 07:49:43] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-31 07:49:43] [INFO ] Invariant cache hit.
[2024-05-31 07:49:43] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-31 07:49:43] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-31 07:49:43] [INFO ] Invariant cache hit.
[2024-05-31 07:49:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:49:45] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2024-05-31 07:49:45] [INFO ] Redundant transitions in 120 ms returned []
Running 1560 sub problems to find dead transitions.
[2024-05-31 07:49:45] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-31 07:49:45] [INFO ] Invariant cache hit.
[2024-05-31 07:49:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-31 07:50:04] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 15 ms to minimize.
[2024-05-31 07:50:04] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-05-31 07:50:04] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-31 07:50:04] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-31 07:50:05] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-31 07:50:05] [INFO ] Deduced a trap composed of 84 places in 282 ms of which 3 ms to minimize.
[2024-05-31 07:50:05] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 4 ms to minimize.
[2024-05-31 07:50:06] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 3 ms to minimize.
[2024-05-31 07:50:06] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 3 ms to minimize.
[2024-05-31 07:50:06] [INFO ] Deduced a trap composed of 376 places in 303 ms of which 4 ms to minimize.
[2024-05-31 07:50:07] [INFO ] Deduced a trap composed of 356 places in 317 ms of which 4 ms to minimize.
[2024-05-31 07:50:07] [INFO ] Deduced a trap composed of 345 places in 319 ms of which 4 ms to minimize.
[2024-05-31 07:50:07] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-05-31 07:50:08] [INFO ] Deduced a trap composed of 271 places in 281 ms of which 5 ms to minimize.
[2024-05-31 07:50:10] [INFO ] Deduced a trap composed of 283 places in 305 ms of which 4 ms to minimize.
[2024-05-31 07:50:12] [INFO ] Deduced a trap composed of 305 places in 405 ms of which 5 ms to minimize.
[2024-05-31 07:50:12] [INFO ] Deduced a trap composed of 319 places in 370 ms of which 4 ms to minimize.
[2024-05-31 07:50:14] [INFO ] Deduced a trap composed of 294 places in 467 ms of which 5 ms to minimize.
[2024-05-31 07:50:15] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 5 ms to minimize.
[2024-05-31 07:50:17] [INFO ] Deduced a trap composed of 346 places in 447 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2158 variables, and 66 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-31 07:50:42] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 4 ms to minimize.
[2024-05-31 07:50:42] [INFO ] Deduced a trap composed of 341 places in 303 ms of which 3 ms to minimize.
[2024-05-31 07:50:42] [INFO ] Deduced a trap composed of 291 places in 265 ms of which 3 ms to minimize.
[2024-05-31 07:50:43] [INFO ] Deduced a trap composed of 280 places in 258 ms of which 2 ms to minimize.
[2024-05-31 07:50:43] [INFO ] Deduced a trap composed of 325 places in 287 ms of which 3 ms to minimize.
[2024-05-31 07:50:47] [INFO ] Deduced a trap composed of 316 places in 439 ms of which 5 ms to minimize.
[2024-05-31 07:50:47] [INFO ] Deduced a trap composed of 322 places in 369 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2158 variables, and 73 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 27/27 constraints]
After SMT, in 65735ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 65753ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 67812 ms. Remains : 618/618 places, 1564/1564 transitions.
Finished random walk after 1877 steps, including 0 resets, run found a deadlock after 21 ms. (steps per millisecond=89 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 114207 ms.
BK_STOP 1717141851434
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="Liveness"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J06T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455800184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;