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.r330-tall-167889203700775.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 marciexred
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 r330-tall-167889203700775
=====================================================================

--------------------
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 1679182852009

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:40:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:40:53] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-18 23:40:53] [INFO ] Transformed 400 places.
[2023-03-18 23:40:53] [INFO ] Transformed 202 transitions.
[2023-03-18 23:40:53] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 146 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 406 ms. (steps per millisecond=24 ) 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 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) 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 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 202 rows 400 cols
[2023-03-18 23:40:54] [INFO ] Computed 200 place invariants in 17 ms
[2023-03-18 23:40:54] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-18 23:40:54] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 23:40:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-18 23:40:55] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 7 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-18 23:40:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2023-03-18 23:40:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-18 23:40:56] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:40:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 23:40:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 23:40:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 247 ms
[2023-03-18 23:40:56] [INFO ] After 1274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-18 23:40:56] [INFO ] After 1781ms 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 333 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 1 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 62 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 63 ms. Remains : 398/400 places, 201/202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 552991 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552991 steps, saw 179788 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 201 rows 398 cols
[2023-03-18 23:41:00] [INFO ] Computed 199 place invariants in 3 ms
[2023-03-18 23:41:00] [INFO ] [Real]Absence check using 199 positive place invariants in 23 ms returned sat
[2023-03-18 23:41:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:41:00] [INFO ] [Nat]Absence check using 199 positive place invariants in 22 ms returned sat
[2023-03-18 23:41:00] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:41:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 5 ms to minimize.
[2023-03-18 23:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 380 ms
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2023-03-18 23:41:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2023-03-18 23:41:01] [INFO ] After 1279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-18 23:41:02] [INFO ] After 1685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 249 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 13 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 13 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 12 ms. Remains 398 /398 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-18 23:41:02] [INFO ] Invariant cache hit.
[2023-03-18 23:41:02] [INFO ] Implicit Places using invariants in 188 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 191 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 11 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 214 ms. Remains : 327/398 places, 201/201 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 574470 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574470 steps, saw 185208 distinct states, run finished after 3004 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 201 rows 327 cols
[2023-03-18 23:41:05] [INFO ] Computed 128 place invariants in 15 ms
[2023-03-18 23:41:05] [INFO ] [Real]Absence check using 128 positive place invariants in 15 ms returned sat
[2023-03-18 23:41:05] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:41:06] [INFO ] [Nat]Absence check using 128 positive place invariants in 16 ms returned sat
[2023-03-18 23:41:06] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-18 23:41:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 308 ms
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:41:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:41:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-18 23:41:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1099 ms
[2023-03-18 23:41:08] [INFO ] After 2034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-18 23:41:08] [INFO ] After 2365ms 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 180 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 1 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 1 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 40 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 40 ms. Remains : 319/327 places, 196/201 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 679364 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679364 steps, saw 171731 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 319 cols
[2023-03-18 23:41:11] [INFO ] Computed 125 place invariants in 4 ms
[2023-03-18 23:41:11] [INFO ] [Real]Absence check using 125 positive place invariants in 14 ms returned sat
[2023-03-18 23:41:11] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:41:11] [INFO ] [Nat]Absence check using 125 positive place invariants in 14 ms returned sat
[2023-03-18 23:41:12] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 9 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 23:41:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 327 ms
[2023-03-18 23:41:12] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-18 23:41:13] [INFO ] After 1189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 96 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 8 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 9 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 7 ms. Remains 319 /319 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-18 23:41:13] [INFO ] Invariant cache hit.
[2023-03-18 23:41:13] [INFO ] Implicit Places using invariants in 131 ms returned [229, 264, 273, 290, 303, 313]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 132 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 148 ms. Remains : 313/319 places, 196/196 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 621294 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621294 steps, saw 158639 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 313 cols
[2023-03-18 23:41:16] [INFO ] Computed 119 place invariants in 10 ms
[2023-03-18 23:41:16] [INFO ] [Real]Absence check using 119 positive place invariants in 15 ms returned sat
[2023-03-18 23:41:16] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:41:16] [INFO ] [Nat]Absence check using 119 positive place invariants in 14 ms returned sat
[2023-03-18 23:41:16] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 152 ms
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 488 ms
[2023-03-18 23:41:17] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-18 23:41:17] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 103 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 6 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 6 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 5 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-18 23:41:18] [INFO ] Invariant cache hit.
[2023-03-18 23:41:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-18 23:41:18] [INFO ] Invariant cache hit.
[2023-03-18 23:41:18] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-18 23:41:18] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 23:41:18] [INFO ] Invariant cache hit.
[2023-03-18 23:41:18] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 313/313 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 23:41:18] [INFO ] Invariant cache hit.
[2023-03-18 23:41:18] [INFO ] [Real]Absence check using 119 positive place invariants in 19 ms returned sat
[2023-03-18 23:41:18] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:41:18] [INFO ] [Nat]Absence check using 119 positive place invariants in 19 ms returned sat
[2023-03-18 23:41:19] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 9 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-18 23:41:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 23:41:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-03-18 23:41:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 708 ms
[2023-03-18 23:41:20] [INFO ] After 1312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-18 23:41:20] [INFO ] After 1598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 23:41:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-18 23:41:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 196 transitions and 820 arcs took 1 ms.
[2023-03-18 23:41:20] [INFO ] Flatten gal took : 48 ms
Total runtime 27028 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ResAllocation_PT_R100C002
(NrP: 313 NrTr: 196 NrArc: 820)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec

