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.r266-smll-167863541200609.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 Peterson-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-CTLCardinality-00
FORMULA_NAME Peterson-PT-3-CTLCardinality-01
FORMULA_NAME Peterson-PT-3-CTLCardinality-02
FORMULA_NAME Peterson-PT-3-CTLCardinality-03
FORMULA_NAME Peterson-PT-3-CTLCardinality-04
FORMULA_NAME Peterson-PT-3-CTLCardinality-05
FORMULA_NAME Peterson-PT-3-CTLCardinality-06
FORMULA_NAME Peterson-PT-3-CTLCardinality-07
FORMULA_NAME Peterson-PT-3-CTLCardinality-08
FORMULA_NAME Peterson-PT-3-CTLCardinality-09
FORMULA_NAME Peterson-PT-3-CTLCardinality-10
FORMULA_NAME Peterson-PT-3-CTLCardinality-11
FORMULA_NAME Peterson-PT-3-CTLCardinality-12
FORMULA_NAME Peterson-PT-3-CTLCardinality-13
FORMULA_NAME Peterson-PT-3-CTLCardinality-14
FORMULA_NAME Peterson-PT-3-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679189599630

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=Peterson-PT-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 01:33:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 01:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:33:23] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-19 01:33:23] [INFO ] Transformed 244 places.
[2023-03-19 01:33:23] [INFO ] Transformed 332 transitions.
[2023-03-19 01:33:23] [INFO ] Found NUPN structural information;
[2023-03-19 01:33:23] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-19 01:33:23] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Support contains 225 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 25 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-19 01:33:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-19 01:33:23] [INFO ] Computed 15 place invariants in 22 ms
[2023-03-19 01:33:24] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-19 01:33:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-19 01:33:24] [INFO ] Invariant cache hit.
[2023-03-19 01:33:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 01:33:24] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2023-03-19 01:33:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-19 01:33:24] [INFO ] Invariant cache hit.
[2023-03-19 01:33:25] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1775 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 225 out of 244 places after structural reductions.
[2023-03-19 01:33:25] [INFO ] Flatten gal took : 125 ms
[2023-03-19 01:33:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-3-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 01:33:25] [INFO ] Flatten gal took : 49 ms
[2023-03-19 01:33:25] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 181 out of 244 places (down from 225) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 972 ms. (steps per millisecond=10 ) properties (out of 50) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-19 01:33:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-19 01:33:27] [INFO ] Invariant cache hit.
[2023-03-19 01:33:27] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-19 01:33:27] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-19 01:33:27] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:7
[2023-03-19 01:33:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-19 01:33:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-19 01:33:28] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :4
[2023-03-19 01:33:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 01:33:28] [INFO ] After 111ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :20 sat :4
[2023-03-19 01:33:28] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 7 ms to minimize.
[2023-03-19 01:33:28] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 2 ms to minimize.
[2023-03-19 01:33:29] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-19 01:33:29] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 2 ms to minimize.
[2023-03-19 01:33:29] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2023-03-19 01:33:29] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 1 ms to minimize.
[2023-03-19 01:33:30] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-19 01:33:30] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2023-03-19 01:33:30] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-19 01:33:30] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-19 01:33:31] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 1 ms to minimize.
[2023-03-19 01:33:31] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 2 ms to minimize.
[2023-03-19 01:33:31] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2023-03-19 01:33:31] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2023-03-19 01:33:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3013 ms
[2023-03-19 01:33:31] [INFO ] After 3224ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-19 01:33:31] [INFO ] After 3799ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :2
Fused 24 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 72 rules applied. Total rules applied 108 place count 208 transition count 260
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 144 place count 172 transition count 236
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 192 place count 148 transition count 236
Applied a total of 192 rules in 61 ms. Remains 148 /244 variables (removed 96) and now considering 236/332 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 148/244 places, 236/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Finished probabilistic random walk after 232628 steps, run visited all 2 properties in 848 ms. (steps per millisecond=274 )
Probabilistic random walk after 232628 steps, saw 46604 distinct states, run finished after 848 ms. (steps per millisecond=274 ) properties seen :2
Successfully simplified 22 atomic propositions for a total of 15 simplifications.
FORMULA Peterson-PT-3-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 01:33:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 32 ms
FORMULA Peterson-PT-3-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 37 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 41 out of 244 places (down from 112) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 28 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 20 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 22 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 18 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 19 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 244 transition count 243
Reduce places removed 89 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 155 transition count 240
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 152 transition count 240
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 184 place count 152 transition count 194
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 276 place count 106 transition count 194
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 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 300 place count 94 transition count 182
Applied a total of 300 rules in 32 ms. Remains 94 /244 variables (removed 150) and now considering 182/332 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 94/244 places, 182/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 10 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 11 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 186 place count 151 transition count 191
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 282 place count 103 transition count 191
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 306 place count 91 transition count 179
Applied a total of 306 rules in 25 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 91/244 places, 179/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 11 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 12 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 179 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA Peterson-PT-3-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 244 transition count 243
Reduce places removed 89 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 93 rules applied. Total rules applied 182 place count 155 transition count 239
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 186 place count 151 transition count 197
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 270 place count 109 transition count 197
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 290 place count 99 transition count 187
Applied a total of 290 rules in 25 ms. Remains 99 /244 variables (removed 145) and now considering 187/332 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 99/244 places, 187/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 10 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 244 transition count 255
Reduce places removed 77 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 83 rules applied. Total rules applied 160 place count 167 transition count 249
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 166 place count 161 transition count 249
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 166 place count 161 transition count 207
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 250 place count 119 transition count 207
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 110 transition count 198
Applied a total of 268 rules in 24 ms. Remains 110 /244 variables (removed 134) and now considering 198/332 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 110/244 places, 198/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 13 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 14 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 13 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 12 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 12 ms
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 13 ms
[2023-03-19 01:33:33] [INFO ] Input system was already deterministic with 332 transitions.
[2023-03-19 01:33:33] [INFO ] Flatten gal took : 13 ms
[2023-03-19 01:33:34] [INFO ] Flatten gal took : 12 ms
[2023-03-19 01:33:34] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 01:33:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 3 ms.
Total runtime 10997 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: 244 NrTr: 332 NrArc: 1016)

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

