Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300694.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 685K Mar 5 18:23 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 ShieldPPPt-PT-100A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679471201587

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=ShieldPPPt-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:46:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:46:44] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-22 07:46:44] [INFO ] Transformed 2503 places.
[2023-03-22 07:46:44] [INFO ] Transformed 1803 transitions.
[2023-03-22 07:46:44] [INFO ] Found NUPN structural information;
[2023-03-22 07:46:44] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 152391 steps, run timeout after 9018 ms. (steps per millisecond=16 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 12=1}
Probabilistic random walk after 152391 steps, saw 151068 distinct states, run finished after 9023 ms. (steps per millisecond=16 ) properties seen :10
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:46:57] [INFO ] Computed 1101 place invariants in 51 ms
[2023-03-22 07:46:58] [INFO ] After 1285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:46:59] [INFO ] [Nat]Absence check using 1101 positive place invariants in 656 ms returned sat
[2023-03-22 07:47:06] [INFO ] After 6097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:47:11] [INFO ] After 12008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4328 ms.
[2023-03-22 07:47:16] [INFO ] After 17822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 968 ms.
Support contains 36 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 379 times.
Drop transitions removed 379 transitions
Iterating global reduction 0 with 379 rules applied. Total rules applied 383 place count 2501 transition count 1800
Applied a total of 383 rules in 797 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 77595 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77595 steps, saw 74420 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:47:21] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-22 07:47:22] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:47:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 288 ms returned sat
[2023-03-22 07:47:28] [INFO ] After 4678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:47:28] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-22 07:47:31] [INFO ] After 2627ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 07:47:33] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 14 ms to minimize.
[2023-03-22 07:47:34] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 23 ms to minimize.
[2023-03-22 07:47:34] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 3 ms to minimize.
[2023-03-22 07:47:35] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 2 ms to minimize.
[2023-03-22 07:47:35] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 1 ms to minimize.
[2023-03-22 07:47:36] [INFO ] Deduced a trap composed of 6 places in 490 ms of which 15 ms to minimize.
[2023-03-22 07:47:36] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 0 ms to minimize.
[2023-03-22 07:47:37] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-22 07:47:37] [INFO ] Deduced a trap composed of 7 places in 590 ms of which 1 ms to minimize.
[2023-03-22 07:47:38] [INFO ] Deduced a trap composed of 7 places in 383 ms of which 1 ms to minimize.
[2023-03-22 07:47:38] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-22 07:47:39] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 07:47:39] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-22 07:47:39] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-22 07:47:40] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-22 07:47:40] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-22 07:47:41] [INFO ] Deduced a trap composed of 7 places in 392 ms of which 1 ms to minimize.
[2023-03-22 07:47:42] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:47:43] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 0 ms to minimize.
[2023-03-22 07:47:43] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2023-03-22 07:47:44] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-22 07:47:45] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-22 07:47:45] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-22 07:47:45] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-22 07:47:45] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 12447 ms
[2023-03-22 07:47:45] [INFO ] After 17476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1672 ms.
[2023-03-22 07:47:47] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 977 ms.
Support contains 36 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 110 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 92 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-22 07:47:48] [INFO ] Invariant cache hit.
[2023-03-22 07:47:51] [INFO ] Implicit Places using invariants in 2781 ms returned []
[2023-03-22 07:47:51] [INFO ] Invariant cache hit.
[2023-03-22 07:47:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-22 07:47:54] [INFO ] Implicit Places using invariants and state equation in 3217 ms returned []
Implicit Place search using SMT with State Equation took 6026 ms to find 0 implicit places.
[2023-03-22 07:47:54] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-22 07:47:54] [INFO ] Invariant cache hit.
[2023-03-22 07:47:57] [INFO ] Dead Transitions using invariants and state equation in 2751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9033 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7225 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 100 place count 2498 transition count 1798
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 195 place count 2498 transition count 1703
Applied a total of 195 rules in 492 ms. Remains 2498 /2501 variables (removed 3) and now considering 1703/1800 (removed 97) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1703 rows 2498 cols
[2023-03-22 07:47:58] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-22 07:47:58] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:47:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 304 ms returned sat
[2023-03-22 07:48:09] [INFO ] After 9545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:48:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 07:48:11] [INFO ] After 2472ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 07:48:18] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 07:48:18] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-22 07:48:19] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-22 07:48:19] [INFO ] Deduced a trap composed of 7 places in 508 ms of which 0 ms to minimize.
[2023-03-22 07:48:20] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 1 ms to minimize.
[2023-03-22 07:48:20] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2023-03-22 07:48:21] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 07:48:21] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 16 ms to minimize.
[2023-03-22 07:48:21] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-22 07:48:22] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 16 ms to minimize.
[2023-03-22 07:48:22] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 0 ms to minimize.
[2023-03-22 07:48:22] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:48:23] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-22 07:48:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5016 ms
[2023-03-22 07:48:23] [INFO ] After 13873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4320 ms.
[2023-03-22 07:48:27] [INFO ] After 28794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 07:48:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 27 ms.
[2023-03-22 07:48:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2501 places, 1800 transitions and 8241 arcs took 10 ms.
[2023-03-22 07:48:28] [INFO ] Flatten gal took : 390 ms
Total runtime 104278 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/621/inv_0_ --invariant=/tmp/621/inv_1_ --invariant=/tmp/621/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15100008 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096620 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="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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 r393-oct2-167903717300694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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