Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r188-tall-171640616800462.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is HealthRecord-PT-06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616800462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 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 1716475665113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:47:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:47:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:47:46] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-23 14:47:46] [INFO ] Transformed 154 places.
[2024-05-23 14:47:46] [INFO ] Transformed 319 transitions.
[2024-05-23 14:47:46] [INFO ] Found NUPN structural information;
[2024-05-23 14:47:46] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 182 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 154/154 places, 319/319 transitions.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 113 place count 91 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 91 transition count 230
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 168 place count 64 transition count 263
Applied a total of 168 rules in 63 ms. Remains 64 /154 variables (removed 90) and now considering 263/319 (removed 56) transitions.
[2024-05-23 14:47:46] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
// Phase 1: matrix 216 rows 64 cols
[2024-05-23 14:47:46] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 14:47:46] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-23 14:47:46] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-23 14:47:46] [INFO ] Invariant cache hit.
[2024-05-23 14:47:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-23 14:47:46] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-23 14:47:46] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-23 14:47:46] [INFO ] Invariant cache hit.
[2024-05-23 14:47:46] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 10 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 3 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:47:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-23 14:47:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 215/279 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 83/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 236 constraints, problems are : Problem set: 0 solved, 247 unsolved in 9475 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 215/279 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 83/235 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 247/482 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (OVERLAPS) 0/280 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 483 constraints, problems are : Problem set: 0 solved, 247 unsolved in 13099 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 6/6 constraints]
After SMT, in 23002ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 23021ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/154 places, 263/319 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 23486 ms. Remains : 64/154 places, 263/319 transitions.
Discarding 212 transitions out of 263. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4296 resets) in 2491 ms. (16 steps per ms) remains 14/50 properties
BEST_FIRST walk for 40003 steps (550 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (568 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (883 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (518 resets) in 87 ms. (454 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (500 resets) in 97 ms. (408 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (519 resets) in 89 ms. (444 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (516 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (518 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
[2024-05-23 14:48:10] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2024-05-23 14:48:10] [INFO ] Invariant cache hit.
[2024-05-23 14:48:10] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 36/55 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 36/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 14:48:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 215/279 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/280 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 231 constraints, problems are : Problem set: 0 solved, 6 unsolved in 499 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 36/55 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 36/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 215/279 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/280 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 237 constraints, problems are : Problem set: 0 solved, 6 unsolved in 456 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 227 ms.
Support contains 12 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 263/263 transitions.
Graph (complete) has 375 edges and 64 vertex of which 55 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 243
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 23 place count 44 transition count 192
Iterating global reduction 1 with 11 rules applied. Total rules applied 34 place count 44 transition count 192
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 53 place count 44 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 41 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 41 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 38 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 38 transition count 134
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 83 place count 38 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 106 place count 38 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 106 place count 38 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 37 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 36 transition count 92
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 36 transition count 92
Applied a total of 117 rules in 38 ms. Remains 36 /64 variables (removed 28) and now considering 92/263 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 36/64 places, 92/263 transitions.
RANDOM walk for 4000000 steps (436812 resets) in 8299 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (74490 resets) in 1813 ms. (2205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (74437 resets) in 1749 ms. (2285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (82368 resets) in 2274 ms. (1758 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1135 steps, run visited all 3 properties in 19 ms. (steps per millisecond=59 )
Probabilistic random walk after 1135 steps, saw 471 distinct states, run finished after 23 ms. (steps per millisecond=49 ) properties seen :3
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 30371 ms.
ITS solved all properties within timeout

BK_STOP 1716475696646

--------------------
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="HealthRecord-PT-06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-06, 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 r188-tall-171640616800462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;