net check time: 0m 0.000sec

init dd package: 0m 3.636sec


RS generation: 0m52.565sec


-> reachability set: #nodes 170194 (1.7e+05) #states 3,407,946 (6)



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

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

abstracting: (0<=0)
states: 3,407,946 (6)
.
EG iterations: 0
-> the formula is TRUE

FORMULA Peterson-PT-3-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (0<=0)
states: 3,407,946 (6)
.-> the formula is TRUE

FORMULA Peterson-PT-3-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.450sec

checking: AG [EX [[[p37<=0 & 0<=p37] | [p127<=1 & 1<=p127]]]]
normalized: ~ [E [true U ~ [EX [[[p127<=1 & 1<=p127] | [p37<=0 & 0<=p37]]]]]]

abstracting: (0<=p37)
states: 3,407,946 (6)
abstracting: (p37<=0)
states: 3,364,478 (6)
abstracting: (1<=p127)
states: 60,142 (4)
abstracting: (p127<=1)
states: 3,407,946 (6)
.-> the formula is TRUE

FORMULA Peterson-PT-3-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.823sec

checking: EX [[[p81<=0 & 0<=p81] & [p131<=1 & 1<=p131]]]
normalized: EX [[[p131<=1 & 1<=p131] & [p81<=0 & 0<=p81]]]

abstracting: (0<=p81)
states: 3,407,946 (6)
abstracting: (p81<=0)
states: 3,347,492 (6)
abstracting: (1<=p131)
states: 2,504 (3)
abstracting: (p131<=1)
states: 3,407,946 (6)
.-> the formula is FALSE

FORMULA Peterson-PT-3-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.840sec

checking: AG [AF [[~ [A [[[p99<=0 & 0<=p99] | [p17<=1 & 1<=p17]] U [p103<=0 & 0<=p103]]] | [p141<=0 & 0<=p141]]]]
normalized: ~ [E [true U EG [~ [[[p141<=0 & 0<=p141] | ~ [[~ [EG [~ [[p103<=0 & 0<=p103]]]] & ~ [E [~ [[p103<=0 & 0<=p103]] U [~ [[[p17<=1 & 1<=p17] | [p99<=0 & 0<=p99]]] & ~ [[p103<=0 & 0<=p103]]]]]]]]]]]]

