Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856419800113.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 IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C03M03P03D03-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679451140016

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=IOTPpurchase-PT-C03M03P03D03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:12:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:12:21] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-22 02:12:21] [INFO ] Transformed 111 places.
[2023-03-22 02:12:21] [INFO ] Transformed 45 transitions.
[2023-03-22 02:12:21] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 77 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 94 transition count 45
Applied a total of 17 rules in 12 ms. Remains 94 /111 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 94 cols
[2023-03-22 02:12:21] [INFO ] Computed 50 place invariants in 15 ms
[2023-03-22 02:12:21] [INFO ] Implicit Places using invariants in 195 ms returned [16, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 217 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 92/111 places, 45/45 transitions.
Support contains 77 out of 92 places after structural reductions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 21 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 71) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) 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 23) 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 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 45 rows 92 cols
[2023-03-22 02:12:22] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-22 02:12:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 02:12:22] [INFO ] [Real]Absence check using 11 positive and 37 generalized place invariants in 7 ms returned sat
[2023-03-22 02:12:22] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-22 02:12:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 02:12:22] [INFO ] [Nat]Absence check using 11 positive and 37 generalized place invariants in 7 ms returned sat
[2023-03-22 02:12:22] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :1
[2023-03-22 02:12:23] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :20 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 02:12:23] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :1
Fused 21 Parikh solutions to 1 different solutions.
Finished Parikh walk after 114 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=114 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:12:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 6 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 48 out of 92 places (down from 56) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 65 transition count 45
Applied a total of 27 rules in 3 ms. Remains 65 /92 variables (removed 27) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 41 place count 50 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 52 place count 39 transition count 25
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 52 place count 39 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 76 place count 24 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 24 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 23 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 78 place count 23 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 84 place count 20 transition count 12
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 10 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 100 place count 10 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 101 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 104 place count 7 transition count 5
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 1 rules applied. Total rules applied 105 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 107 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 107 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 109 place count 4 transition count 3
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 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 112 place count 2 transition count 2
Applied a total of 112 rules in 9 ms. Remains 2 /92 variables (removed 90) and now considering 2/45 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 2/92 places, 2/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 67 transition count 45
Applied a total of 25 rules in 2 ms. Remains 67 /92 variables (removed 25) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 66 transition count 45
Applied a total of 26 rules in 2 ms. Remains 66 /92 variables (removed 26) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 6 places :
Implicit places reduction removed 6 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 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 65 transition count 43
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 63 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 62 transition count 42
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 13 place count 62 transition count 33
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 37 place count 47 transition count 33
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 37 place count 47 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 41 place count 45 transition count 31
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 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 55 place count 37 transition count 25
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 36 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 58 place count 35 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 58 place count 35 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 61 place count 33 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 61 place count 33 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 64 place count 31 transition count 22
Applied a total of 64 rules in 9 ms. Remains 31 /92 variables (removed 61) and now considering 22/45 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 31/92 places, 22/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 65 transition count 45
Applied a total of 27 rules in 2 ms. Remains 65 /92 variables (removed 27) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 65 transition count 45
Applied a total of 27 rules in 2 ms. Remains 65 /92 variables (removed 27) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 65 transition count 45
Applied a total of 27 rules in 2 ms. Remains 65 /92 variables (removed 27) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/92 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 5 places :
Implicit places reduction removed 5 places
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 8 rules applied. Total rules applied 8 place count 67 transition count 42
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 61 transition count 36
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 55 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 53 transition count 34
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 30 place count 53 transition count 23
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 59 place count 35 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 59 place count 35 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 65 place count 32 transition count 20
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 8 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 78 place count 24 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 23 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 79 place count 23 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 19 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 19 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 88 place count 17 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 16 transition count 12
Applied a total of 89 rules in 6 ms. Remains 16 /92 variables (removed 76) and now considering 12/45 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 16/92 places, 12/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 51 transition count 27
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 41 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 40 transition count 26
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 50 place count 40 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 66 place count 30 transition count 20
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 30 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 68 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 68 place count 29 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 70 place count 28 transition count 18
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 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 81 place count 22 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 21 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 82 place count 21 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 84 place count 20 transition count 12
Applied a total of 84 rules in 7 ms. Remains 20 /92 variables (removed 72) and now considering 12/45 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 20/92 places, 12/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 40
Reduce places removed 7 places and 0 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 1 with 10 rules applied. Total rules applied 20 place count 59 transition count 37
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 56 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 52 transition count 35
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 29 place count 52 transition count 22
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 62 place count 32 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 32 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 30 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 86 place count 17 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 97 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 99 place count 9 transition count 8
Applied a total of 99 rules in 6 ms. Remains 9 /92 variables (removed 83) and now considering 8/45 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 9/92 places, 8/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:12:23] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 02:12:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 45 transitions and 184 arcs took 1 ms.
Total runtime 1883 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: 92 NrTr: 45 NrArc: 184)

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

net check time: 0m 0.000sec

init dd package: 0m 2.725sec


RS generation: 0m 0.085sec


-> reachability set: #nodes 2825 (2.8e+03) #states 354,176 (5)



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

