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.r521-tall-167987246400263.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 EisenbergMcGuire-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 EisenbergMcGuire-PT-08-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680845956285

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=EisenbergMcGuire-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:39:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 05:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:39:21] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-04-07 05:39:21] [INFO ] Transformed 712 places.
[2023-04-07 05:39:21] [INFO ] Transformed 2816 transitions.
[2023-04-07 05:39:21] [INFO ] Found NUPN structural information;
[2023-04-07 05:39:21] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 16) seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 41895 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41895 steps, saw 34141 distinct states, run finished after 3003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 05:39:25] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-07 05:39:25] [INFO ] Computed 25 invariants in 61 ms
[2023-04-07 05:39:28] [INFO ] After 1909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-04-07 05:39:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 76 ms returned sat
[2023-04-07 05:39:29] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 72 ms returned sat
[2023-04-07 05:39:32] [INFO ] After 2157ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2023-04-07 05:39:32] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-07 05:39:34] [INFO ] After 1826ms SMT Verify possible using 676 Read/Feed constraints in natural domain returned unsat :5 sat :10
[2023-04-07 05:39:34] [INFO ] Deduced a trap composed of 3 places in 704 ms of which 8 ms to minimize.
[2023-04-07 05:39:35] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 1 ms to minimize.
[2023-04-07 05:39:35] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 1 ms to minimize.
[2023-04-07 05:39:35] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 1 ms to minimize.
[2023-04-07 05:39:36] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2023-04-07 05:39:36] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 0 ms to minimize.
[2023-04-07 05:39:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2246 ms
[2023-04-07 05:39:36] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2023-04-07 05:39:36] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2023-04-07 05:39:36] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2023-04-07 05:39:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 611 ms
[2023-04-07 05:39:37] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2023-04-07 05:39:37] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-04-07 05:39:37] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-04-07 05:39:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 584 ms
[2023-04-07 05:39:38] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 0 ms to minimize.
[2023-04-07 05:39:38] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2023-04-07 05:39:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-04-07 05:39:38] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-07 05:39:38] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2023-04-07 05:39:39] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-04-07 05:39:39] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-04-07 05:39:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 823 ms
[2023-04-07 05:39:39] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 1 ms to minimize.
[2023-04-07 05:39:39] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 05:39:39] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2023-04-07 05:39:40] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 4 ms to minimize.
[2023-04-07 05:39:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 824 ms
[2023-04-07 05:39:40] [INFO ] After 8654ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :10
Attempting to minimize the solution found.
Minimization took 1298 ms.
[2023-04-07 05:39:42] [INFO ] After 13982ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :10
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 119 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 712 transition count 2813
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 709 transition count 2813
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 175 Pre rules applied. Total rules applied 6 place count 709 transition count 2638
Deduced a syphon composed of 175 places in 4 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 356 place count 534 transition count 2638
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 398 place count 492 transition count 2302
Iterating global reduction 2 with 42 rules applied. Total rules applied 440 place count 492 transition count 2302
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 542 place count 441 transition count 2251
Applied a total of 542 rules in 341 ms. Remains 441 /712 variables (removed 271) and now considering 2251/2816 (removed 565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 441/712 places, 2251/2816 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 127566 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{5=1, 9=1}
Probabilistic random walk after 127566 steps, saw 88028 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :2
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
[2023-04-07 05:39:46] [INFO ] Flow matrix only has 803 transitions (discarded 1448 similar events)
// Phase 1: matrix 803 rows 441 cols
[2023-04-07 05:39:46] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:39:46] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:39:46] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:39:46] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 05:39:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:39:46] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:39:47] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 05:39:47] [INFO ] State equation strengthened by 382 read => feed constraints.
[2023-04-07 05:39:48] [INFO ] After 635ms SMT Verify possible using 382 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 05:39:48] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-04-07 05:39:48] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2023-04-07 05:39:48] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2023-04-07 05:39:48] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-04-07 05:39:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1733 ms
[2023-04-07 05:39:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 05:39:50] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 6 ms to minimize.
[2023-04-07 05:39:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-04-07 05:39:50] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 05:39:50] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-04-07 05:39:51] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 0 ms to minimize.
[2023-04-07 05:39:51] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-04-07 05:39:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 859 ms
[2023-04-07 05:39:51] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2023-04-07 05:39:51] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-04-07 05:39:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-04-07 05:39:51] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 05:39:52] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 0 ms to minimize.
[2023-04-07 05:39:52] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 0 ms to minimize.
[2023-04-07 05:39:52] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2023-04-07 05:39:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 858 ms
[2023-04-07 05:39:52] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2023-04-07 05:39:53] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 1 ms to minimize.
[2023-04-07 05:39:53] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 1 ms to minimize.
[2023-04-07 05:39:53] [INFO ] Deduced a trap composed of 104 places in 219 ms of which 0 ms to minimize.
[2023-04-07 05:39:53] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 0 ms to minimize.
[2023-04-07 05:39:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1139 ms
[2023-04-07 05:39:54] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2023-04-07 05:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 05:39:54] [INFO ] After 6560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 635 ms.
[2023-04-07 05:39:54] [INFO ] After 8020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 103 ms.
Support contains 105 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 2251/2251 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 441 transition count 2246
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 436 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 435 transition count 2238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 435 transition count 2238
Applied a total of 12 rules in 136 ms. Remains 435 /441 variables (removed 6) and now considering 2238/2251 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 435/441 places, 2238/2251 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 157698 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{5=1}
Probabilistic random walk after 157698 steps, saw 106011 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
[2023-04-07 05:39:58] [INFO ] Flow matrix only has 790 transitions (discarded 1448 similar events)
// Phase 1: matrix 790 rows 435 cols
[2023-04-07 05:39:58] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 05:39:58] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:39:58] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:39:58] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:39:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:39:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:39:59] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:39:59] [INFO ] State equation strengthened by 375 read => feed constraints.
[2023-04-07 05:40:00] [INFO ] After 503ms SMT Verify possible using 375 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:40:00] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2023-04-07 05:40:00] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 05:40:00] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2023-04-07 05:40:00] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2023-04-07 05:40:00] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1142 ms
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 0 ms to minimize.
[2023-04-07 05:40:01] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 05:40:02] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-07 05:40:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-04-07 05:40:02] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 1 ms to minimize.
[2023-04-07 05:40:02] [INFO ] Deduced a trap composed of 105 places in 200 ms of which 2 ms to minimize.
[2023-04-07 05:40:02] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 1 ms to minimize.
[2023-04-07 05:40:02] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2023-04-07 05:40:03] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 5 ms to minimize.
[2023-04-07 05:40:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 984 ms
[2023-04-07 05:40:03] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-04-07 05:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-04-07 05:40:03] [INFO ] After 3771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-04-07 05:40:03] [INFO ] After 4966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 47 ms.
Support contains 83 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 2238/2238 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 435 transition count 2231
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 428 transition count 2231
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 423 transition count 2191
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 423 transition count 2191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 422 transition count 2190
Applied a total of 26 rules in 125 ms. Remains 422 /435 variables (removed 13) and now considering 2190/2238 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 422/435 places, 2190/2238 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 249741 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249741 steps, saw 152742 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 7 properties.
[2023-04-07 05:40:07] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
// Phase 1: matrix 742 rows 422 cols
[2023-04-07 05:40:07] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:40:07] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:40:07] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:40:07] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:40:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:40:07] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:40:08] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:40:08] [INFO ] State equation strengthened by 340 read => feed constraints.
[2023-04-07 05:40:08] [INFO ] After 492ms SMT Verify possible using 340 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1022 ms
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 334 ms
[2023-04-07 05:40:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-04-07 05:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 05:40:11] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2023-04-07 05:40:11] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 1 ms to minimize.
[2023-04-07 05:40:11] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-04-07 05:40:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2023-04-07 05:40:11] [INFO ] After 3333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 456 ms.
[2023-04-07 05:40:12] [INFO ] After 4467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 57 ms.
Support contains 83 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2190/2190 transitions.
Applied a total of 0 rules in 84 ms. Remains 422 /422 variables (removed 0) and now considering 2190/2190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 422/422 places, 2190/2190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2190/2190 transitions.
Applied a total of 0 rules in 159 ms. Remains 422 /422 variables (removed 0) and now considering 2190/2190 (removed 0) transitions.
[2023-04-07 05:40:12] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-07 05:40:12] [INFO ] Invariant cache hit.
[2023-04-07 05:40:12] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-07 05:40:12] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-07 05:40:12] [INFO ] Invariant cache hit.
[2023-04-07 05:40:13] [INFO ] State equation strengthened by 340 read => feed constraints.
[2023-04-07 05:40:14] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2023-04-07 05:40:14] [INFO ] Redundant transitions in 113 ms returned []
[2023-04-07 05:40:14] [INFO ] Flow matrix only has 742 transitions (discarded 1448 similar events)
[2023-04-07 05:40:14] [INFO ] Invariant cache hit.
[2023-04-07 05:40:14] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2583 ms. Remains : 422/422 places, 2190/2190 transitions.
Graph (trivial) has 1306 edges and 422 vertex of which 59 / 422 are part of one of the 8 SCC in 3 ms
Free SCC test removed 51 places
Drop transitions removed 182 transitions
Ensure Unique test removed 1450 transitions
Reduce isomorphic transitions removed 1632 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 371 transition count 507
Reduce places removed 51 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 56 rules applied. Total rules applied 108 place count 320 transition count 502
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 315 transition count 502
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 113 place count 315 transition count 494
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 130 place count 306 transition count 494
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 288 place count 227 transition count 415
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 306 place count 227 transition count 397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 226 transition count 410
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 339 place count 226 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 339 place count 226 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 225 transition count 378
Free-agglomeration rule applied 70 times.
Iterating global reduction 4 with 70 rules applied. Total rules applied 411 place count 225 transition count 308
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 481 place count 155 transition count 308
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 490 place count 155 transition count 308
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 491 place count 155 transition count 308
Applied a total of 491 rules in 62 ms. Remains 155 /422 variables (removed 267) and now considering 308/2190 (removed 1882) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 308 rows 155 cols
[2023-04-07 05:40:14] [INFO ] Computed 24 invariants in 1 ms
[2023-04-07 05:40:15] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 05:40:15] [INFO ] [Real]Absence check using 17 positive and 7 generalized place invariants in 1 ms returned sat
[2023-04-07 05:40:15] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:40:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 05:40:15] [INFO ] [Nat]Absence check using 17 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:40:15] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 05:40:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-07 05:40:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-04-07 05:40:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-04-07 05:40:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-07 05:40:16] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-04-07 05:40:16] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:40:16] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-04-07 05:40:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 422 places, 2190 transitions and 11420 arcs took 31 ms.
[2023-04-07 05:40:17] [INFO ] Flatten gal took : 331 ms
Total runtime 56075 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/785/inv_0_ --invariant=/tmp/785/inv_1_ --invariant=/tmp/785/inv_2_ --invariant=/tmp/785/inv_3_ --invariant=/tmp/785/inv_4_ --invariant=/tmp/785/inv_5_ --invariant=/tmp/785/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14918616 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104728 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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r521-tall-167987246400263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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