abstracting: (0<=p103)
states: 3,407,946 (6)
abstracting: (p103<=0)
states: 3,401,378 (6)
abstracting: (0<=p99)
states: 3,407,946 (6)
abstracting: (p99<=0)
states: 3,401,378 (6)
abstracting: (1<=p17)
states: 35,768 (4)
abstracting: (p17<=1)
states: 3,407,946 (6)
abstracting: (0<=p103)
states: 3,407,946 (6)
abstracting: (p103<=0)
states: 3,401,378 (6)
abstracting: (0<=p103)
states: 3,407,946 (6)
abstracting: (p103<=0)
states: 3,401,378 (6)
.
EG iterations: 1
abstracting: (0<=p141)
states: 3,407,946 (6)
abstracting: (p141<=0)
states: 3,405,442 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Peterson-PT-3-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.409sec

checking: ~ [A [~ [[[[[p77<=0 & 0<=p77] | [p60<=1 & 1<=p60]] & EF [[[p241<=0 & 0<=p241] | [p135<=1 & 1<=p135]]]] | [p28<=0 & 0<=p28]]] U [~ [[p2<=0 & 0<=p2]] | AG [[[p9<=0 & 0<=p9] & [p181<=0 & 0<=p181]]]]]]
normalized: ~ [[~ [EG [~ [[~ [E [true U ~ [[[p181<=0 & 0<=p181] & [p9<=0 & 0<=p9]]]]] | ~ [[p2<=0 & 0<=p2]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[p181<=0 & 0<=p181] & [p9<=0 & 0<=p9]]]]] | ~ [[p2<=0 & 0<=p2]]]] U [[[p28<=0 & 0<=p28] | [E [true U [[p135<=1 & 1<=p135] | [p241<=0 & 0<=p241]]] & [[p60<=1 & 1<=p60] | [p77<=0 & 0<=p77]]]] & ~ [[~ [E [true U ~ [[[p181<=0 & 0<=p181] & [p9<=0 & 0<=p9]]]]] | ~ [[p2<=0 & 0<=p2]]]]]]]]]

abstracting: (0<=p2)
states: 3,407,946 (6)
abstracting: (p2<=0)
states: 3,314,602 (6)
abstracting: (0<=p9)
states: 3,407,946 (6)
abstracting: (p9<=0)
states: 3,401,378 (6)
abstracting: (0<=p181)
states: 3,407,946 (6)
abstracting: (p181<=0)
states: 3,392,579 (6)
abstracting: (0<=p77)
states: 3,407,946 (6)
abstracting: (p77<=0)
states: 3,398,500 (6)
abstracting: (1<=p60)
states: 6,568 (3)
abstracting: (p60<=1)
states: 3,407,946 (6)
abstracting: (0<=p241)
states: 3,407,946 (6)
abstracting: (p241<=0)
states: 3,405,442 (6)
abstracting: (1<=p135)
states: 85,336 (4)
abstracting: (p135<=1)
states: 3,407,946 (6)
abstracting: (0<=p28)
states: 3,407,946 (6)
abstracting: (p28<=0)
states: 3,364,478 (6)
abstracting: (0<=p2)
states: 3,407,946 (6)
abstracting: (p2<=0)
states: 3,314,602 (6)
abstracting: (0<=p9)
states: 3,407,946 (6)
abstracting: (p9<=0)
states: 3,401,378 (6)
abstracting: (0<=p181)
states: 3,407,946 (6)
abstracting: (p181<=0)
states: 3,392,579 (6)
abstracting: (0<=p2)
states: 3,407,946 (6)
abstracting: (p2<=0)
states: 3,314,602 (6)
abstracting: (0<=p9)
states: 3,407,946 (6)
abstracting: (p9<=0)
states: 3,401,378 (6)
abstracting: (0<=p181)
states: 3,407,946 (6)
abstracting: (p181<=0)
states: 3,392,579 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Peterson-PT-3-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 7.225sec