checking: AF [AX [EG [EX [0<=0]]]]
normalized: ~ [EG [EX [~ [EG [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 354,176 (5)
.
EG iterations: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

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

abstracting: (p88<=1)
states: 313,056 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: EX [EF [AG [EX [~ [p66<=p68]]]]]
normalized: EX [E [true U ~ [E [true U ~ [EX [~ [p66<=p68]]]]]]]

abstracting: (p66<=p68)
states: 277,856 (5)
..-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [AF [EG [A [2<=p11 U p50<=0]]]]
normalized: ~ [EX [EG [~ [EG [[~ [EG [~ [p50<=0]]] & ~ [E [~ [p50<=0] U [~ [2<=p11] & ~ [p50<=0]]]]]]]]]]

abstracting: (p50<=0)
states: 33,232 (4)
abstracting: (2<=p11)
states: 1,072 (3)
abstracting: (p50<=0)
states: 33,232 (4)
abstracting: (p50<=0)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
...............................................................................................
EG iterations: 95

EG iterations: 0
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.680sec

checking: EF [AG [[~ [p17<=p23] | [~ [2<=p68] & ~ [p36<=2]]]]]
normalized: E [true U ~ [E [true U ~ [[[~ [2<=p68] & ~ [p36<=2]] | ~ [p17<=p23]]]]]]

abstracting: (p17<=p23)
states: 260,312 (5)
abstracting: (p36<=2)
states: 280,546 (5)
abstracting: (2<=p68)
states: 848
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: E [EX [3<=p48] U EX [AF [E [AG [p21<=p80] U EX [p3<=p46]]]]]
normalized: E [EX [3<=p48] U EX [~ [EG [~ [E [~ [E [true U ~ [p21<=p80]]] U EX [p3<=p46]]]]]]]

abstracting: (p3<=p46)
states: 320,944 (5)
.abstracting: (p21<=p80)
states: 333,864 (5)
......................................................
EG iterations: 54
.abstracting: (3<=p48)
states: 64
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.155sec

checking: E [0<=0 U AG [AF [[AG [p14<=p8] & [p39<=1 & p29<=p7]]]]]
normalized: E [0<=0 U ~ [E [true U EG [~ [[[p39<=1 & p29<=p7] & ~ [E [true U ~ [p14<=p8]]]]]]]]]

abstracting: (p14<=p8)
states: 325,104 (5)
abstracting: (p29<=p7)
states: 333,496 (5)
abstracting: (p39<=1)
states: 354,176 (5)

EG iterations: 0
abstracting: (0<=0)
states: 354,176 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AF [[EG [p86<=p45] & [~ [E [[p44<=1 & 1<=p42] U p69<=0]] | AF [[~ [1<=p21] | ~ [2<=p83]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[~ [2<=p83] | ~ [1<=p21]]]]] | ~ [E [[p44<=1 & 1<=p42] U p69<=0]]] & EG [p86<=p45]]]]]

abstracting: (p86<=p45)
states: 320,944 (5)
.
EG iterations: 1
abstracting: (p69<=0)
states: 332,664 (5)
abstracting: (1<=p42)
states: 21,512 (4)
abstracting: (p44<=1)
states: 353,328 (5)
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (2<=p83)
states: 8,216 (3)
.............
EG iterations: 13
.............................................................................................
EG iterations: 93
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.479sec

checking: [AF [AX [[AX [~ [1<=p17]] | [EG [p75<=p57] | [1<=p37 & [p36<=1 & p70<=p34]]]]]] & AG [p7<=1]]
normalized: [~ [E [true U ~ [p7<=1]]] & ~ [EG [EX [~ [[~ [EX [1<=p17]] | [EG [p75<=p57] | [1<=p37 & [p36<=1 & p70<=p34]]]]]]]]]

abstracting: (p70<=p34)
states: 354,176 (5)
abstracting: (p36<=1)
states: 188,236 (5)
abstracting: (1<=p37)
states: 29,844 (4)
abstracting: (p75<=p57)
states: 344,640 (5)
.
EG iterations: 1
abstracting: (1<=p17)
states: 97,704 (4)
...................
EG iterations: 17
abstracting: (p7<=1)
states: 353,328 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: [AX [[AG [[p77<=0 & [p35<=3 | 1<=p28]]] & p3<=0]] | EG [[p76<=p64 | A [p65<=p82 U A [1<=p65 U p84<=p81]]]]]
normalized: [EG [[p76<=p64 | [~ [EG [~ [[~ [EG [~ [p84<=p81]]] & ~ [E [~ [p84<=p81] U [~ [1<=p65] & ~ [p84<=p81]]]]]]]] & ~ [E [~ [[~ [EG [~ [p84<=p81]]] & ~ [E [~ [p84<=p81] U [~ [1<=p65] & ~ [p84<=p81]]]]]] U [~ [p65<=p82] & ~ [[~ [EG [~ [p84<=p81]]] & ~ [E [~ [p84<=p81] U [~ [1<=p65] & ~ [p84<=p81]]]]]]]]]]]] | ~ [EX [~ [[p3<=0 & ~ [E [true U ~ [[p77<=0 & [p35<=3 | 1<=p28]]]]]]]]]]

abstracting: (1<=p28)
states: 29,844 (4)
abstracting: (p35<=3)
states: 354,176 (5)
abstracting: (p77<=0)
states: 332,664 (5)
abstracting: (p3<=0)
states: 318,832 (5)
.abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (1<=p65)
states: 21,512 (4)
abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (p84<=p81)
states: 344,382 (5)
..........................................................................
EG iterations: 74
abstracting: (p65<=p82)
states: 333,496 (5)
abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (1<=p65)
states: 21,512 (4)
abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (p84<=p81)
states: 344,382 (5)
..........................................................................
EG iterations: 74
abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (1<=p65)
states: 21,512 (4)
abstracting: (p84<=p81)
states: 344,382 (5)
abstracting: (p84<=p81)
states: 344,382 (5)
..........................................................................
EG iterations: 74
..........................................................................
EG iterations: 74
abstracting: (p76<=p64)
states: 333,496 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.288sec

checking: AG [A [EF [[2<=p76 & p0<=p5]] U [3<=p32 | [[~ [p38<=2] & [EF [p6<=p25] | [p89<=p4 | [2<=p5 & 3<=p52]]]] | [AF [p35<=p60] & ~ [p82<=1]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[3<=p32 | [[~ [p82<=1] & ~ [EG [~ [p35<=p60]]]] | [[[p89<=p4 | [2<=p5 & 3<=p52]] | E [true U p6<=p25]] & ~ [p38<=2]]]]]]] & ~ [E [~ [[3<=p32 | [[~ [p82<=1] & ~ [EG [~ [p35<=p60]]]] | [[[p89<=p4 | [2<=p5 & 3<=p52]] | E [true U p6<=p25]] & ~ [p38<=2]]]]] U [~ [E [true U [2<=p76 & p0<=p5]]] & ~ [[3<=p32 | [[~ [p82<=1] & ~ [EG [~ [p35<=p60]]]] | [[[p89<=p4 | [2<=p5 & 3<=p52]] | E [true U p6<=p25]] & ~ [p38<=2]]]]]]]]]]]]

