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-167873951100910.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-32, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100910
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K 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 942K 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-32-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679678925507

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-32
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 17:28:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 17:28:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 17:28:47] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-24 17:28:47] [INFO ] Transformed 3806 places.
[2023-03-24 17:28:47] [INFO ] Transformed 506 transitions.
[2023-03-24 17:28:47] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 220 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 267 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 15) seen :1
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 1052 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 969 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 1129443 steps, run timeout after 12001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 1129443 steps, saw 136656 distinct states, run finished after 12002 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 17:29:04] [INFO ] Computed 3301 place invariants in 161 ms
[2023-03-24 17:29:07] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-24 17:29:07] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 830 ms returned sat
[2023-03-24 17:29:08] [INFO ] After 2569ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-24 17:29:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-24 17:29:10] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 716 ms returned sat
[2023-03-24 17:29:33] [INFO ] After 5747ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-24 17:29:33] [INFO ] After 5752ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 17:29:33] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3806 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 89 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 3806/3806 places, 506/506 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 897 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 1026 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 904 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 717545 steps, run timeout after 9001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 717545 steps, saw 87998 distinct states, run finished after 9001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-24 17:29:45] [INFO ] Invariant cache hit.
[2023-03-24 17:29:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-24 17:29:48] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 787 ms returned sat
[2023-03-24 17:29:48] [INFO ] After 2240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 17:29:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-24 17:29:50] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 823 ms returned sat
[2023-03-24 17:30:14] [INFO ] After 5870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-24 17:30:14] [INFO ] After 5876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 17:30:14] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3806 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 38 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 3806/3806 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 40 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:30:14] [INFO ] Invariant cache hit.
[2023-03-24 17:30:14] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-24 17:30:14] [INFO ] Invariant cache hit.
[2023-03-24 17:30:14] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-24 17:30:14] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-24 17:30:14] [INFO ] Invariant cache hit.
[2023-03-24 17:30:15] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1602 ms. Remains : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running SMT prover for 13 properties.
[2023-03-24 17:30:15] [INFO ] Invariant cache hit.
[2023-03-24 17:30:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-24 17:30:18] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 859 ms returned sat
[2023-03-24 17:30:18] [INFO ] After 2360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 17:30:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-24 17:30:20] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 886 ms returned sat
[2023-03-24 17:31:16] [INFO ] After 39056ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2023-03-24 17:31:18] [INFO ] After 40426ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 4954 ms.
[2023-03-24 17:31:23] [INFO ] After 64476ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-24 17:31:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-24 17:31:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3806 places, 506 transitions and 8173 arcs took 11 ms.
[2023-03-24 17:31:23] [INFO ] Flatten gal took : 257 ms
Total runtime 156358 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/498/inv_0_ --invariant=/tmp/498/inv_1_ --invariant=/tmp/498/inv_2_ --invariant=/tmp/498/inv_3_ --invariant=/tmp/498/inv_4_ --invariant=/tmp/498/inv_5_ --inv-par
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-00
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-03
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-05
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-06
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-07
Could not compute solution for formula : QuasiCertifProtocol-PT-32-ReachabilityCardinality-08

BK_STOP 1679679089321

--------------------
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-32-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_0_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_1_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_2_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_3_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_4_
rfs formula name QuasiCertifProtocol-PT-32-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/498/inv_5_
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 3806 places, 506 transitions and 8173 arcs
pnml2lts-sym: Petri net QuasiCertifProtocol_PT_32 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 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: 506->506 groups
pnml2lts-sym: Regrouping took 2.630 real 2.630 user 0.000 sys
pnml2lts-sym: state vector length is 3806; there are 506 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
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-32"
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-32, 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-167873951100910"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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