checking: ~ [E [A [~ [[[[[p171<=1 & 1<=p171] & [[p18<=0 & 0<=p18] | [p238<=1 & 1<=p238]]] | AF [[[p124<=0 & 0<=p124] | [p182<=1 & 1<=p182]]]] & [p181<=0 & 0<=p181]]] U ~ [[[p163<=1 & 1<=p163] | [p126<=1 & 1<=p126]]]] U AG [~ [AX [[p133<=1 & 1<=p133]]]]]]
normalized: ~ [E [[~ [EG [[[p126<=1 & 1<=p126] | [p163<=1 & 1<=p163]]]] & ~ [E [[[p126<=1 & 1<=p126] | [p163<=1 & 1<=p163]] U [[[p181<=0 & 0<=p181] & [~ [EG [~ [[[p182<=1 & 1<=p182] | [p124<=0 & 0<=p124]]]]] | [[[p238<=1 & 1<=p238] | [p18<=0 & 0<=p18]] & [p171<=1 & 1<=p171]]]] & [[p126<=1 & 1<=p126] | [p163<=1 & 1<=p163]]]]]] U ~ [E [true U ~ [EX [~ [[p133<=1 & 1<=p133]]]]]]]]

abstracting: (1<=p133)
states: 93,344 (4)
abstracting: (p133<=1)
states: 3,407,946 (6)
.abstracting: (1<=p163)
states: 127,120 (5)
abstracting: (p163<=1)
states: 3,407,946 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
abstracting: (1<=p171)
states: 13,962 (4)
abstracting: (p171<=1)
states: 3,407,946 (6)
abstracting: (0<=p18)
states: 3,407,946 (6)
abstracting: (p18<=0)
states: 3,358,338 (6)
abstracting: (1<=p238)
states: 6,568 (3)
abstracting: (p238<=1)
states: 3,407,946 (6)
abstracting: (0<=p124)
states: 3,407,946 (6)
abstracting: (p124<=0)
states: 3,171,790 (6)
abstracting: (1<=p182)
states: 256,858 (5)
abstracting: (p182<=1)
states: 3,407,946 (6)
.
EG iterations: 1
abstracting: (0<=p181)
states: 3,407,946 (6)
abstracting: (p181<=0)
states: 3,392,579 (6)
abstracting: (1<=p163)
states: 127,120 (5)
abstracting: (p163<=1)
states: 3,407,946 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
abstracting: (1<=p163)
states: 127,120 (5)
abstracting: (p163<=1)
states: 3,407,946 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Peterson-PT-3-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.562sec

checking: A [EG [~ [[EF [[[p15<=0 & 0<=p15] | [p166<=1 & 1<=p166]]] & [[p1<=0 & 0<=p1] | [p238<=1 & 1<=p238]]]]] U [[AG [[[p130<=0 & 0<=p130] | [p48<=1 & 1<=p48]]] | EG [[[p43<=1 & 1<=p43] & [p6<=1 & 1<=p6]]]] | [~ [[[p175<=0 & 0<=p175] | [p54<=1 & 1<=p54]]] | [~ [[p180<=0 & 0<=p180]] | [[EF [[[p217<=0 & 0<=p217] | [p98<=1 & 1<=p98]]] & [p16<=1 & 1<=p16]] & [[[p147<=0 & 0<=p147] | [p134<=1 & 1<=p134]] & [[p188<=0 & 0<=p188] | [p126<=1 & 1<=p126]]]]]]]]
normalized: [~ [EG [~ [[[[[[[[p126<=1 & 1<=p126] | [p188<=0 & 0<=p188]] & [[p134<=1 & 1<=p134] | [p147<=0 & 0<=p147]]] & [[p16<=1 & 1<=p16] & E [true U [[p98<=1 & 1<=p98] | [p217<=0 & 0<=p217]]]]] | ~ [[p180<=0 & 0<=p180]]] | ~ [[[p54<=1 & 1<=p54] | [p175<=0 & 0<=p175]]]] | [EG [[[p6<=1 & 1<=p6] & [p43<=1 & 1<=p43]]] | ~ [E [true U ~ [[[p48<=1 & 1<=p48] | [p130<=0 & 0<=p130]]]]]]]]]] & ~ [E [~ [[[[[[[[p126<=1 & 1<=p126] | [p188<=0 & 0<=p188]] & [[p134<=1 & 1<=p134] | [p147<=0 & 0<=p147]]] & [[p16<=1 & 1<=p16] & E [true U [[p98<=1 & 1<=p98] | [p217<=0 & 0<=p217]]]]] | ~ [[p180<=0 & 0<=p180]]] | ~ [[[p54<=1 & 1<=p54] | [p175<=0 & 0<=p175]]]] | [EG [[[p6<=1 & 1<=p6] & [p43<=1 & 1<=p43]]] | ~ [E [true U ~ [[[p48<=1 & 1<=p48] | [p130<=0 & 0<=p130]]]]]]]] U [~ [EG [~ [[[[p238<=1 & 1<=p238] | [p1<=0 & 0<=p1]] & E [true U [[p166<=1 & 1<=p166] | [p15<=0 & 0<=p15]]]]]]] & ~ [[[[[[[[p126<=1 & 1<=p126] | [p188<=0 & 0<=p188]] & [[p134<=1 & 1<=p134] | [p147<=0 & 0<=p147]]] & [[p16<=1 & 1<=p16] & E [true U [[p98<=1 & 1<=p98] | [p217<=0 & 0<=p217]]]]] | ~ [[p180<=0 & 0<=p180]]] | ~ [[[p54<=1 & 1<=p54] | [p175<=0 & 0<=p175]]]] | [EG [[[p6<=1 & 1<=p6] & [p43<=1 & 1<=p43]]] | ~ [E [true U ~ [[[p48<=1 & 1<=p48] | [p130<=0 & 0<=p130]]]]]]]]]]]]

