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.r265-smll-167863540300614.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 Peterson-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679132807581

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=Peterson-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:46:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 09:46:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:46:51] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-18 09:46:51] [INFO ] Transformed 244 places.
[2023-03-18 09:46:51] [INFO ] Transformed 332 transitions.
[2023-03-18 09:46:51] [INFO ] Found NUPN structural information;
[2023-03-18 09:46:51] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-18 09:46:51] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 90 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 13) seen :3
FORMULA Peterson-PT-3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-18 09:46:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:46:54] [INFO ] Computed 15 place invariants in 14 ms
[2023-03-18 09:46:55] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:5
[2023-03-18 09:46:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 77 ms returned sat
[2023-03-18 09:46:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-18 09:46:56] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-03-18 09:46:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:46:56] [INFO ] After 131ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2023-03-18 09:46:56] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 10 ms to minimize.
[2023-03-18 09:46:57] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 2 ms to minimize.
[2023-03-18 09:46:57] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 2 ms to minimize.
[2023-03-18 09:46:57] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 3 ms to minimize.
[2023-03-18 09:46:57] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 2 ms to minimize.
[2023-03-18 09:46:58] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2023-03-18 09:46:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1490 ms
[2023-03-18 09:46:58] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-18 09:46:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2023-03-18 09:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2023-03-18 09:46:58] [INFO ] After 2079ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-18 09:46:58] [INFO ] After 3323ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
FORMULA Peterson-PT-3-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 27 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 244 transition count 262
Reduce places removed 70 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 79 rules applied. Total rules applied 149 place count 174 transition count 253
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 165 transition count 253
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 158 place count 165 transition count 215
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 234 place count 127 transition count 215
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 117 transition count 205
Applied a total of 254 rules in 108 ms. Remains 117 /244 variables (removed 127) and now considering 205/332 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 117/244 places, 205/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 289333 steps, run visited all 3 properties in 1251 ms. (steps per millisecond=231 )
Probabilistic random walk after 289333 steps, saw 57982 distinct states, run finished after 1251 ms. (steps per millisecond=231 ) properties seen :3
FORMULA Peterson-PT-3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9739 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/483/inv_0_ --invariant=/tmp/483/inv_1_ --invariant=/tmp/483/inv_2_ --invariant=/tmp/483/inv_3_ --invariant=/tmp/483/inv_4_ --invariant=/tmp/483/inv_5_ --invariant=/tmp/483/inv_6_ --invariant=/tmp/483/inv_7_ --invariant=/tmp/483/inv_8_ --invariant=/tmp/483/inv_9_ --invariant=/tmp/483/inv_10_ --invariant=/tmp/483/inv_11_ --invariant=/tmp/483/inv_12_ --invariant=/tmp/483/inv_13_ --invariant=/tmp/483/inv_14_ --invariant=/tmp/483/inv_15_ --inv-par
FORMULA Peterson-PT-3-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679132827124

--------------------
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 Peterson-PT-3-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_0_
rfs formula name Peterson-PT-3-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_1_
rfs formula name Peterson-PT-3-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_2_
rfs formula name Peterson-PT-3-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_3_
rfs formula name Peterson-PT-3-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_4_
rfs formula name Peterson-PT-3-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_5_
rfs formula name Peterson-PT-3-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_6_
rfs formula name Peterson-PT-3-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_7_
rfs formula name Peterson-PT-3-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_8_
rfs formula name Peterson-PT-3-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_9_
rfs formula name Peterson-PT-3-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_10_
rfs formula name Peterson-PT-3-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_11_
rfs formula name Peterson-PT-3-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_12_
rfs formula name Peterson-PT-3-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_13_
rfs formula name Peterson-PT-3-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/483/inv_14_
rfs formula name Peterson-PT-3-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/483/inv_15_
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 244 places, 332 transitions and 1016 arcs
pnml2lts-sym: Petri net Peterson-PT-3 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 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: 332->332 groups
pnml2lts-sym: Regrouping took 0.120 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 244; there are 332 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
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/483/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 214629 group checks and 0 next state calls
pnml2lts-sym: reachability took 2.140 real 8.550 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 3407946 states, 43031 nodes
pnml2lts-sym: group_next: 1724 nodes total
pnml2lts-sym: group_explored: 1016 nodes, 1004 short vectors total
pnml2lts-sym: max token count: 1

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="Peterson-PT-3"
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 Peterson-PT-3, 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 r265-smll-167863540300614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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