fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420400527
Last Updated
May 14, 2023

About the Execution of Marcie+red for LeafsetExtension-PT-S64C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5721.096 2672011.00 2731112.00 6170.40 FFTTTFTFFTTTFTFF normal

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.r234-tall-167856420400527.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 LeafsetExtension-PT-S64C2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679525689641

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=LeafsetExtension-PT-S64C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:54:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:54:51] [INFO ] Load time of PNML (sax parser for PT used): 474 ms
[2023-03-22 22:54:51] [INFO ] Transformed 21462 places.
[2023-03-22 22:54:52] [INFO ] Transformed 21129 transitions.
[2023-03-22 22:54:52] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 622 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 549 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 22:54:56] [INFO ] Computed 333 place invariants in 2604 ms
[2023-03-22 22:55:01] [INFO ] [Real]Absence check using 67 positive place invariants in 80 ms returned sat
[2023-03-22 22:55:02] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 911 ms returned sat
[2023-03-22 22:55:21] [INFO ] After 25076ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-03-22 22:55:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 58 ms returned sat
[2023-03-22 22:55:26] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 912 ms returned sat
[2023-03-22 22:55:46] [INFO ] After 17250ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-22 22:55:46] [INFO ] After 17284ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 22:55:46] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 132 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 10531 are kept as prefixes of interest. Removing 10931 places using SCC suffix rule.39 ms
Discarding 10931 places :
Also discarding 5244 output transitions
Drop transitions removed 5244 transitions
Drop transitions removed 1409 transitions
Reduce isomorphic transitions removed 1409 transitions.
Drop transitions removed 3974 transitions
Trivial Post-agglo rules discarded 3974 transitions
Performed 3974 trivial Post agglomeration. Transition count delta: 3974
Iterating post reduction 0 with 5383 rules applied. Total rules applied 5384 place count 10531 transition count 10502
Reduce places removed 3975 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 3981 rules applied. Total rules applied 9365 place count 6556 transition count 10496
Reduce places removed 6 places and 0 transitions.
Performed 623 Post agglomeration using F-continuation condition.Transition count delta: 623
Iterating post reduction 2 with 629 rules applied. Total rules applied 9994 place count 6550 transition count 9873
Reduce places removed 623 places and 0 transitions.
Iterating post reduction 3 with 623 rules applied. Total rules applied 10617 place count 5927 transition count 9873
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 10617 place count 5927 transition count 9796
Deduced a syphon composed of 77 places in 7 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 10771 place count 5850 transition count 9796
Discarding 2653 places :
Symmetric choice reduction at 4 with 2653 rule applications. Total rules 13424 place count 3197 transition count 7143
Iterating global reduction 4 with 2653 rules applied. Total rules applied 16077 place count 3197 transition count 7143
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 16108 place count 3166 transition count 7112
Iterating global reduction 4 with 31 rules applied. Total rules applied 16139 place count 3166 transition count 7112
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16140 place count 3165 transition count 7112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 16142 place count 3164 transition count 7111
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 16153 place count 3164 transition count 7100
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 16164 place count 3153 transition count 7100
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 6 with 202 rules applied. Total rules applied 16366 place count 3153 transition count 7100
Applied a total of 16366 rules in 3503 ms. Remains 3153 /21462 variables (removed 18309) and now considering 7100/21129 (removed 14029) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3505 ms. Remains : 3153/21462 places, 7100/21129 transitions.
Incomplete random walk after 10000 steps, including 1031 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :4
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 22:55:50] [INFO ] Flow matrix only has 5591 transitions (discarded 1509 similar events)
// Phase 1: matrix 5591 rows 3153 cols
[2023-03-22 22:55:50] [INFO ] Computed 116 place invariants in 96 ms
[2023-03-22 22:55:50] [INFO ] [Real]Absence check using 0 positive and 116 generalized place invariants in 49 ms returned sat
[2023-03-22 22:55:50] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 22:55:51] [INFO ] [Nat]Absence check using 0 positive and 116 generalized place invariants in 42 ms returned sat
[2023-03-22 22:55:54] [INFO ] After 3193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 22:55:55] [INFO ] After 4388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1156 ms.
[2023-03-22 22:55:56] [INFO ] After 6071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 79 out of 3153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3153/3153 places, 7100/7100 transitions.
Graph (complete) has 16048 edges and 3153 vertex of which 2945 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.3 ms
Discarding 208 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 188 rules applied. Total rules applied 189 place count 2945 transition count 6885
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 203 place count 2932 transition count 6884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 2931 transition count 6884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 204 place count 2931 transition count 6882
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 2929 transition count 6882
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 243 place count 2894 transition count 6847
Iterating global reduction 3 with 35 rules applied. Total rules applied 278 place count 2894 transition count 6847
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 3 with 45 rules applied. Total rules applied 323 place count 2894 transition count 6847
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 329 place count 2888 transition count 6841
Iterating global reduction 3 with 6 rules applied. Total rules applied 335 place count 2888 transition count 6841
Applied a total of 335 rules in 879 ms. Remains 2888 /3153 variables (removed 265) and now considering 6841/7100 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 879 ms. Remains : 2888/3153 places, 6841/7100 transitions.
Incomplete random walk after 10000 steps, including 1061 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 23743 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23743 steps, saw 11129 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 22:56:00] [INFO ] Flow matrix only has 5132 transitions (discarded 1709 similar events)
// Phase 1: matrix 5132 rows 2888 cols
[2023-03-22 22:56:00] [INFO ] Computed 109 place invariants in 74 ms
[2023-03-22 22:56:01] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 39 ms returned sat
[2023-03-22 22:56:01] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 22:56:01] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 41 ms returned sat
[2023-03-22 22:56:04] [INFO ] After 2670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 22:56:06] [INFO ] After 3972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 675 ms.
[2023-03-22 22:56:06] [INFO ] After 5165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 79 out of 2888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2888/2888 places, 6841/6841 transitions.
Applied a total of 0 rules in 233 ms. Remains 2888 /2888 variables (removed 0) and now considering 6841/6841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 2888/2888 places, 6841/6841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2888/2888 places, 6841/6841 transitions.
Applied a total of 0 rules in 224 ms. Remains 2888 /2888 variables (removed 0) and now considering 6841/6841 (removed 0) transitions.
[2023-03-22 22:56:07] [INFO ] Flow matrix only has 5132 transitions (discarded 1709 similar events)
[2023-03-22 22:56:07] [INFO ] Invariant cache hit.
[2023-03-22 22:56:09] [INFO ] Implicit Places using invariants in 2542 ms returned [8, 45, 85, 124, 199, 238, 275, 312, 388, 425, 462, 499, 649, 688, 725, 797, 837, 908, 950, 1022, 1060, 1098, 1135, 1172, 1209, 1247, 1286, 1324, 1362, 1400, 1437, 1439, 1476, 1510, 1513, 1547, 1550, 1584, 1587, 1621, 1624, 1658, 1697, 1700, 1734, 1739, 1773, 1850, 1854, 1888, 1891, 1925, 1928, 1963, 2004, 2007, 2041, 2044, 2078, 2081, 2115, 2118, 2152, 2155, 2192, 2226, 2231, 2265, 2268, 2302, 2307, 2341, 2413, 2416, 2453, 2487, 2492, 2526, 2563, 2602, 2639, 2673, 2712, 2715, 2749, 2786, 2821]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 2549 ms to find 87 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2801/2888 places, 6841/6841 transitions.
Discarding 1776 places :
Symmetric choice reduction at 0 with 1776 rule applications. Total rules 1776 place count 1025 transition count 5065
Iterating global reduction 0 with 1776 rules applied. Total rules applied 3552 place count 1025 transition count 5065
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 3609 place count 968 transition count 5008
Iterating global reduction 0 with 57 rules applied. Total rules applied 3666 place count 968 transition count 5008
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 3966 place count 668 transition count 4708
Iterating global reduction 0 with 300 rules applied. Total rules applied 4266 place count 668 transition count 4708
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 4284 place count 659 transition count 4699
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 4303 place count 659 transition count 4680
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 4322 place count 640 transition count 4680
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4323 place count 640 transition count 4680
Applied a total of 4323 rules in 350 ms. Remains 640 /2801 variables (removed 2161) and now considering 4680/6841 (removed 2161) transitions.
[2023-03-22 22:56:10] [INFO ] Flow matrix only has 1161 transitions (discarded 3519 similar events)
// Phase 1: matrix 1161 rows 640 cols
[2023-03-22 22:56:10] [INFO ] Computed 22 place invariants in 9 ms
[2023-03-22 22:56:10] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-22 22:56:10] [INFO ] Flow matrix only has 1161 transitions (discarded 3519 similar events)
[2023-03-22 22:56:10] [INFO ] Invariant cache hit.
[2023-03-22 22:56:13] [INFO ] Implicit Places using invariants and state equation in 2904 ms returned [13, 18, 25, 31, 73, 76, 79, 82, 94, 97, 100, 103, 106, 158, 194, 196, 200, 203, 286, 292, 329, 331, 338, 341, 344, 352, 362, 368, 373, 376, 529, 631]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 3373 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 608/2888 places, 4680/6841 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 608 transition count 4677
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 605 transition count 4677
Discarding 267 places :
Symmetric choice reduction at 0 with 267 rule applications. Total rules 273 place count 338 transition count 4410
Iterating global reduction 0 with 267 rules applied. Total rules applied 540 place count 338 transition count 4410
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 566 place count 325 transition count 4397
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 589 place count 325 transition count 4374
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 612 place count 302 transition count 4374
Applied a total of 612 rules in 160 ms. Remains 302 /608 variables (removed 306) and now considering 4374/4680 (removed 306) transitions.
[2023-03-22 22:56:13] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
// Phase 1: matrix 837 rows 302 cols
[2023-03-22 22:56:13] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-22 22:56:13] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-22 22:56:13] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-22 22:56:13] [INFO ] Invariant cache hit.
[2023-03-22 22:56:14] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 302/2888 places, 4374/6841 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7977 ms. Remains : 302/2888 places, 4374/6841 transitions.
Incomplete random walk after 10000 steps, including 1552 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:56:15] [INFO ] Flow matrix only has 837 transitions (discarded 3537 similar events)
[2023-03-22 22:56:15] [INFO ] Invariant cache hit.
[2023-03-22 22:56:15] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-22 22:56:15] [INFO ] After 280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 22:56:15] [INFO ] After 465ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-22 22:56:16] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 4374/4374 transitions.
Graph (complete) has 2046 edges and 302 vertex of which 287 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 287 transition count 4358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 285 transition count 4358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 279 transition count 4352
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 279 transition count 4352
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 277 transition count 4350
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 277 transition count 4347
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 274 transition count 4347
Applied a total of 32 rules in 146 ms. Remains 274 /302 variables (removed 28) and now considering 4347/4374 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 274/302 places, 4347/4374 transitions.
Incomplete random walk after 10000 steps, including 1549 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93010 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 93010 steps, saw 27230 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:56:19] [INFO ] Flow matrix only has 772 transitions (discarded 3575 similar events)
// Phase 1: matrix 772 rows 274 cols
[2023-03-22 22:56:19] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-22 22:56:19] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-22 22:56:19] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:56:19] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-22 22:56:19] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:56:19] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-22 22:56:20] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 66 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 4347/4347 transitions.
Applied a total of 0 rules in 62 ms. Remains 274 /274 variables (removed 0) and now considering 4347/4347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 274/274 places, 4347/4347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 4347/4347 transitions.
Applied a total of 0 rules in 59 ms. Remains 274 /274 variables (removed 0) and now considering 4347/4347 (removed 0) transitions.
[2023-03-22 22:56:20] [INFO ] Flow matrix only has 772 transitions (discarded 3575 similar events)
[2023-03-22 22:56:20] [INFO ] Invariant cache hit.
[2023-03-22 22:56:20] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-22 22:56:20] [INFO ] Flow matrix only has 772 transitions (discarded 3575 similar events)
[2023-03-22 22:56:20] [INFO ] Invariant cache hit.
[2023-03-22 22:56:21] [INFO ] Implicit Places using invariants and state equation in 944 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1298 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 4347/4347 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 269 transition count 4343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 269 transition count 4342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 268 transition count 4342
Applied a total of 10 rules in 131 ms. Remains 268 /273 variables (removed 5) and now considering 4342/4347 (removed 5) transitions.
[2023-03-22 22:56:21] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
// Phase 1: matrix 767 rows 268 cols
[2023-03-22 22:56:21] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-22 22:56:22] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 22:56:22] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
[2023-03-22 22:56:22] [INFO ] Invariant cache hit.
[2023-03-22 22:56:22] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 268/274 places, 4342/4347 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2743 ms. Remains : 268/274 places, 4342/4347 transitions.
Incomplete random walk after 10000 steps, including 1577 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96191 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96191 steps, saw 28187 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:56:26] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
[2023-03-22 22:56:26] [INFO ] Invariant cache hit.
[2023-03-22 22:56:26] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-22 22:56:26] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:56:26] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-22 22:56:26] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:56:26] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-22 22:56:26] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 4342/4342 transitions.
Applied a total of 0 rules in 61 ms. Remains 268 /268 variables (removed 0) and now considering 4342/4342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 268/268 places, 4342/4342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 4342/4342 transitions.
Applied a total of 0 rules in 58 ms. Remains 268 /268 variables (removed 0) and now considering 4342/4342 (removed 0) transitions.
[2023-03-22 22:56:27] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
[2023-03-22 22:56:27] [INFO ] Invariant cache hit.
[2023-03-22 22:56:27] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 22:56:27] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
[2023-03-22 22:56:27] [INFO ] Invariant cache hit.
[2023-03-22 22:56:28] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-03-22 22:56:28] [INFO ] Redundant transitions in 386 ms returned []
[2023-03-22 22:56:28] [INFO ] Flow matrix only has 767 transitions (discarded 3575 similar events)
[2023-03-22 22:56:28] [INFO ] Invariant cache hit.
[2023-03-22 22:56:29] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2843 ms. Remains : 268/268 places, 4342/4342 transitions.
Drop transitions removed 1379 transitions
Ensure Unique test removed 2221 transitions
Reduce isomorphic transitions removed 3600 transitions.
Iterating post reduction 0 with 3600 rules applied. Total rules applied 3600 place count 268 transition count 742
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3600 place count 268 transition count 736
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 3612 place count 262 transition count 736
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 3637 place count 237 transition count 526
Iterating global reduction 1 with 25 rules applied. Total rules applied 3662 place count 237 transition count 526
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 3670 place count 233 transition count 522
Free-agglomeration rule applied 49 times.
Iterating global reduction 1 with 49 rules applied. Total rules applied 3719 place count 233 transition count 473
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 3774 place count 184 transition count 467
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3775 place count 184 transition count 466
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 3790 place count 184 transition count 451
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 3805 place count 169 transition count 451
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3807 place count 167 transition count 449
Iterating global reduction 3 with 2 rules applied. Total rules applied 3809 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3811 place count 165 transition count 431
Iterating global reduction 3 with 2 rules applied. Total rules applied 3813 place count 165 transition count 431
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3815 place count 165 transition count 429
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 3871 place count 165 transition count 429
Applied a total of 3871 rules in 38 ms. Remains 165 /268 variables (removed 103) and now considering 429/4342 (removed 3913) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 429 rows 165 cols
[2023-03-22 22:56:29] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-22 22:56:29] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-22 22:56:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:56:30] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-22 22:56:30] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:56:30] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-22 22:56:30] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:56:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 22:56:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 268 places, 4342 transitions and 18780 arcs took 22 ms.
[2023-03-22 22:56:30] [INFO ] Flatten gal took : 303 ms
Total runtime 99496 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: gen
(NrP: 268 NrTr: 4342 NrArc: 18780)

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

