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.r468-smll-171620167100174.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 ltsminxred
Input is AutoFlight-PT-24a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K 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 AutoFlight-PT-24a-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717193592915

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:13:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:13:15] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2024-05-31 22:13:15] [INFO ] Transformed 607 places.
[2024-05-31 22:13:15] [INFO ] Transformed 605 transitions.
[2024-05-31 22:13:15] [INFO ] Found NUPN structural information;
[2024-05-31 22:13:15] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (457 resets) in 3689 ms. (10 steps per ms) remains 6/14 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 817 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
// Phase 1: matrix 485 rows 607 cols
[2024-05-31 22:13:17] [INFO ] Computed 148 invariants in 31 ms
[2024-05-31 22:13:17] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 229/337 variables, 61/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 229/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 170/507 variables, 86/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 170/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 100/607 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 100/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 485/1092 variables, 607/1362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1092 variables, 120/1482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1092 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 1482 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2590 ms.
Refiners :[Domain max(s): 607/607 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 229/337 variables, 61/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 229/398 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 170/507 variables, 86/484 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 170/654 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/654 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 100/607 variables, 1/655 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 100/755 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 22:13:21] [INFO ] Deduced a trap composed of 222 places in 523 ms of which 73 ms to minimize.
[2024-05-31 22:13:22] [INFO ] Deduced a trap composed of 226 places in 497 ms of which 8 ms to minimize.
[2024-05-31 22:13:22] [INFO ] Deduced a trap composed of 229 places in 397 ms of which 7 ms to minimize.
[2024-05-31 22:13:22] [INFO ] Deduced a trap composed of 239 places in 302 ms of which 8 ms to minimize.
[2024-05-31 22:13:23] [INFO ] Deduced a trap composed of 244 places in 251 ms of which 6 ms to minimize.
[2024-05-31 22:13:23] [INFO ] Deduced a trap composed of 238 places in 212 ms of which 5 ms to minimize.
[2024-05-31 22:13:23] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 5 ms to minimize.
[2024-05-31 22:13:24] [INFO ] Deduced a trap composed of 240 places in 364 ms of which 6 ms to minimize.
[2024-05-31 22:13:24] [INFO ] Deduced a trap composed of 241 places in 402 ms of which 6 ms to minimize.
[2024-05-31 22:13:24] [INFO ] Deduced a trap composed of 253 places in 325 ms of which 6 ms to minimize.
[2024-05-31 22:13:25] [INFO ] Deduced a trap composed of 247 places in 327 ms of which 6 ms to minimize.
SMT process timed out in 7875ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 485/485 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 607 transition count 431
Reduce places removed 54 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 553 transition count 426
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 548 transition count 426
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 118 place count 548 transition count 408
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 154 place count 530 transition count 408
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 226 place count 494 transition count 372
Free-agglomeration rule applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 258 place count 494 transition count 340
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 290 place count 462 transition count 340
Applied a total of 290 rules in 334 ms. Remains 462 /607 variables (removed 145) and now considering 340/485 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 462/607 places, 340/485 transitions.
RANDOM walk for 40000 steps (838 resets) in 992 ms. (40 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (82 resets) in 247 ms. (161 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (69 resets) in 218 ms. (182 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (76 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
// Phase 1: matrix 340 rows 462 cols
[2024-05-31 22:13:26] [INFO ] Computed 148 invariants in 7 ms
[2024-05-31 22:13:26] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/139 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 111/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 244/383 variables, 128/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 244/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/462 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 79/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 340/802 variables, 462/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 205/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/802 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/802 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 675 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 462/462 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 111/139 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 111/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 244/383 variables, 128/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 244/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/462 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 79/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:13:27] [INFO ] Deduced a trap composed of 222 places in 236 ms of which 5 ms to minimize.
[2024-05-31 22:13:27] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 6 ms to minimize.
[2024-05-31 22:13:28] [INFO ] Deduced a trap composed of 227 places in 268 ms of which 5 ms to minimize.
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 462/802 variables, and 613 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1143 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/462 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1852ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 13206 ms.
ITS solved all properties within timeout

BK_STOP 1717193608132

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="AutoFlight-PT-24a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-24a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167100174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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