fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300159
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HealthRecord-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
220.287 51361.00 102447.00 186.20 TFTFTTTTTTTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477300159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.4K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 11:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 30 11:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 30 11:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 70K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654187127824

Running Version 202205111006
[2022-06-02 16:25:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:25:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:25:30] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-06-02 16:25:30] [INFO ] Transformed 159 places.
[2022-06-02 16:25:30] [INFO ] Transformed 334 transitions.
[2022-06-02 16:25:30] [INFO ] Found NUPN structural information;
[2022-06-02 16:25:30] [INFO ] Parsed PT model containing 159 places and 334 transitions in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Incomplete random walk after 10000 steps, including 661 resets, run finished after 940 ms. (steps per millisecond=10 ) properties (out of 16) seen :4
FORMULA HealthRecord-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :2
FORMULA HealthRecord-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-02 16:25:33] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2022-06-02 16:25:33] [INFO ] Computed 18 place invariants in 15 ms
[2022-06-02 16:25:33] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 16:25:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2022-06-02 16:25:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 23 ms returned sat
[2022-06-02 16:25:34] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2022-06-02 16:25:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:25:35] [INFO ] After 340ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2022-06-02 16:25:35] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 7 ms to minimize.
[2022-06-02 16:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-06-02 16:25:35] [INFO ] After 975ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 298 ms.
[2022-06-02 16:25:35] [INFO ] After 2226ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA HealthRecord-PT-11-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
FORMULA HealthRecord-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1334 ms.
Support contains 76 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 42 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 671 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 146 transition count 286
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 48 place count 103 transition count 200
Iterating global reduction 2 with 43 rules applied. Total rules applied 91 place count 103 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 101 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 101 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 100 transition count 195
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 100 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 100 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 99 transition count 192
Applied a total of 101 rules in 78 ms. Remains 99 /159 variables (removed 60) and now considering 192/307 (removed 115) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/159 places, 192/307 transitions.
Incomplete random walk after 1000000 steps, including 77588 resets, run finished after 21743 ms. (steps per millisecond=45 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 11664 resets, run finished after 4164 ms. (steps per millisecond=240 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 11576 resets, run finished after 3995 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 948505 steps, including 10994 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Interrupted Best-First random walk after 782974 steps, including 9094 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen 0
Running SMT prover for 4 properties.
// Phase 1: matrix 192 rows 99 cols
[2022-06-02 16:26:17] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-02 16:26:17] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:26:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-06-02 16:26:17] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:26:17] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2022-06-02 16:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-06-02 16:26:18] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2022-06-02 16:26:18] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:26:18] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:26:18] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:26:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2022-06-02 16:26:18] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2022-06-02 16:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-02 16:26:18] [INFO ] After 926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-06-02 16:26:18] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA HealthRecord-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 467 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 192/192 transitions.
Graph (trivial) has 106 edges and 99 vertex of which 4 / 99 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 393 edges and 97 vertex of which 79 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 79 transition count 110
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 112 place count 38 transition count 69
Iterating global reduction 1 with 41 rules applied. Total rules applied 153 place count 38 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 156 place count 38 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 156 place count 38 transition count 62
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 34 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 172 place count 26 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 180 place count 26 transition count 49
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 26 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 23 transition count 38
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 23 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 195 place count 23 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 21 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 21 transition count 33
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 21 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 19 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 7 edges and 17 vertex of which 2 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 212 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 215 place count 15 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 215 place count 15 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 217 place count 14 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 220 place count 14 transition count 18
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 225 place count 12 transition count 15
Applied a total of 225 rules in 28 ms. Remains 12 /99 variables (removed 87) and now considering 15/192 (removed 177) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/99 places, 15/192 transitions.
Finished random walk after 272 steps, including 42 resets, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
FORMULA HealthRecord-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 48740 ms.

BK_STOP 1654187179185

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477300159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;