fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905977900255
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldRVt-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
453.348 12424.00 28134.00 78.50 FTTTTTFFTFTFTTTF normal

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.r425-tajo-167905977900255.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 ShieldRVt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977900255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:05 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.5K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 23:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 23:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 23:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 60K 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 ShieldRVt-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679306155998

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:55:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:55:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:55:58] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-20 09:55:58] [INFO ] Transformed 253 places.
[2023-03-20 09:55:58] [INFO ] Transformed 253 transitions.
[2023-03-20 09:55:58] [INFO ] Found NUPN structural information;
[2023-03-20 09:55:58] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 16) seen :12
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 253 cols
[2023-03-20 09:55:58] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-20 09:55:59] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:55:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-20 09:55:59] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:55:59] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 9 ms to minimize.
[2023-03-20 09:55:59] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:55:59] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-20 09:55:59] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-20 09:56:00] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2023-03-20 09:56:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-20 09:56:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 538 ms
[2023-03-20 09:56:00] [INFO ] After 899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-20 09:56:00] [INFO ] After 1172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 57 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 253/253 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 253 transition count 220
Reduce places removed 33 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 41 rules applied. Total rules applied 74 place count 220 transition count 212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 82 place count 212 transition count 212
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 82 place count 212 transition count 188
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 130 place count 188 transition count 188
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 157 place count 161 transition count 161
Iterating global reduction 3 with 27 rules applied. Total rules applied 184 place count 161 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 161 transition count 160
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 185 place count 161 transition count 155
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 195 place count 156 transition count 155
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 261 place count 123 transition count 122
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 267 place count 120 transition count 122
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 120 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 271 place count 118 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 118 transition count 120
Applied a total of 273 rules in 109 ms. Remains 118 /253 variables (removed 135) and now considering 120/253 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 118/253 places, 120/253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 118 cols
[2023-03-20 09:56:00] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 09:56:00] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-20 09:56:00] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 09:56:00] [INFO ] After 29ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:00] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-20 09:56:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-20 09:56:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-20 09:56:00] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-20 09:56:00] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 39 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 120/120 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 117
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 115 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 114 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 114 transition count 111
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 109 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 104 transition count 106
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 104 transition count 106
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 3 with 6 rules applied. Total rules applied 34 place count 101 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 99 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 99 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 98 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 98 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 97 transition count 101
Applied a total of 42 rules in 23 ms. Remains 97 /118 variables (removed 21) and now considering 101/120 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 97/118 places, 101/120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1751706 steps, run timeout after 3001 ms. (steps per millisecond=583 ) properties seen :{}
Probabilistic random walk after 1751706 steps, saw 703206 distinct states, run finished after 3008 ms. (steps per millisecond=582 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 97 cols
[2023-03-20 09:56:04] [INFO ] Computed 21 place invariants in 8 ms
[2023-03-20 09:56:04] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 09:56:04] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 09:56:04] [INFO ] After 68ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:04] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2023-03-20 09:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-20 09:56:04] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 09:56:04] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-20 09:56:04] [INFO ] Invariant cache hit.
[2023-03-20 09:56:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 09:56:04] [INFO ] Invariant cache hit.
[2023-03-20 09:56:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 09:56:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-20 09:56:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 09:56:04] [INFO ] Invariant cache hit.
[2023-03-20 09:56:04] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 97/97 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 09:56:04] [INFO ] Invariant cache hit.
[2023-03-20 09:56:04] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 09:56:04] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-20 09:56:05] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-20 09:56:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2023-03-20 09:56:05] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 09:56:05] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 09:56:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 101 transitions and 331 arcs took 1 ms.
[2023-03-20 09:56:05] [INFO ] Flatten gal took : 39 ms
Total runtime 7233 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 --inv-bin-par --invariant=/tmp/542/inv_0_ --inv-par
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679306168422

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldRVt-PT-005B-ReachabilityFireability-13
rfs formula type AG
rfs formula formula --invariant=/tmp/542/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 97 places, 101 transitions and 331 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_005B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 101->84 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 97; there are 84 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 29019 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.350 real 1.190 user 0.130 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 833965467316 states, 2724 nodes
pnml2lts-sym: group_next: 843 nodes total
pnml2lts-sym: group_explored: 765 nodes, 1017 short vectors total
pnml2lts-sym: max token count: 1

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="ShieldRVt-PT-005B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-005B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977900255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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