About the Execution of 2024-gold for PolyORBLF-PT-S04J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15688.840 | 113190.00 | 147320.00 | 396.30 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266800304.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
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 r168-tall-174881266800304
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 152K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 769K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.6M May 29 14:32 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 1748900137048
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:35:38] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2025-06-02 21:35:38] [INFO ] Transformed 618 places.
[2025-06-02 21:35:38] [INFO ] Transformed 3190 transitions.
[2025-06-02 21:35:38] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 351 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 13 ms.20292KB 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 116 ms. Remains 618 /618 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2025-06-02 21:35:39] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2025-06-02 21:35:39] [INFO ] Computed 54 invariants in 93 ms
[2025-06-02 21:35:39] [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
[2025-06-02 21:35:59] [INFO ] Deduced a trap composed of 84 places in 299 ms of which 19 ms to minimize.
[2025-06-02 21:35:59] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:35:59] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2025-06-02 21:35:59] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2025-06-02 21:36:00] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:36:00] [INFO ] Deduced a trap composed of 84 places in 560 ms of which 6 ms to minimize.
[2025-06-02 21:36:00] [INFO ] Deduced a trap composed of 148 places in 270 ms of which 7 ms to minimize.
[2025-06-02 21:36:01] [INFO ] Deduced a trap composed of 354 places in 357 ms of which 4 ms to minimize.
[2025-06-02 21:36:01] [INFO ] Deduced a trap composed of 359 places in 329 ms of which 3 ms to minimize.
[2025-06-02 21:36:02] [INFO ] Deduced a trap composed of 351 places in 395 ms of which 4 ms to minimize.
[2025-06-02 21:36:02] [INFO ] Deduced a trap composed of 343 places in 324 ms of which 3 ms to minimize.
[2025-06-02 21:36:02] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 2 ms to minimize.
[2025-06-02 21:36:03] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 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 20091 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
[2025-06-02 21:36:17] [INFO ] Deduced a trap composed of 315 places in 317 ms of which 3 ms to minimize.
[2025-06-02 21:36:18] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 4 ms to minimize.
[2025-06-02 21:36:18] [INFO ] Deduced a trap composed of 327 places in 311 ms of which 4 ms to minimize.
[2025-06-02 21:36:18] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 4 ms to minimize.
[2025-06-02 21:36:19] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:36:20] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 1 ms to minimize.
[2025-06-02 21:36:23] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:36:23] [INFO ] Deduced a trap composed of 280 places in 300 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 20033 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 44945ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 44997ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 45159 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 50 ms. Remains 618 /618 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2025-06-02 21:36:24] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2025-06-02 21:36:24] [INFO ] Invariant cache hit.
[2025-06-02 21:36:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 21:36:24] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2025-06-02 21:36:24] [INFO ] Invariant cache hit.
[2025-06-02 21:36:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 21:36:25] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2025-06-02 21:36:25] [INFO ] Redundant transitions in 90 ms returned []
Running 1560 sub problems to find dead transitions.
[2025-06-02 21:36:25] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2025-06-02 21:36:25] [INFO ] Invariant cache hit.
[2025-06-02 21:36:25] [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
[2025-06-02 21:36:44] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2025-06-02 21:36:44] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:36:44] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2025-06-02 21:36:44] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2025-06-02 21:36:44] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 0 ms to minimize.
[2025-06-02 21:36:45] [INFO ] Deduced a trap composed of 84 places in 265 ms of which 4 ms to minimize.
[2025-06-02 21:36:45] [INFO ] Deduced a trap composed of 148 places in 260 ms of which 3 ms to minimize.
[2025-06-02 21:36:45] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 4 ms to minimize.
[2025-06-02 21:36:46] [INFO ] Deduced a trap composed of 323 places in 387 ms of which 7 ms to minimize.
[2025-06-02 21:36:46] [INFO ] Deduced a trap composed of 376 places in 387 ms of which 4 ms to minimize.
[2025-06-02 21:36:47] [INFO ] Deduced a trap composed of 356 places in 350 ms of which 4 ms to minimize.
[2025-06-02 21:36:47] [INFO ] Deduced a trap composed of 345 places in 337 ms of which 3 ms to minimize.
[2025-06-02 21:36:48] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:36:49] [INFO ] Deduced a trap composed of 271 places in 313 ms of which 5 ms to minimize.
[2025-06-02 21:36:50] [INFO ] Deduced a trap composed of 283 places in 308 ms of which 4 ms to minimize.
[2025-06-02 21:36:53] [INFO ] Deduced a trap composed of 305 places in 312 ms of which 4 ms to minimize.
[2025-06-02 21:36:53] [INFO ] Deduced a trap composed of 319 places in 316 ms of which 4 ms to minimize.
[2025-06-02 21:36:55] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 4 ms to minimize.
[2025-06-02 21:36:56] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 4 ms to minimize.
[2025-06-02 21:36:59] [INFO ] Deduced a trap composed of 346 places in 369 ms of which 4 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 30034 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
[2025-06-02 21:37:22] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 4 ms to minimize.
[2025-06-02 21:37:22] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 3 ms to minimize.
[2025-06-02 21:37:23] [INFO ] Deduced a trap composed of 291 places in 271 ms of which 3 ms to minimize.
[2025-06-02 21:37:23] [INFO ] Deduced a trap composed of 280 places in 264 ms of which 3 ms to minimize.
[2025-06-02 21:37:23] [INFO ] Deduced a trap composed of 325 places in 285 ms of which 3 ms to minimize.
[2025-06-02 21:37:27] [INFO ] Deduced a trap composed of 316 places in 295 ms of which 4 ms to minimize.
[2025-06-02 21:37:28] [INFO ] Deduced a trap composed of 322 places in 293 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 30036 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 64325ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 64343ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 65933 ms. Remains : 618/618 places, 1564/1564 transitions.
Finished random walk after 1141 steps, including 0 resets, run found a deadlock after 11 ms. (steps per millisecond=103 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 111833 ms.
ITS solved all properties within timeout
BK_STOP 1748900250238
--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r168-tall-174881266800304"
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.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 ;