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.r329-tall-167889202500775.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 ResAllocation-PT-R100C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202500775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K Mar 5 18:23 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 ResAllocation-PT-R100C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679170359994

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=ResAllocation-PT-R100C002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:12:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:12:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:12:41] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-18 20:12:41] [INFO ] Transformed 400 places.
[2023-03-18 20:12:41] [INFO ] Transformed 202 transitions.
[2023-03-18 20:12:41] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 152 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 3 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 16) seen :10
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :1
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 202 rows 400 cols
[2023-03-18 20:12:42] [INFO ] Computed 200 place invariants in 14 ms
[2023-03-18 20:12:43] [INFO ] [Real]Absence check using 200 positive place invariants in 49 ms returned sat
[2023-03-18 20:12:43] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:12:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-18 20:12:43] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:12:43] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
[2023-03-18 20:12:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 20:12:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 253 ms
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 17 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 20:12:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2023-03-18 20:12:44] [INFO ] After 1450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-18 20:12:45] [INFO ] After 1980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 376 ms.
Support contains 140 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 201
Applied a total of 3 rules in 61 ms. Remains 398 /400 variables (removed 2) and now considering 201/202 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 398/400 places, 201/202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 437563 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437563 steps, saw 150586 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 201 rows 398 cols
[2023-03-18 20:12:48] [INFO ] Computed 199 place invariants in 5 ms
[2023-03-18 20:12:48] [INFO ] [Real]Absence check using 199 positive place invariants in 26 ms returned sat
[2023-03-18 20:12:48] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:12:49] [INFO ] [Nat]Absence check using 199 positive place invariants in 23 ms returned sat
[2023-03-18 20:12:49] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 20:12:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 354 ms
[2023-03-18 20:12:50] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-18 20:12:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:12:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:12:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2023-03-18 20:12:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 262 ms
[2023-03-18 20:12:50] [INFO ] After 1329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-18 20:12:50] [INFO ] After 1750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 196 ms.
Support contains 140 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 201/201 transitions.
Applied a total of 0 rules in 11 ms. Remains 398 /398 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 398/398 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 201/201 transitions.
Applied a total of 0 rules in 8 ms. Remains 398 /398 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-18 20:12:50] [INFO ] Invariant cache hit.
[2023-03-18 20:12:51] [INFO ] Implicit Places using invariants in 205 ms returned [201, 205, 207, 209, 211, 217, 221, 223, 225, 227, 231, 233, 237, 239, 247, 249, 251, 255, 261, 263, 265, 267, 273, 275, 277, 279, 281, 283, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 311, 313, 315, 317, 319, 321, 323, 329, 331, 333, 337, 341, 343, 345, 353, 355, 357, 359, 361, 365, 367, 371, 373, 375, 379, 381, 383, 387, 389, 391, 393, 395, 397]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 208 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 327/398 places, 201/201 transitions.
Applied a total of 0 rules in 12 ms. Remains 327 /327 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 230 ms. Remains : 327/398 places, 201/201 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 502561 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502561 steps, saw 167000 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 201 rows 327 cols
[2023-03-18 20:12:54] [INFO ] Computed 128 place invariants in 13 ms
[2023-03-18 20:12:54] [INFO ] [Real]Absence check using 128 positive place invariants in 20 ms returned sat
[2023-03-18 20:12:54] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:12:54] [INFO ] [Nat]Absence check using 128 positive place invariants in 14 ms returned sat
[2023-03-18 20:12:55] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 311 ms
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-18 20:12:55] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 20:12:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1112 ms
[2023-03-18 20:12:56] [INFO ] After 2075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-18 20:12:56] [INFO ] After 2435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 178 ms.
Support contains 109 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 201/201 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 326 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 326 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 322 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 321 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 321 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 319 transition count 196
Applied a total of 13 rules in 43 ms. Remains 319 /327 variables (removed 8) and now considering 196/201 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 319/327 places, 196/201 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 641525 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641525 steps, saw 163172 distinct states, run finished after 3003 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 319 cols
[2023-03-18 20:13:00] [INFO ] Computed 125 place invariants in 6 ms
[2023-03-18 20:13:00] [INFO ] [Real]Absence check using 125 positive place invariants in 16 ms returned sat
[2023-03-18 20:13:00] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:13:00] [INFO ] [Nat]Absence check using 125 positive place invariants in 18 ms returned sat
[2023-03-18 20:13:00] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 8 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-18 20:13:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 339 ms
[2023-03-18 20:13:01] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-18 20:13:01] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 101 ms.
Support contains 109 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 196/196 transitions.
Applied a total of 0 rules in 10 ms. Remains 319 /319 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 319/319 places, 196/196 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-18 20:13:01] [INFO ] Invariant cache hit.
[2023-03-18 20:13:02] [INFO ] Implicit Places using invariants in 142 ms returned [229, 264, 273, 290, 303, 313]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 143 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/319 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 162 ms. Remains : 313/319 places, 196/196 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 569955 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569955 steps, saw 147243 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 313 cols
[2023-03-18 20:13:05] [INFO ] Computed 119 place invariants in 6 ms
[2023-03-18 20:13:05] [INFO ] [Real]Absence check using 119 positive place invariants in 15 ms returned sat
[2023-03-18 20:13:05] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:13:05] [INFO ] [Nat]Absence check using 119 positive place invariants in 14 ms returned sat
[2023-03-18 20:13:05] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:13:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-18 20:13:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 20:13:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 20:13:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 165 ms
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-18 20:13:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 482 ms
[2023-03-18 20:13:06] [INFO ] After 1097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-18 20:13:06] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 111 ms.
Support contains 109 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 196/196 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 313/313 places, 196/196 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 196/196 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-18 20:13:06] [INFO ] Invariant cache hit.
[2023-03-18 20:13:07] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-18 20:13:07] [INFO ] Invariant cache hit.
[2023-03-18 20:13:07] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-18 20:13:07] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 20:13:07] [INFO ] Invariant cache hit.
[2023-03-18 20:13:07] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 313/313 places, 196/196 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 20:13:07] [INFO ] Invariant cache hit.
[2023-03-18 20:13:07] [INFO ] [Real]Absence check using 119 positive place invariants in 15 ms returned sat
[2023-03-18 20:13:07] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:13:07] [INFO ] [Nat]Absence check using 119 positive place invariants in 15 ms returned sat
[2023-03-18 20:13:07] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 8 ms to minimize.
[2023-03-18 20:13:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 20:13:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-18 20:13:09] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2023-03-18 20:13:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 806 ms
[2023-03-18 20:13:09] [INFO ] After 1433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-18 20:13:09] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:13:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-18 20:13:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 196 transitions and 820 arcs took 2 ms.
[2023-03-18 20:13:09] [INFO ] Flatten gal took : 58 ms
Total runtime 28142 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/762/inv_0_ --invariant=/tmp/762/inv_1_ --inv-par
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679170403701

--------------------
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 ResAllocation-PT-R100C002-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/762/inv_0_
rfs formula name ResAllocation-PT-R100C002-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/762/inv_1_
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 313 places, 196 transitions and 820 arcs
pnml2lts-sym: Petri net ResAllocation_PT_R100C002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 196->192 groups
pnml2lts-sym: Regrouping took 0.020 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 313; there are 192 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: Exploration took 33460 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.110 real 3.330 user 1.100 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 7.84358808891217e+30 states, 1105 nodes
pnml2lts-sym: group_next: 1868 nodes total
pnml2lts-sym: group_explored: 2197 nodes, 1536 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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r329-tall-167889202500775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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