abstracting: (0<=p130)
states: 3,407,946 (6)
abstracting: (p130<=0)
states: 3,386,730 (6)
abstracting: (1<=p48)
states: 6,568 (3)
abstracting: (p48<=1)
states: 3,407,946 (6)
abstracting: (1<=p43)
states: 24,256 (4)
abstracting: (p43<=1)
states: 3,407,946 (6)
abstracting: (1<=p6)
states: 60,454 (4)
abstracting: (p6<=1)
states: 3,407,946 (6)
.
EG iterations: 1
abstracting: (0<=p175)
states: 3,407,946 (6)
abstracting: (p175<=0)
states: 3,358,338 (6)
abstracting: (1<=p54)
states: 51,004 (4)
abstracting: (p54<=1)
states: 3,407,946 (6)
abstracting: (0<=p180)
states: 3,407,946 (6)
abstracting: (p180<=0)
states: 3,398,500 (6)
abstracting: (0<=p217)
states: 3,407,946 (6)
abstracting: (p217<=0)
states: 3,383,690 (6)
abstracting: (1<=p98)
states: 20,840 (4)
abstracting: (p98<=1)
states: 3,407,946 (6)
abstracting: (1<=p16)
states: 60,142 (4)
abstracting: (p16<=1)
states: 3,407,946 (6)
abstracting: (0<=p147)
states: 3,407,946 (6)
abstracting: (p147<=0)
states: 3,188,918 (6)
abstracting: (1<=p134)
states: 256,858 (5)
abstracting: (p134<=1)
states: 3,407,946 (6)
abstracting: (0<=p188)
states: 3,407,946 (6)
abstracting: (p188<=0)
states: 3,314,602 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
abstracting: (0<=p15)
states: 3,407,946 (6)
abstracting: (p15<=0)
states: 3,386,730 (6)
abstracting: (1<=p166)
states: 123,352 (5)
abstracting: (p166<=1)
states: 3,407,946 (6)
abstracting: (0<=p1)
states: 3,407,946 (6)
abstracting: (p1<=0)
states: 3,322,364 (6)
abstracting: (1<=p238)
states: 6,568 (3)
abstracting: (p238<=1)
states: 3,407,946 (6)
.
EG iterations: 1
abstracting: (0<=p130)
states: 3,407,946 (6)
abstracting: (p130<=0)
states: 3,386,730 (6)
abstracting: (1<=p48)
states: 6,568 (3)
abstracting: (p48<=1)
states: 3,407,946 (6)
abstracting: (1<=p43)
states: 24,256 (4)
abstracting: (p43<=1)
states: 3,407,946 (6)
abstracting: (1<=p6)
states: 60,454 (4)
abstracting: (p6<=1)
states: 3,407,946 (6)
.
EG iterations: 1
abstracting: (0<=p175)
states: 3,407,946 (6)
abstracting: (p175<=0)
states: 3,358,338 (6)
abstracting: (1<=p54)
states: 51,004 (4)
abstracting: (p54<=1)
states: 3,407,946 (6)
abstracting: (0<=p180)
states: 3,407,946 (6)
abstracting: (p180<=0)
states: 3,398,500 (6)
abstracting: (0<=p217)
states: 3,407,946 (6)
abstracting: (p217<=0)
states: 3,383,690 (6)
abstracting: (1<=p98)
states: 20,840 (4)
abstracting: (p98<=1)
states: 3,407,946 (6)
abstracting: (1<=p16)
states: 60,142 (4)
abstracting: (p16<=1)
states: 3,407,946 (6)
abstracting: (0<=p147)
states: 3,407,946 (6)
abstracting: (p147<=0)
states: 3,188,918 (6)
abstracting: (1<=p134)
states: 256,858 (5)
abstracting: (p134<=1)
states: 3,407,946 (6)
abstracting: (0<=p188)
states: 3,407,946 (6)
abstracting: (p188<=0)
states: 3,314,602 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
abstracting: (0<=p130)
states: 3,407,946 (6)
abstracting: (p130<=0)
states: 3,386,730 (6)
abstracting: (1<=p48)
states: 6,568 (3)
abstracting: (p48<=1)
states: 3,407,946 (6)
abstracting: (1<=p43)
states: 24,256 (4)
abstracting: (p43<=1)
states: 3,407,946 (6)
abstracting: (1<=p6)
states: 60,454 (4)
abstracting: (p6<=1)
states: 3,407,946 (6)
.
EG iterations: 1
abstracting: (0<=p175)
states: 3,407,946 (6)
abstracting: (p175<=0)
states: 3,358,338 (6)
abstracting: (1<=p54)
states: 51,004 (4)
abstracting: (p54<=1)
states: 3,407,946 (6)
abstracting: (0<=p180)
states: 3,407,946 (6)
abstracting: (p180<=0)
states: 3,398,500 (6)
abstracting: (0<=p217)
states: 3,407,946 (6)
abstracting: (p217<=0)
states: 3,383,690 (6)
abstracting: (1<=p98)
states: 20,840 (4)
abstracting: (p98<=1)
states: 3,407,946 (6)
abstracting: (1<=p16)
states: 60,142 (4)
abstracting: (p16<=1)
states: 3,407,946 (6)
abstracting: (0<=p147)
states: 3,407,946 (6)
abstracting: (p147<=0)
states: 3,188,918 (6)
abstracting: (1<=p134)
states: 256,858 (5)
abstracting: (p134<=1)
states: 3,407,946 (6)
abstracting: (0<=p188)
states: 3,407,946 (6)
abstracting: (p188<=0)
states: 3,314,602 (6)
abstracting: (1<=p126)
states: 11,371 (4)
abstracting: (p126<=1)
states: 3,407,946 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Peterson-PT-3-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.685sec

