Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400470.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 63K Mar 5 18:22 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 BusinessProcesses-PT-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678360081967

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:08:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:08:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:08:04] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-09 11:08:04] [INFO ] Transformed 274 places.
[2023-03-09 11:08:04] [INFO ] Transformed 237 transitions.
[2023-03-09 11:08:04] [INFO ] Found NUPN structural information;
[2023-03-09 11:08:04] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:08:04] [INFO ] Flatten gal took : 69 ms
[2023-03-09 11:08:04] [INFO ] Flatten gal took : 22 ms
[2023-03-09 11:08:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8297367056883298268.gal : 42 ms
[2023-03-09 11:08:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6122859515069299116.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8297367056883298268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6122859515069299116.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6122859515069299116.prop.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :16 after 29
Reachability property BusinessProcesses-PT-03-ReachabilityCardinality-15 is true.
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :29 after 7940
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 236 rows 273 cols
[2023-03-09 11:08:05] [INFO ] Computed 43 place invariants in 15 ms
[2023-03-09 11:08:05] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 11:08:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-09 11:08:05] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-09 11:08:06] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 4 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 1 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:08:06] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1053 ms
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:08:07] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 4 ms to minimize.
[2023-03-09 11:08:08] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2023-03-09 11:08:09] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2143 ms
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :7940 after 1.00442e+08
[2023-03-09 11:08:09] [INFO ] After 3557ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-09 11:08:09] [INFO ] After 3802ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 14 ms.
Support contains 12 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 158 edges and 273 vertex of which 7 / 273 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 514 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 266 transition count 171
Reduce places removed 56 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 210 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 207 transition count 168
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 121 place count 207 transition count 132
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 203 place count 161 transition count 132
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 239 place count 125 transition count 96
Iterating global reduction 3 with 36 rules applied. Total rules applied 275 place count 125 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 275 place count 125 transition count 95
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 277 place count 124 transition count 95
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 365 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 366 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 367 place count 78 transition count 50
Applied a total of 367 rules in 61 ms. Remains 78 /273 variables (removed 195) and now considering 50/236 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 78/273 places, 50/236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 3482 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=435 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 5822 ms.

BK_STOP 1678360090119

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690400470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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