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

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
586.476 194880.00 753502.00 113.10 TTFTTTTTFFFTFFFT 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-167905978100383.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 SieveSingleMsgMbox-PT-d0m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679313835809

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=SieveSingleMsgMbox-PT-d0m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:03:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:03:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:03:58] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-20 12:03:58] [INFO ] Transformed 262 places.
[2023-03-20 12:03:58] [INFO ] Transformed 73 transitions.
[2023-03-20 12:03:58] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 10) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 394 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 12:03:59] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-20 12:03:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:03:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:03:59] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-20 12:04:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:04:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:04:00] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-20 12:04:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 12:04:00] [INFO ] After 88ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-20 12:04:00] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 12:04:00] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 63 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 63 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 62 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 61 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 62
Applied a total of 20 rules in 37 ms. Remains 61 /72 variables (removed 11) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 61/72 places, 62/73 transitions.
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 508 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 938061 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 938061 steps, saw 450371 distinct states, run finished after 3004 ms. (steps per millisecond=312 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 61 cols
[2023-03-20 12:04:04] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:04:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 12:04:04] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:04:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:04:04] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:04] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:04] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 12:04:04] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 62/62 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2749933 steps, run timeout after 3001 ms. (steps per millisecond=916 ) properties seen :{}
Probabilistic random walk after 2749933 steps, saw 1212464 distinct states, run finished after 3002 ms. (steps per millisecond=916 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:04:07] [INFO ] Invariant cache hit.
[2023-03-20 12:04:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 12:04:07] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:04:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:04:07] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:07] [INFO ] After 23ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:07] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 12:04:07] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 14 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:04:07] [INFO ] Invariant cache hit.
[2023-03-20 12:04:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:04:07] [INFO ] Invariant cache hit.
[2023-03-20 12:04:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:04:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-20 12:04:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:04:07] [INFO ] Invariant cache hit.
[2023-03-20 12:04:07] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 61/61 places, 62/62 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 1 place count 61 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 11 place count 56 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 55 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 54 transition count 55
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 54 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 53 transition count 54
Applied a total of 17 rules in 15 ms. Remains 53 /61 variables (removed 8) and now considering 54/62 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 53 cols
[2023-03-20 12:04:07] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:04:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 12:04:07] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:04:07] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:04:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 12:04:07] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:04:07] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:07] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 12:04:07] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:04:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-20 12:04:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 62 transitions and 246 arcs took 1 ms.
[2023-03-20 12:04:08] [INFO ] Flatten gal took : 33 ms
Total runtime 10144 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/510/inv_0_ --inv-par
FORMULA SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679314030689

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name SieveSingleMsgMbox-PT-d0m36-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/510/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 61 places, 62 transitions and 246 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d0m36 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: 62->60 groups
pnml2lts-sym: Regrouping took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 61; there are 60 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:
pnml2lts-sym: Invariant violation (/tmp/510/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 182.190 real 727.030 user 1.030 sys
pnml2lts-sym: max token count: 36

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="SieveSingleMsgMbox-PT-d0m36"
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 SieveSingleMsgMbox-PT-d0m36, 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-167905978100383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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