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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 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-d1m64-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679317125030

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-d1m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:58:46] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-20 12:58:46] [INFO ] Transformed 1295 places.
[2023-03-20 12:58:46] [INFO ] Transformed 749 transitions.
[2023-03-20 12:58:46] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 187 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 8 ms
Reduce places removed 1036 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 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 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 20 ms. (steps per millisecond=50 ) 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 1000 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 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 54 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 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 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 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 221770 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{1=1, 3=1, 4=1, 5=1, 6=1, 8=1, 9=1, 10=1, 15=1}
Probabilistic random walk after 221770 steps, saw 101858 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :9
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 12:58:50] [INFO ] Computed 6 place invariants in 21 ms
[2023-03-20 12:58:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:58:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-20 12:58:51] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-20 12:58:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 12:58:51] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 12:58:52] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-20 12:58:52] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 12:58:53] [INFO ] After 773ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-20 12:58:53] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 12 ms to minimize.
[2023-03-20 12:58:53] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2023-03-20 12:58:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-03-20 12:58:54] [INFO ] After 1743ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 907 ms.
[2023-03-20 12:58:55] [INFO ] After 3539ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 187 ms.
Support contains 42 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.2 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 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 279 place count 205 transition count 444
Iterating global reduction 1 with 36 rules applied. Total rules applied 315 place count 205 transition count 444
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 324 place count 205 transition count 435
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 341 place count 188 transition count 418
Iterating global reduction 2 with 17 rules applied. Total rules applied 358 place count 188 transition count 418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 361 place count 188 transition count 415
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 373 place count 176 transition count 402
Iterating global reduction 3 with 12 rules applied. Total rules applied 385 place count 176 transition count 402
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 404 place count 176 transition count 383
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 405 place count 175 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 406 place count 175 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 407 place count 174 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 174 transition count 381
Applied a total of 408 rules in 105 ms. Remains 174 /259 variables (removed 85) and now considering 381/749 (removed 368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 174/259 places, 381/749 transitions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 335564 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335564 steps, saw 153766 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 381 rows 174 cols
[2023-03-20 12:58:58] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 12:58:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:58:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:58:59] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 12:58:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:58:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:58:59] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 12:58:59] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-20 12:59:00] [INFO ] After 457ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 12:59:00] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2023-03-20 12:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-20 12:59:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2023-03-20 12:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-20 12:59:00] [INFO ] After 1170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 476 ms.
[2023-03-20 12:59:01] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 234 ms.
Support contains 42 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 381/381 transitions.
Applied a total of 0 rules in 22 ms. Remains 174 /174 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 174/174 places, 381/381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 381/381 transitions.
Applied a total of 0 rules in 27 ms. Remains 174 /174 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2023-03-20 12:59:01] [INFO ] Invariant cache hit.
[2023-03-20 12:59:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 12:59:01] [INFO ] Invariant cache hit.
[2023-03-20 12:59:01] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-20 12:59:02] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-20 12:59:02] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 12:59:02] [INFO ] Invariant cache hit.
[2023-03-20 12:59:02] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 899 ms. Remains : 174/174 places, 381/381 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 379
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 173 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 172 transition count 378
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 5 place count 172 transition count 364
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 33 place count 158 transition count 364
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 55 place count 147 transition count 353
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 145 transition count 356
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 145 transition count 352
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 141 transition count 352
Applied a total of 67 rules in 43 ms. Remains 141 /174 variables (removed 33) and now considering 352/381 (removed 29) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 352 rows 141 cols
[2023-03-20 12:59:02] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 12:59:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:59:02] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 12:59:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:59:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:59:03] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 12:59:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-20 12:59:03] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2023-03-20 12:59:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-20 12:59:03] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-20 12:59:03] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 12:59:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 12:59:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 381 transitions and 1507 arcs took 4 ms.
[2023-03-20 12:59:04] [INFO ] Flatten gal took : 62 ms
Total runtime 17565 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/522/inv_0_ --invariant=/tmp/522/inv_1_ --invariant=/tmp/522/inv_2_ --invariant=/tmp/522/inv_3_ --invariant=/tmp/522/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 11887424 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096612 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-11
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-14

BK_STOP 1679320715700

--------------------
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-d1m64-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/522/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/522/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/522/inv_2_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/522/inv_3_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/522/inv_4_
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 174 places, 381 transitions and 1507 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d1m64 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: 381->364 groups
pnml2lts-sym: Regrouping took 0.110 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 174; there are 364 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 528
Killing (9) : 528

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

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