Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100234.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-V50P20N20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 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 11K 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 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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.9M 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-V50P20N20-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716328885993

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-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 22:01:27] [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 22:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:01:27] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-21 22:01:27] [INFO ] Transformed 138 places.
[2024-05-21 22:01:27] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:01:27] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 100 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:01:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:01:28] [INFO ] Computed 5 invariants in 15 ms
[2024-05-21 22:01:28] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:01:58] [INFO ] Deduced a trap composed of 5 places in 1065 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 57536ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 57658ms
[2024-05-21 22:02:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:02:26] [INFO ] Invariant cache hit.
[2024-05-21 22:02:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 22:02:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:02:26] [INFO ] Invariant cache hit.
[2024-05-21 22:02:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:02:26] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:02:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:02:26] [INFO ] Invariant cache hit.
[2024-05-21 22:02:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:02:50] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 3 ms to minimize.
[2024-05-21 22:03:08] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 0 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 7 constraints, problems are : Problem set: 17 solved, 2328 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 17 solved, 2328 unsolved
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 76342ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 76377ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134618 ms. Remains : 136/138 places, 2298/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 22:03:44] [INFO ] Flatten gal took : 519 ms
[2024-05-21 22:03:46] [INFO ] Flatten gal took : 368 ms
[2024-05-21 22:03:48] [INFO ] Input system was already deterministic with 2298 transitions.
Reduction of identical properties reduced properties to check from 52 to 51
RANDOM walk for 40000 steps (92 resets) in 5976 ms. (6 steps per ms) remains 27/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 282 ms. (14 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 111 ms. (35 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
[2024-05-21 22:03:51] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 22:03:51] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:03:51] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 21 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/136 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 289/425 variables, 136/141 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 41/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
[2024-05-21 22:03:53] [INFO ] Deduced a trap composed of 25 places in 374 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/425 variables, 1/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 183 constraints, problems are : Problem set: 5 solved, 20 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 48/134 variables, 4/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 289/423 variables, 134/140 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 41/181 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2/425 variables, 2/184 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 19/203 constraints. Problems are: Problem set: 5 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 203 constraints, problems are : Problem set: 5 solved, 20 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 20/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 9795ms problems are : Problem set: 5 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 490 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 22:04:01] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 22:04:01] [INFO ] Invariant cache hit.
[2024-05-21 22:04:01] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716329050067

--------------------
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:
++ 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 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-V50P20N20"
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-V50P20N20, 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-171620399100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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