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.r331-tall-167889204400391.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 smartxred
Input is Railroad-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r331-tall-167889204400391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 22:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 22:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 Railroad-PT-050-ReachabilityFireability-00
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-01
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-02
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-03
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-04
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-05
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-06
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-07
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-08
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-09
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-10
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-11
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-12
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-13
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-14
FORMULA_NAME Railroad-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679143716214

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 12:48:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 12:48:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:48:38] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2023-03-18 12:48:38] [INFO ] Transformed 518 places.
[2023-03-18 12:48:38] [INFO ] Transformed 2756 transitions.
[2023-03-18 12:48:38] [INFO ] Found NUPN structural information;
[2023-03-18 12:48:38] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 151 places in 21 ms
Reduce places removed 151 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA Railroad-PT-050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2706 rows 367 cols
[2023-03-18 12:48:40] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-18 12:48:40] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 12:48:42] [INFO ] After 1282ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-18 12:48:43] [INFO ] After 2358ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-18 12:48:43] [INFO ] After 3218ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA Railroad-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Railroad-PT-050-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA Railroad-PT-050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Railroad-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 320 ms.
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 9 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 1 with 98 rules applied. Total rules applied 150 place count 266 transition count 2657
Applied a total of 150 rules in 628 ms. Remains 266 /367 variables (removed 101) and now considering 2657/2706 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 266/367 places, 2657/2706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 516455 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516455 steps, saw 428552 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 12:48:48] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-18 12:48:48] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:48:49] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 12:48:49] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-18 12:48:49] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 451 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 266/266 places, 2657/2657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 2657/2657 transitions.
Applied a total of 0 rules in 590 ms. Remains 266 /266 variables (removed 0) and now considering 2657/2657 (removed 0) transitions.
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 12:48:50] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 12:48:50] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 2657 rows 266 cols
[2023-03-18 12:48:50] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-18 12:48:52] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned [0, 1, 6, 7, 8, 11, 12, 16, 17, 18, 22, 23, 24, 27, 31, 133, 134, 136, 137, 138, 140, 141, 143, 147, 148, 149, 152, 153, 154, 156, 157, 159, 160, 162, 215, 217, 219, 225, 226, 227, 228, 231, 239, 240, 242, 244, 245, 246, 247, 248, 250, 256, 258, 261, 262]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2208 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/266 places, 2657/2657 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 2655
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 209 transition count 2653
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 207 transition count 2653
Applied a total of 8 rules in 420 ms. Remains 207 /211 variables (removed 4) and now considering 2653/2657 (removed 4) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:48:53] [INFO ] Invariants computation overflowed in 18 ms
[2023-03-18 12:48:53] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:48:53] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-18 12:48:54] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/266 places, 2653/2657 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4686 ms. Remains : 207/266 places, 2653/2657 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 763412 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 763412 steps, saw 631233 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:48:57] [INFO ] Invariants computation overflowed in 10 ms
[2023-03-18 12:48:58] [INFO ] After 623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:48:58] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 12:48:59] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-18 12:48:59] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 433 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 385 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:48:59] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 12:49:00] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:49:00] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-18 12:49:01] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2023-03-18 12:49:01] [INFO ] Redundant transitions in 144 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2023-03-18 12:49:01] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-18 12:49:02] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2808 ms. Remains : 207/207 places, 2653/2653 transitions.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 66 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2023-03-18 12:49:02] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-18 12:49:03] [INFO ] After 730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:49:03] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 12:49:04] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-18 12:49:04] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 12:49:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-18 12:49:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 207 places, 2653 transitions and 15706 arcs took 15 ms.
[2023-03-18 12:49:04] [INFO ] Flatten gal took : 265 ms
Total runtime 26269 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Railroad (PT), instance 050
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 207 places, 2653 transitions, 15706 arcs.
Final Score: 26819.22
Took : 51 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679143797613

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 18625:
syntax error

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="Railroad-PT-050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Railroad-PT-050, 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 r331-tall-167889204400391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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