net check time: 0m 0.000sec

init dd package: 0m 2.722sec


RS generation: 0m 1.010sec


-> reachability set: #nodes 841 (8.4e+02) #states 7,843,588,088,912,169,421,760,851,083,264 (30)



starting MCC model checker
--------------------------

checking: AG [[[[p207<=0 | [p156<=0 | p159<=0]] | [p17<=0 | p206<=0]] | [[[1<=p190 & 1<=p193] | [1<=p1 & [1<=p195 & 1<=p196]]] | [[1<=p70 & 1<=p73] | [[[[1<=p55 & 1<=p231] & [1<=p232 & 1<=p142]] & [[1<=p145 & 1<=p27] & [1<=p212 & [1<=p213 & [p0<=0 | p3<=0]]]]] | [[p43<=0 | [p224<=0 | p225<=0]] & [[p69<=0 | [p241<=0 | p242<=0]] & [[1<=p38 & 1<=p41] | [[1<=p138 & 1<=p141] | [[1<=p96 & 1<=p99] & [1<=p162 & 1<=p165]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[1<=p232 & 1<=p142] & [1<=p55 & 1<=p231]] & [[[[p0<=0 | p3<=0] & 1<=p213] & 1<=p212] & [1<=p145 & 1<=p27]]] | [[[[1<=p38 & 1<=p41] | [[1<=p138 & 1<=p141] | [[1<=p162 & 1<=p165] & [1<=p96 & 1<=p99]]]] & [[p241<=0 | p242<=0] | p69<=0]] & [[p224<=0 | p225<=0] | p43<=0]]] | [1<=p70 & 1<=p73]] | [[[1<=p195 & 1<=p196] & 1<=p1] | [1<=p190 & 1<=p193]]] | [[p17<=0 | p206<=0] | [[p156<=0 | p159<=0] | p207<=0]]]]]]

abstracting: (p207<=0)
states: 7,407,833,195,083,715,564,996,359,356,416 (30)
abstracting: (p159<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p156<=0)
states: 7,051,306,463,769,526,045,825,411,579,904 (30)
abstracting: (p206<=0)
states: 396,140,812,571,321,687,967,719,751,680 (29)
abstracting: (p17<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p193)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p190)
states: 118,842,243,771,396,506,390,315,925,504 (29)
abstracting: (1<=p1)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p196)
states: 118,842,243,771,396,506,390,315,925,504 (29)
abstracting: (1<=p195)
states: 7,764,359,926,397,905,084,167,307,132,928 (30)
abstracting: (1<=p73)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p70)
states: 2,495,687,119,199,326,634,196,634,435,584 (30)
abstracting: (p43<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p225<=0)
states: 6,892,850,138,740,997,370,638,323,679,232 (30)
abstracting: (p224<=0)
states: 911,123,868,914,039,882,325,755,428,864 (29)
abstracting: (p69<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p242<=0)
states: 6,377,867,082,398,279,176,280,288,002,048 (30)
abstracting: (p241<=0)
states: 1,426,106,925,256,758,076,683,791,106,048 (30)
abstracting: (1<=p99)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p96)
states: 1,980,704,062,856,608,439,838,598,758,400 (30)
abstracting: (1<=p165)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p162)
states: 673,439,381,371,246,869,545,123,577,856 (29)
abstracting: (1<=p141)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p138)
states: 1,148,808,356,456,832,895,106,387,279,872 (30)
abstracting: (1<=p41)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p38)
states: 3,129,512,419,313,441,334,944,986,038,272 (30)
abstracting: (1<=p27)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p145)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p212)
states: 7,249,376,870,055,186,889,809,271,455,744 (30)
abstracting: (1<=p213)
states: 633,825,300,114,114,700,748,351,602,688 (29)
abstracting: (p3<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p0<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p231)
states: 6,694,779,732,455,336,526,654,463,803,392 (30)
abstracting: (1<=p55)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p142)
states: 1,069,580,193,942,568,557,512,843,329,536 (30)
abstracting: (1<=p232)
states: 1,188,422,437,713,965,063,903,159,255,040 (30)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[1<=p96 & [1<=p99 & [[[[[1<=p13 & 1<=p203] & [1<=p204 & [[1<=p52 & 1<=p55] | [[1<=p166 & 1<=p169] | [[1<=p82 & 1<=p85] & [1<=p122 & 1<=p125]]]]]] & [[[[1<=p188 & 1<=p191] | [1<=p182 & 1<=p185]] & [[p11<=0 | [p201<=0 | p202<=0]] | [[p41<=0 | p222<=0] | [p223<=0 | [1<=p88 & 1<=p91]]]]] & [[[p175<=0 | p303<=0] | [p304<=0 | [p10<=0 | p13<=0]]] & [[p68<=0 | [p71<=0 | p26<=0]] | [p29<=0 | [p162<=0 | p165<=0]]]]]] | [[1<=p57 & 1<=p233] & [1<=p234 & [[p156<=0 | p159<=0] | [[[[p70<=0 | p73<=0] & [p6<=0 | p9<=0]] & [[p64<=0 | p67<=0] & [[p83<=0 | p249<=0] | [p250<=0 | [[p188<=0 | p191<=0] & [p149<=0 | [p288<=0 | p289<=0]]]]]]] | [[p33<=0 | [p216<=0 | p217<=0]] & [p137<=0 | [p280<=0 | p281<=0]]]]]]]] | [[[1<=p41 & 1<=p222] & [1<=p223 & [[1<=p158 & 1<=p161] | [1<=p70 & 1<=p73]]]] | [[[1<=p133 & [1<=p277 & 1<=p278]] & [[1<=p39 & 1<=p220] & [1<=p221 & 1<=p176]]] & [[[1<=p179 & 1<=p67] & [1<=p239 & 1<=p240]] & [[[p126<=0 | p129<=0] & [[p125<=0 | [p272<=0 | p273<=0]] | [p145<=0 | [p285<=0 | p286<=0]]]] & [[[[1<=p26 & 1<=p29] & [1<=p105 & [1<=p261 & 1<=p262]]] | [[1<=p150 & 1<=p153] & [1<=p161 & [1<=p295 & 1<=p296]]]] & [[1<=p142 & 1<=p145] | [1<=p149 & [1<=p288 & 1<=p289]]]]]]]]]]]]
normalized: E [true U [1<=p96 & [1<=p99 & [[[[[[[[1<=p149 & [1<=p288 & 1<=p289]] | [1<=p142 & 1<=p145]] & [[[1<=p161 & [1<=p295 & 1<=p296]] & [1<=p150 & 1<=p153]] | [[1<=p105 & [1<=p261 & 1<=p262]] & [1<=p26 & 1<=p29]]]] & [[[p145<=0 | [p285<=0 | p286<=0]] | [p125<=0 | [p272<=0 | p273<=0]]] & [p126<=0 | p129<=0]]] & [[1<=p239 & 1<=p240] & [1<=p179 & 1<=p67]]] & [[[1<=p221 & 1<=p176] & [1<=p39 & 1<=p220]] & [1<=p133 & [1<=p277 & 1<=p278]]]] | [[1<=p223 & [[1<=p70 & 1<=p73] | [1<=p158 & 1<=p161]]] & [1<=p41 & 1<=p222]]] | [[[1<=p234 & [[[[p137<=0 | [p280<=0 | p281<=0]] & [p33<=0 | [p216<=0 | p217<=0]]] | [[[[p250<=0 | [[p149<=0 | [p288<=0 | p289<=0]] & [p188<=0 | p191<=0]]] | [p83<=0 | p249<=0]] & [p64<=0 | p67<=0]] & [[p6<=0 | p9<=0] & [p70<=0 | p73<=0]]]] | [p156<=0 | p159<=0]]] & [1<=p57 & 1<=p233]] | [[[[[p29<=0 | [p162<=0 | p165<=0]] | [p68<=0 | [p71<=0 | p26<=0]]] & [[p304<=0 | [p10<=0 | p13<=0]] | [p175<=0 | p303<=0]]] & [[[[p223<=0 | [1<=p88 & 1<=p91]] | [p41<=0 | p222<=0]] | [p11<=0 | [p201<=0 | p202<=0]]] & [[1<=p182 & 1<=p185] | [1<=p188 & 1<=p191]]]] & [[1<=p204 & [[[[1<=p122 & 1<=p125] & [1<=p82 & 1<=p85]] | [1<=p166 & 1<=p169]] | [1<=p52 & 1<=p55]]] & [1<=p13 & 1<=p203]]]]]]]]

