Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 115K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678307151816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 20:25:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 20:25:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:25:53] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-08 20:25:53] [INFO ] Transformed 439 places.
[2023-03-08 20:25:53] [INFO ] Transformed 390 transitions.
[2023-03-08 20:25:53] [INFO ] Found NUPN structural information;
[2023-03-08 20:25:53] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 147 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 80 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 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 11 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 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 20:25:54] [INFO ] Computed 65 place invariants in 35 ms
[2023-03-08 20:25:55] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 20:25:55] [INFO ] [Nat]Absence check using 39 positive place invariants in 47 ms returned sat
[2023-03-08 20:25:55] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 67 ms returned sat
[2023-03-08 20:26:00] [INFO ] After 2628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 20:26:00] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 4 ms to minimize.
[2023-03-08 20:26:00] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2023-03-08 20:26:00] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 2 ms to minimize.
[2023-03-08 20:26:00] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-08 20:26:00] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-08 20:26:01] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2023-03-08 20:26:01] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2023-03-08 20:26:01] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2023-03-08 20:26:02] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2023-03-08 20:26:02] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2023-03-08 20:26:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2372 ms
[2023-03-08 20:26:02] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-08 20:26:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 139 ms
[2023-03-08 20:26:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-08 20:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 20:26:03] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-08 20:26:04] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-08 20:26:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-08 20:26:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2023-03-08 20:26:05] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-08 20:26:05] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-08 20:26:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-08 20:26:05] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-08 20:26:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 667 ms
[2023-03-08 20:26:06] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2023-03-08 20:26:06] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-08 20:26:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-08 20:26:06] [INFO ] After 9061ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2477 ms.
[2023-03-08 20:26:08] [INFO ] After 13885ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA DES-PT-40b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA DES-PT-40b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 716 ms.
Support contains 43 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 428 transition count 368
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 413 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 412 transition count 367
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 35 place count 412 transition count 359
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 51 place count 404 transition count 359
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 67 place count 388 transition count 343
Iterating global reduction 3 with 16 rules applied. Total rules applied 83 place count 388 transition count 343
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 94 place count 377 transition count 332
Iterating global reduction 3 with 11 rules applied. Total rules applied 105 place count 377 transition count 332
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 116 place count 377 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 376 transition count 321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 117 place count 376 transition count 320
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 119 place count 375 transition count 320
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 241 place count 314 transition count 259
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 247 place count 311 transition count 274
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 255 place count 311 transition count 266
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 311 transition count 262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 263 place count 307 transition count 262
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 307 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 306 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 305 transition count 260
Applied a total of 266 rules in 252 ms. Remains 305 /439 variables (removed 134) and now considering 260/390 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 305/439 places, 260/390 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 590920 steps, run timeout after 3002 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590920 steps, saw 110447 distinct states, run finished after 3003 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 260 rows 305 cols
[2023-03-08 20:26:13] [INFO ] Computed 61 place invariants in 12 ms
[2023-03-08 20:26:13] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 20:26:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2023-03-08 20:26:13] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 20:26:14] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 20:26:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 20:26:14] [INFO ] After 389ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 20:26:14] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-03-08 20:26:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-08 20:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-08 20:26:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-08 20:26:15] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-08 20:26:15] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-08 20:26:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2023-03-08 20:26:15] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-08 20:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-08 20:26:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-08 20:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 20:26:15] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-08 20:26:16] [INFO ] After 2557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 427 ms.
Support contains 43 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 305 /305 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 305/305 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 305 /305 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-08 20:26:16] [INFO ] Invariant cache hit.
[2023-03-08 20:26:16] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 20:26:16] [INFO ] Invariant cache hit.
[2023-03-08 20:26:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 20:26:17] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-08 20:26:17] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 20:26:17] [INFO ] Invariant cache hit.
[2023-03-08 20:26:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 305/305 places, 260/260 transitions.
Graph (complete) has 909 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 304 /305 variables (removed 1) and now considering 260/260 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 260 rows 304 cols
[2023-03-08 20:26:17] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 20:26:17] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 20:26:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:26:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 20:26:18] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 20:26:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2023-03-08 20:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 20:26:18] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-08 20:26:18] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-08 20:26:18] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2023-03-08 20:26:18] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 4 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 611 ms
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-08 20:26:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 327 ms
[2023-03-08 20:26:19] [INFO ] After 1978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-08 20:26:19] [INFO ] After 2623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-08 20:26:20] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-08 20:26:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 260 transitions and 1249 arcs took 2 ms.
[2023-03-08 20:26:20] [INFO ] Flatten gal took : 57 ms
Total runtime 26913 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/612/inv_0_ --invariant=/tmp/612/inv_1_ --invariant=/tmp/612/inv_2_ --invariant=/tmp/612/inv_3_ --invariant=/tmp/612/inv_4_ --invariant=/tmp/612/inv_5_ --inv-par
FORMULA DES-PT-40b-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678310302648

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name DES-PT-40b-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/612/inv_0_
rfs formula name DES-PT-40b-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/612/inv_1_
rfs formula name DES-PT-40b-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/612/inv_2_
rfs formula name DES-PT-40b-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/612/inv_3_
rfs formula name DES-PT-40b-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/612/inv_4_
rfs formula name DES-PT-40b-ReachabilityFireability-14
rfs formula type AG
rfs formula formula --invariant=/tmp/612/inv_5_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 305 places, 260 transitions and 1249 arcs
pnml2lts-sym: Petri net DES_PT_40b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 260->244 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 305; there are 244 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/612/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/612/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/612/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/612/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/612/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 350671270 group checks and 0 next state calls
pnml2lts-sym: reachability took 3120.040 real 12440.180 user 29.780 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.850 real 3.410 user 0.000 sys
pnml2lts-sym: state space has 1.23869538532441e+15 states, 3152591 nodes
pnml2lts-sym: group_next: 2682 nodes total
pnml2lts-sym: group_explored: 3207 nodes, 4579 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-40b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481200471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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