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.r057-tajo-171620409500328.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 BusinessProcesses-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r057-tajo-171620409500328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716543677302

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-24 09:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-24 09:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:41:18] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-24 09:41:18] [INFO ] Transformed 518 places.
[2024-05-24 09:41:18] [INFO ] Transformed 471 transitions.
[2024-05-24 09:41:18] [INFO ] Found NUPN structural information;
[2024-05-24 09:41:18] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 192 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 21 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
[2024-05-24 09:41:19] [INFO ] Flatten gal took : 145 ms
[2024-05-24 09:41:19] [INFO ] Flatten gal took : 72 ms
[2024-05-24 09:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11982804020605863287.gal : 41 ms
[2024-05-24 09:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality498965351068217301.prop : 3 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/ReachabilityCardinality11982804020605863287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality498965351068217301.prop' '--nowitness' '--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 ...328
Loading property file /tmp/ReachabilityCardinality498965351068217301.prop.
RANDOM walk for 40000 steps (359 resets) in 3097 ms. (12 steps per ms) remains 195/356 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 195/195 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 195/195 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
SDD proceeding with computation,356 properties remain. new max is 4
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 195/195 properties
SDD size :1 after 5
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 195/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 195/195 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 195/195 properties
// Phase 1: matrix 464 rows 512 cols
SDD proceeding with computation,356 properties remain. new max is 8
SDD size :5 after 10
[2024-05-24 09:41:20] [INFO ] Computed 85 invariants in 22 ms
[2024-05-24 09:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,356 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,356 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,356 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,356 properties remain. new max is 128
SDD size :197 after 391
SDD proceeding with computation,356 properties remain. new max is 256
SDD size :391 after 3.84528e+14
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 183/378 variables, 30/237 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 183/420 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 68/446 variables, 16/436 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 68/504 constraints. Problems are: Problem set: 0 solved, 195 unsolved
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 446/976 variables, and 504 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5042 ms.
Refiners :[Domain max(s): 446/512 constraints, Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 12/39 constraints, State Equation: 0/512 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 183/378 variables, 30/237 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 183/420 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 32 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 125 places in 96 ms of which 3 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 2 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 2 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 2 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 3 ms to minimize.
[2024-05-24 09:41:26] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 120 places in 102 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 3 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 133 places in 97 ms of which 2 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 133 places in 84 ms of which 3 ms to minimize.
[2024-05-24 09:41:27] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 5 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 2 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 2 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 3 ms to minimize.
[2024-05-24 09:41:28] [INFO ] Deduced a trap composed of 120 places in 101 ms of which 2 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 3 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 113 places in 96 ms of which 3 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 120 places in 95 ms of which 2 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 119 places in 104 ms of which 2 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 3 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 2 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 3 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 7 ms to minimize.
[2024-05-24 09:41:29] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 2 ms to minimize.
[2024-05-24 09:41:30] [INFO ] Deduced a trap composed of 123 places in 85 ms of which 2 ms to minimize.
[2024-05-24 09:41:30] [INFO ] Deduced a trap composed of 125 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 10177ms, After SMT, problems are : Problem set: 0 solved, 195 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 510 transition count 400
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 448 transition count 400
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 126 place count 448 transition count 363
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 206 place count 405 transition count 363
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 227 place count 384 transition count 342
Iterating global reduction 2 with 21 rules applied. Total rules applied 248 place count 384 transition count 342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 248 place count 384 transition count 341
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 383 transition count 341
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 415 place count 299 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 417 place count 298 transition count 263
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 419 place count 298 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 296 transition count 261
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 424 place count 296 transition count 261
Applied a total of 424 rules in 142 ms. Remains 296 /512 variables (removed 216) and now considering 261/464 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 296/512 places, 261/464 transitions.
RANDOM walk for 82484 steps (1609 resets) in 1031 ms. (79 steps per ms) remains 0/195 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12234 ms.

BK_STOP 1716543690832

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

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