fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446700256
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.584 1853884.00 1913118.00 2847.70 [undef] Cannot compute

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700256.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 PolyORBLF-PT-S02J06T08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716916186423

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-28 17:09:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:09:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:09:47] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-28 17:09:47] [INFO ] Transformed 690 places.
[2024-05-28 17:09:47] [INFO ] Transformed 1434 transitions.
[2024-05-28 17:09:47] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 255 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Running 1304 sub problems to find dead transitions.
[2024-05-28 17:09:48] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 17:09:48] [INFO ] Computed 54 invariants in 76 ms
[2024-05-28 17:09:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 17:10:02] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 36 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 181 places in 419 ms of which 6 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:10:03] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:10:04] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:10:05] [INFO ] Deduced a trap composed of 376 places in 363 ms of which 5 ms to minimize.
[2024-05-28 17:10:05] [INFO ] Deduced a trap composed of 327 places in 270 ms of which 4 ms to minimize.
[2024-05-28 17:10:05] [INFO ] Deduced a trap composed of 358 places in 297 ms of which 4 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 374 places in 326 ms of which 4 ms to minimize.
[2024-05-28 17:10:06] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 393 places in 367 ms of which 5 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 414 places in 341 ms of which 4 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 67 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 17:10:27] [INFO ] Deduced a trap composed of 368 places in 372 ms of which 5 ms to minimize.
[2024-05-28 17:10:27] [INFO ] Deduced a trap composed of 335 places in 379 ms of which 5 ms to minimize.
[2024-05-28 17:10:28] [INFO ] Deduced a trap composed of 442 places in 341 ms of which 4 ms to minimize.
[2024-05-28 17:10:28] [INFO ] Deduced a trap composed of 391 places in 302 ms of which 4 ms to minimize.
[2024-05-28 17:10:29] [INFO ] Deduced a trap composed of 79 places in 300 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 72 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 22/22 constraints]
After SMT, in 42149ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42214ms
[2024-05-28 17:10:30] [INFO ] Redundant transitions in 101 ms returned []
Running 1304 sub problems to find dead transitions.
[2024-05-28 17:10:30] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 17:10:30] [INFO ] Invariant cache hit.
[2024-05-28 17:10:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 200 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 3 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 74 places in 36 ms of which 0 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 74 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:10:45] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:10:46] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:10:46] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:10:46] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:10:47] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 5 ms to minimize.
[2024-05-28 17:10:47] [INFO ] Deduced a trap composed of 327 places in 350 ms of which 4 ms to minimize.
[2024-05-28 17:10:48] [INFO ] Deduced a trap composed of 335 places in 327 ms of which 7 ms to minimize.
[2024-05-28 17:10:48] [INFO ] Deduced a trap composed of 75 places in 379 ms of which 5 ms to minimize.
[2024-05-28 17:10:50] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-28 17:10:53] [INFO ] Deduced a trap composed of 371 places in 327 ms of which 4 ms to minimize.
[2024-05-28 17:10:53] [INFO ] Deduced a trap composed of 349 places in 258 ms of which 3 ms to minimize.
[2024-05-28 17:10:54] [INFO ] Deduced a trap composed of 344 places in 303 ms of which 5 ms to minimize.
[2024-05-28 17:10:56] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-28 17:10:56] [INFO ] Deduced a trap composed of 54 places in 343 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 70 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-05-28 17:11:22] [INFO ] Deduced a trap composed of 408 places in 243 ms of which 4 ms to minimize.
[2024-05-28 17:11:22] [INFO ] Deduced a trap composed of 412 places in 324 ms of which 5 ms to minimize.
[2024-05-28 17:11:23] [INFO ] Deduced a trap composed of 446 places in 296 ms of which 4 ms to minimize.
[2024-05-28 17:11:23] [INFO ] Deduced a trap composed of 393 places in 224 ms of which 3 ms to minimize.
[2024-05-28 17:11:23] [INFO ] Deduced a trap composed of 421 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:11:24] [INFO ] Deduced a trap composed of 443 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:11:24] [INFO ] Deduced a trap composed of 370 places in 233 ms of which 3 ms to minimize.
[2024-05-28 17:11:26] [INFO ] Deduced a trap composed of 385 places in 364 ms of which 4 ms to minimize.
[2024-05-28 17:11:28] [INFO ] Deduced a trap composed of 507 places in 393 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 79 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 29/29 constraints]
After SMT, in 61966ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 61982ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 104412 ms. Remains : 690/690 places, 1306/1306 transitions.
Final net has 690 places and 1306 transitions.
[2024-05-28 17:11:32] [INFO ] Flatten gal took : 174 ms
[2024-05-28 17:11:32] [INFO ] Applying decomposition
[2024-05-28 17:11:33] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12067052651856783239.txt' '-o' '/tmp/graph12067052651856783239.bin' '-w' '/tmp/graph12067052651856783239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12067052651856783239.bin' '-l' '-1' '-v' '-w' '/tmp/graph12067052651856783239.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:11:33] [INFO ] Decomposing Gal with order
[2024-05-28 17:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:11:33] [INFO ] Removed a total of 976 redundant transitions.
[2024-05-28 17:11:33] [INFO ] Flatten gal took : 211 ms
[2024-05-28 17:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 74 ms.
[2024-05-28 17:11:34] [INFO ] Time to serialize gal into /tmp/StateSpace5376440572469696408.gal : 46 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/StateSpace5376440572469696408.gal' '-t' 'CGAL' '--stats'

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 ...219
ITS-tools command line returned an error code 137
[2024-05-28 17:20:43] [INFO ] Flatten gal took : 91 ms
[2024-05-28 17:20:43] [INFO ] Time to serialize gal into /tmp/StateSpace5781044505204899083.gal : 25 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/StateSpace5781044505204899083.gal' '-t' 'CGAL' '--stats' '--gen-order' 'FOLLOW'

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 ...240
ITS-tools command line returned an error code 137
[2024-05-28 17:29:57] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:29:58] [INFO ] Input system was already deterministic with 1306 transitions.
[2024-05-28 17:29:58] [INFO ] Transformed 690 places.
[2024-05-28 17:29:58] [INFO ] Transformed 1306 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 17:30:28] [INFO ] Time to serialize gal into /tmp/StateSpace16063909136028093578.gal : 11 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/StateSpace16063909136028093578.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 ...286
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 1852504 ms.

BK_STOP 1716918040307

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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 StateSpace -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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="StateSpace"
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 PolyORBLF-PT-S02J06T08, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446700256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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