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.r137-smll-167819417900295.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 DiscoveryGPU-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417900295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 46K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678775777749

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 06:36:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 06:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 06:36:20] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-14 06:36:20] [INFO ] Transformed 184 places.
[2023-03-14 06:36:20] [INFO ] Transformed 194 transitions.
[2023-03-14 06:36:20] [INFO ] Found NUPN structural information;
[2023-03-14 06:36:20] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 49 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 16) seen :11
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 194 rows 184 cols
[2023-03-14 06:36:21] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-14 06:36:22] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 06:36:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-14 06:36:22] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-14 06:36:22] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 9 ms to minimize.
[2023-03-14 06:36:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 251 ms
[2023-03-14 06:36:23] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-14 06:36:23] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 22 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 194/194 transitions.
Graph (complete) has 314 edges and 184 vertex of which 162 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.17 ms
Discarding 22 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 162 transition count 155
Reduce places removed 26 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 136 transition count 150
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 131 transition count 150
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 66 place count 131 transition count 138
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 119 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 113 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 113 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 109 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 109 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 105 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 105 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 101 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 101 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 98 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 98 transition count 113
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 186 place count 71 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 70 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 70 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 69 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 69 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 68 transition count 84
Applied a total of 192 rules in 187 ms. Remains 68 /184 variables (removed 116) and now considering 84/194 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 68/184 places, 84/194 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2833325 steps, run timeout after 3001 ms. (steps per millisecond=944 ) properties seen :{}
Probabilistic random walk after 2833325 steps, saw 487711 distinct states, run finished after 3002 ms. (steps per millisecond=943 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 06:36:26] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
// Phase 1: matrix 77 rows 68 cols
[2023-03-14 06:36:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 06:36:26] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 06:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 06:36:26] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 06:36:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 06:36:26] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 06:36:26] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-14 06:36:26] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 68/68 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-14 06:36:26] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-14 06:36:26] [INFO ] Invariant cache hit.
[2023-03-14 06:36:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-14 06:36:26] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-14 06:36:26] [INFO ] Invariant cache hit.
[2023-03-14 06:36:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 06:36:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-14 06:36:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 06:36:26] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2023-03-14 06:36:26] [INFO ] Invariant cache hit.
[2023-03-14 06:36:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 68/68 places, 84/84 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 68 transition count 77
Applied a total of 7 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 77/84 (removed 7) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 68 cols
[2023-03-14 06:36:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 06:36:26] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 06:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 06:36:27] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 06:36:27] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 06:36:27] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 06:36:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 24 ms.
[2023-03-14 06:36:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 84 transitions and 271 arcs took 1 ms.
[2023-03-14 06:36:27] [INFO ] Flatten gal took : 44 ms
Total runtime 7150 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 --inv-bin-par --invariant=/tmp/486/inv_0_ --inv-par
FORMULA DiscoveryGPU-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678775791060

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name DiscoveryGPU-PT-06b-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/486/inv_0_
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 68 places, 84 transitions and 271 arcs
pnml2lts-sym: Petri net DiscoveryGPU_PT_06b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 84->67 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.010 sys
pnml2lts-sym: state vector length is 68; there are 67 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/486/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 2.430 real 9.710 user 0.030 sys
pnml2lts-sym: max token count: 5

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="DiscoveryGPU-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
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 DiscoveryGPU-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819417900295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;