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

About the Execution of Marcie+red for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10133.548 484038.00 500846.00 1645.00 FFTFFFFTFFTTFTTF 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.r170-tall-167838856800134.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 EnergyBus-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M 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 EnergyBus-PT-none-ReachabilityCardinality-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678492903086

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:01:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:01:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:01:44] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2023-03-11 00:01:44] [INFO ] Transformed 157 places.
[2023-03-11 00:01:45] [INFO ] Transformed 4430 transitions.
[2023-03-11 00:01:45] [INFO ] Found NUPN structural information;
[2023-03-11 00:01:45] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 10) seen :5
FORMULA EnergyBus-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 00:01:45] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 00:01:45] [INFO ] Computed 23 place invariants in 25 ms
[2023-03-11 00:01:46] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 00:01:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-11 00:01:46] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:46] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 00:01:46] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-11 00:01:46] [INFO ] After 194ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-11 00:01:47] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 5 ms to minimize.
[2023-03-11 00:01:47] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2023-03-11 00:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 539 ms
[2023-03-11 00:01:47] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2023-03-11 00:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-11 00:01:47] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-11 00:01:47] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA EnergyBus-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 12 / 153 are part of one of the 5 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions removed 21 transitions
Ensure Unique test removed 1035 transitions
Reduce isomorphic transitions removed 1056 transitions.
Graph (complete) has 762 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 142 transition count 849
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 139 transition count 847
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 139 transition count 840
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 132 transition count 840
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 47 place count 111 transition count 579
Iterating global reduction 2 with 21 rules applied. Total rules applied 68 place count 111 transition count 579
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 98 place count 111 transition count 549
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 114 place count 103 transition count 541
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 141 place count 103 transition count 514
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 512
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 512
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 4 with 2 rules applied. Total rules applied 145 place count 101 transition count 511
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 101 transition count 509
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 161 place count 94 transition count 544
Drop transitions removed 3 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 169 place count 94 transition count 536
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 217 place count 94 transition count 488
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 219 place count 93 transition count 487
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 221 place count 92 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 91 transition count 486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 222 place count 91 transition count 483
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 228 place count 88 transition count 483
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 240 place count 82 transition count 477
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 271 place count 82 transition count 446
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 281 place count 82 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 291 place count 72 transition count 436
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 292 place count 72 transition count 435
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 293 place count 72 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 294 place count 71 transition count 457
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 302 place count 71 transition count 449
Applied a total of 302 rules in 388 ms. Remains 71 /153 variables (removed 82) and now considering 449/1913 (removed 1464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 71/153 places, 449/1913 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :1
FORMULA EnergyBus-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:01:48] [INFO ] Flow matrix only has 197 transitions (discarded 252 similar events)
// Phase 1: matrix 197 rows 71 cols
[2023-03-11 00:01:48] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-11 00:01:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:01:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 00:01:48] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:48] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:01:48] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-11 00:01:48] [INFO ] After 50ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 00:01:48] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2023-03-11 00:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-11 00:01:48] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 00:01:48] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 449/449 transitions.
Graph (trivial) has 13 edges and 71 vertex of which 3 / 71 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 445
Applied a total of 2 rules in 22 ms. Remains 68 /71 variables (removed 3) and now considering 445/449 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 68/71 places, 445/449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 489866 steps, run timeout after 3003 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 489866 steps, saw 87641 distinct states, run finished after 3012 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:01:52] [INFO ] Flow matrix only has 193 transitions (discarded 252 similar events)
// Phase 1: matrix 193 rows 68 cols
[2023-03-11 00:01:52] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-11 00:01:52] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:01:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 00:01:52] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 00:01:52] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:01:52] [INFO ] State equation strengthened by 146 read => feed constraints.
[2023-03-11 00:01:52] [INFO ] After 48ms SMT Verify possible using 146 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 00:01:52] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-11 00:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-11 00:01:52] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 00:01:52] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 445/445 transitions.
Applied a total of 0 rules in 21 ms. Remains 68 /68 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 68/68 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 445/445 transitions.
Applied a total of 0 rules in 21 ms. Remains 68 /68 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2023-03-11 00:01:52] [INFO ] Flow matrix only has 193 transitions (discarded 252 similar events)
[2023-03-11 00:01:52] [INFO ] Invariant cache hit.
[2023-03-11 00:01:53] [INFO ] Implicit Places using invariants in 438 ms returned [3, 4, 5, 6, 24, 28, 56]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 446 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/68 places, 445/445 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 60 transition count 443
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 59 transition count 443
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 54 transition count 438
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 2 with 91 rules applied. Total rules applied 105 place count 54 transition count 347
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 54 transition count 345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 52 transition count 345
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 118 place count 52 transition count 345
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 52 transition count 339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 51 transition count 338
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 51 transition count 338
Applied a total of 126 rules in 67 ms. Remains 51 /61 variables (removed 10) and now considering 338/445 (removed 107) transitions.
[2023-03-11 00:01:53] [INFO ] Flow matrix only has 116 transitions (discarded 222 similar events)
// Phase 1: matrix 116 rows 51 cols
[2023-03-11 00:01:53] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 00:01:53] [INFO ] Implicit Places using invariants in 152 ms returned [36, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/68 places, 338/445 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 46 transition count 335
Applied a total of 6 rules in 15 ms. Remains 46 /49 variables (removed 3) and now considering 335/338 (removed 3) transitions.
[2023-03-11 00:01:53] [INFO ] Flow matrix only has 113 transitions (discarded 222 similar events)
// Phase 1: matrix 113 rows 46 cols
[2023-03-11 00:01:53] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-11 00:01:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 00:01:53] [INFO ] Flow matrix only has 113 transitions (discarded 222 similar events)
[2023-03-11 00:01:53] [INFO ] Invariant cache hit.
[2023-03-11 00:01:53] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-11 00:01:53] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [7, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 128 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 44/68 places, 335/445 transitions.
Applied a total of 0 rules in 14 ms. Remains 44 /44 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 848 ms. Remains : 44/68 places, 335/445 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Finished probabilistic random walk after 947531 steps, run visited all 3 properties in 1530 ms. (steps per millisecond=619 )
Probabilistic random walk after 947531 steps, saw 138293 distinct states, run finished after 1531 ms. (steps per millisecond=618 ) properties seen :3
FORMULA EnergyBus-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10600 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EnergyBus_PT_none
(NrP: 157 NrTr: 4430 NrArc: 63389)

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

net check time: 0m 0.008sec

init dd package: 0m 2.737sec


RS generation: 1m47.736sec


-> reachability set: #nodes 271660 (2.7e+05) #states 2,131,836,945,601 (12)



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

checking: EF [~ [p17<=1]]
normalized: E [true U ~ [p17<=1]]

abstracting: (p17<=1)
states: 2,131,836,945,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [p20<=1]
normalized: ~ [E [true U ~ [p20<=1]]]

abstracting: (p20<=1)
states: 2,131,836,945,601 (12)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: AG [~ [1<=p148]]
normalized: ~ [E [true U 1<=p148]]

abstracting: (1<=p148)
states: 91,381,210,560 (10)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.128sec

checking: EF [~ [p69<=1]]
normalized: E [true U ~ [p69<=1]]

abstracting: (p69<=1)
states: 2,131,836,945,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

checking: EF [~ [p81<=0]]
normalized: E [true U ~ [p81<=0]]

abstracting: (p81<=0)
states: 1,992,224,913,601 (12)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.714sec

checking: AG [p87<=0]
normalized: ~ [E [true U ~ [p87<=0]]]

abstracting: (p87<=0)
states: 2,065,973,995,201 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.392sec

checking: AG [p90<=p70]
normalized: ~ [E [true U ~ [p90<=p70]]]

abstracting: (p90<=p70)
states: 2,072,041,771,201 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.039sec

checking: AG [p62<=p99]
normalized: ~ [E [true U ~ [p62<=p99]]]

abstracting: (p62<=p99)
states: 2,041,810,745,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.048sec

checking: AG [[~ [1<=p42] | p144<=p23]]
normalized: ~ [E [true U ~ [[~ [1<=p42] | p144<=p23]]]]

abstracting: (p144<=p23)
states: 2,111,396,191,681 (12)
abstracting: (1<=p42)
states: 176,178,160,000 (11)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.285sec

checking: EF [[~ [p76<=p20] & p24<=p74]]
normalized: E [true U [p24<=p74 & ~ [p76<=p20]]]

abstracting: (p76<=p20)
states: 1,973,979,681,601 (12)
abstracting: (p24<=p74)
states: 788,515,908,801 (11)

before gc: list nodes free: 1311415

after gc: idd nodes used:909558, unused:63090442; list nodes free:287446583
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m31.754sec

checking: EF [[~ [p48<=1] & [p126<=1 & p74<=p78]]]
normalized: E [true U [[p126<=1 & p74<=p78] & ~ [p48<=1]]]

abstracting: (p48<=1)
states: 2,131,836,945,601 (12)
abstracting: (p74<=p78)
states: 1,921,955,555,201 (12)
abstracting: (p126<=1)
states: 2,131,836,945,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.531sec

checking: EF [[~ [[~ [1<=p46] & p25<=p58]] | [1<=p33 & [p104<=0 & p99<=1]]]]
normalized: E [true U [[1<=p33 & [p104<=0 & p99<=1]] | ~ [[p25<=p58 & ~ [1<=p46]]]]]

abstracting: (1<=p46)
states: 176,178,160,000 (11)
abstracting: (p25<=p58)
states: 1,554,028,385,601 (12)
abstracting: (p99<=1)
states: 2,131,836,945,601 (12)
abstracting: (p104<=0)
states: 2,019,571,446,721 (12)
abstracting: (1<=p33)
states: 426,059,623,680 (11)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.012sec

checking: AG [~ [[[[~ [p128<=0] & [~ [[~ [p38<=0] & [1<=p114 | p89<=p59]]] & [~ [1<=p72] & ~ [[p17<=1 | p89<=0]]]]] & p83<=p6] & ~ [[[1<=p49 & p93<=p121] & [[~ [p98<=p49] | p95<=0] & ~ [1<=p118]]]]]]]
normalized: ~ [E [true U [~ [[[~ [1<=p118] & [p95<=0 | ~ [p98<=p49]]] & [1<=p49 & p93<=p121]]] & [p83<=p6 & [[[~ [[p17<=1 | p89<=0]] & ~ [1<=p72]] & ~ [[[1<=p114 | p89<=p59] & ~ [p38<=0]]]] & ~ [p128<=0]]]]]]

abstracting: (p128<=0)
states: 2,040,455,735,041 (12)
abstracting: (p38<=0)
states: 2,128,125,574,401 (12)
abstracting: (p89<=p59)
states: 2,067,077,227,201 (12)
abstracting: (1<=p114)
states: 857,226,138,000 (11)
abstracting: (1<=p72)
states: 196,613,096,000 (11)
abstracting: (p89<=0)
states: 2,065,973,995,201 (12)
abstracting: (p17<=1)
states: 2,131,836,945,601 (12)
abstracting: (p83<=p6)
states: 2,054,802,596,881 (12)
abstracting: (p93<=p121)
states: 2,058,397,348,801 (12)
abstracting: (1<=p49)
states: 196,613,096,000 (11)
abstracting: (p98<=p49)
states: 2,094,437,380,801 (12)
abstracting: (p95<=0)
states: 1,992,224,913,601 (12)
abstracting: (1<=p118)
states: 514,030,483,200 (11)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.296sec

checking: AG [[[~ [1<=p43] & [[[p63<=p143 & 1<=p96] | [[p14<=p86 | p130<=0] | [[p91<=0 | [~ [1<=p99] | p118<=p57]] | [[1<=p73 | ~ [p16<=1]] & ~ [[p125<=1 & p36<=p1]]]]]] | [[p72<=p150 & 1<=p7] | [[[[~ [p5<=0] & ~ [p21<=1]] | p127<=1] | ~ [p139<=0]] | p120<=0]]]] & p134<=p12]]
normalized: ~ [E [true U ~ [[p134<=p12 & [[[[p120<=0 | [~ [p139<=0] | [p127<=1 | [~ [p21<=1] & ~ [p5<=0]]]]] | [p72<=p150 & 1<=p7]] | [[[[~ [[p125<=1 & p36<=p1]] & [1<=p73 | ~ [p16<=1]]] | [p91<=0 | [p118<=p57 | ~ [1<=p99]]]] | [p14<=p86 | p130<=0]] | [p63<=p143 & 1<=p96]]] & ~ [1<=p43]]]]]]

abstracting: (1<=p43)
states: 92,784,280,000 (10)
abstracting: (1<=p96)
states: 139,612,032,000 (11)
abstracting: (p63<=p143)
states: 2,043,014,897,601 (12)
abstracting: (p130<=0)
states: 2,031,541,161,601 (12)
abstracting: (p14<=p86)
states: 99,963,590,401 (10)
abstracting: (1<=p99)
states: 65,862,950,400 (10)
abstracting: (p118<=p57)
states: 1,668,612,491,201 (12)
abstracting: (p91<=0)
states: 2,065,973,995,201 (12)
abstracting: (p16<=1)
states: 2,131,836,945,601 (12)
abstracting: (1<=p73)
states: 210,707,348,800 (11)
abstracting: (p36<=p1)
states: 2,125,255,969,921 (12)
abstracting: (p125<=1)
states: 2,131,836,945,601 (12)
abstracting: (1<=p7)
states: 184,980,185,760 (11)
abstracting: (p72<=p150)
states: 1,944,747,433,601 (12)
abstracting: (p5<=0)
states: 1,677,220,336,321 (12)
abstracting: (p21<=1)
states: 2,131,836,945,601 (12)
abstracting: (p127<=1)
states: 2,131,836,945,601 (12)
abstracting: (p139<=0)
states: 2,031,541,161,601 (12)
abstracting: (p120<=0)
states: 566,582,935,681 (11)
abstracting: (p134<=p12)
states: 2,131,836,945,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.412sec

checking: EF [~ [[[[~ [[~ [[~ [p107<=p27] & ~ [1<=p38]]] | [[[p87<=p78 & p113<=0] | [p103<=p39 | p117<=p38]] | ~ [1<=p4]]]] | [~ [[[~ [p13<=1] | [p121<=p8 & p55<=0]] | 1<=p82]] & [1<=p131 | ~ [p12<=p11]]]] | [[[~ [p107<=p116] & p102<=p84] | p15<=p15] & ~ [[[[~ [p54<=1] & 1<=p33] | ~ [[1<=p67 & 1<=p47]]] & ~ [p151<=0]]]]] | ~ [[~ [[[p124<=1 | [p61<=0 | p60<=1]] | [1<=p92 & [1<=p23 | 1<=p62]]]] & ~ [[~ [p86<=1] | [[p74<=1 | p52<=p68] & [p95<=p38 | p12<=1]]]]]]]]]
normalized: E [true U ~ [[~ [[~ [[[[p95<=p38 | p12<=1] & [p74<=1 | p52<=p68]] | ~ [p86<=1]]] & ~ [[[1<=p92 & [1<=p23 | 1<=p62]] | [p124<=1 | [p61<=0 | p60<=1]]]]]] | [[~ [[~ [p151<=0] & [~ [[1<=p67 & 1<=p47]] | [1<=p33 & ~ [p54<=1]]]]] & [p15<=p15 | [p102<=p84 & ~ [p107<=p116]]]] | [[[1<=p131 | ~ [p12<=p11]] & ~ [[1<=p82 | [[p121<=p8 & p55<=0] | ~ [p13<=1]]]]] | ~ [[[~ [1<=p4] | [[p103<=p39 | p117<=p38] | [p87<=p78 & p113<=0]]] | ~ [[~ [1<=p38] & ~ [p107<=p27]]]]]]]]]]

abstracting: (p107<=p27)
states: 2,046,838,100,161 (12)
abstracting: (1<=p38)
states: 3,711,371,200 (9)
abstracting: (p113<=0)
states: 1,274,610,807,601 (12)
abstracting: (p87<=p78)
states: 2,065,973,995,201 (12)
abstracting: (p117<=p38)
states: 1,618,701,361,601 (12)
abstracting: (p103<=p39)
states: 1,990,829,932,801 (12)
abstracting: (1<=p4)
states: 326,226,286,560 (11)
abstracting: (p13<=1)
states: 2,131,836,945,601 (12)
abstracting: (p55<=0)
states: 1,921,129,596,801 (12)
abstracting: (p121<=p8)
states: 1,706,899,743,841 (12)
abstracting: (1<=p82)
states: 139,612,032,000 (11)
abstracting: (p12<=p11)
states: 1,517,568,949,201 (12)
abstracting: (1<=p131)
states: 100,295,784,000 (11)
abstracting: (p107<=p116)
states: 2,045,416,670,401 (12)
abstracting: (p102<=p84)
states: 2,123,532,715,201 (12)
abstracting: (p15<=p15)
states: 2,131,836,945,601 (12)
abstracting: (p54<=1)
states: 2,131,836,945,601 (12)
abstracting: (1<=p33)
states: 426,059,623,680 (11)
abstracting: (1<=p47)
states: 176,178,160,000 (11)
abstracting: (1<=p67)
states: 176,178,160,000 (11)
abstracting: (p151<=0)
states: 2,028,611,524,801 (12)
abstracting: (p60<=1)
states: 2,131,836,945,601 (12)
abstracting: (p61<=0)
states: 1,955,658,785,601 (12)
abstracting: (p124<=1)
states: 2,131,836,945,601 (12)
abstracting: (1<=p62)
states: 92,784,280,000 (10)
abstracting: (1<=p23)
states: 531,206,205,600 (11)
abstracting: (1<=p92)
states: 99,963,590,400 (10)
abstracting: (p86<=1)
states: 2,131,836,945,601 (12)
abstracting: (p52<=p68)
states: 1,935,223,849,601 (12)
abstracting: (p74<=1)
states: 2,131,836,945,601 (12)
abstracting: (p12<=1)
states: 2,131,836,945,601 (12)
abstracting: (p95<=p38)
states: 1,992,458,769,601 (12)
-> the formula is FALSE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.531sec

checking: AG [[[p69<=0 | [~ [[~ [1<=p69] & [[p52<=p42 | p71<=0] & [~ [[1<=p99 | p61<=p90]] & p146<=p98]]]] | [[[[[[p14<=p144 | p44<=p39] | [p84<=0 | p142<=p60]] | p5<=0] & [~ [[1<=p154 | p51<=0]] | [[p80<=p38 | 1<=p123] | [p86<=p78 & 1<=p56]]]] & [[~ [[p6<=p135 | 1<=p126]] | [[p47<=0 & p142<=p7] | ~ [p33<=1]]] | p142<=0]] | 1<=p26]]] & [[[1<=p110 | [p115<=1 | [~ [[p58<=p7 & p112<=p40]] | [[[p126<=p58 | p25<=p59] & p40<=1] & ~ [p127<=0]]]]] & [[p1<=0 | [~ [p102<=p136] & [p90<=p150 & [[p52<=p152 & 1<=p117] & 1<=p68]]]] | ~ [1<=p75]]] | p52<=p126]]]
normalized: ~ [E [true U ~ [[[p52<=p126 | [[~ [1<=p75] | [p1<=0 | [[p90<=p150 & [1<=p68 & [p52<=p152 & 1<=p117]]] & ~ [p102<=p136]]]] & [1<=p110 | [p115<=1 | [[~ [p127<=0] & [p40<=1 & [p126<=p58 | p25<=p59]]] | ~ [[p58<=p7 & p112<=p40]]]]]]] & [p69<=0 | [[1<=p26 | [[p142<=0 | [[~ [p33<=1] | [p47<=0 & p142<=p7]] | ~ [[p6<=p135 | 1<=p126]]]] & [[[[p86<=p78 & 1<=p56] | [p80<=p38 | 1<=p123]] | ~ [[1<=p154 | p51<=0]]] & [p5<=0 | [[p84<=0 | p142<=p60] | [p14<=p144 | p44<=p39]]]]]] | ~ [[[[p146<=p98 & ~ [[1<=p99 | p61<=p90]]] & [p52<=p42 | p71<=0]] & ~ [1<=p69]]]]]]]]]

abstracting: (1<=p69)
states: 196,613,096,000 (11)
abstracting: (p71<=0)
states: 1,935,223,849,601 (12)
abstracting: (p52<=p42)
states: 1,970,459,481,601 (12)
abstracting: (p61<=p90)
states: 1,961,174,945,601 (12)
abstracting: (1<=p99)
states: 65,862,950,400 (10)
abstracting: (p146<=p98)
states: 2,038,430,550,721 (12)
abstracting: (p44<=p39)
states: 2,039,052,665,601 (12)
abstracting: (p14<=p144)
states: 27,222,243,841 (10)
abstracting: (p142<=p60)
states: 2,033,200,761,601 (12)
abstracting: (p84<=0)
states: 2,033,927,990,401 (12)
abstracting: (p5<=0)
states: 1,677,220,336,321 (12)
abstracting: (p51<=0)
states: 1,935,223,849,601 (12)
abstracting: (1<=p154)
states: 127,987,732,800 (11)
abstracting: (1<=p123)
states: 437,604,316,800 (11)
abstracting: (p80<=p38)
states: 1,992,458,769,601 (12)
abstracting: (1<=p56)
states: 210,707,348,800 (11)
abstracting: (p86<=p78)
states: 2,031,873,355,201 (12)
abstracting: (1<=p126)
states: 713,380,392,000 (11)
abstracting: (p6<=p135)
states: 1,677,220,336,321 (12)
abstracting: (p142<=p7)
states: 2,040,139,171,201 (12)
abstracting: (p47<=0)
states: 1,955,658,785,601 (12)
abstracting: (p33<=1)
states: 2,131,836,945,601 (12)
abstracting: (p142<=0)
states: 2,031,541,161,601 (12)
abstracting: (1<=p26)
states: 1,069,424,534,400 (12)
abstracting: (p69<=0)
states: 1,935,223,849,601 (12)
abstracting: (p112<=p40)
states: 1,926,640,294,801 (12)
abstracting: (p58<=p7)
states: 1,939,412,794,081 (12)
abstracting: (p25<=p59)
states: 1,501,251,145,601 (12)
abstracting: (p126<=p58)
states: 1,488,967,656,001 (12)
abstracting: (p40<=1)
states: 2,131,836,945,601 (12)
abstracting: (p127<=0)
states: 1,418,456,553,601 (12)
abstracting: (p115<=1)
states: 2,131,836,945,601 (12)
abstracting: (1<=p110)
states: 141,474,657,600 (11)
abstracting: (p102<=p136)
states: 2,123,532,715,201 (12)
abstracting: (1<=p117)
states: 514,030,483,200 (11)
abstracting: (p52<=p152)
states: 1,944,747,433,601 (12)
abstracting: (1<=p68)
states: 196,613,096,000 (11)
abstracting: (p90<=p150)
states: 2,069,183,467,201 (12)
abstracting: (p1<=0)
states: 2,003,446,622,881 (12)
abstracting: (1<=p75)
states: 210,707,348,800 (11)
abstracting: (p52<=p126)
states: 2,001,021,985,601 (12)
-> the formula is TRUE

FORMULA EnergyBus-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.333sec

totally nodes used: 101191331 (1.0e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 347921183 946740158 1294661341
used/not used/entry size/cache size: 65174368 1934496 16 1024MB
basic ops cache: hits/miss/sum: 57143049 139044799 196187848
used/not used/entry size/cache size: 16723099 54117 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: 1845650 5776534 7622184
used/not used/entry size/cache size: 3835868 4552740 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 39458567
1 19522924
2 6230991
3 1535551
4 303524
5 49600
6 6820
7 789
8 91
9 7
>= 10 0

Total processing time: 7m50.906sec


BK_STOP 1678493387124

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p135
p133
p134
p136

The net has transition(s) that can never fire:
t2348
t2622
t2623
t2488
t2489
t2490
t2491
t2492
t2493
t2494
t2495
t2496
t2497
t2498
t2499
t2500
t2501
t2502
t2503
t2504
t2505
t2506
t2507
t2508
t2509
t2510
t2511
t2512
t2513
t2514
t2515
t2516
t2517
t2518
t2519
t2520
t2521
t2358
t2362
t2374
t2378
t2390
t2398
t2402
t2338
t2339
t2340
t2341
t2342
t2343
t2344
t2345
t2349
t2350
t2351
t2352
t2353
t2354
t2355
t2356
t2357
t2359
t2360
t2361
t2363
t2364
t2365
t2366
t2367
t2368
t2369
t2370
t2371
t2372
t2373
t2375
t2376
t2377
t2379
t2380
t2381
t2382
t2383
t2384
t2385
t2386
t2387
t2388
t2389
t2391
t2392
t2393
t2394
t2395
t2396
t2397
t2399
t2400
t2401
t2403
t2404
t2405
t2406
t2407
t2408
t2409
t2410
t2411
t2412
t2413
t2414
t2415
t2416
t2417
t2418
t2419
t2420
t2421
t2422
t2423
t2424
t2425
t2426
t2427
t2428
t2429
t2430
t2431
t2432
t2433
t2434
t2435
t2436
t2437
t2438
t2439
t2440
t2441
t2442
t2443
t2444
t2445
t2446
t2447
t2448
t2449
t2450
t2451
t2452
t2453
t2454
t2455
t2456
t2457
t2458
t2459
t2460
t2461
t2462
t2463
t2464
t2465
t2466
t2467
t2468
t2469
t2470
t2471
t2472
t2473
t2474
t2475
t2476
t2477
t2478
t2479
t2480
t2481
t2482
t2483
t2484
t2485
t2486
t2487
t2522
t2523
t2524
t2525
t2526
t2527
t2528
t2529
t2530
t2531
t2532
t2533
t2534
t2535
t2536
t2537
t2538
t2539
t2540
t2541
t2542
t2543
t2544
t2545
t2546
t2547
t2548
t2549
t2550
t2551
t2552
t2553
t2554
t2555
t2556
t2557
t2558
t2559
t2560
t2561
t2562
t2563
t2564
t2565
t2566
t2567
t2568
t2569
t2570
t2571
t2572
t2573
t2574
t2575
t2576
t2577
t2578
t2579
t2580
t2581
t2582
t2583
t2584
t2585
t2586
t2587
t2588
t2589
t2590
t2591
t2592
t2593
t2594
t2851
t2595
t2852
t2596
t2597
t2598
t2599
t2600
t2601
t2602
t2603
t2604
t2605
t2606
t2607
t2608
t2609
t2610
t2611
t2612
t2613
t2614
t2615
t2616
t2617
t2618
t2619
t2620
t2621
t2624
t2625
t2626
t2627
t2628
t2629
t2630
t2631
t2632
t2633
t2634
t2635
t2636
t2637
t2638
t2639
t2640
t2641
t2642
t2643
t2644
t2645
t2646
t2647
t2648
t2649
t2650
t2651
t2652
t2653
t2654
t2655
t2656
t2657
t2658
t2659
t2660
t2661
t2662
t2663
t2664
t2665
t2666
t2667
t2668
t2669
t2670
t2671
t2672
t2673
t2674
t2675
t2676
t2677
t2678
t2679
t2680
t2681
t2682
t2683
t2684
t2685
t2686
t2687
t2688
t2689
t2690
t2691
t2692
t2693
t2694
t2695
t2696
t2697
t2698
t2699
t2700
t2701
t2702
t2703
t2704
t2705
t2706
t2707
t2708
t2709
t2710
t2711
t2712
t2713
t2714
t2715
t2716
t2717
t2718
t2719
t2720
t2721
t2722
t2723
t2724
t2725
t2726
t2727
t2728
t2729
t2730
t2731
t2732
t2733
t2734
t2735
t2736
t2737
t2738
t2739
t2740
t2741
t2742
t2743
t2744
t2745
t2746
t2747
t2748
t2749
t2750
t2751
t2752
t2753
t2754
t2755
t2756
t2757
t2758
t2759
t2760
t2761
t2762
t2763
t2764
t2765
t2766
t2767
t2768
t2769
t2770
t2771
t2772
t2773
t2774
t2775
t2776
t2777
t2778
t2779
t2780
t2781
t2782
t2783
t2784
t2785
t2786
t2787
t2788
t2789
t2790
t2791
t2792
t2793
t2794
t2795
t2796
t2797
t2798
t2799
t2800
t2801
t2802
t2803
t2804
t2805
t2806
t2807
t2808
t2809
t2810
t2811
t2812
t2813
t2814
t2815
t2816
t2817
t2818
t2819
t2820
t2821
t2822
t2823
t2824
t2825
t2826
t2827
t2828
t2829
t2830
t2831
t2832
t2833
t2834
t2835
t2836
t2837
t2838
t2839
t2840
t2841
t2842
t2843
t2844
t2845
t2846
t2847
t2848
t2849
t2850
t2853
t2854
t2855
t2856
t2857
t2858
t2859
t2860
t2861
t2862
t2863
t2864
t2865
t2866
t2867
t2868
t2869
t2870
t2871
t2872
t2873
t2874
t2875
t2876
t2877
t2878
t2879
t2880
t2881
t2882
t2883
t2884
t2885
t2886
t2887
t2888
t2889
t2890
t2891
t2892
t2893
t2894
t2895
t2896
t2897
t2898
t2899
t2900
t2901
t2902
t2903
t2904
t2905
t2906
t2907
t2908
t2909
t2910
t2911
t2912
t2913
t2914
t2915
t2916
t2917
t2918
t2919
t2920
t2921
t2922
t2923
t2924
t2925
t2926
t2927
t2928
t2929
t2930
t2931
t2932
t2933
t2934
t2935
t2936
t2937
t2938
t2939
t2940
t2941
t2942
t2943
t2944
t2945
t2946
t2947
t2948
t2949
t2950
t2951
t2952
t2953
t2954
t2955
t2956
t2957
t2958
t2959
t2960
t2961
t2962
t2963
t2964
t2965
t2966
t2967
t2968
t2969
t2970
t2971
t2972
t2973
t2974
t2975
t2976
t2977
t2978
t2979
t2980
t2981
t2982
t2983
t2984
t2985
t2986
t2987
t2988
t2989
t2990
t2991
t2992
t2993
t2994
t2995
t2996
t2997
t2998
t2999
t3000
t3001
t3002
t3003
t3004
t3005
t3006
t3007
t3008
t3009
t3010
t3011
t3012
t3013
t3014
t3015
t3016
t3017
t3018
t3019
t3020
t3021
t3022
t3023
t3024
t3025
t3026
t3027
t4384
t3028
t3029
t3030
t3031
t3032
t3033
t3034
t3035
t3036
t3037
t3038
t3039
t3040
t3041
t3042
t3043
t3044
t3045
t3046
t3047
t3048
t3049
t3050
t3051
t3052
t3053
t3054
t3055
t3056
t3057
t3058
t3059
t3060
t3061
t3062
t3063
t3064
t3065
t3066
t3067
t3068
t3069
t3070
t3071
t3072
t3073
t3074
t3075
t3076
t3077
t3078
t3079
t3080
t3081
t3082
t3083
t3084
t3085
t3086
t3087
t3088
t3089
t3090
t3091
t3092
t3093
t3094
t3095
t3096
t3097
t3098
t3099
t3100
t3101
t3102
t3103
t3104
t3105
t3106
t3107
t3108
t3109
t3110
t3111
t3112
t3113
t3114
t3115
t3116
t3117
t3118
t3119
t3120
t3121
t3122
t3123
t3124
t3125
t3126
t3127
t3128
t3129
t3130
t3131
t3132
t3133
t3134
t3135
t3136
t3137
t3138
t3139
t3140
t3141
t3142
t3143
t3144
t3145
t3146
t3147
t3148
t3149
t3150
t3151
t3152
t3153
t4381
t4382
t4383
t2346
t2347
t20
t21
t22
t23
t24

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

159440 251309 269964 278360 302310 383729 379888 372141 389372 401994 421781 427750 431068 430926 433606 432925 397695 399410 385351 374900 363555 359604 343902
iterations count:2343359 (528), effective:24587 (5)

initing FirstDep: 0m 0.014sec

115503 201698 184201 194442 276632 258185 260396 260047 253088 249798 249277
iterations count:1100408 (248), effective:11552 (2)
149768 184773 185524 215618 209459 260064 268097 266603 259950 257848
iterations count:1042491 (235), effective:12103 (2)
139890 151360 156396 193465 207236 255816 261159 260020 253490 251231
iterations count:1074074 (242), effective:11961 (2)
134616 157045 155969 196123 206947 253689 259438 259505 253270 250846
iterations count:1077499 (243), effective:12034 (2)
188928 194757 187660
iterations count:323434 (73), effective:6918 (1)
146430 209254 209042 269650 270952 270794 260211 259542
iterations count:808652 (182), effective:7596 (1)
162743 168135 366728 352276 300161
iterations count:525122 (118), effective:9765 (2)

iterations count:6742 (1), effective:48 (0)

iterations count:9437 (2), effective:41 (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="EnergyBus-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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 EnergyBus-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856800134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;