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.r105-tall-167814481200422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678295330837

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=DES-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 17:08:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 17:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:08:52] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 17:08:52] [INFO ] Transformed 320 places.
[2023-03-08 17:08:52] [INFO ] Transformed 271 transitions.
[2023-03-08 17:08:52] [INFO ] Found NUPN structural information;
[2023-03-08 17:08:52] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 12) seen :8
FORMULA DES-PT-10b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :1
FORMULA DES-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 271 rows 320 cols
[2023-03-08 17:08:53] [INFO ] Computed 65 place invariants in 29 ms
[2023-03-08 17:08:53] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:08:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 161 ms returned sat
[2023-03-08 17:08:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 17:08:54] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:08:54] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 6 ms to minimize.
[2023-03-08 17:08:54] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-08 17:08:54] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2023-03-08 17:08:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2023-03-08 17:08:54] [INFO ] After 1256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-08 17:08:55] [INFO ] After 1971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 68 ms.
Support contains 50 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 311 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 311 transition count 260
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 303 transition count 254
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 297 transition count 254
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 29 place count 297 transition count 248
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 41 place count 291 transition count 248
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 58 place count 274 transition count 231
Iterating global reduction 3 with 17 rules applied. Total rules applied 75 place count 274 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 274 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 273 transition count 230
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 88 place count 262 transition count 219
Iterating global reduction 3 with 11 rules applied. Total rules applied 99 place count 262 transition count 219
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 110 place count 262 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 261 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 111 place count 261 transition count 207
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 260 transition count 207
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 215 place count 209 transition count 156
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 209 transition count 155
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 209 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 222 place count 206 transition count 152
Applied a total of 222 rules in 128 ms. Remains 206 /320 variables (removed 114) and now considering 152/271 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 206/320 places, 152/271 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 961330 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 961330 steps, saw 149706 distinct states, run finished after 3002 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 206 cols
[2023-03-08 17:08:58] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 17:08:58] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:08:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 17:08:58] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-08 17:08:59] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:08:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 17:08:59] [INFO ] After 99ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 17:08:59] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-08 17:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 17:08:59] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 17:08:59] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 50 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 206/206 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-08 17:08:59] [INFO ] Invariant cache hit.
[2023-03-08 17:08:59] [INFO ] Implicit Places using invariants in 241 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 249 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 263 ms. Remains : 205/206 places, 152/152 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 969165 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 969165 steps, saw 150892 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 205 cols
[2023-03-08 17:09:02] [INFO ] Computed 58 place invariants in 11 ms
[2023-03-08 17:09:03] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:09:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 17:09:03] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-08 17:09:03] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:09:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 17:09:03] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 17:09:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-08 17:09:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-08 17:09:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-08 17:09:03] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-08 17:09:03] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 205/205 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-08 17:09:03] [INFO ] Invariant cache hit.
[2023-03-08 17:09:03] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 17:09:03] [INFO ] Invariant cache hit.
[2023-03-08 17:09:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 17:09:03] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-08 17:09:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 17:09:03] [INFO ] Invariant cache hit.
[2023-03-08 17:09:04] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 205/205 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 17:09:04] [INFO ] Invariant cache hit.
[2023-03-08 17:09:04] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:09:04] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 17:09:04] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-08 17:09:04] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 235 ms
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2023-03-08 17:09:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-08 17:09:04] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-08 17:09:04] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 17:09:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-08 17:09:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 152 transitions and 593 arcs took 2 ms.
[2023-03-08 17:09:05] [INFO ] Flatten gal took : 45 ms
Total runtime 12848 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/533/inv_0_ --invariant=/tmp/533/inv_1_ --inv-par
FORMULA DES-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678295374122

--------------------
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
rfs formula name DES-PT-10b-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/533/inv_0_
rfs formula name DES-PT-10b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/533/inv_1_
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 205 places, 152 transitions and 593 arcs
pnml2lts-sym: Petri net DES_PT_10b 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: 152->144 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 205; there are 144 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:
pnml2lts-sym: Invariant violation (/tmp/533/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/533/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 8.990 real 34.840 user 0.950 sys
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="DES-PT-10b"
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 DES-PT-10b, 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 r105-tall-167814481200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;