net check time: 0m 0.003sec

init dd package: 0m 2.751sec


RS generation: 42m35.860sec


-> reachability set: #nodes 273966 (2.7e+05) #states 604,978 (5)



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

checking: EF [[[[[[[[1<=p151 & 1<=p191] & 1<=p21] | p70<=0] | [p64<=0 | 1<=p100]] & [1<=p177 | p226<=0]] & [[[[[[[[[[1<=p260 & 1<=p217] | [1<=p44 & 1<=p38]] | [1<=p204 & 1<=p82]] | [1<=p53 | p242<=0]] | [[p119<=0 | p173<=0] | [p127<=0 | 1<=p210]]] & [p137<=0 | p81<=0]] | [[[[p149<=0 | p132<=0] & p107<=0] | p14<=0] & 1<=p200]] | [[[[[1<=p220 & 1<=p117] | 1<=p165] | [p114<=0 | p78<=0]] & [p205<=0 | p121<=0]] & [p238<=0 | p41<=0]]] | [[[[p86<=0 | p18<=0] & p258<=0] | [1<=p241 & 1<=p221]] | 1<=p126]] & [[[[[p74<=0 & [[p169<=0 | p156<=0] & [[[[1<=p202 & 1<=p171] & [1<=p230 & 1<=p236]] | p76<=0] | p48<=0]]] | [[1<=p142 & [1<=p20 | [1<=p68 & 1<=p57]]] & 1<=p104]] | 1<=p16] & 1<=p251] | [1<=p190 & 1<=p195]]]] & [[[p96<=0 | p90<=0] & [p27<=0 | p31<=0]] & [1<=p181 & p130<=0]]]]
normalized: E [true U [[[1<=p181 & p130<=0] & [[p27<=0 | p31<=0] & [p96<=0 | p90<=0]]] & [[[[1<=p126 | [[1<=p241 & 1<=p221] | [[p86<=0 | p18<=0] & p258<=0]]] | [[[[[p114<=0 | p78<=0] | [[1<=p220 & 1<=p117] | 1<=p165]] & [p205<=0 | p121<=0]] & [p238<=0 | p41<=0]] | [[[[[p149<=0 | p132<=0] & p107<=0] | p14<=0] & 1<=p200] | [[[[p119<=0 | p173<=0] | [p127<=0 | 1<=p210]] | [[1<=p53 | p242<=0] | [[[1<=p44 & 1<=p38] | [1<=p260 & 1<=p217]] | [1<=p204 & 1<=p82]]]] & [p137<=0 | p81<=0]]]]] & [[1<=p190 & 1<=p195] | [[[[[[p169<=0 | p156<=0] & [[[[1<=p202 & 1<=p171] & [1<=p230 & 1<=p236]] | p76<=0] | p48<=0]] & p74<=0] | [[[[1<=p68 & 1<=p57] | 1<=p20] & 1<=p142] & 1<=p104]] | 1<=p16] & 1<=p251]]] & [[1<=p177 | p226<=0] & [[[[1<=p151 & 1<=p191] & 1<=p21] | p70<=0] | [p64<=0 | 1<=p100]]]]]]

