Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399000194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399000194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716326312631

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:18:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:18:35] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-05-21 21:18:35] [INFO ] Transformed 108 places.
[2024-05-21 21:18:35] [INFO ] Transformed 2228 transitions.
[2024-05-21 21:18:35] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 87 ms.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 83 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 21:18:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 21:18:35] [INFO ] Computed 5 invariants in 17 ms
[2024-05-21 21:18:36] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:19:00] [INFO ] Deduced a trap composed of 5 places in 581 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:19:29] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 56146ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 56226ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 21:19:32] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 21:19:32] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 21:19:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:19:32] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:19:32] [INFO ] Invariant cache hit.
[2024-05-21 21:19:32] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:19:32] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 17 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56688 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 21:19:33] [INFO ] Flatten gal took : 334 ms
[2024-05-21 21:19:35] [INFO ] Flatten gal took : 395 ms
[2024-05-21 21:19:39] [INFO ] Input system was already deterministic with 2208 transitions.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 69 to 62
RANDOM walk for 40000 steps (228 resets) in 3418 ms. (11 steps per ms) remains 44/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 151 ms. (26 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 186 ms. (21 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 44/44 properties
[2024-05-21 21:19:41] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:19:41] [INFO ] Invariant cache hit.
[2024-05-21 21:19:41] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 36 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/103 variables, 3/5 constraints. Problems are: Problem set: 9 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 289/392 variables, 103/108 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 101/209 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/209 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/395 variables, 3/212 constraints. Problems are: Problem set: 9 solved, 35 unsolved
[2024-05-21 21:19:44] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/213 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/213 constraints. Problems are: Problem set: 9 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/395 variables, and 213 constraints, problems are : Problem set: 9 solved, 35 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 46/103 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 289/392 variables, 103/109 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 101/210 constraints. Problems are: Problem set: 9 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/211 constraints. Problems are: Problem set: 9 solved, 35 unsolved
[2024-05-21 21:19:49] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 1/212 constraints. Problems are: Problem set: 9 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/395 variables, and 212 constraints, problems are : Problem set: 9 solved, 35 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 103/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/44 constraints, Known Traps: 2/2 constraints]
After SMT, in 10534ms problems are : Problem set: 9 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 305 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 21:19:52] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 21:19:52] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 21:19:52] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 21:20:15] [INFO ] Deduced a trap composed of 5 places in 726 ms of which 139 ms to minimize.

BK_STOP 1716326421581

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="CTLFireability"
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 BridgeAndVehicles-PT-V20P10N50, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399000194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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