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.r140-smll-174876533400067.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 MedleyA-PT-02, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533400067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 48K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748927775215

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:16:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:16:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:16:17] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-03 05:16:17] [INFO ] Transformed 69 places.
[2025-06-03 05:16:17] [INFO ] Transformed 168 transitions.
[2025-06-03 05:16:17] [INFO ] Found NUPN structural information;
[2025-06-03 05:16:17] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 289 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 69/69 places, 168/168 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 162
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 63 transition count 156
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 44 place count 50 transition count 208
Applied a total of 44 rules in 89 ms. Remains 50 /69 variables (removed 19) and now considering 208/168 (removed -40) transitions.
[2025-06-03 05:16:17] [INFO ] Flow matrix only has 204 transitions (discarded 4 similar events)
// Phase 1: matrix 204 rows 50 cols
[2025-06-03 05:16:17] [INFO ] Computed 9 invariants in 34 ms
[2025-06-03 05:16:18] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-03 05:16:18] [INFO ] Flow matrix only has 204 transitions (discarded 4 similar events)
[2025-06-03 05:16:18] [INFO ] Invariant cache hit.
[2025-06-03 05:16:18] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-03 05:16:18] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-03 05:16:18] [INFO ] Flow matrix only has 204 transitions (discarded 4 similar events)
[2025-06-03 05:16:18] [INFO ] Invariant cache hit.
[2025-06-03 05:16:18] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-06-03 05:16:21] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 14 ms to minimize.
[2025-06-03 05:16:21] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 3 ms to minimize.
[2025-06-03 05:16:21] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-06-03 05:16:21] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-06-03 05:16:22] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-03 05:16:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 204/254 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 98/213 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 213 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8115 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 204/254 variables, 50/115 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 98/213 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 204/417 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-06-03 05:16:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-03 05:16:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2025-06-03 05:16:39] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-03 05:16:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/254 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 421 constraints, problems are : Problem set: 0 solved, 204 unsolved in 21752 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints]
After SMT, in 30578ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 30619ms
Starting structural reductions in LIVENESS mode, iteration 1 : 50/69 places, 208/168 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31615 ms. Remains : 50/69 places, 208/168 transitions.
Discarding 159 transitions out of 208. Remains 49
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6082 resets) in 3269 ms. (12 steps per ms) remains 14/48 properties
BEST_FIRST walk for 40004 steps (966 resets) in 298 ms. (133 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (1373 resets) in 135 ms. (294 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (1390 resets) in 145 ms. (274 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (1331 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1373 resets) in 143 ms. (277 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (1389 resets) in 164 ms. (242 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (1359 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1420 resets) in 104 ms. (380 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (1309 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1393 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1391 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1399 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
[2025-06-03 05:16:50] [INFO ] Flow matrix only has 204 transitions (discarded 4 similar events)
[2025-06-03 05:16:50] [INFO ] Invariant cache hit.
[2025-06-03 05:16:50] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/49 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-03 05:16:51] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 204/253 variables, 49/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 98/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/254 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-03 05:16:51] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 654 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/49 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 204/253 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 98/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/254 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/254 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/254 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-03 05:16:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/254 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/254 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/254 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 216 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1005 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 395 ms.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 208/208 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 41 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 41 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 60 place count 41 transition count 144
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 41 transition count 144
Applied a total of 68 rules in 42 ms. Remains 41 /50 variables (removed 9) and now considering 144/208 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 41/50 places, 144/208 transitions.
RANDOM walk for 3721128 steps (792372 resets) in 14627 ms. (254 steps per ms) remains 0/5 properties
Able to resolve query QuasiLiveness after proving 49 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 40146 ms.
ITS solved all properties within timeout

BK_STOP 1748927817343

--------------------
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 QuasiLiveness -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="MedleyA-PT-02"
export BK_EXAMINATION="QuasiLiveness"
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 MedleyA-PT-02, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-smll-174876533400067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-02.tgz
mv MedleyA-PT-02 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;