Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694700422.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678635967441

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:46:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:46:09] [INFO ] Load time of PNML (sax parser for PT used): 721 ms
[2023-03-12 15:46:09] [INFO ] Transformed 754 places.
[2023-03-12 15:46:09] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:46:09] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 898 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 114 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 94802 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94802 steps, saw 48107 distinct states, run finished after 3010 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-12 15:46:14] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 15:46:14] [INFO ] Computed 10 place invariants in 39 ms
[2023-03-12 15:46:14] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 15:46:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:16] [INFO ] After 1074ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-12 15:46:16] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:46:16] [INFO ] After 853ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2023-03-12 15:46:17] [INFO ] Deduced a trap composed of 73 places in 481 ms of which 7 ms to minimize.
[2023-03-12 15:46:18] [INFO ] Deduced a trap composed of 23 places in 529 ms of which 1 ms to minimize.
[2023-03-12 15:46:18] [INFO ] Deduced a trap composed of 87 places in 358 ms of which 2 ms to minimize.
[2023-03-12 15:46:18] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 1 ms to minimize.
[2023-03-12 15:46:19] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 0 ms to minimize.
[2023-03-12 15:46:19] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 1 ms to minimize.
[2023-03-12 15:46:20] [INFO ] Deduced a trap composed of 56 places in 440 ms of which 1 ms to minimize.
[2023-03-12 15:46:20] [INFO ] Deduced a trap composed of 55 places in 405 ms of which 1 ms to minimize.
[2023-03-12 15:46:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3876 ms
[2023-03-12 15:46:21] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2023-03-12 15:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-12 15:46:22] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 1 ms to minimize.
[2023-03-12 15:46:22] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 1 ms to minimize.
[2023-03-12 15:46:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1147 ms
[2023-03-12 15:46:22] [INFO ] After 6596ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 384 ms.
[2023-03-12 15:46:23] [INFO ] After 8253ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 275 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 271 transition count 3873
Applied a total of 15 rules in 420 ms. Remains 271 /280 variables (removed 9) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 271/280 places, 3873/3904 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 119559 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119559 steps, saw 60824 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:46:26] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 271 cols
[2023-03-12 15:46:26] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 15:46:26] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:46:27] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:46:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:28] [INFO ] After 830ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:46:29] [INFO ] Deduced a trap composed of 16 places in 493 ms of which 0 ms to minimize.
[2023-03-12 15:46:30] [INFO ] Deduced a trap composed of 10 places in 513 ms of which 1 ms to minimize.
[2023-03-12 15:46:30] [INFO ] Deduced a trap composed of 58 places in 474 ms of which 1 ms to minimize.
[2023-03-12 15:46:31] [INFO ] Deduced a trap composed of 86 places in 538 ms of which 1 ms to minimize.
[2023-03-12 15:46:32] [INFO ] Deduced a trap composed of 59 places in 550 ms of which 0 ms to minimize.
[2023-03-12 15:46:32] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 1 ms to minimize.
[2023-03-12 15:46:33] [INFO ] Deduced a trap composed of 92 places in 382 ms of which 0 ms to minimize.
[2023-03-12 15:46:34] [INFO ] Deduced a trap composed of 84 places in 561 ms of which 1 ms to minimize.
[2023-03-12 15:46:34] [INFO ] Deduced a trap composed of 120 places in 575 ms of which 1 ms to minimize.
[2023-03-12 15:46:35] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 1 ms to minimize.
[2023-03-12 15:46:35] [INFO ] Deduced a trap composed of 87 places in 391 ms of which 0 ms to minimize.
[2023-03-12 15:46:36] [INFO ] Deduced a trap composed of 93 places in 422 ms of which 1 ms to minimize.
[2023-03-12 15:46:36] [INFO ] Deduced a trap composed of 91 places in 416 ms of which 0 ms to minimize.
[2023-03-12 15:46:37] [INFO ] Deduced a trap composed of 62 places in 484 ms of which 2 ms to minimize.
[2023-03-12 15:46:37] [INFO ] Deduced a trap composed of 63 places in 438 ms of which 0 ms to minimize.
[2023-03-12 15:46:38] [INFO ] Deduced a trap composed of 87 places in 437 ms of which 0 ms to minimize.
[2023-03-12 15:46:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9316 ms
[2023-03-12 15:46:38] [INFO ] After 10851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-12 15:46:39] [INFO ] After 12317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 8 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 107 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 271/271 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 100 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2023-03-12 15:46:39] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2023-03-12 15:46:39] [INFO ] Invariant cache hit.
[2023-03-12 15:46:39] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-12 15:46:39] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2023-03-12 15:46:39] [INFO ] Invariant cache hit.
[2023-03-12 15:46:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:41] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
[2023-03-12 15:46:42] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-12 15:46:42] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2023-03-12 15:46:42] [INFO ] Invariant cache hit.
[2023-03-12 15:46:43] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3844 ms. Remains : 271/271 places, 3873/3873 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 271 transition count 3700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 270 transition count 3699
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 270 transition count 3698
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 180 place count 270 transition count 3694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 184 place count 266 transition count 3694
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 207 place count 266 transition count 3694
Applied a total of 207 rules in 412 ms. Remains 266 /271 variables (removed 5) and now considering 3694/3873 (removed 179) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3694 rows 266 cols
[2023-03-12 15:46:43] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-12 15:46:43] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:46:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:46:44] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:46:44] [INFO ] After 886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-12 15:46:44] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:46:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 15:46:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 3873 transitions and 19049 arcs took 28 ms.
[2023-03-12 15:46:45] [INFO ] Flatten gal took : 362 ms
Total runtime 36453 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/592/inv_0_ --invariant=/tmp/592/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 15500980 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16082396 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="BugTracking-PT-q8m032"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m032, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694700422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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