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

About the Execution of Marcie+red for RefineWMG-PT-015016

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8120.191 58746.00 64619.00 608.50 TTFTFTTTTFFFTTFT 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.r330-tall-167889203500601.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 RefineWMG-PT-015016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203500601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Feb 26 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 16:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 35K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679170407483

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-015016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:13:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:13:29] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-18 20:13:29] [INFO ] Transformed 79 places.
[2023-03-18 20:13:29] [INFO ] Transformed 63 transitions.
[2023-03-18 20:13:29] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 58 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 11 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:29] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-18 20:13:29] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-18 20:13:29] [INFO ] Invariant cache hit.
[2023-03-18 20:13:29] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 58 out of 79 places after structural reductions.
[2023-03-18 20:13:29] [INFO ] Flatten gal took : 23 ms
[2023-03-18 20:13:29] [INFO ] Flatten gal took : 9 ms
[2023-03-18 20:13:30] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 65) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-18 20:13:30] [INFO ] Invariant cache hit.
[2023-03-18 20:13:30] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-18 20:13:30] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-18 20:13:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-18 20:13:31] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :28
[2023-03-18 20:13:31] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :28
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-18 20:13:31] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :28
Fused 34 Parikh solutions to 28 different solutions.
Finished Parikh walk after 412 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=206 )
Parikh walk visited 28 properties in 315 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA RefineWMG-PT-015016-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Support contains 54 out of 79 places (down from 56) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 44 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 57 place count 21 transition count 20
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 69 place count 21 transition count 8
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 81 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 7 transition count 6
Applied a total of 85 rules in 14 ms. Remains 7 /79 variables (removed 72) and now considering 6/63 (removed 57) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:13:31] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 7/79 places, 6/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:31] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-18 20:13:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:31] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:31] [INFO ] Invariant cache hit.
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:32] [INFO ] Invariant cache hit.
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:32] [INFO ] Invariant cache hit.
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 35 edges and 79 vertex of which 22 / 79 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 57 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 50 place count 31 transition count 29
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 31 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 27 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 58 place count 27 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 66 place count 23 transition count 21
Applied a total of 66 rules in 6 ms. Remains 23 /79 variables (removed 56) and now considering 21/63 (removed 42) transitions.
// Phase 1: matrix 21 rows 23 cols
[2023-03-18 20:13:32] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 23/79 places, 21/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:32] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 51 place count 25 transition count 22
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 60 place count 25 transition count 13
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 13 transition count 10
Applied a total of 75 rules in 5 ms. Remains 13 /79 variables (removed 66) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-18 20:13:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 13/79 places, 10/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:32] [INFO ] Computed 32 place invariants in 0 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:32] [INFO ] Invariant cache hit.
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 24 / 79 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 40
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 57 place count 25 transition count 25
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 25 transition count 16
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 75 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 75 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 13 transition count 13
Applied a total of 81 rules in 7 ms. Remains 13 /79 variables (removed 66) and now considering 13/63 (removed 50) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-03-18 20:13:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 13/79 places, 13/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:32] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 40 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 50 place count 27 transition count 24
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 6 rules applied. Total rules applied 56 place count 27 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 21 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 18 transition count 15
Applied a total of 68 rules in 5 ms. Remains 18 /79 variables (removed 61) and now considering 15/63 (removed 48) transitions.
// Phase 1: matrix 15 rows 18 cols
[2023-03-18 20:13:32] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 18/79 places, 15/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2023-03-18 20:13:32] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-18 20:13:32] [INFO ] Invariant cache hit.
[2023-03-18 20:13:32] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 79/79 places, 63/63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:13:32] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 20:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 63 transitions and 188 arcs took 1 ms.
Total runtime 3517 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 79 NrTr: 63 NrArc: 188)

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

net check time: 0m 0.000sec

init dd package: 0m 2.741sec


RS generation: 0m 0.594sec


-> reachability set: #nodes 4204 (4.2e+03) #states 12,052,112,861,661,422,877,288,655,381,293,683,978,185,758 (43)



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

checking: EG [EF [1<=p10]]
normalized: EG [E [true U 1<=p10]]

abstracting: (1<=p10)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)

EG iterations: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.212sec

checking: AX [EG [AG [11<=p21]]]
normalized: ~ [EX [~ [EG [~ [E [true U ~ [11<=p21]]]]]]]

