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-171654446600224.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-S02J04T06, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 862K 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 1716913235148

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-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-28 16:20:36] [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 16:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:20:37] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-28 16:20:37] [INFO ] Transformed 476 places.
[2024-05-28 16:20:37] [INFO ] Transformed 920 transitions.
[2024-05-28 16:20:37] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 381 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 476/476 places, 824/824 transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 16:20:37] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 16:20:37] [INFO ] Computed 46 invariants in 70 ms
[2024-05-28 16:20:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 16 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
[2024-05-28 16:20:46] [INFO ] Deduced a trap composed of 282 places in 295 ms of which 3 ms to minimize.
[2024-05-28 16:20:46] [INFO ] Deduced a trap composed of 136 places in 271 ms of which 2 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 322 places in 307 ms of which 3 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 229 places in 287 ms of which 3 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:20:48] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:20:49] [INFO ] Deduced a trap composed of 269 places in 271 ms of which 3 ms to minimize.
[2024-05-28 16:20:51] [INFO ] Deduced a trap composed of 318 places in 222 ms of which 4 ms to minimize.
[2024-05-28 16:20:52] [INFO ] Deduced a trap composed of 242 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:20:52] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 10 ms to minimize.
[2024-05-28 16:20:52] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 55 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 2 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 3 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 28 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 251 places in 308 ms of which 4 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 193 places in 297 ms of which 3 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 132 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 271 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 275 places in 224 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 272 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 260 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 274 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 159 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 4 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 282 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:21:11] [INFO ] Deduced a trap composed of 297 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:21:16] [INFO ] Deduced a trap composed of 269 places in 235 ms of which 4 ms to minimize.
[2024-05-28 16:21:17] [INFO ] Deduced a trap composed of 279 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 304 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 275 places in 254 ms of which 3 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 285 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 252 places in 197 ms of which 2 ms to minimize.
SMT process timed out in 41476ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41518ms
[2024-05-28 16:21:19] [INFO ] Redundant transitions in 52 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-28 16:21:19] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 16:21:19] [INFO ] Invariant cache hit.
[2024-05-28 16:21:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:21:25] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:21:26] [INFO ] Deduced a trap composed of 277 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:21:26] [INFO ] Deduced a trap composed of 136 places in 304 ms of which 4 ms to minimize.
[2024-05-28 16:21:26] [INFO ] Deduced a trap composed of 246 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:21:27] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:21:27] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:21:27] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 7 ms to minimize.
[2024-05-28 16:21:27] [INFO ] Deduced a trap composed of 290 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:21:28] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:21:29] [INFO ] Deduced a trap composed of 262 places in 293 ms of which 14 ms to minimize.
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 243 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 215 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 116 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:21:39] [INFO ] Deduced a trap composed of 265 places in 222 ms of which 4 ms to minimize.
[2024-05-28 16:21:40] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/56 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 56 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 16:21:59] [INFO ] Deduced a trap composed of 279 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:22:01] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:22:01] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 4 ms to minimize.
[2024-05-28 16:22:01] [INFO ] Deduced a trap composed of 226 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:22:02] [INFO ] Deduced a trap composed of 264 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:22:02] [INFO ] Deduced a trap composed of 261 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:22:02] [INFO ] Deduced a trap composed of 260 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:22:02] [INFO ] Deduced a trap composed of 255 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:22:03] [INFO ] Deduced a trap composed of 287 places in 388 ms of which 22 ms to minimize.
[2024-05-28 16:22:03] [INFO ] Deduced a trap composed of 264 places in 292 ms of which 3 ms to minimize.
[2024-05-28 16:22:03] [INFO ] Deduced a trap composed of 268 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:22:04] [INFO ] Deduced a trap composed of 275 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:22:05] [INFO ] Deduced a trap composed of 238 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:22:05] [INFO ] Deduced a trap composed of 286 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:22:08] [INFO ] Deduced a trap composed of 265 places in 243 ms of which 3 ms to minimize.
[2024-05-28 16:22:09] [INFO ] Deduced a trap composed of 276 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 16/72 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 72 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 36/36 constraints]
After SMT, in 60774ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60786ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 102498 ms. Remains : 476/476 places, 824/824 transitions.
Final net has 476 places and 824 transitions.
[2024-05-28 16:22:20] [INFO ] Flatten gal took : 91 ms
[2024-05-28 16:22:20] [INFO ] Applying decomposition
[2024-05-28 16:22:20] [INFO ] Flatten gal took : 49 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/graph5235172786235110545.txt' '-o' '/tmp/graph5235172786235110545.bin' '-w' '/tmp/graph5235172786235110545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5235172786235110545.bin' '-l' '-1' '-v' '-w' '/tmp/graph5235172786235110545.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:22:20] [INFO ] Decomposing Gal with order
[2024-05-28 16:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:22:20] [INFO ] Removed a total of 512 redundant transitions.
[2024-05-28 16:22:20] [INFO ] Flatten gal took : 118 ms
[2024-05-28 16:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 17 ms.
[2024-05-28 16:22:20] [INFO ] Time to serialize gal into /tmp/StateSpace14516606815539307016.gal : 14 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/StateSpace14516606815539307016.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 ...220
ITS-tools command line returned an error code 137
[2024-05-28 16:37:16] [INFO ] Flatten gal took : 83 ms
[2024-05-28 16:37:16] [INFO ] Time to serialize gal into /tmp/StateSpace17350823147278920461.gal : 17 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/StateSpace17350823147278920461.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 ...241
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.40755e+08,138.695,2194560,2,302243,5,3.73322e+06,6,0,2800,4.44856e+06,0
Total reachable state count : 140754672

Max variable value : 10
STATE_SPACE MAX_TOKEN_IN_PLACE 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Maximum sum along a path : 63
STATE_SPACE MAX_TOKEN_PER_MARKING 63 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exact state count : 140754672
STATE_SPACE STATES 140754672 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1140882 ms.

BK_STOP 1716914377896

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

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