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-171654416600021.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-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416600021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717242348709

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:45:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 11:45:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:45:51] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-06-01 11:45:51] [INFO ] Transformed 231 places.
[2024-06-01 11:45:51] [INFO ] Transformed 202 transitions.
[2024-06-01 11:45:51] [INFO ] Found NUPN structural information;
[2024-06-01 11:45:51] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 555 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 11 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 8 ms.20201KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable 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 4 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
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
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 76 rules in 235 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 269 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2413 ms (no deadlock found). (steps per millisecond=518 )
Random directed walk for 1250001 steps, including 0 resets, run took 1616 ms (no deadlock found). (steps per millisecond=773 )
// Phase 1: matrix 164 rows 193 cols
[2024-06-01 11:45:56] [INFO ] Computed 59 invariants in 16 ms
[2024-06-01 11:45:56] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2024-06-01 11:45:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2024-06-01 11:45:57] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-06-01 11:45:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:45:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2024-06-01 11:45:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2024-06-01 11:45:58] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-06-01 11:45:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 11:45:58] [INFO ] [Nat]Added 68 Read/Feed constraints in 74 ms returned sat
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 14 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 4 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 4 ms to minimize.
[2024-06-01 11:45:58] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 4 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 4 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:45:59] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 4 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 3 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 3 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 3 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-06-01 11:46:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3430 ms
[2024-06-01 11:46:01] [INFO ] Computed and/alt/rep : 155/412/155 causal constraints (skipped 7 transitions) in 24 ms.
[2024-06-01 11:46:02] [INFO ] Added : 135 causal constraints over 27 iterations in 974 ms. Result :sat
Parikh directed walk for 26400 steps, including 902 resets, run took 130 ms. (steps per millisecond=203 )
Random directed walk for 500002 steps, including 0 resets, run took 727 ms (no deadlock found). (steps per millisecond=687 )
Random walk for 500000 steps, including 0 resets, run took 897 ms (no deadlock found). (steps per millisecond=557 )
Random directed walk for 500001 steps, including 0 resets, run took 596 ms (no deadlock found). (steps per millisecond=838 )
Random walk for 500000 steps, including 0 resets, run took 769 ms (no deadlock found). (steps per millisecond=650 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 193/193 places, 164/164 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 20 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-06-01 11:46:05] [INFO ] Invariant cache hit.
[2024-06-01 11:46:06] [INFO ] Implicit Places using invariants in 442 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
[2024-06-01 11:46:06] [INFO ] Actually due to overlaps returned [78, 80, 77, 35, 40, 54, 64, 92, 93, 95, 132, 133, 135, 166, 167, 175, 17, 18, 22, 28, 36, 41, 55, 65, 172, 173, 184, 97, 98, 137, 138, 162, 163]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 451 ms to find 33 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 160/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 160 transition count 143
Reduce places removed 21 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 139 transition count 143
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 139 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 137 transition count 141
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 135 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 135 transition count 139
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 132 place count 94 transition count 98
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 132 rules in 33 ms. Remains 94 /160 variables (removed 66) and now considering 98/164 (removed 66) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-06-01 11:46:06] [INFO ] Computed 26 invariants in 3 ms
[2024-06-01 11:46:06] [INFO ] Implicit Places using invariants in 170 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 172 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 88/193 places, 98/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 95
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 84 transition count 94
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 8 rules in 19 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-06-01 11:46:06] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 11:46:06] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 11:46:06] [INFO ] Invariant cache hit.
[2024-06-01 11:46:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:46:06] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 3 : 84/193 places, 94/164 transitions.
Finished structural reductions in DEADLOCK mode , in 3 iterations and 1163 ms. Remains : 84/193 places, 94/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1557 ms (no deadlock found). (steps per millisecond=802 )
Random directed walk for 1250001 steps, including 0 resets, run took 1096 ms (no deadlock found). (steps per millisecond=1140 )
[2024-06-01 11:46:09] [INFO ] Invariant cache hit.
[2024-06-01 11:46:09] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 11:46:09] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 11:46:09] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-01 11:46:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 11:46:09] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-01 11:46:09] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 11:46:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:46:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 20 ms returned sat
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 10 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:46:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:46:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1205 ms
[2024-06-01 11:46:11] [INFO ] Computed and/alt/rep : 92/216/92 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 11:46:11] [INFO ] Added : 89 causal constraints over 19 iterations in 360 ms. Result :sat
Parikh directed walk for 19900 steps, including 370 resets, run took 70 ms. (steps per millisecond=284 )
Random directed walk for 500002 steps, including 0 resets, run took 581 ms (no deadlock found). (steps per millisecond=860 )
Random walk for 500000 steps, including 0 resets, run took 497 ms (no deadlock found). (steps per millisecond=1006 )
Random directed walk for 500000 steps, including 0 resets, run took 384 ms (no deadlock found). (steps per millisecond=1302 )
Random walk for 500000 steps, including 0 resets, run took 502 ms (no deadlock found). (steps per millisecond=996 )
[2024-06-01 11:46:14] [INFO ] Flatten gal took : 109 ms
[2024-06-01 11:46:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 3 ms.
[2024-06-01 11:46:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 202 transitions and 846 arcs took 13 ms.
Total runtime 22773 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717242374465

--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-3"
export BK_EXAMINATION="ReachabilityDeadlock"
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-3, examination is ReachabilityDeadlock"
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-171654416600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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