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

About the Execution of LTSMin+red for ShieldIIPs-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9701.308 2901533.00 11570412.00 42.90 FTFFTTTTTFFTTTFT normal

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-167903716600063.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 ShieldIIPs-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 16:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 66K 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 ShieldIIPs-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679417199939

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=ShieldIIPs-PT-004B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 16:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 16:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:46:42] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-21 16:46:42] [INFO ] Transformed 243 places.
[2023-03-21 16:46:42] [INFO ] Transformed 239 transitions.
[2023-03-21 16:46:42] [INFO ] Found NUPN structural information;
[2023-03-21 16:46:42] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 239 rows 243 cols
[2023-03-21 16:46:43] [INFO ] Computed 37 place invariants in 11 ms
[2023-03-21 16:46:43] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 16:46:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2023-03-21 16:46:44] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-21 16:46:44] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 20 ms to minimize.
[2023-03-21 16:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-21 16:46:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 855 ms
[2023-03-21 16:46:45] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 0 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2023-03-21 16:46:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1157 ms
[2023-03-21 16:46:46] [INFO ] After 3024ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-21 16:46:47] [INFO ] After 3559ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 104 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 239/239 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 243 transition count 233
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 237 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 232 transition count 228
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 22 place count 232 transition count 221
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 36 place count 225 transition count 221
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 46 place count 215 transition count 211
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 215 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 215 transition count 210
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 214 transition count 210
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 118 place count 184 transition count 180
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 184 transition count 180
Applied a total of 124 rules in 107 ms. Remains 184 /243 variables (removed 59) and now considering 180/239 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 184/243 places, 180/239 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 715352 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 715352 steps, saw 125731 distinct states, run finished after 3005 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 180 rows 184 cols
[2023-03-21 16:46:50] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-21 16:46:50] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 16:46:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-21 16:46:51] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 14 ms to minimize.
[2023-03-21 16:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 26 ms to minimize.
[2023-03-21 16:46:51] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1018 ms
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-21 16:46:52] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-21 16:46:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-21 16:46:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 441 ms
[2023-03-21 16:46:53] [INFO ] After 2146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-21 16:46:53] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 104 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 17 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 184/184 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-21 16:46:53] [INFO ] Invariant cache hit.
[2023-03-21 16:46:53] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-21 16:46:53] [INFO ] Invariant cache hit.
[2023-03-21 16:46:53] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-21 16:46:53] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-21 16:46:53] [INFO ] Invariant cache hit.
[2023-03-21 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-21 16:46:54] [INFO ] Invariant cache hit.
[2023-03-21 16:46:54] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 16:46:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 49 ms returned sat
[2023-03-21 16:46:54] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 16:46:54] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 18 ms to minimize.
[2023-03-21 16:46:54] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 14 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 23 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 405 ms
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-21 16:46:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-21 16:46:55] [INFO ] After 1435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-21 16:46:56] [INFO ] After 1771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 16:46:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 21 ms.
[2023-03-21 16:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 180 transitions and 612 arcs took 2 ms.
[2023-03-21 16:46:56] [INFO ] Flatten gal took : 56 ms
Total runtime 14101 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/633/inv_0_ --invariant=/tmp/633/inv_1_ --invariant=/tmp/633/inv_2_ --inv-par
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679420101472

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldIIPs-PT-004B-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/633/inv_0_
rfs formula name ShieldIIPs-PT-004B-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/633/inv_1_
rfs formula name ShieldIIPs-PT-004B-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/633/inv_2_
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 184 places, 180 transitions and 612 arcs
pnml2lts-sym: Petri net ShieldIIPs_PT_004B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 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: 180->170 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.010 sys
pnml2lts-sym: state vector length is 184; there are 170 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/633/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 235720543 group checks and 0 next state calls
pnml2lts-sym: reachability took 2883.450 real 11510.820 user 15.180 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.660 real 2.630 user 0.000 sys
pnml2lts-sym: state space has 1.31980608195271e+19 states, 3676907 nodes
pnml2lts-sym: group_next: 1554 nodes total
pnml2lts-sym: group_explored: 1682 nodes, 1470 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="ShieldIIPs-PT-004B"
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 ShieldIIPs-PT-004B, 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 r393-oct2-167903716600063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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