Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r514-smll-171654416500013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ParamProductionCell-PT-1, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 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:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717242216347

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:43:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 11:43:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:43:39] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-06-01 11:43:39] [INFO ] Transformed 231 places.
[2024-06-01 11:43:39] [INFO ] Transformed 202 transitions.
[2024-06-01 11:43:39] [INFO ] Found NUPN structural information;
[2024-06-01 11:43:39] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 527 ms.
RANDOM walk for 40000 steps (8 resets) in 3065 ms. (13 steps per ms) remains 24/231 properties
BEST_FIRST walk for 4001 steps (8 resets) in 164 ms. (24 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
// Phase 1: matrix 202 rows 231 cols
[2024-06-01 11:43:41] [INFO ] Computed 59 invariants in 44 ms
[2024-06-01 11:43:41] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 86/110 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 8/118 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 56/174 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 23/197 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 23/238 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 8/205 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 8/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 165/370 variables, 205/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 37/407 variables, 68/527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 26/433 variables, 26/553 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/433 variables, 26/579 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/433 variables, 10/589 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/433 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 171.0 196.0))
(s2 (/ 1.0 4.0))
(s3 0.0)
(s4 0.0)
(s5 (/ 89.0 98.0))
(s6 0.0)
(s7 (/ 9.0 98.0))
(s8 0.0)
(s9 (/ 95.0 98.0))
(s10 (/ 43.0 49.0))
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 (/ 40.0 49.0))
(s15 (/ 46.0 49.0))
(s16 (/ 3.0 98.0))
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 (/ 3.0 98.0))
(s33 0.0)
(s34 0.0)
(s35 (/ 43.0 49.0))
(s36 (/ 6.0 49.0))
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 46.0 49.0))
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 (/ 1.0 49.0))
(s99 (/ 45.0 49.0))
(s100 (/ 1.0 196.0))
(s101 (/ 3.0 49.0))
(s102 (/ 1.0 196.0))
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 (/ 1.0 196.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 589 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5092 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 86/110 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 8/118 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 56/174 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 23/197 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 23/238 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 8/205 variables, 8/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 8/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 165/370 variables, 205/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 37/407 variables, 68/527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 26/433 variables, 26/553 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/433 variables, 26/579 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/433 variables, 10/589 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/433 variables, 24/613 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 11:43:50] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 46 ms to minimize.
[2024-06-01 11:43:50] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 5 ms to minimize.
[2024-06-01 11:43:50] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 4 ms to minimize.
[2024-06-01 11:43:51] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 4 ms to minimize.
[2024-06-01 11:43:51] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 4 ms to minimize.
SMT process timed out in 10351ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 199 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 195 transition count 166
Applied a total of 72 rules in 144 ms. Remains 195 /231 variables (removed 36) and now considering 166/202 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 195/231 places, 166/202 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23662 ms. (169 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1540 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1536 ms. (260 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1543 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1527 ms. (261 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1536 ms. (260 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1546 ms. (258 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1526 ms. (261 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1526 ms. (261 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1535 ms. (260 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1552 ms. (257 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1528 ms. (261 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1533 ms. (260 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1538 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1541 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1617 ms. (247 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1542 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1533 ms. (260 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1663 ms. (240 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1542 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1663 ms. (240 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1599 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1559 ms. (256 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1540 ms. (259 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1535 ms. (260 steps per ms) remains 24/24 properties
Probably explored full state space saw : 2710 states, properties seen :0
Probabilistic random walk after 9540 steps, saw 2710 distinct states, run finished after 133 ms. (steps per millisecond=71 ) properties seen :0
Explored full state space saw : 2710 states, properties seen :0
Exhaustive walk after 9540 steps, saw 2710 distinct states, run finished after 115 ms. (steps per millisecond=82 ) properties seen :0
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK TOPOLOGICAL
Total runtime 30154 ms.
ITS solved all properties within timeout

BK_STOP 1717242248959

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ParamProductionCell-PT-1, 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 r514-smll-171654416500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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