abstracting: (11<=p21)
states: 4,253,686,892,351,090,427,278,348,958,103,653,168,771,444 (42)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RefineWMG-PT-015016-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.260sec

checking: EF [EG [[AG [~ [6<=p56]] | p21<=p25]]]
normalized: E [true U EG [[p21<=p25 | ~ [E [true U 6<=p56]]]]]

abstracting: (6<=p56)
states: 7,798,425,969,310,332,450,010,306,423,190,030,809,414,314 (42)
abstracting: (p21<=p25)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.154sec

checking: AG [AF [EG [[~ [p27<=10] | [~ [10<=p23] & ~ [4<=p57]]]]]]
normalized: ~ [E [true U EG [~ [EG [[[~ [4<=p57] & ~ [10<=p23]] | ~ [p27<=10]]]]]]]

abstracting: (p27<=10)
states: 7,798,425,969,310,332,450,010,306,423,190,030,809,414,314 (42)
abstracting: (10<=p23)
states: 4,962,634,707,742,938,831,824,740,451,120,928,696,900,018 (42)
abstracting: (4<=p57)
states: 9,216,321,600,094,029,259,103,089,409,224,581,865,671,462 (42)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-015016-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.262sec

checking: EF [[AG [p23<=14] | AX [~ [A [[11<=p25 | p70<=1] U ~ [4<=p44]]]]]]
normalized: E [true U [~ [EX [[~ [EG [4<=p44]] & ~ [E [4<=p44 U [4<=p44 & ~ [[11<=p25 | p70<=1]]]]]]]] | ~ [E [true U ~ [p23<=14]]]]]

abstracting: (p23<=14)
states: 10,634,217,230,877,726,068,195,872,395,259,132,921,928,610 (43)
abstracting: (p70<=1)
states: 1,417,895,630,783,696,809,092,782,986,034,551,056,257,148 (42)
abstracting: (11<=p25)
states: 4,253,686,892,351,090,427,278,348,958,103,653,168,771,444 (42)
abstracting: (4<=p44)
states: 47,636,809,729,887,046,945,804,961,981,397,960,388,086 (40)
abstracting: (4<=p44)
states: 47,636,809,729,887,046,945,804,961,981,397,960,388,086 (40)
abstracting: (4<=p44)
states: 47,636,809,729,887,046,945,804,961,981,397,960,388,086 (40)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.639sec

checking: AX [EF [[AX [5<=p65] & [p40<=p13 | AX [p27<=p46]]]]]
normalized: ~ [EX [~ [E [true U [[p40<=p13 | ~ [EX [~ [p27<=p46]]]] & ~ [EX [~ [5<=p65]]]]]]]]

abstracting: (5<=p65)
states: 8,507,373,784,702,180,854,556,697,916,207,306,337,542,888 (42)
.abstracting: (p27<=p46)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.abstracting: (p40<=p13)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.233sec

checking: AG [EF [[p9<=p36 | [p18<=p66 | AF [10<=p20]]]]]
normalized: ~ [E [true U ~ [E [true U [p9<=p36 | [p18<=p66 | ~ [EG [~ [10<=p20]]]]]]]]]

abstracting: (10<=p20)
states: 4,962,634,707,742,938,831,824,740,451,120,928,696,900,018 (42)
.
EG iterations: 1
abstracting: (p18<=p66)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p9<=p36)
states: 11,760,193,172,970,661,769,534,258,884,168,923,466,603,404 (43)
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.150sec

checking: EF [[AX [[EF [~ [p46<=9]] & AX [~ [p68<=p70]]]] | [AG [6<=p56] | ~ [A [E [p32<=9 U 7<=p37] U p24<=6]]]]]
normalized: E [true U [[~ [[~ [EG [~ [p24<=6]]] & ~ [E [~ [p24<=6] U [~ [E [p32<=9 U 7<=p37]] & ~ [p24<=6]]]]]] | ~ [E [true U ~ [6<=p56]]]] | ~ [EX [~ [[~ [EX [p68<=p70]] & E [true U ~ [p46<=9]]]]]]]]

