Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900526.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 14K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Mar 15 11:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 15 11:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 15 11:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779944699604

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 05:05:01] [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]
[2026-05-28 05:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 05:05:03] [INFO ] Load time of PNML (sax parser for PT used): 1089 ms
[2026-05-28 05:05:03] [INFO ] Transformed 21462 places.
[2026-05-28 05:05:03] [INFO ] Transformed 21129 transitions.
[2026-05-28 05:05:03] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1554 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2192 resets) in 5878 ms. (6 steps per ms) remains 12/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 1133 ms. (35 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 450 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 637 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (99 resets) in 1006 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 336 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 524 ms. (76 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (98 resets) in 204 ms. (195 steps per ms) remains 11/12 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (98 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 346 ms. (115 steps per ms) remains 11/11 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2954555145182548193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15943904499577945244.kers'
[2026-05-28 05:05:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2954555145182548193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15943904499577945244.kers]
[2026-05-28 05:05:07] [INFO ] Flatten gal took : 2246 ms
Culling duplicate invariants (modulo rational): removing 68 columns.
Culled 68 columns in 43 ms.
// Phase 1: matrix 21129 rows 21394 cols 59092 entries
[2026-05-28 05:05:08] [INFO ] Flatten gal took : 785 ms
Finished phase 1 with 12711 SingleSign rule and 8418 generalized
[2026-05-28 05:05:08] [INFO ] Computed 333 invariants in 1079 ms
Computed 333 P flows in 1083 ms.
Exported basis to /tmp/petrispot-output-15943904499577945244.kers
Total runtime 1104 ms.
[2026-05-28 05:05:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5070654217859342184.gal : 415 ms
[2026-05-28 05:05:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16701926464489221071.prop : 8 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5070654217859342184.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16701926464489221071.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19658/42591 variables, and 65 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5148 ms.
Refiners :[Positive P Invariants (semi-flows): 65/132 constraints, Generalized P Invariants (flows): 0/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality16701926464489221071.prop.
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 19375/19658 variables, 65/65 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19658/42591 variables, and 65 constraints, problems are : Problem set: 9 solved, 2 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 65/132 constraints, Generalized P Invariants (flows): 0/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11980ms problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 2881 are kept as prefixes of interest. Removing 18581 places using SCC suffix rule.58 ms
Discarding 18581 places :
Also discarding 10107 output transitions
Drop transitions (Output transitions of discarded places.) removed 10107 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4163 transitions
Reduce isomorphic transitions removed 4163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 5353 rules applied. Total rules applied 5354 place count 2881 transition count 5669
Reduce places removed 1192 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 1229 rules applied. Total rules applied 6583 place count 1689 transition count 5632
Reduce places removed 37 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 41 rules applied. Total rules applied 6624 place count 1652 transition count 5628
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 6628 place count 1648 transition count 5628
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 6628 place count 1648 transition count 5581
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 6722 place count 1601 transition count 5581
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 6753 place count 1570 transition count 5550
Iterating global reduction 4 with 31 rules applied. Total rules applied 6784 place count 1570 transition count 5550
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 6799 place count 1570 transition count 5535
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 6814 place count 1555 transition count 5535
Partial Free-agglomeration rule applied 983 times.
Drop transitions (Partial Free agglomeration) removed 983 transitions
Iterating global reduction 5 with 983 rules applied. Total rules applied 7797 place count 1555 transition count 5535
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 5 with 23 rules applied. Total rules applied 7820 place count 1532 transition count 5535
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 7835 place count 1532 transition count 5520
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 7850 place count 1517 transition count 5520
Applied a total of 7850 rules in 2520 ms. Remains 1517 /21462 variables (removed 19945) and now considering 5520/21129 (removed 15609) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2535 ms. Remains : 1517/21462 places, 5520/21129 transitions.
RANDOM walk for 40000 steps (7195 resets) in 2434 ms. (16 steps per ms) remains 1/2 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (180 resets) in 535 ms. (74 steps per ms) remains 1/1 properties
[2026-05-28 05:05:22] [INFO ] Flow matrix only has 2658 transitions (discarded 2862 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15276033948840989424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16199496947878138983.kers'
[2026-05-28 05:05:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15276033948840989424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16199496947878138983.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 2658 rows 1516 cols 7775 entries
Finished phase 1 with 1448 SingleSign rule and 66 generalized
[2026-05-28 05:05:22] [INFO ] Computed 3 invariants in 24 ms
Computed 3 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-16199496947878138983.kers
Total runtime 29 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1189 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2462/3651 variables, 1131/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3651 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 4175/4175 variables, and 1518 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1528 ms.
Refiners :[Generalized P Invariants (flows): 1/3 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1605ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 22627 ms.

BK_STOP 1779944724541

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="LeafsetExtension-PT-S64C2"
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-5973"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C2, 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 r162-smll-177961107900526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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