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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 3.1M 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-10-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680852977127

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-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:36:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 07:36:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:36:19] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2023-04-07 07:36:19] [INFO ] Transformed 1090 places.
[2023-04-07 07:36:19] [INFO ] Transformed 5200 transitions.
[2023-04-07 07:36:19] [INFO ] Found NUPN structural information;
[2023-04-07 07:36:19] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2023-04-07 07:36:20] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 07:36:20] [INFO ] Computed 31 invariants in 36 ms
[2023-04-07 07:36:21] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 07:36:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 40 ms returned sat
[2023-04-07 07:36:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 07:36:24] [INFO ] After 2016ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-04-07 07:36:24] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-07 07:36:26] [INFO ] After 1806ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2023-04-07 07:36:27] [INFO ] Deduced a trap composed of 3 places in 558 ms of which 6 ms to minimize.
[2023-04-07 07:36:28] [INFO ] Deduced a trap composed of 3 places in 753 ms of which 1 ms to minimize.
[2023-04-07 07:36:28] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 2 ms to minimize.
[2023-04-07 07:36:29] [INFO ] Deduced a trap composed of 50 places in 311 ms of which 1 ms to minimize.
[2023-04-07 07:36:29] [INFO ] Deduced a trap composed of 57 places in 352 ms of which 1 ms to minimize.
[2023-04-07 07:36:30] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 0 ms to minimize.
[2023-04-07 07:36:30] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 1 ms to minimize.
[2023-04-07 07:36:30] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2023-04-07 07:36:31] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 0 ms to minimize.
[2023-04-07 07:36:31] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2023-04-07 07:36:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4526 ms
[2023-04-07 07:36:31] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 0 ms to minimize.
[2023-04-07 07:36:31] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 0 ms to minimize.
[2023-04-07 07:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-04-07 07:36:32] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 1 ms to minimize.
[2023-04-07 07:36:32] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 1 ms to minimize.
[2023-04-07 07:36:33] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-04-07 07:36:33] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-04-07 07:36:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-07 07:36:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1345 ms
[2023-04-07 07:36:34] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 1 ms to minimize.
[2023-04-07 07:36:34] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 1 ms to minimize.
[2023-04-07 07:36:35] [INFO ] Deduced a trap composed of 3 places in 514 ms of which 2 ms to minimize.
[2023-04-07 07:36:35] [INFO ] Deduced a trap composed of 266 places in 470 ms of which 1 ms to minimize.
[2023-04-07 07:36:36] [INFO ] Deduced a trap composed of 34 places in 479 ms of which 1 ms to minimize.
[2023-04-07 07:36:36] [INFO ] Deduced a trap composed of 90 places in 465 ms of which 1 ms to minimize.
[2023-04-07 07:36:37] [INFO ] Deduced a trap composed of 73 places in 488 ms of which 1 ms to minimize.
[2023-04-07 07:36:37] [INFO ] Deduced a trap composed of 56 places in 435 ms of which 0 ms to minimize.
[2023-04-07 07:36:38] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 0 ms to minimize.
[2023-04-07 07:36:38] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 1 ms to minimize.
[2023-04-07 07:36:38] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2023-04-07 07:36:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5189 ms
[2023-04-07 07:36:39] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2023-04-07 07:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-04-07 07:36:40] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 1 ms to minimize.
[2023-04-07 07:36:40] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 0 ms to minimize.
[2023-04-07 07:36:41] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 0 ms to minimize.
[2023-04-07 07:36:41] [INFO ] Deduced a trap composed of 214 places in 393 ms of which 0 ms to minimize.
[2023-04-07 07:36:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2194 ms
[2023-04-07 07:36:42] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 1 ms to minimize.
[2023-04-07 07:36:42] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 4 ms to minimize.
[2023-04-07 07:36:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2023-04-07 07:36:43] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-07 07:36:43] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 0 ms to minimize.
[2023-04-07 07:36:43] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 0 ms to minimize.
[2023-04-07 07:36:43] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 0 ms to minimize.
[2023-04-07 07:36:44] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 2 ms to minimize.
[2023-04-07 07:36:44] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-04-07 07:36:44] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-04-07 07:36:44] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 0 ms to minimize.
[2023-04-07 07:36:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2114 ms
[2023-04-07 07:36:45] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2023-04-07 07:36:45] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2023-04-07 07:36:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2023-04-07 07:36:45] [INFO ] After 21086ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 1050 ms.
[2023-04-07 07:36:47] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 483 ms.
Support contains 91 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1090 transition count 5192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1082 transition count 5192
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 16 place count 1082 transition count 4898
Deduced a syphon composed of 294 places in 6 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 604 place count 788 transition count 4898
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 685 place count 707 transition count 4088
Iterating global reduction 2 with 81 rules applied. Total rules applied 766 place count 707 transition count 4088
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 8 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 942 place count 619 transition count 4000
Applied a total of 942 rules in 712 ms. Remains 619 /1090 variables (removed 471) and now considering 4000/5200 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 714 ms. Remains : 619/1090 places, 4000/5200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) 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 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 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 170247 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{1=1, 5=1}
Probabilistic random walk after 170247 steps, saw 121345 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :2
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
[2023-04-07 07:36:51] [INFO ] Flow matrix only has 1130 transitions (discarded 2870 similar events)
// Phase 1: matrix 1130 rows 619 cols
[2023-04-07 07:36:51] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 07:36:51] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 07:36:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-04-07 07:36:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 07:36:53] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 07:36:53] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-07 07:36:54] [INFO ] After 1024ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 07:36:54] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 2 ms to minimize.
[2023-04-07 07:36:55] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 0 ms to minimize.
[2023-04-07 07:36:55] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 0 ms to minimize.
[2023-04-07 07:36:55] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 1 ms to minimize.
[2023-04-07 07:36:55] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 0 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 1 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-04-07 07:36:56] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 14 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3270 ms
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-04-07 07:36:57] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 1 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-07 07:36:58] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1605 ms
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 3 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2023-04-07 07:36:59] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 14 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 675 ms
[2023-04-07 07:37:00] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 0 ms to minimize.
[2023-04-07 07:37:00] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 0 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 0 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2023-04-07 07:37:01] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 1 ms to minimize.
[2023-04-07 07:37:02] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
[2023-04-07 07:37:02] [INFO ] Deduced a trap composed of 109 places in 248 ms of which 1 ms to minimize.
[2023-04-07 07:37:02] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2023-04-07 07:37:02] [INFO ] Deduced a trap composed of 95 places in 255 ms of which 0 ms to minimize.
[2023-04-07 07:37:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2604 ms
[2023-04-07 07:37:03] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 0 ms to minimize.
[2023-04-07 07:37:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-04-07 07:37:03] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 12 ms to minimize.
[2023-04-07 07:37:04] [INFO ] Deduced a trap composed of 38 places in 324 ms of which 0 ms to minimize.
[2023-04-07 07:37:04] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 0 ms to minimize.
[2023-04-07 07:37:04] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 1 ms to minimize.
[2023-04-07 07:37:04] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2023-04-07 07:37:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1579 ms
[2023-04-07 07:37:05] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 1 ms to minimize.
[2023-04-07 07:37:05] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-04-07 07:37:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2023-04-07 07:37:05] [INFO ] After 12500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1295 ms.
[2023-04-07 07:37:06] [INFO ] After 14953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 153 ms.
Support contains 89 out of 619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 619/619 places, 4000/4000 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 619 transition count 3998
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 617 transition count 3998
Applied a total of 4 rules in 254 ms. Remains 617 /619 variables (removed 2) and now considering 3998/4000 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 617/619 places, 3998/4000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 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 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 156156 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156156 steps, saw 113045 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 07:37:10] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
// Phase 1: matrix 1128 rows 617 cols
[2023-04-07 07:37:10] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 07:37:11] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 07:37:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 07:37:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:37:12] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 07:37:12] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-07 07:37:13] [INFO ] After 948ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 07:37:13] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 0 ms to minimize.
[2023-04-07 07:37:13] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 0 ms to minimize.
[2023-04-07 07:37:14] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 0 ms to minimize.
[2023-04-07 07:37:14] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 0 ms to minimize.
[2023-04-07 07:37:14] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 1 ms to minimize.
[2023-04-07 07:37:15] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 0 ms to minimize.
[2023-04-07 07:37:15] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-04-07 07:37:15] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2023-04-07 07:37:15] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 1 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2023-04-07 07:37:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3652 ms
[2023-04-07 07:37:17] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2023-04-07 07:37:17] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2023-04-07 07:37:17] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 07:37:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-04-07 07:37:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 653 ms
[2023-04-07 07:37:17] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 0 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 0 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 0 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 1 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2023-04-07 07:37:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1250 ms
[2023-04-07 07:37:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-04-07 07:37:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-04-07 07:37:19] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 1 ms to minimize.
[2023-04-07 07:37:19] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 0 ms to minimize.
[2023-04-07 07:37:20] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 0 ms to minimize.
[2023-04-07 07:37:20] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 1 ms to minimize.
[2023-04-07 07:37:20] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Deduced a trap composed of 131 places in 248 ms of which 1 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 1 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 0 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2388 ms
[2023-04-07 07:37:21] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2023-04-07 07:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-04-07 07:37:22] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2023-04-07 07:37:22] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 0 ms to minimize.
[2023-04-07 07:37:22] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-04-07 07:37:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 566 ms
[2023-04-07 07:37:23] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 0 ms to minimize.
[2023-04-07 07:37:23] [INFO ] Deduced a trap composed of 45 places in 307 ms of which 0 ms to minimize.
[2023-04-07 07:37:23] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 0 ms to minimize.
[2023-04-07 07:37:24] [INFO ] Deduced a trap composed of 111 places in 291 ms of which 0 ms to minimize.
[2023-04-07 07:37:24] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 0 ms to minimize.
[2023-04-07 07:37:24] [INFO ] Deduced a trap composed of 17 places in 476 ms of which 1 ms to minimize.
[2023-04-07 07:37:25] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 0 ms to minimize.
[2023-04-07 07:37:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2546 ms
[2023-04-07 07:37:25] [INFO ] After 13159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1087 ms.
[2023-04-07 07:37:26] [INFO ] After 15244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 238 ms.
Support contains 89 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3998/3998 transitions.
Applied a total of 0 rules in 344 ms. Remains 617 /617 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 617/617 places, 3998/3998 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3998/3998 transitions.
Applied a total of 0 rules in 337 ms. Remains 617 /617 variables (removed 0) and now considering 3998/3998 (removed 0) transitions.
[2023-04-07 07:37:27] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-07 07:37:27] [INFO ] Invariant cache hit.
[2023-04-07 07:37:31] [INFO ] Implicit Places using invariants in 4158 ms returned []
[2023-04-07 07:37:31] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-07 07:37:31] [INFO ] Invariant cache hit.
[2023-04-07 07:37:32] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-04-07 07:37:36] [INFO ] Implicit Places using invariants and state equation in 4503 ms returned []
Implicit Place search using SMT with State Equation took 8675 ms to find 0 implicit places.
[2023-04-07 07:37:36] [INFO ] Redundant transitions in 325 ms returned []
[2023-04-07 07:37:36] [INFO ] Flow matrix only has 1128 transitions (discarded 2870 similar events)
[2023-04-07 07:37:36] [INFO ] Invariant cache hit.
[2023-04-07 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 9058 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18433 ms. Remains : 617/617 places, 3998/3998 transitions.
Graph (trivial) has 2855 edges and 617 vertex of which 96 / 617 are part of one of the 10 SCC in 5 ms
Free SCC test removed 86 places
Drop transitions removed 318 transitions
Ensure Unique test removed 2870 transitions
Reduce isomorphic transitions removed 3188 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 531 transition count 725
Reduce places removed 85 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 446 transition count 717
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 187 place count 438 transition count 717
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 187 place count 438 transition count 703
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 218 place count 421 transition count 703
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 506 place count 277 transition count 559
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 554 place count 277 transition count 511
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 562 place count 273 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 565 place count 273 transition count 537
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 599 place count 273 transition count 503
Free-agglomeration rule applied 106 times.
Iterating global reduction 5 with 106 rules applied. Total rules applied 705 place count 273 transition count 397
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 5 with 106 rules applied. Total rules applied 811 place count 167 transition count 397
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 821 place count 167 transition count 397
Applied a total of 821 rules in 102 ms. Remains 167 /617 variables (removed 450) and now considering 397/3998 (removed 3601) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 397 rows 167 cols
[2023-04-07 07:37:45] [INFO ] Computed 28 invariants in 7 ms
[2023-04-07 07:37:45] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 07:37:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-07 07:37:45] [INFO ] [Nat]Absence check using 21 positive and 7 generalized place invariants in 1 ms returned sat
[2023-04-07 07:37:46] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 406 ms
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-04-07 07:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-04-07 07:37:46] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-04-07 07:37:47] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 07:37:47] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-04-07 07:37:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 617 places, 3998 transitions and 21376 arcs took 22 ms.
[2023-04-07 07:37:47] [INFO ] Flatten gal took : 323 ms
Total runtime 89111 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/931/inv_0_ --invariant=/tmp/931/inv_1_ --invariant=/tmp/931/inv_2_ --invariant=/tmp/931/inv_3_ --invariant=/tmp/931/inv_4_ --invariant=/tmp/931/inv_5_ --invariant=/tmp/931/inv_6_ --invariant=/tmp/931/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15245484 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097692 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-10"
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-10, 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-167987246500279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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