abstracting: (1<=p100)
states: 1,179 (3)
abstracting: (p64<=0)
states: 601,555 (5)
abstracting: (p70<=0)
states: 575,486 (5)
abstracting: (1<=p21)
states: 1,187 (3)
abstracting: (1<=p191)
states: 579,545 (5)
abstracting: (1<=p151)
states: 1,182 (3)
abstracting: (p226<=0)
states: 603,792 (5)
abstracting: (1<=p177)
states: 1,183 (3)
abstracting: (1<=p251)
states: 1,174 (3)
abstracting: (1<=p16)
states: 1,179 (3)
abstracting: (1<=p104)
states: 1,188 (3)
abstracting: (1<=p142)
states: 1,179 (3)
abstracting: (1<=p20)
states: 1,183 (3)
abstracting: (1<=p57)
states: 2,341 (3)
abstracting: (1<=p68)
states: 32,810 (4)
abstracting: (p74<=0)
states: 603,792 (5)
abstracting: (p48<=0)
states: 16,620 (4)
abstracting: (p76<=0)
states: 603,789 (5)
abstracting: (1<=p236)
states: 32,533 (4)
abstracting: (1<=p230)
states: 2,345 (3)
abstracting: (1<=p171)
states: 586,312 (5)
abstracting: (1<=p202)
states: 1,184 (3)
abstracting: (p156<=0)
states: 602,639 (5)
abstracting: (p169<=0)
states: 572,499 (5)
abstracting: (1<=p195)
states: 12,914 (4)
abstracting: (1<=p190)
states: 1,174 (3)
abstracting: (p81<=0)
states: 603,794 (5)
abstracting: (p137<=0)
states: 18,666 (4)
abstracting: (1<=p82)
states: 10,656 (4)
abstracting: (1<=p204)
states: 1,184 (3)
abstracting: (1<=p217)
states: 29,278 (4)
abstracting: (1<=p260)
states: 575,549 (5)
abstracting: (1<=p38)
states: 3,459 (3)
abstracting: (1<=p44)
states: 29,552 (4)
abstracting: (p242<=0)
states: 592,064 (5)
abstracting: (1<=p53)
states: 1,185 (3)
abstracting: (1<=p210)
states: 1,181 (3)
abstracting: (p127<=0)
states: 603,790 (5)
abstracting: (p173<=0)
states: 18,666 (4)
abstracting: (p119<=0)
states: 603,804 (5)
abstracting: (1<=p200)
states: 1,185 (3)
abstracting: (p14<=0)
states: 603,793 (5)
abstracting: (p107<=0)
states: 603,788 (5)
abstracting: (p132<=0)
states: 603,799 (5)
abstracting: (p149<=0)
states: 18,666 (4)
abstracting: (p41<=0)
states: 603,806 (5)
abstracting: (p238<=0)
states: 593,242 (5)
abstracting: (p121<=0)
states: 593,158 (5)
abstracting: (p205<=0)
states: 603,796 (5)
abstracting: (1<=p165)
states: 1,172 (3)
abstracting: (1<=p117)
states: 1,172 (3)
abstracting: (1<=p220)
states: 12,892 (4)
abstracting: (p78<=0)
states: 603,794 (5)
abstracting: (p114<=0)
states: 594,322 (5)
abstracting: (p258<=0)
states: 603,788 (5)
abstracting: (p18<=0)
states: 603,797 (5)
abstracting: (p86<=0)
states: 593,168 (5)
abstracting: (1<=p221)
states: 583,988 (5)
abstracting: (1<=p241)
states: 1,174 (3)
abstracting: (1<=p126)
states: 1,179 (3)
abstracting: (p90<=0)
states: 602,635 (5)
abstracting: (p96<=0)
states: 572,385 (5)
abstracting: (p31<=0)
states: 572,452 (5)
abstracting: (p27<=0)
states: 602,629 (5)
abstracting: (p130<=0)
states: 603,796 (5)
abstracting: (1<=p181)
states: 1,184 (3)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.282sec

totally nodes used: 3506502 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 950687098 1436205694 2386892792
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 3740432 12771920 16512352
used/not used/entry size/cache size: 10244709 6532507 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: 170696 1074779 1245475
used/not used/entry size/cache size: 1011269 7377339 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 64016797
1 2738313
2 300396
3 46673
4 6091
5 550
6 44
7 0
8 0
9 0
>= 10 0

Total processing time: 42m49.760sec


BK_STOP 1679528361652

--------------------
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.011sec

17761 20917 25651 32438 37800 41860 41637 45679 45943 46034 46223 46424 52164 52244 52040 51931 52282 63689 69979 69973 70143 70217 75285 81673 91654 92347 100441 104735 109864 125685 134596 139298 159692 174403 187096 198986 201682 201703 203956 210670 224138 228727 233559 239828 261707 268250 266516 266119 266633 266618 266017 269452
iterations count:5216517 (1201), effective:8466 (1)

initing FirstDep: 0m 0.010sec


iterations count:16188 (3), effective:9 (0)

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="LeafsetExtension-PT-S64C2"
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 LeafsetExtension-PT-S64C2, 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 r234-tall-167856420400527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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