fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r026-smll-171620167100150
Last Updated
July 7, 2024

About the Execution of ITS-Tools for AutoFlight-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
414.947 11806.00 37012.00 133.60 FFTFTFFFTTFTTFFF normal

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.r026-smll-171620167100150.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 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 134K 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-06b-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716268982249

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 05:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 05:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:23:05] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-21 05:23:05] [INFO ] Transformed 574 places.
[2024-05-21 05:23:05] [INFO ] Transformed 572 transitions.
[2024-05-21 05:23:05] [INFO ] Found NUPN structural information;
[2024-05-21 05:23:05] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (137 resets) in 2961 ms. (13 steps per ms) remains 5/15 properties
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 312 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
[2024-05-21 05:23:06] [INFO ] Flatten gal took : 378 ms
[2024-05-21 05:23:06] [INFO ] Flatten gal took : 144 ms
BEST_FIRST walk for 40004 steps (11 resets) in 1267 ms. (31 steps per ms) remains 5/5 properties
[2024-05-21 05:23:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18300272060339775737.gal : 84 ms
[2024-05-21 05:23:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10933430403863983056.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18300272060339775737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10933430403863983056.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (12 resets) in 158 ms. (251 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (16 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality10933430403863983056.prop.
// Phase 1: matrix 572 rows 574 cols
[2024-05-21 05:23:07] [INFO ] Computed 40 invariants in 30 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :34 after 81
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :81 after 22135
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :22135 after 4.29942e+09
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :4.29942e+09 after 5.60913e+20
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5.60913e+20 after 8.03157e+31
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutoFlight-PT-06b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 472/540 variables, 38/106 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 472/578 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/542 variables, 1/579 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/581 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AutoFlight-PT-06b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 32/574 variables, 1/582 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 32/614 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/614 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 572/1146 variables, 574/1188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 1188 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1232 ms.
Refiners :[Domain max(s): 574/574 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 77/81 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 77/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 460/541 variables, 35/120 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 460/580 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 05:23:09] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 28 ms to minimize.
[2024-05-21 05:23:09] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-21 05:23:09] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-21 05:23:09] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 4/584 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/584 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 33/574 variables, 1/585 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 33/618 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 05:23:09] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 4 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 4 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 4 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 4 ms to minimize.
[2024-05-21 05:23:10] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 4 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 4 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 4 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-21 05:23:11] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 13/631 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/631 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 572/1146 variables, 574/1205 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1146 variables, 3/1208 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 05:23:12] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-21 05:23:12] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 4 ms to minimize.
[2024-05-21 05:23:12] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 3 ms to minimize.
[2024-05-21 05:23:13] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2024-05-21 05:23:13] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 4 ms to minimize.
[2024-05-21 05:23:13] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-21 05:23:13] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 6496ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 574 transition count 351
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 262 rules applied. Total rules applied 483 place count 353 transition count 310
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 495 place count 341 transition count 310
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 495 place count 341 transition count 232
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 651 place count 263 transition count 232
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 704 place count 210 transition count 179
Iterating global reduction 3 with 53 rules applied. Total rules applied 757 place count 210 transition count 179
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 757 place count 210 transition count 163
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 789 place count 194 transition count 163
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 879 place count 149 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 880 place count 149 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 882 place count 148 transition count 116
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 906 place count 148 transition count 92
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 930 place count 124 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 931 place count 123 transition count 91
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 935 place count 119 transition count 91
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 935 place count 119 transition count 87
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 943 place count 115 transition count 87
Applied a total of 943 rules in 203 ms. Remains 115 /574 variables (removed 459) and now considering 87/572 (removed 485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 115/574 places, 87/572 transitions.
RANDOM walk for 7538 steps (0 resets) in 80 ms. (93 steps per ms) remains 0/3 properties
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 9219 ms.

BK_STOP 1716268994055

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="AutoFlight-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
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 AutoFlight-PT-06b, 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 r026-smll-171620167100150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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