abstracting: (1<=p203)
states: 7,526,675,438,855,112,071,386,675,281,920 (30)
abstracting: (1<=p13)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p55)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p52)
states: 2,852,213,850,513,516,153,367,582,212,096 (30)
abstracting: (1<=p169)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p166)
states: 594,211,218,856,982,531,951,579,627,520 (29)
abstracting: (1<=p85)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p82)
states: 2,258,002,631,656,533,621,416,002,584,576 (30)
abstracting: (1<=p125)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p122)
states: 1,465,721,006,513,890,245,480,563,081,216 (30)
abstracting: (1<=p204)
states: 356,526,731,314,189,519,170,947,776,512 (29)
abstracting: (1<=p191)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p188)
states: 158,456,325,028,528,675,187,087,900,672 (29)
abstracting: (1<=p185)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p182)
states: 277,298,568,799,925,181,577,403,826,176 (29)
abstracting: (p202<=0)
states: 7,526,675,438,855,112,071,386,675,281,920 (30)
abstracting: (p201<=0)
states: 277,298,568,799,925,181,577,403,826,176 (29)
abstracting: (p11<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p222<=0)
states: 871,509,787,656,907,713,528,983,453,696 (29)
abstracting: (p41<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p91)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p88)
states: 2,139,160,387,885,137,115,025,686,659,072 (30)
abstracting: (p223<=0)
states: 6,932,464,219,998,129,539,435,095,654,400 (30)
abstracting: (p303<=0)
states: 3,525,653,231,884,763,022,912,705,789,952 (30)
abstracting: (p175<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p13<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p10<=0)
states: 4,159,478,531,998,877,723,661,057,392,640 (30)
abstracting: (p304<=0)
states: 4,278,320,775,770,274,230,051,373,318,144 (30)
abstracting: (p26<=0)
states: 4,476,391,182,055,935,074,035,233,193,984 (30)
abstracting: (p71<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p68<=0)
states: 5,308,286,888,455,710,618,767,444,672,512 (30)
abstracting: (p165<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p162<=0)
states: 7,170,148,707,540,922,552,215,727,505,408 (30)
abstracting: (p29<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p233)
states: 6,655,165,651,198,204,357,857,691,828,224 (30)
abstracting: (1<=p57)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (p159<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p156<=0)
states: 7,051,306,463,769,526,045,825,411,579,904 (30)
abstracting: (p73<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p70<=0)
states: 5,347,900,969,712,842,787,564,216,647,680 (30)
abstracting: (p9<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p6<=0)
states: 4,080,250,369,484,613,386,067,513,442,304 (30)
abstracting: (p67<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p64<=0)
states: 5,229,058,725,941,446,281,173,900,722,176 (30)
abstracting: (p249<=0)
states: 1,703,405,494,056,683,258,261,194,932,224 (30)
abstracting: (p83<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p191<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p188<=0)
states: 7,685,131,763,883,640,746,573,763,182,592 (30)
abstracting: (p289<=0)
states: 4,793,303,832,112,992,424,409,408,995,328 (30)
abstracting: (p288<=0)
states: 3,010,670,175,542,044,828,554,670,112,768 (30)
abstracting: (p149<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p250<=0)
states: 6,100,568,513,598,353,994,702,884,175,872 (30)
abstracting: (p217<=0)
states: 7,090,920,545,026,658,214,622,183,555,072 (30)
abstracting: (p216<=0)
states: 713,053,462,628,379,038,341,895,553,024 (29)
abstracting: (p33<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p281<=0)
states: 5,030,988,319,655,785,437,190,040,846,336 (30)
abstracting: (p280<=0)
states: 2,772,985,687,999,251,815,774,038,261,760 (30)
abstracting: (p137<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p234)
states: 1,228,036,518,971,097,232,699,931,230,208 (30)
abstracting: (1<=p222)
states: 6,972,078,301,255,261,708,231,867,629,568 (30)
abstracting: (1<=p41)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p161)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p158)
states: 752,667,543,885,511,207,138,667,528,192 (29)
abstracting: (1<=p73)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p70)
states: 2,495,687,119,199,326,634,196,634,435,584 (30)
abstracting: (1<=p223)
states: 911,123,868,914,039,882,325,755,428,864 (29)
abstracting: (1<=p278)
states: 2,733,371,606,742,119,646,977,266,286,592 (30)
abstracting: (1<=p277)
states: 5,149,830,563,427,181,943,580,356,771,840 (30)
abstracting: (1<=p133)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p220)
states: 7,011,692,382,512,393,877,028,639,604,736 (30)
abstracting: (1<=p39)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p176)
states: 396,140,812,571,321,687,967,719,751,680 (29)
abstracting: (1<=p221)
states: 871,509,787,656,907,713,528,983,453,696 (29)
abstracting: (1<=p67)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p179)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p240)
states: 1,426,106,925,256,758,076,683,791,106,048 (30)
abstracting: (1<=p239)
states: 6,457,095,244,912,543,513,873,831,952,384 (30)
abstracting: (p129<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p126<=0)
states: 6,457,095,244,912,543,513,873,831,952,384 (30)
abstracting: (p273<=0)
states: 5,268,672,807,198,578,449,970,672,697,344 (30)
abstracting: (p272<=0)
states: 2,535,301,200,456,458,802,993,406,410,752 (30)
abstracting: (p125<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (p286<=0)
states: 4,872,531,994,627,256,762,002,952,945,664 (30)
abstracting: (p285<=0)
states: 2,931,442,013,027,780,490,961,126,162,432 (30)
abstracting: (p145<=0)
states: 3,961,408,125,713,216,879,677,197,516,800 (30)
abstracting: (1<=p29)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p26)
states: 3,367,196,906,856,234,347,725,617,889,280 (30)
abstracting: (1<=p262)
states: 2,178,774,469,142,269,283,822,458,634,240 (30)
abstracting: (1<=p261)
states: 5,704,427,701,027,032,306,735,164,424,192 (30)
abstracting: (1<=p105)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p153)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p150)
states: 911,123,868,914,039,882,325,755,428,864 (29)
abstracting: (1<=p296)
states: 3,287,968,744,341,970,010,132,073,938,944 (30)
abstracting: (1<=p295)
states: 4,595,233,425,827,331,580,425,549,119,488 (30)
abstracting: (1<=p161)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p145)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p142)
states: 1,069,580,193,942,568,557,512,843,329,536 (30)
abstracting: (1<=p289)
states: 3,050,284,256,799,176,997,351,442,087,936 (30)
abstracting: (1<=p288)
states: 4,832,917,913,370,124,593,206,180,970,496 (30)
abstracting: (1<=p149)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p99)
states: 3,882,179,963,198,952,542,083,653,566,464 (30)
abstracting: (1<=p96)
states: 1,980,704,062,856,608,439,838,598,758,400 (30)
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

totally nodes used: 1144264 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1229452 3937737 5167189
used/not used/entry size/cache size: 4767706 62341158 16 1024MB
basic ops cache: hits/miss/sum: 39060 176676 215736
used/not used/entry size/cache size: 428647 16348569 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 13914 39970 53884
used/not used/entry size/cache size: 39960 8348648 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66026988
1 1024836
2 52066
3 4621
4 333
5 19
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.580sec


BK_STOP 1679182887110

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec


iterations count:33264 (169), effective:9506 (48)

initing FirstDep: 0m 0.002sec

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="marciexred"
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 marciexred"
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 r330-tall-167889203700775"
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 ;