abstracting: (p46<=9)
states: 7,089,478,153,918,484,045,463,914,930,172,755,281,285,740 (42)
abstracting: (p68<=p70)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
..abstracting: (6<=p56)
states: 7,798,425,969,310,332,450,010,306,423,190,030,809,414,314 (42)
abstracting: (p24<=6)
states: 12,052,063,700,867,067,988,695,316,057,287,511,224,872,664 (43)
abstracting: (7<=p37)
states: 7,089,478,153,918,484,045,463,914,930,172,755,281,285,740 (42)
abstracting: (p32<=9)
states: 7,089,478,153,918,484,045,463,914,930,172,755,281,285,740 (42)
abstracting: (p24<=6)
states: 12,052,063,700,867,067,988,695,316,057,287,511,224,872,664 (43)
abstracting: (p24<=6)
states: 12,052,063,700,867,067,988,695,316,057,287,511,224,872,664 (43)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.327sec

checking: AG [EF [[[EG [~ [p43<=11]] & p14<=1] & [p7<=14 & [~ [p66<=p72] & ~ [p18<=p26]]]]]]
normalized: ~ [E [true U ~ [E [true U [[p7<=14 & [~ [p18<=p26] & ~ [p66<=p72]]] & [p14<=1 & EG [~ [p43<=11]]]]]]]]

abstracting: (p43<=11)
states: 8,507,373,784,702,180,854,556,697,916,207,306,337,542,888 (42)
.
EG iterations: 1
abstracting: (p14<=1)
states: 11,051,739,857,333,794,891,426,751,179,684,326,810,035,952 (43)
abstracting: (p66<=p72)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p18<=p26)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p7<=14)
states: 10,634,217,230,877,726,068,195,872,395,259,132,921,928,610 (43)
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.145sec

checking: AX [AG [[p29<=p55 & [AX [~ [p61<=0]] | A [~ [6<=p75] U [p12<=p56 & 3<=p75]]]]]]
normalized: ~ [EX [E [true U ~ [[p29<=p55 & [[~ [EG [~ [[p12<=p56 & 3<=p75]]]] & ~ [E [~ [[p12<=p56 & 3<=p75]] U [6<=p75 & ~ [[p12<=p56 & 3<=p75]]]]]] | ~ [EX [p61<=0]]]]]]]]