abstracting: (p38<=2)
states: 354,160 (5)
abstracting: (p6<=p25)
states: 335,576 (5)
abstracting: (3<=p52)
states: 0
abstracting: (2<=p5)
states: 848
abstracting: (p89<=p4)
states: 329,056 (5)
abstracting: (p35<=p60)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p82<=1)
states: 353,328 (5)
abstracting: (3<=p32)
states: 16
abstracting: (p0<=p5)
states: 334,328 (5)
abstracting: (2<=p76)
states: 848
abstracting: (p38<=2)
states: 354,160 (5)
abstracting: (p6<=p25)
states: 335,576 (5)
abstracting: (3<=p52)
states: 0
abstracting: (2<=p5)
states: 848
abstracting: (p89<=p4)
states: 329,056 (5)
abstracting: (p35<=p60)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p82<=1)
states: 353,328 (5)
abstracting: (3<=p32)
states: 16
abstracting: (p38<=2)
states: 354,160 (5)
abstracting: (p6<=p25)
states: 335,576 (5)
abstracting: (3<=p52)
states: 0
abstracting: (2<=p5)
states: 848
abstracting: (p89<=p4)
states: 329,056 (5)
abstracting: (p35<=p60)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p82<=1)
states: 353,328 (5)
abstracting: (3<=p32)
states: 16
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.109sec

totally nodes used: 2292123 (2.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1630755 4968270 6599025
used/not used/entry size/cache size: 6745982 60362882 16 1024MB
basic ops cache: hits/miss/sum: 147354 544708 692062
used/not used/entry size/cache size: 1004205 15773011 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: 8611 24639 33250
used/not used/entry size/cache size: 24605 8364003 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 65077194
1 1816481
2 179816
3 29847
4 4661
5 584
6 125
7 13
8 30
9 31
>= 10 82

Total processing time: 0m 6.502sec


BK_STOP 1679451150960

--------------------
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:1146 (25), effective:247 (5)

initing FirstDep: 0m 0.000sec


iterations count:391 (8), effective:88 (1)

iterations count:98 (2), effective:16 (0)

iterations count:51 (1), effective:3 (0)

iterations count:256 (5), effective:52 (1)

iterations count:240 (5), effective:47 (1)

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

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

iterations count:255 (5), effective:52 (1)

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

iterations count:47 (1), effective:2 (0)

iterations count:419 (9), effective:86 (1)

iterations count:232 (5), effective:43 (0)

iterations count:55 (1), effective:3 (0)

iterations count:55 (1), effective:3 (0)

iterations count:191 (4), effective:29 (0)

iterations count:55 (1), effective:3 (0)

iterations count:132 (2), effective:30 (0)

iterations count:425 (9), effective:88 (1)

iterations count:132 (2), effective:30 (0)

iterations count:132 (2), effective:30 (0)

iterations count:62 (1), effective:5 (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="IOTPpurchase-PT-C03M03P03D03"
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 IOTPpurchase-PT-C03M03P03D03, 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 r234-tall-167856419800113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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