fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r037-tajo-167813690500551
Last Updated
May 14, 2023

About the Execution of ITS-Tools for BusinessProcesses-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
409.611 22941.00 56577.00 1059.00 TTFFTTFFTTTTTTTT normal

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-167813690500551.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678363050704

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-09 11:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:57:34] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-09 11:57:34] [INFO ] Transformed 593 places.
[2023-03-09 11:57:34] [INFO ] Transformed 536 transitions.
[2023-03-09 11:57:34] [INFO ] Found NUPN structural information;
[2023-03-09 11:57:34] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:57:34] [INFO ] Flatten gal took : 189 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-09 11:57:35] [INFO ] Flatten gal took : 103 ms
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
[2023-03-09 11:57:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4934615027145872464.gal : 64 ms
[2023-03-09 11:57:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17523489224963819226.prop : 2 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/ReachabilityCardinality4934615027145872464.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17523489224963819226.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0

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 ...329
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Loading property file /tmp/ReachabilityCardinality17523489224963819226.prop.
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
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
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :28 after 125
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :125 after 247
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-12 is true.
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :247 after 4.84367e+14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-09 11:57:36] [INFO ] Computed 95 place invariants in 38 ms
[2023-03-09 11:57:39] [INFO ] [Real]Absence check using 57 positive place invariants in 41 ms returned sat
[2023-03-09 11:57:39] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2023-03-09 11:57:39] [INFO ] After 3193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 11:57:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 46 ms returned sat
[2023-03-09 11:57:39] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2023-03-09 11:57:40] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 20 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 1 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 29 places in 1008 ms of which 2 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 0 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 0 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 91 places in 974 ms of which 2 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 103 places in 1008 ms of which 26 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 0 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 1 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 0 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 97 places in 2607 ms of which 27 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 1 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9139 ms
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1033 ms
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 631 ms
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 4 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2023-03-09 11:57:52] [INFO ] After 12276ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-03-09 11:57:52] [INFO ] After 13069ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 7 different solutions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 171 ms.
Support contains 6 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 329 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 573 transition count 391
Reduce places removed 128 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 445 transition count 389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 262 place count 443 transition count 304
Deduced a syphon composed of 85 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 449 place count 341 transition count 304
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 523 place count 267 transition count 230
Iterating global reduction 3 with 74 rules applied. Total rules applied 597 place count 267 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 597 place count 267 transition count 222
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 615 place count 257 transition count 222
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 795 place count 166 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 797 place count 165 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 799 place count 165 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 801 place count 163 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 163 transition count 135
Applied a total of 802 rules in 198 ms. Remains 163 /585 variables (removed 422) and now considering 135/528 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 163/585 places, 135/528 transitions.
Finished random walk after 458 steps, including 14 resets, run visited all 4 properties in 10 ms. (steps per millisecond=45 )
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 18986 ms.

BK_STOP 1678363073645

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-13"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-13, 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 r037-tajo-167813690500551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 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 ;