Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683810800100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 19:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716929682861

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 20:54:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 20:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:54:46] [INFO ] Load time of PNML (sax parser for PT used): 547 ms
[2024-05-28 20:54:46] [INFO ] Transformed 2398 places.
[2024-05-28 20:54:46] [INFO ] Transformed 1954 transitions.
[2024-05-28 20:54:46] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 789 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 22 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 956 place count 286 transition count 604
Iterating global reduction 1 with 103 rules applied. Total rules applied 1059 place count 286 transition count 604
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1070 place count 286 transition count 593
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1147 place count 209 transition count 516
Iterating global reduction 2 with 77 rules applied. Total rules applied 1224 place count 209 transition count 516
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1255 place count 209 transition count 485
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1281 place count 183 transition count 454
Iterating global reduction 3 with 26 rules applied. Total rules applied 1307 place count 183 transition count 454
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 1359 place count 183 transition count 402
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1365 place count 177 transition count 392
Iterating global reduction 4 with 6 rules applied. Total rules applied 1371 place count 177 transition count 392
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1376 place count 172 transition count 387
Iterating global reduction 4 with 5 rules applied. Total rules applied 1381 place count 172 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1383 place count 170 transition count 384
Iterating global reduction 4 with 2 rules applied. Total rules applied 1385 place count 170 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1386 place count 169 transition count 383
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 169 transition count 383
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1388 place count 168 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 1389 place count 168 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1390 place count 167 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 1391 place count 167 transition count 381
Applied a total of 1391 rules in 193 ms. Remains 167 /414 variables (removed 247) and now considering 381/1954 (removed 1573) transitions.
// Phase 1: matrix 381 rows 167 cols
[2024-05-28 20:54:46] [INFO ] Computed 5 invariants in 43 ms
[2024-05-28 20:54:47] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-28 20:54:47] [INFO ] Invariant cache hit.
[2024-05-28 20:54:47] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-28 20:54:48] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-28 20:54:48] [INFO ] Invariant cache hit.
[2024-05-28 20:54:49] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-28 20:54:55] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 30 ms to minimize.
[2024-05-28 20:54:55] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 4 ms to minimize.
[2024-05-28 20:54:55] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-28 20:54:57] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-28 20:55:01] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 4 ms to minimize.
[2024-05-28 20:55:01] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 1/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 3 ms to minimize.
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 4 ms to minimize.
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 3 ms to minimize.
[2024-05-28 20:55:08] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-28 20:55:11] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-28 20:55:11] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 10 (OVERLAPS) 381/548 variables, 167/186 constraints. Problems are: Problem set: 24 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 251/437 constraints. Problems are: Problem set: 24 solved, 356 unsolved
[2024-05-28 20:55:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 31593ms, After SMT, problems are : Problem set: 24 solved, 356 unsolved
Search for dead transitions found 24 dead transitions in 31630ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/414 places, 357/1954 transitions.
Reduce places removed 34 places and 202 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 133 transition count 134
Reduce places removed 15 places and 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 70 place count 118 transition count 119
Reduce places removed 7 places and 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 111 transition count 112
Reduce places removed 4 places and 13 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 107 transition count 99
Reduce places removed 10 places and 11 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 91 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 92 place count 96 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 93 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 94 place count 95 transition count 86
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 94 transition count 85
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 93 transition count 84
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 93 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 102 place count 93 transition count 81
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 102 rules in 19 ms. Remains 93 /167 variables (removed 74) and now considering 81/357 (removed 276) transitions.
// Phase 1: matrix 81 rows 93 cols
[2024-05-28 20:55:20] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 20:55:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 20:55:20] [INFO ] Invariant cache hit.
[2024-05-28 20:55:20] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 20:55:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/414 places, 81/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34458 ms. Remains : 93/414 places, 81/1954 transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Support contains 7 out of 78 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:55:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 20:55:21] [INFO ] Flatten gal took : 48 ms
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:55:21] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:55:21] [INFO ] Input system was already deterministic with 81 transitions.
Support contains 6 out of 78 places (down from 7) after GAL structural reductions.
RANDOM walk for 40000 steps (8947 resets) in 2267 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4062 resets) in 604 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
Probably explored full state space saw : 625 states, properties seen :1
Probabilistic random walk after 1432 steps, saw 625 distinct states, run finished after 48 ms. (steps per millisecond=29 ) properties seen :1
Explored full state space saw : 625 states, properties seen :0
Exhaustive walk after 1432 steps, saw 625 distinct states, run finished after 18 ms. (steps per millisecond=79 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 1 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 78 stabilizing places and 81 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 81
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All properties solved by simple procedures.
Total runtime 37116 ms.

BK_STOP 1716929722445

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d2m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810800100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;