abstracting: (p61<=0)
states: 708,947,815,391,848,404,546,391,493,017,275,528,128,574 (41)
.abstracting: (3<=p75)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
abstracting: (p12<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (6<=p75)
states: 7,798,425,969,310,332,450,010,306,423,190,030,809,414,314 (42)
abstracting: (3<=p75)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
abstracting: (p12<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (3<=p75)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
abstracting: (p12<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.
EG iterations: 1
abstracting: (p29<=p55)
states: 11,760,193,172,970,661,769,534,258,884,168,923,466,603,404 (43)
.-> the formula is FALSE

FORMULA RefineWMG-PT-015016-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.187sec

checking: E [AX [[AF [[AX [p74<=4] & [p16<=11 & 6<=p61]]] | [~ [[p22<=p49 | p22<=6]] | ~ [p37<=13]]]] U EX [EF [~ [3<=p28]]]]
normalized: E [~ [EX [~ [[[~ [p37<=13] | ~ [[p22<=p49 | p22<=6]]] | ~ [EG [~ [[[p16<=11 & 6<=p61] & ~ [EX [~ [p74<=4]]]]]]]]]]] U EX [E [true U ~ [3<=p28]]]]

abstracting: (3<=p28)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
.abstracting: (p74<=4)
states: 12,044,591,260,125,124,922,507,738,808,349,252,721,282,376 (43)
.abstracting: (6<=p61)
states: 7,798,425,969,310,332,450,010,306,423,190,030,809,414,314 (42)
abstracting: (p16<=11)
states: 8,507,373,784,702,180,854,556,697,916,207,306,337,542,888 (42)
.
EG iterations: 1
abstracting: (p22<=6)
states: 4,962,634,707,742,938,831,824,740,451,120,928,696,900,018 (42)
abstracting: (p22<=p49)
states: 1,000,867,504,082,609,512,300,787,990,142,036,039,710,928 (42)
abstracting: (p37<=13)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
.-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.280sec

checking: AG [[[AX [~ [p2<=0]] | A [EF [15<=p31] U ~ [p36<=p56]]] | [AG [[p52<=15 | AF [p39<=2]]] | [p54<=p44 | 3<=p35]]]]
normalized: ~ [E [true U ~ [[[[p54<=p44 | 3<=p35] | ~ [E [true U ~ [[p52<=15 | ~ [EG [~ [p39<=2]]]]]]]] | [[~ [EG [p36<=p56]] & ~ [E [p36<=p56 U [p36<=p56 & ~ [E [true U 15<=p31]]]]]] | ~ [EX [p2<=0]]]]]]]

abstracting: (p2<=0)
states: 2,008,685,476,943,570,479,548,109,230,215,613,996,364,293 (42)
.abstracting: (15<=p31)
states: 1,417,895,630,783,696,809,092,782,986,034,551,056,257,148 (42)
abstracting: (p36<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p36<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p36<=p56)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.
EG iterations: 1
abstracting: (p39<=2)
states: 11,813,928,813,011,987,642,559,630,571,386,694,176,245,328 (43)
.
EG iterations: 1
abstracting: (p52<=15)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
abstracting: (3<=p35)
states: 9,925,269,415,485,877,663,649,480,902,241,857,393,800,036 (42)
abstracting: (p54<=p44)
states: 9,187,169,249,041,580,323,252,870,273,564,139,151,006,720 (42)
-> the formula is FALSE

FORMULA RefineWMG-PT-015016-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.293sec

checking: AG [[p49<=p70 & E [[[p29<=p9 & p2<=15] | EX [p76<=p61]] U [~ [p23<=14] & [p7<=p14 & p66<=p13]]]]]
normalized: ~ [E [true U ~ [[p49<=p70 & E [[EX [p76<=p61] | [p29<=p9 & p2<=15]] U [[p7<=p14 & p66<=p13] & ~ [p23<=14]]]]]]]

abstracting: (p23<=14)
states: 10,634,217,230,877,726,068,195,872,395,259,132,921,928,610 (43)
abstracting: (p66<=p13)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p7<=p14)
states: 1,000,867,504,082,609,512,300,787,990,142,036,039,710,928 (42)
abstracting: (p2<=15)
states: 12,052,112,861,661,422,877,288,655,381,293,683,978,185,758 (43)
abstracting: (p29<=p9)
states: 9,187,169,249,041,580,323,252,870,273,564,139,151,006,720 (42)
abstracting: (p76<=p61)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.abstracting: (p49<=p70)
states: 11,760,193,172,970,661,769,534,258,884,168,923,466,603,404 (43)
-> the formula is FALSE

FORMULA RefineWMG-PT-015016-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.750sec

checking: E [[~ [EG [p29<=p5]] | [[~ [p57<=2] & p28<=1] | [p51<=p60 & ~ [[[AX [9<=p76] & p66<=p4] & [12<=p33 & [p20<=p51 | p18<=6]]]]]]] U EF [[p7<=8 & p40<=p13]]]
normalized: E [[[[p51<=p60 & ~ [[[12<=p33 & [p20<=p51 | p18<=6]] & [p66<=p4 & ~ [EX [~ [9<=p76]]]]]]] | [p28<=1 & ~ [p57<=2]]] | ~ [EG [p29<=p5]]] U E [true U [p7<=8 & p40<=p13]]]

abstracting: (p40<=p13)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p7<=8)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p29<=p5)
states: 11,760,193,172,970,661,769,534,258,884,168,923,466,603,404 (43)
.
EG iterations: 1
abstracting: (p57<=2)
states: 2,126,843,446,175,545,213,639,174,479,051,826,584,385,722 (42)
abstracting: (p28<=1)
states: 1,417,895,630,783,696,809,092,782,986,034,551,056,257,148 (42)
abstracting: (9<=p76)
states: 5,671,582,523,134,787,236,371,131,944,138,204,225,028,592 (42)
.abstracting: (p66<=p4)
states: 1,000,867,504,082,609,512,300,787,990,142,036,039,710,928 (42)
abstracting: (p18<=6)
states: 4,962,634,707,742,938,831,824,740,451,120,928,696,900,018 (42)
abstracting: (p20<=p51)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (12<=p33)
states: 3,544,739,076,959,242,022,731,957,465,086,377,640,642,870 (42)
abstracting: (p51<=p60)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.158sec

