Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951100894.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100894
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 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 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 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 QuasiCertifProtocol-PT-22-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679674039026

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 16:07:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 16:07:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 16:07:21] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-24 16:07:21] [INFO ] Transformed 1966 places.
[2023-03-24 16:07:21] [INFO ] Transformed 356 transitions.
[2023-03-24 16:07:21] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 95 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 372 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 356738 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356738 steps, saw 52943 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 356 rows 1966 cols
[2023-03-24 16:07:25] [INFO ] Computed 1611 place invariants in 79 ms
[2023-03-24 16:07:27] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 16:07:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-24 16:07:28] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 364 ms returned sat
[2023-03-24 16:07:52] [INFO ] After 2351ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2023-03-24 16:07:52] [INFO ] After 2355ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 16:07:52] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1965 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1965 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 1965 /1966 variables (removed 1) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1965/1966 places, 356/356 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 375514 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375514 steps, saw 55508 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 356 rows 1965 cols
[2023-03-24 16:07:57] [INFO ] Computed 1610 place invariants in 41 ms
[2023-03-24 16:07:58] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 16:07:58] [INFO ] [Nat]Absence check using 25 positive place invariants in 25 ms returned sat
[2023-03-24 16:07:59] [INFO ] [Nat]Absence check using 25 positive and 1585 generalized place invariants in 338 ms returned sat
[2023-03-24 16:08:23] [INFO ] After 4862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-24 16:08:23] [INFO ] After 4869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 16:08:23] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1965 out of 1965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1965/1965 places, 356/356 transitions.
Applied a total of 0 rules in 23 ms. Remains 1965 /1965 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1965/1965 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1965/1965 places, 356/356 transitions.
Applied a total of 0 rules in 18 ms. Remains 1965 /1965 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 16:08:23] [INFO ] Invariant cache hit.
[2023-03-24 16:08:23] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-24 16:08:23] [INFO ] Invariant cache hit.
[2023-03-24 16:08:24] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-24 16:08:24] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-24 16:08:24] [INFO ] Invariant cache hit.
[2023-03-24 16:08:25] [INFO ] Dead Transitions using invariants and state equation in 1310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2681 ms. Remains : 1965/1965 places, 356/356 transitions.
Applied a total of 0 rules in 16 ms. Remains 1965 /1965 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Running SMT prover for 11 properties.
[2023-03-24 16:08:25] [INFO ] Invariant cache hit.
[2023-03-24 16:08:26] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 16:08:27] [INFO ] [Nat]Absence check using 25 positive place invariants in 23 ms returned sat
[2023-03-24 16:08:27] [INFO ] [Nat]Absence check using 25 positive and 1585 generalized place invariants in 323 ms returned sat
[2023-03-24 16:08:57] [INFO ] After 10957ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-24 16:08:58] [INFO ] After 11388ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-24 16:08:58] [INFO ] After 31593ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-24 16:08:58] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-24 16:08:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1965 places, 356 transitions and 4318 arcs took 6 ms.
[2023-03-24 16:08:58] [INFO ] Flatten gal took : 160 ms
Total runtime 98080 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/494/inv_0_ --invariant=/tmp/494/inv_1_ --invariant=/tmp/494/inv_2_ --invariant=/tmp/494/inv_3_ --invariant=/tmp/494/inv_4_ --inv-par
Could not compute solution for formula : QuasiCertifProtocol-PT-22-ReachabilityCardinality-00
Could not compute solution for formula : QuasiCertifProtocol-PT-22-ReachabilityCardinality-04
Could not compute solution for formula : QuasiCertifProtocol-PT-22-ReachabilityCardinality-07
Could not compute solution for formula : QuasiCertifProtocol-PT-22-ReachabilityCardinality-09
Could not compute solution for formula : QuasiCertifProtocol-PT-22-ReachabilityCardinality-10

BK_STOP 1679674141289

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name QuasiCertifProtocol-PT-22-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_0_
rfs formula name QuasiCertifProtocol-PT-22-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_1_
rfs formula name QuasiCertifProtocol-PT-22-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_2_
rfs formula name QuasiCertifProtocol-PT-22-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_3_
rfs formula name QuasiCertifProtocol-PT-22-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 1965 places, 356 transitions and 4318 arcs
pnml2lts-sym: Petri net QuasiCertifProtocol_PT_22 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 356->351 groups
pnml2lts-sym: Regrouping took 0.920 real 0.910 user 0.000 sys
pnml2lts-sym: state vector length is 1965; there are 351 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state

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="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-PT-22, 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 r297-tall-167873951100894"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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