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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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 450K 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-d1m96-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679317610317

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-d1m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:06:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:06:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:06:51] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-20 13:06:51] [INFO ] Transformed 1295 places.
[2023-03-20 13:06:51] [INFO ] Transformed 749 transitions.
[2023-03-20 13:06:51] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2196 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 213926 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{1=1, 5=1, 7=1, 10=1, 11=1, 12=1, 15=1}
Probabilistic random walk after 213926 steps, saw 98385 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :7
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 13:06:55] [INFO ] Computed 6 place invariants in 21 ms
[2023-03-20 13:06:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:06:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:06:56] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-20 13:06:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:06:56] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 13:06:57] [INFO ] After 1162ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-20 13:06:57] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 13:06:58] [INFO ] After 658ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2023-03-20 13:06:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
[2023-03-20 13:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-20 13:06:58] [INFO ] After 1401ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 874 ms.
[2023-03-20 13:06:59] [INFO ] After 3598ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 326 ms.
Support contains 31 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 283 place count 201 transition count 410
Iterating global reduction 1 with 40 rules applied. Total rules applied 323 place count 201 transition count 410
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 332 place count 201 transition count 401
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 355 place count 178 transition count 378
Iterating global reduction 2 with 23 rules applied. Total rules applied 378 place count 178 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 384 place count 178 transition count 372
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 399 place count 163 transition count 356
Iterating global reduction 3 with 15 rules applied. Total rules applied 414 place count 163 transition count 356
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 448 place count 163 transition count 322
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 449 place count 162 transition count 321
Iterating global reduction 4 with 1 rules applied. Total rules applied 450 place count 162 transition count 321
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 451 place count 161 transition count 320
Iterating global reduction 4 with 1 rules applied. Total rules applied 452 place count 161 transition count 320
Applied a total of 452 rules in 147 ms. Remains 161 /259 variables (removed 98) and now considering 320/749 (removed 429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 161/259 places, 320/749 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 435 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 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 463 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 365856 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365856 steps, saw 171350 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 320 rows 161 cols
[2023-03-20 13:07:03] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 13:07:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:07:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:07:03] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:07:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:07:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:07:04] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:07:04] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-20 13:07:04] [INFO ] After 274ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 13:07:04] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-20 13:07:05] [INFO ] After 1264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 224 ms.
Support contains 31 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 320/320 transitions.
Applied a total of 0 rules in 22 ms. Remains 161 /161 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 161/161 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 320/320 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2023-03-20 13:07:05] [INFO ] Invariant cache hit.
[2023-03-20 13:07:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-20 13:07:05] [INFO ] Invariant cache hit.
[2023-03-20 13:07:05] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-20 13:07:05] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-20 13:07:06] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-20 13:07:06] [INFO ] Invariant cache hit.
[2023-03-20 13:07:06] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 161/161 places, 320/320 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 161 transition count 315
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 157 transition count 315
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 9 place count 157 transition count 301
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 143 transition count 301
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 131 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 129 transition count 292
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 129 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 128 transition count 291
Applied a total of 67 rules in 30 ms. Remains 128 /161 variables (removed 33) and now considering 291/320 (removed 29) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 291 rows 128 cols
[2023-03-20 13:07:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:07:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:07:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 13:07:06] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:07:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:07:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:07:06] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:07:06] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
[2023-03-20 13:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-20 13:07:06] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-20 13:07:06] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 13:07:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-20 13:07:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 320 transitions and 1265 arcs took 3 ms.
[2023-03-20 13:07:07] [INFO ] Flatten gal took : 49 ms
Total runtime 15441 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/511/inv_0_ --invariant=/tmp/511/inv_1_ --invariant=/tmp/511/inv_2_ --invariant=/tmp/511/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 14260320 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101608 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-13

BK_STOP 1679321198541

--------------------
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-d1m96-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/511/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/511/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/511/inv_2_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/511/inv_3_
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 161 places, 320 transitions and 1265 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d1m96 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 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: 320->305 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 161; there are 305 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
Killing (15) : 517
Killing (9) : 517

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-d1m96"
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-d1m96, 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-167905978200447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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