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.r299-tajo-171654455500049.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-COL-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455500049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717141274475

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-31 07:41:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:41:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:41:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 07:41:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 07:41:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 746 ms
[2024-05-31 07:41:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 30 ms.
[2024-05-31 07:41:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-31 07:41:16] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-31 07:41:16] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 39 ms.
[2024-05-31 07:41:16] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-31 07:41:16] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 58 ms.
[2024-05-31 07:41:16] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-31 07:41:16] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 07:41:16] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 07:41:16] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-31 07:41:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-05-31 07:41:16] [INFO ] Skeletonized 65 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-31 07:41:16] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 13 ms.
[2024-05-31 07:41:16] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-31 07:41:16] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-31 07:41:16] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 07:41:16] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.32180KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-31 07:41:17] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-31 07:41:17] [INFO ] Computed 46 invariants in 60 ms
[2024-05-31 07:41:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:41:24] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 13 ms to minimize.
[2024-05-31 07:41:24] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-31 07:41:24] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-31 07:41:24] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-31 07:41:24] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-31 07:41:25] [INFO ] Deduced a trap composed of 249 places in 177 ms of which 4 ms to minimize.
[2024-05-31 07:41:25] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 3 ms to minimize.
[2024-05-31 07:41:25] [INFO ] Deduced a trap composed of 153 places in 144 ms of which 2 ms to minimize.
[2024-05-31 07:41:25] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
[2024-05-31 07:41:25] [INFO ] Deduced a trap composed of 273 places in 160 ms of which 3 ms to minimize.
[2024-05-31 07:41:26] [INFO ] Deduced a trap composed of 271 places in 156 ms of which 3 ms to minimize.
[2024-05-31 07:41:26] [INFO ] Deduced a trap composed of 283 places in 159 ms of which 3 ms to minimize.
[2024-05-31 07:41:26] [INFO ] Deduced a trap composed of 283 places in 197 ms of which 3 ms to minimize.
[2024-05-31 07:41:26] [INFO ] Deduced a trap composed of 248 places in 177 ms of which 2 ms to minimize.
[2024-05-31 07:41:31] [INFO ] Deduced a trap composed of 238 places in 209 ms of which 3 ms to minimize.
[2024-05-31 07:41:32] [INFO ] Deduced a trap composed of 223 places in 182 ms of which 3 ms to minimize.
[2024-05-31 07:41:32] [INFO ] Deduced a trap composed of 252 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:41:36] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 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 472/1288 variables, and 60 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:41:44] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-31 07:41:47] [INFO ] Deduced a trap composed of 258 places in 211 ms of which 4 ms to minimize.
[2024-05-31 07:41:47] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 4 ms to minimize.
[2024-05-31 07:41:48] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 64 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 22/22 constraints]
After SMT, in 41208ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41242ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41338 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 29 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-05-31 07:41:58] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:41:58] [INFO ] Invariant cache hit.
[2024-05-31 07:41:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 07:41:58] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:41:58] [INFO ] Invariant cache hit.
[2024-05-31 07:41:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 07:41:58] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-31 07:41:58] [INFO ] Redundant transitions in 45 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 07:41:58] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-31 07:41:58] [INFO ] Invariant cache hit.
[2024-05-31 07:41:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:42:05] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-31 07:42:05] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-31 07:42:05] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-31 07:42:05] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-31 07:42:05] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-31 07:42:06] [INFO ] Deduced a trap composed of 217 places in 196 ms of which 3 ms to minimize.
[2024-05-31 07:42:06] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 3 ms to minimize.
[2024-05-31 07:42:07] [INFO ] Deduced a trap composed of 255 places in 179 ms of which 4 ms to minimize.
[2024-05-31 07:42:07] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-31 07:42:07] [INFO ] Deduced a trap composed of 279 places in 190 ms of which 4 ms to minimize.
[2024-05-31 07:42:07] [INFO ] Deduced a trap composed of 232 places in 174 ms of which 3 ms to minimize.
[2024-05-31 07:42:07] [INFO ] Deduced a trap composed of 280 places in 181 ms of which 3 ms to minimize.
[2024-05-31 07:42:08] [INFO ] Deduced a trap composed of 265 places in 162 ms of which 6 ms to minimize.
[2024-05-31 07:42:08] [INFO ] Deduced a trap composed of 254 places in 157 ms of which 3 ms to minimize.
[2024-05-31 07:42:08] [INFO ] Deduced a trap composed of 244 places in 155 ms of which 2 ms to minimize.
[2024-05-31 07:42:08] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 264 places in 183 ms of which 4 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 321 places in 155 ms of which 2 ms to minimize.
[2024-05-31 07:42:13] [INFO ] Deduced a trap composed of 266 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:42:14] [INFO ] Deduced a trap composed of 250 places in 195 ms of which 3 ms to minimize.
[2024-05-31 07:42:17] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-31 07:42:20] [INFO ] Deduced a trap composed of 240 places in 151 ms of which 3 ms to minimize.
[2024-05-31 07:42:20] [INFO ] Deduced a trap composed of 226 places in 151 ms of which 3 ms to minimize.
[2024-05-31 07:42:21] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 67 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:42:34] [INFO ] Deduced a trap composed of 312 places in 167 ms of which 3 ms to minimize.
[2024-05-31 07:42:34] [INFO ] Deduced a trap composed of 301 places in 152 ms of which 2 ms to minimize.
[2024-05-31 07:42:34] [INFO ] Deduced a trap composed of 300 places in 150 ms of which 3 ms to minimize.
[2024-05-31 07:42:34] [INFO ] Deduced a trap composed of 242 places in 157 ms of which 3 ms to minimize.
[2024-05-31 07:42:34] [INFO ] Deduced a trap composed of 313 places in 153 ms of which 3 ms to minimize.
[2024-05-31 07:42:35] [INFO ] Deduced a trap composed of 288 places in 155 ms of which 3 ms to minimize.
[2024-05-31 07:42:35] [INFO ] Deduced a trap composed of 246 places in 155 ms of which 3 ms to minimize.
[2024-05-31 07:42:37] [INFO ] Deduced a trap composed of 224 places in 205 ms of which 4 ms to minimize.
[2024-05-31 07:42:38] [INFO ] Deduced a trap composed of 243 places in 172 ms of which 3 ms to minimize.
[2024-05-31 07:42:38] [INFO ] Deduced a trap composed of 239 places in 186 ms of which 8 ms to minimize.
[2024-05-31 07:42:38] [INFO ] Deduced a trap composed of 244 places in 192 ms of which 3 ms to minimize.
[2024-05-31 07:42:38] [INFO ] Deduced a trap composed of 238 places in 163 ms of which 2 ms to minimize.
[2024-05-31 07:42:38] [INFO ] Deduced a trap composed of 257 places in 140 ms of which 2 ms to minimize.
[2024-05-31 07:42:39] [INFO ] Deduced a trap composed of 250 places in 138 ms of which 3 ms to minimize.
[2024-05-31 07:42:40] [INFO ] Deduced a trap composed of 290 places in 211 ms of which 4 ms to minimize.
[2024-05-31 07:42:41] [INFO ] Deduced a trap composed of 239 places in 177 ms of which 3 ms to minimize.
[2024-05-31 07:42:41] [INFO ] Deduced a trap composed of 243 places in 167 ms of which 3 ms to minimize.
[2024-05-31 07:42:41] [INFO ] Deduced a trap composed of 236 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 07:42:44] [INFO ] Deduced a trap composed of 247 places in 185 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 86 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 44/44 constraints]
After SMT, in 61047ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 61064ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61677 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 418 steps, including 0 resets, run found a deadlock after 8 ms. (steps per millisecond=52 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 104229 ms.

BK_STOP 1717141380077

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-COL-S02J04T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-COL-S02J04T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455500049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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