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

About the Execution of LTSMin+red for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1112.848 3600000.00 14196763.00 543.60 TTTF?TFF?T?TTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481200463.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-40a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678304197406

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=DES-PT-40a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 19:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:36:39] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 19:36:39] [INFO ] Transformed 274 places.
[2023-03-08 19:36:39] [INFO ] Transformed 231 transitions.
[2023-03-08 19:36:39] [INFO ] Found NUPN structural information;
[2023-03-08 19:36:39] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 16) seen :2
FORMULA DES-PT-40a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 19:36:40] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-08 19:36:41] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 19:36:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 19:36:41] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 19:36:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 19:36:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 103 ms returned sat
[2023-03-08 19:36:47] [INFO ] After 5614ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-08 19:36:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:36:53] [INFO ] After 5724ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :13
[2023-03-08 19:36:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 5 ms to minimize.
[2023-03-08 19:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-08 19:36:55] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-08 19:36:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-08 19:36:59] [INFO ] After 11870ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 5846 ms.
[2023-03-08 19:37:05] [INFO ] After 23955ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
FORMULA DES-PT-40a-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 13 different solutions.
FORMULA DES-PT-40a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 750 ms.
Support contains 91 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 274 transition count 215
Applied a total of 4 rules in 53 ms. Remains 274 /274 variables (removed 0) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 274/274 places, 215/217 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 600441 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600441 steps, saw 88005 distinct states, run finished after 3002 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 215 rows 274 cols
[2023-03-08 19:37:09] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-08 19:37:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 19:37:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-08 19:37:10] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 153 ms returned sat
[2023-03-08 19:37:14] [INFO ] After 3837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 19:37:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:37:16] [INFO ] After 2630ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 19:37:17] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-08 19:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-08 19:37:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 19:37:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 19:37:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-08 19:37:18] [INFO ] After 4571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1919 ms.
[2023-03-08 19:37:20] [INFO ] After 10779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA DES-PT-40a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 398 ms.
Support contains 41 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Applied a total of 2 rules in 23 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 274/274 places, 215/215 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1016973 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016973 steps, saw 143788 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 215 rows 274 cols
[2023-03-08 19:37:24] [INFO ] Computed 61 place invariants in 12 ms
[2023-03-08 19:37:24] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:37:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 19:37:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 155 ms returned sat
[2023-03-08 19:37:25] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 19:37:27] [INFO ] After 1326ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:28] [INFO ] After 3140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 358 ms.
[2023-03-08 19:37:29] [INFO ] After 4643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 126 ms.
Support contains 41 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 23 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 274/274 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-08 19:37:29] [INFO ] Invariant cache hit.
[2023-03-08 19:37:29] [INFO ] Implicit Places using invariants in 196 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 218 ms. Remains : 273/274 places, 215/215 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1142458 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1142458 steps, saw 159986 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 215 rows 273 cols
[2023-03-08 19:37:32] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 19:37:32] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:37:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:37:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 69 ms returned sat
[2023-03-08 19:37:34] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:37:35] [INFO ] After 1342ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-08 19:37:36] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-08 19:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-08 19:37:36] [INFO ] After 2194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1661 ms.
[2023-03-08 19:37:38] [INFO ] After 5526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 245 ms.
Support contains 41 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-08 19:37:38] [INFO ] Invariant cache hit.
[2023-03-08 19:37:38] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 19:37:38] [INFO ] Invariant cache hit.
[2023-03-08 19:37:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:37:39] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-08 19:37:39] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 19:37:39] [INFO ] Invariant cache hit.
[2023-03-08 19:37:39] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 12 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 19:37:39] [INFO ] Invariant cache hit.
[2023-03-08 19:37:39] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:37:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:37:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2023-03-08 19:37:40] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:41] [INFO ] After 1392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 711 ms.
[2023-03-08 19:37:42] [INFO ] After 2426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-08 19:37:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-08 19:37:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 215 transitions and 1066 arcs took 2 ms.
[2023-03-08 19:37:42] [INFO ] Flatten gal took : 56 ms
Total runtime 63374 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/532/inv_0_ --invariant=/tmp/532/inv_1_ --invariant=/tmp/532/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15035656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101416 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
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 DES-PT-40a, 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 r105-tall-167814481200463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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