checking: EF [[AX [[A [E [p4<=4 U p78<=p34] U AF [1<=p34]] & p20<=15]] & [[~ [1<=p9] | [~ [11<=p61] | [p63<=6 & [~ [2<=p29] | ~ [p3<=p46]]]]] & [A [p61<=p28 U p26<=p31] | AX [~ [p42<=p43]]]]]]
normalized: E [true U [[[~ [EX [p42<=p43]] | [~ [EG [~ [p26<=p31]]] & ~ [E [~ [p26<=p31] U [~ [p61<=p28] & ~ [p26<=p31]]]]]] & [[[p63<=6 & [~ [p3<=p46] | ~ [2<=p29]]] | ~ [11<=p61]] | ~ [1<=p9]]] & ~ [EX [~ [[p20<=15 & [~ [EG [EG [~ [1<=p34]]]] & ~ [E [EG [~ [1<=p34]] U [~ [E [p4<=4 U p78<=p34]] & EG [~ [1<=p34]]]]]]]]]]]]

abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
.
EG iterations: 1
abstracting: (p78<=p34)
states: 1,000,867,504,082,609,512,300,787,990,142,036,039,710,928 (42)
abstracting: (p4<=4)
states: 12,044,591,260,125,124,922,507,738,808,349,252,721,282,376 (43)
abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
.
EG iterations: 1
abstracting: (1<=p34)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p20<=15)
states: 11,343,165,046,269,574,472,742,263,888,276,408,450,057,184 (43)
.abstracting: (1<=p9)
states: 3,668,034,349,201,302,614,826,982,072,567,642,949,882,622 (42)
abstracting: (11<=p61)
states: 4,253,686,892,351,090,427,278,348,958,103,653,168,771,444 (42)
abstracting: (2<=p29)
states: 1,000,373,004,327,627,985,861,904,201,609,357,168,149,806 (42)
abstracting: (p3<=p46)
states: 10,279,743,323,181,801,865,922,676,648,750,495,157,864,323 (43)
abstracting: (p63<=6)
states: 4,962,634,707,742,938,831,824,740,451,120,928,696,900,018 (42)
abstracting: (p26<=p31)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p61<=p28)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p26<=p31)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
abstracting: (p26<=p31)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.
EG iterations: 1
abstracting: (p42<=p43)
states: 6,380,530,338,526,635,640,917,523,437,155,479,753,157,166 (42)
.-> the formula is TRUE

FORMULA RefineWMG-PT-015016-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.149sec

totally nodes used: 28084288 (2.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 80115981 70788366 150904347
used/not used/entry size/cache size: 50675576 16433288 16 1024MB
basic ops cache: hits/miss/sum: 32355808 28358443 60714251
used/not used/entry size/cache size: 15547200 1230016 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: 374888 376346 751234
used/not used/entry size/cache size: 368689 8019919 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 44211283
1 18614566
2 3732984
3 477353
4 44925
5 4322
6 956
7 728
8 278
9 727
>= 10 20742

Total processing time: 0m52.371sec


BK_STOP 1679170466229

--------------------
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 CTLCardinality -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.000sec


iterations count:7427 (117), effective:2611 (41)

initing FirstDep: 0m 0.000sec


iterations count:266 (4), effective:59 (0)

iterations count:2055 (32), effective:680 (10)

iterations count:69 (1), effective:6 (0)

iterations count:3013 (47), effective:1000 (15)

iterations count:189 (3), effective:42 (0)

iterations count:150 (2), effective:29 (0)

iterations count:106 (1), effective:18 (0)

iterations count:1634 (25), effective:544 (8)

iterations count:2563 (40), effective:872 (13)

iterations count:105 (1), effective:21 (0)

iterations count:73 (1), effective:10 (0)

iterations count:4879 (77), effective:1668 (26)

iterations count:77 (1), effective:7 (0)

iterations count:113 (1), effective:20 (0)

iterations count:618 (9), effective:208 (3)

iterations count:575 (9), effective:186 (2)

iterations count:2700 (42), effective:942 (14)

iterations count:649 (10), effective:229 (3)

iterations count:91 (1), effective:14 (0)

iterations count:63 (1), effective:0 (0)

iterations count:78 (1), effective:15 (0)

iterations count:1210 (19), effective:393 (6)

iterations count:2813 (44), effective:988 (15)

iterations count:258 (4), effective:75 (1)

iterations count:774 (12), effective:282 (4)

iterations count:155 (2), effective:38 (0)

iterations count:63 (1), effective:0 (0)

iterations count:527 (8), effective:184 (2)

iterations count:245 (3), effective:76 (1)

iterations count:96 (1), effective:17 (0)

iterations count:523 (8), effective:169 (2)

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="RefineWMG-PT-015016"
export BK_EXAMINATION="CTLCardinality"
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 RefineWMG-PT-015016, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203500601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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