About the Execution of 2024-gold for BlocksWorld-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15688.970 | 226439.00 | 292018.00 | 798.10 | 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.r028-smll-174853774400024.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 BlocksWorld-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774400024
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 172K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 995K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 783K 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 1748542728529
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:18:52] [INFO ] Load time of PNML (sax parser for PT used): 840 ms
[2025-05-29 18:18:52] [INFO ] Transformed 869 places.
[2025-05-29 18:18:52] [INFO ] Transformed 1625 transitions.
[2025-05-29 18:18:52] [INFO ] Found NUPN structural information;
[2025-05-29 18:18:52] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2025-05-29 18:18:52] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 1186 ms.
Discarding 28 transitions out of 1625. Remains 1597
Built sparse matrix representations for Structural reductions in 55 ms.28398KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 869/869 places, 1625/1625 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 662 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 701 ms. Remains : 869/869 places, 1625/1625 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 869/869 places, 1625/1625 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 222 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
// Phase 1: matrix 1625 rows 869 cols
[2025-05-29 18:18:54] [INFO ] Computed 57 invariants in 57 ms
[2025-05-29 18:18:55] [INFO ] Implicit Places using invariants in 649 ms returned []
[2025-05-29 18:18:55] [INFO ] Invariant cache hit.
[2025-05-29 18:18:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 18:18:57] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2025-05-29 18:18:57] [INFO ] Redundant transitions in 229 ms returned []
Running 1619 sub problems to find dead transitions.
[2025-05-29 18:18:57] [INFO ] Invariant cache hit.
[2025-05-29 18:18:57] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2494 variables, and 46 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30201 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1596/813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2494 variables, and 6 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 783/813 constraints, Known Traps: 0/0 constraints]
After SMT, in 76184ms problems are : Problem set: 46 solved, 1573 unsolved
Search for dead transitions found 46 dead transitions in 76324ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 869/869 places, 1579/1625 transitions.
Computed a total of 23 stabilizing places and 0 stable transitions
Graph (complete) has 4558 edges and 869 vertex of which 846 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.33 ms
Discarding 23 places :
Also discarding 0 output 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 1 rules in 364 ms. Remains 846 /869 variables (removed 23) and now considering 1579/1579 (removed 0) transitions.
// Phase 1: matrix 1579 rows 846 cols
[2025-05-29 18:20:14] [INFO ] Computed 57 invariants in 18 ms
[2025-05-29 18:20:14] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-05-29 18:20:14] [INFO ] Invariant cache hit.
[2025-05-29 18:20:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-29 18:20:15] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 846/869 places, 1579/1625 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 81272 ms. Remains : 846/869 places, 1579/1625 transitions.
Random walk for 1250000 steps, including 0 resets, run took 28150 ms (no deadlock found). (steps per millisecond=44 )
Random directed walk for 1250001 steps, including 0 resets, run took 20193 ms (no deadlock found). (steps per millisecond=61 )
[2025-05-29 18:21:03] [INFO ] Invariant cache hit.
[2025-05-29 18:21:04] [INFO ] [Real]Absence check using 57 positive place invariants in 214 ms returned sat
[2025-05-29 18:21:07] [INFO ] [Real]Absence check using state equation in 2985 ms returned sat
[2025-05-29 18:21:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:21:08] [INFO ] [Nat]Absence check using 57 positive place invariants in 155 ms returned sat
[2025-05-29 18:21:12] [INFO ] [Nat]Absence check using state equation in 4466 ms returned sat
[2025-05-29 18:21:12] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-29 18:21:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2025-05-29 18:21:14] [INFO ] Deduced a trap composed of 56 places in 1339 ms of which 127 ms to minimize.
[2025-05-29 18:21:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1495 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 869/869 places, 1625/1625 transitions.
Applied a total of 0 rules in 29 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
// Phase 1: matrix 1625 rows 869 cols
[2025-05-29 18:21:14] [INFO ] Computed 57 invariants in 18 ms
[2025-05-29 18:21:16] [INFO ] Implicit Places using invariants in 1779 ms returned []
[2025-05-29 18:21:16] [INFO ] Invariant cache hit.
[2025-05-29 18:21:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 18:21:19] [INFO ] Implicit Places using invariants and state equation in 3511 ms returned []
Implicit Place search using SMT with State Equation took 5296 ms to find 0 implicit places.
Running 1619 sub problems to find dead transitions.
[2025-05-29 18:21:19] [INFO ] Invariant cache hit.
[2025-05-29 18:21:19] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2494 variables, and 46 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1596/813 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2494 variables, and 6 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 783/813 constraints, Known Traps: 0/0 constraints]
After SMT, in 75145ms problems are : Problem set: 46 solved, 1573 unsolved
Search for dead transitions found 46 dead transitions in 75190ms
Found 46 dead transitions using SMT.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 223195 ms.
ITS solved all properties within timeout
BK_STOP 1748542954968
--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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 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="BlocksWorld-PT-05"
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 BlocksWorld-PT-05, 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 r028-smll-174853774400024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-05.tgz
mv BlocksWorld-PT-05 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 ;