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-167814481000327.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 DBSingleClientW-PT-d2m08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m08-ReachabilityFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678278740064

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=DBSingleClientW-PT-d2m08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 12:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 12:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:32:21] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-08 12:32:21] [INFO ] Transformed 4763 places.
[2023-03-08 12:32:21] [INFO ] Transformed 2478 transitions.
[2023-03-08 12:32:21] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 155065 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{2=1, 3=1, 6=1, 8=1, 10=1, 11=1, 12=1, 14=1, 15=1}
Probabilistic random walk after 155065 steps, saw 65918 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :9
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 12:32:26] [INFO ] Computed 6 place invariants in 180 ms
[2023-03-08 12:32:27] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 12:32:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2023-03-08 12:32:27] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-08 12:32:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-08 12:32:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-08 12:32:29] [INFO ] After 2407ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-08 12:32:30] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 12:32:33] [INFO ] After 3737ms SMT Verify possible using 1588 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-08 12:32:35] [INFO ] After 5794ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 2751 ms.
[2023-03-08 12:32:38] [INFO ] After 11479ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 65 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.7 ms
Discarding 46 places :
Also discarding 0 output transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 1137 transition count 2279
Discarding 361 places :
Symmetric choice reduction at 1 with 361 rule applications. Total rules 561 place count 776 transition count 1572
Iterating global reduction 1 with 361 rules applied. Total rules applied 922 place count 776 transition count 1572
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 1010 place count 776 transition count 1484
Discarding 289 places :
Symmetric choice reduction at 2 with 289 rule applications. Total rules 1299 place count 487 transition count 1195
Iterating global reduction 2 with 289 rules applied. Total rules applied 1588 place count 487 transition count 1195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1596 place count 487 transition count 1187
Discarding 205 places :
Symmetric choice reduction at 3 with 205 rule applications. Total rules 1801 place count 282 transition count 913
Iterating global reduction 3 with 205 rules applied. Total rules applied 2006 place count 282 transition count 913
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Iterating post reduction 3 with 268 rules applied. Total rules applied 2274 place count 282 transition count 645
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2288 place count 268 transition count 623
Iterating global reduction 4 with 14 rules applied. Total rules applied 2302 place count 268 transition count 623
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2335 place count 268 transition count 590
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2340 place count 263 transition count 585
Iterating global reduction 5 with 5 rules applied. Total rules applied 2345 place count 263 transition count 585
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2347 place count 263 transition count 583
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2351 place count 259 transition count 579
Iterating global reduction 6 with 4 rules applied. Total rules applied 2355 place count 259 transition count 579
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2359 place count 259 transition count 575
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2360 place count 258 transition count 573
Iterating global reduction 7 with 1 rules applied. Total rules applied 2361 place count 258 transition count 573
Applied a total of 2361 rules in 360 ms. Remains 258 /1183 variables (removed 925) and now considering 573/2478 (removed 1905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 258/1183 places, 573/2478 transitions.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 406 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 586721 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{2=1}
Probabilistic random walk after 586721 steps, saw 224107 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 573 rows 258 cols
[2023-03-08 12:32:42] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 12:32:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:32:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 12:32:42] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:32:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:32:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 12:32:42] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:32:42] [INFO ] State equation strengthened by 317 read => feed constraints.
[2023-03-08 12:32:43] [INFO ] After 412ms SMT Verify possible using 317 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:32:43] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-08 12:32:44] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 63 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 559
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 559
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 254 transition count 557
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 254 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 252 transition count 553
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 252 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 252 transition count 552
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 251 transition count 551
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 251 transition count 551
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 250 transition count 550
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 250 transition count 550
Applied a total of 17 rules in 52 ms. Remains 250 /258 variables (removed 8) and now considering 550/573 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 250/258 places, 550/573 transitions.
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 189 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 682533 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{0=1}
Probabilistic random walk after 682533 steps, saw 258171 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 550 rows 250 cols
[2023-03-08 12:32:47] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-08 12:32:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-08 12:32:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 12:32:47] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:32:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:32:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 12:32:47] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:47] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-08 12:32:48] [INFO ] After 292ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:48] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-08 12:32:48] [INFO ] After 1102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 43 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 550/550 transitions.
Graph (complete) has 973 edges and 250 vertex of which 249 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 249 transition count 543
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 20 place count 237 transition count 490
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 237 transition count 490
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 41 place count 237 transition count 481
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 229 transition count 468
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 229 transition count 468
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 229 transition count 466
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 223 transition count 457
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 223 transition count 457
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 223 transition count 454
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 77 place count 220 transition count 446
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 220 transition count 446
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 83 place count 217 transition count 443
Iterating global reduction 4 with 3 rules applied. Total rules applied 86 place count 217 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 88 place count 215 transition count 440
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 215 transition count 440
Applied a total of 90 rules in 49 ms. Remains 215 /250 variables (removed 35) and now considering 440/550 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 215/250 places, 440/550 transitions.
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1347734 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1347734 steps, saw 507594 distinct states, run finished after 3002 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 440 rows 215 cols
[2023-03-08 12:32:51] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 12:32:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:32:51] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:32:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:32:52] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:52] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-08 12:32:52] [INFO ] After 177ms SMT Verify possible using 225 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:52] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-08 12:32:52] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 215 /215 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 215/215 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 215 /215 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-08 12:32:52] [INFO ] Invariant cache hit.
[2023-03-08 12:32:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-08 12:32:52] [INFO ] Invariant cache hit.
[2023-03-08 12:32:52] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-08 12:32:53] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-08 12:32:53] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-08 12:32:53] [INFO ] Invariant cache hit.
[2023-03-08 12:32:53] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1057 ms. Remains : 215/215 places, 440/440 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 215 transition count 429
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 11 place count 215 transition count 412
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 1 with 34 rules applied. Total rules applied 45 place count 198 transition count 412
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 197 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 197 transition count 411
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 196 transition count 410
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 196 transition count 410
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 67 place count 187 transition count 401
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 185 transition count 405
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 185 transition count 402
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 182 transition count 402
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 102 place count 182 transition count 402
Applied a total of 102 rules in 38 ms. Remains 182 /215 variables (removed 33) and now considering 402/440 (removed 38) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 402 rows 182 cols
[2023-03-08 12:32:53] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 12:32:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 12:32:53] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 12:32:54] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:32:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 12:32:54] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 12:32:54] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:54] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-08 12:32:54] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:32:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-08 12:32:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 440 transitions and 1738 arcs took 3 ms.
[2023-03-08 12:32:54] [INFO ] Flatten gal took : 66 ms
Total runtime 33389 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/507/inv_0_ --inv-par
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678280782671

--------------------
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 DBSingleClientW-PT-d2m08-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/507/inv_0_
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 215 places, 440 transitions and 1738 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m08 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 440->418 groups
pnml2lts-sym: Regrouping took 0.160 real 0.160 user 0.000 sys
pnml2lts-sym: state vector length is 215; there are 418 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:
pnml2lts-sym: Invariant violation (/tmp/507/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 2005.960 real 8013.560 user 4.710 sys
pnml2lts-sym: max token count: 8

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="DBSingleClientW-PT-d2m08"
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 DBSingleClientW-PT-d2m08, 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-167814481000327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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