totally nodes used: 28522733 (2.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 114823094 505670561 620493655
used/not used/entry size/cache size: 67057478 51386 16 1024MB
basic ops cache: hits/miss/sum: 5903266 25310932 31214198
used/not used/entry size/cache size: 14954314 1822902 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: 191538 903812 1095350
used/not used/entry size/cache size: 858094 7530514 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 46089998
1 15198036
2 4449124
3 1108372
4 221662
5 35975
6 5134
7 506
8 50
9 6
>= 10 1

Total processing time: 4m17.623sec


BK_STOP 1679189872684

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

67593 118683 152189 174918
iterations count:416217 (1253), effective:7444 (22)

initing FirstDep: 0m 0.000sec


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

iterations count:18922 (56), effective:559 (1)
168813
iterations count:135626 (408), effective:2408 (7)

iterations count:552 (1), effective:1 (0)
168813
iterations count:135626 (408), effective:2408 (7)

iterations count:332 (1), effective:0 (0)
168813
iterations count:135626 (408), effective:2408 (7)

iterations count:1260 (3), effective:15 (0)

iterations count:332 (1), effective:0 (0)
168159
iterations count:134553 (405), effective:2304 (6)

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

iterations count:334 (1), effective:1 (0)
168159
iterations count:134553 (405), effective:2304 (6)

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

iterations count:334 (1), effective:1 (0)
168159
iterations count:134553 (405), effective:2304 (6)

iterations count:334 (1), effective:1 (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="Peterson-PT-3"
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 Peterson-PT-3, 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 r266-smll-167863541200609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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