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.r138-smll-167819419200009.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 Dekker-PT-015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K 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 Dekker-PT-015-CTLCardinality-00
FORMULA_NAME Dekker-PT-015-CTLCardinality-01
FORMULA_NAME Dekker-PT-015-CTLCardinality-02
FORMULA_NAME Dekker-PT-015-CTLCardinality-03
FORMULA_NAME Dekker-PT-015-CTLCardinality-04
FORMULA_NAME Dekker-PT-015-CTLCardinality-05
FORMULA_NAME Dekker-PT-015-CTLCardinality-06
FORMULA_NAME Dekker-PT-015-CTLCardinality-07
FORMULA_NAME Dekker-PT-015-CTLCardinality-08
FORMULA_NAME Dekker-PT-015-CTLCardinality-09
FORMULA_NAME Dekker-PT-015-CTLCardinality-10
FORMULA_NAME Dekker-PT-015-CTLCardinality-11
FORMULA_NAME Dekker-PT-015-CTLCardinality-12
FORMULA_NAME Dekker-PT-015-CTLCardinality-13
FORMULA_NAME Dekker-PT-015-CTLCardinality-14
FORMULA_NAME Dekker-PT-015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678531310559

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=Dekker-PT-015
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:41:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:41:54] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-11 10:41:54] [INFO ] Transformed 75 places.
[2023-03-11 10:41:54] [INFO ] Transformed 255 transitions.
[2023-03-11 10:41:54] [INFO ] Found NUPN structural information;
[2023-03-11 10:41:54] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Dekker-PT-015-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 30 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:41:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-11 10:41:54] [INFO ] Computed 45 place invariants in 9 ms
[2023-03-11 10:41:54] [INFO ] Implicit Places using invariants in 411 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 468 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 508 ms. Remains : 74/75 places, 255/255 transitions.
Support contains 61 out of 74 places after structural reductions.
[2023-03-11 10:41:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 10:41:55] [INFO ] Flatten gal took : 160 ms
FORMULA Dekker-PT-015-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 10:41:55] [INFO ] Flatten gal took : 59 ms
[2023-03-11 10:41:55] [INFO ] Input system was already deterministic with 255 transitions.
Support contains 55 out of 74 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=10 ) properties (out of 45) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 10:41:57] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 74 cols
[2023-03-11 10:41:57] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-11 10:41:57] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 10:41:57] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 16 ms returned sat
[2023-03-11 10:41:57] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-11 10:41:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:41:57] [INFO ] After 44ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:41:57] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:41:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-11 10:41:57] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 10:41:57] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 10:41:57] [INFO ] After 51ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 11 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-11 10:41:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:41:59] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1180 ms
[2023-03-11 10:41:59] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 10:41:59] [INFO ] After 1788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 42 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 735600 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{1=1}
Probabilistic random walk after 735600 steps, saw 70259 distinct states, run finished after 3002 ms. (steps per millisecond=245 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-11 10:42:02] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:02] [INFO ] Invariant cache hit.
[2023-03-11 10:42:02] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 10:42:02] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 10:42:03] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-11 10:42:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:42:03] [INFO ] After 22ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-11 10:42:03] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 10:42:03] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-11 10:42:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-11 10:42:03] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 10:42:03] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 10:42:03] [INFO ] After 36ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 470 ms
[2023-03-11 10:42:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-11 10:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-11 10:42:03] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 10:42:03] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 22 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 997440 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 997440 steps, saw 86422 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-11 10:42:07] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:07] [INFO ] Invariant cache hit.
[2023-03-11 10:42:07] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-11 10:42:07] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 10:42:07] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:42:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 10:42:07] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 10:42:07] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:42:07] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2023-03-11 10:42:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2023-03-11 10:42:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 773 ms
[2023-03-11 10:42:08] [INFO ] After 809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 10:42:08] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 31 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1323680 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1323680 steps, saw 98272 distinct states, run finished after 3002 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:42:11] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:11] [INFO ] Invariant cache hit.
[2023-03-11 10:42:11] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2023-03-11 10:42:11] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 10:42:11] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:42:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 10:42:11] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 10:42:11] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:42:11] [INFO ] After 21ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-11 10:42:11] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 10:42:12] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 732 ms
[2023-03-11 10:42:12] [INFO ] After 774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 10:42:12] [INFO ] After 931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 19 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 74/74 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 22 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:42:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:12] [INFO ] Invariant cache hit.
[2023-03-11 10:42:12] [INFO ] Implicit Places using invariants in 276 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 62, 68, 71]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 278 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/74 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 316 ms. Remains : 61/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1351776 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1351776 steps, saw 98287 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 10:42:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2023-03-11 10:42:16] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-11 10:42:16] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 10:42:16] [INFO ] [Real]Absence check using 30 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:42:16] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 10:42:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-11 10:42:16] [INFO ] [Nat]Absence check using 30 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:42:16] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:42:16] [INFO ] After 21ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 378 ms
[2023-03-11 10:42:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 378 ms
[2023-03-11 10:42:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 10:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-11 10:42:16] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 10:42:16] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/61 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 10:42:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:16] [INFO ] Invariant cache hit.
[2023-03-11 10:42:17] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 10:42:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:17] [INFO ] Invariant cache hit.
[2023-03-11 10:42:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 10:42:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-11 10:42:17] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 10:42:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 10:42:17] [INFO ] Invariant cache hit.
[2023-03-11 10:42:17] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 823 ms. Remains : 61/61 places, 255/255 transitions.
Graph (complete) has 95 edges and 61 vertex of which 21 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 170 output transitions
Drop transitions removed 170 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 20 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 16 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 16 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 16 transition count 14
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 12 transition count 12
Applied a total of 83 rules in 21 ms. Remains 12 /61 variables (removed 49) and now considering 12/255 (removed 243) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-11 10:42:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 10:42:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 10:42:17] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 10:42:17] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 10:42:17] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2023-03-11 10:42:17] [INFO ] Flatten gal took : 40 ms
[2023-03-11 10:42:17] [INFO ] Flatten gal took : 44 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 33 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 36 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 30 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 28 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 24 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 27 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 27 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 24 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 23 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 23 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 18 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 23 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 22 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 14 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:42:18] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:42:18] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 10:42:19] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:42:19] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:42:19] [INFO ] Input system was already deterministic with 255 transitions.
[2023-03-11 10:42:19] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:42:19] [INFO ] Flatten gal took : 12 ms
[2023-03-11 10:42:19] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 10:42:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 255 transitions and 1814 arcs took 3 ms.
Total runtime 25140 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: 74 NrTr: 255 NrArc: 1814)

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

net check time: 0m 0.000sec

init dd package: 0m 4.237sec


RS generation: 0m 0.254sec


-> reachability set: #nodes 2284 (2.3e+03) #states 278,528 (5)



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

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

abstracting: (0<=p12)
states: 278,528 (5)
abstracting: (p12<=0)
states: 147,456 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.582sec

checking: EG [[p4<=1 & 1<=p4]]
normalized: EG [[p4<=1 & 1<=p4]]

abstracting: (1<=p4)
states: 131,072 (5)
abstracting: (p4<=1)
states: 278,528 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

checking: EF [EG [[[p52<=0 & 0<=p52] | [p3<=1 & 1<=p3]]]]
normalized: E [true U EG [[[p3<=1 & 1<=p3] | [p52<=0 & 0<=p52]]]]

abstracting: (0<=p52)
states: 278,528 (5)
abstracting: (p52<=0)
states: 147,456 (5)
abstracting: (1<=p3)
states: 147,456 (5)
abstracting: (p3<=1)
states: 278,528 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.350sec

checking: [A [EX [[[p25<=1 & 1<=p25] | ~ [[p73<=0 & 0<=p73]]]] U [[p68<=0 & 0<=p68] | [p39<=1 & 1<=p39]]] & EF [AG [[p25<=1 & 1<=p25]]]]
normalized: [E [true U ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]] & [~ [EG [~ [[[p39<=1 & 1<=p39] | [p68<=0 & 0<=p68]]]]] & ~ [E [~ [[[p39<=1 & 1<=p39] | [p68<=0 & 0<=p68]]] U [~ [EX [[~ [[p73<=0 & 0<=p73]] | [p25<=1 & 1<=p25]]]] & ~ [[[p39<=1 & 1<=p39] | [p68<=0 & 0<=p68]]]]]]]]

abstracting: (0<=p68)
states: 278,528 (5)
abstracting: (p68<=0)
states: 147,456 (5)
abstracting: (1<=p39)
states: 131,072 (5)
abstracting: (p39<=1)
states: 278,528 (5)
abstracting: (1<=p25)
states: 147,456 (5)
abstracting: (p25<=1)
states: 278,528 (5)
abstracting: (0<=p73)
states: 278,528 (5)
abstracting: (p73<=0)
states: 262,144 (5)
.abstracting: (0<=p68)
states: 278,528 (5)
abstracting: (p68<=0)
states: 147,456 (5)
abstracting: (1<=p39)
states: 131,072 (5)
abstracting: (p39<=1)
states: 278,528 (5)
abstracting: (0<=p68)
states: 278,528 (5)
abstracting: (p68<=0)
states: 147,456 (5)
abstracting: (1<=p39)
states: 131,072 (5)
abstracting: (p39<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (1<=p25)
states: 147,456 (5)
abstracting: (p25<=1)
states: 278,528 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: [EF [[[EF [[p36<=1 & 1<=p36]] | [p64<=0 & 0<=p64]] & EG [[AG [[p19<=0 & 0<=p19]] & AX [[p32<=0 & 0<=p32]]]]]] & EF [[[p52<=0 & 0<=p52] & [p68<=1 & 1<=p68]]]]
normalized: [E [true U [[p68<=1 & 1<=p68] & [p52<=0 & 0<=p52]]] & E [true U [EG [[~ [EX [~ [[p32<=0 & 0<=p32]]]] & ~ [E [true U ~ [[p19<=0 & 0<=p19]]]]]] & [[p64<=0 & 0<=p64] | E [true U [p36<=1 & 1<=p36]]]]]]

abstracting: (1<=p36)
states: 131,072 (5)
abstracting: (p36<=1)
states: 278,528 (5)
abstracting: (0<=p64)
states: 278,528 (5)
abstracting: (p64<=0)
states: 262,144 (5)
abstracting: (0<=p19)
states: 278,528 (5)
abstracting: (p19<=0)
states: 131,072 (5)
abstracting: (0<=p32)
states: 278,528 (5)
abstracting: (p32<=0)
states: 262,144 (5)
..
EG iterations: 1
abstracting: (0<=p52)
states: 278,528 (5)
abstracting: (p52<=0)
states: 147,456 (5)
abstracting: (1<=p68)
states: 131,072 (5)
abstracting: (p68<=1)
states: 278,528 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: EX [AX [[[p51<=1 & 1<=p51] & [EF [[p70<=1 & 1<=p70]] | [[AG [[p6<=1 & 1<=p6]] & [p23<=0 & 0<=p23]] & [EF [[p62<=0 & 0<=p62]] & [[p56<=0 & 0<=p56] & [p1<=1 & 1<=p1]]]]]]]]
normalized: EX [~ [EX [~ [[[[[[[p1<=1 & 1<=p1] & [p56<=0 & 0<=p56]] & E [true U [p62<=0 & 0<=p62]]] & [[p23<=0 & 0<=p23] & ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]] | E [true U [p70<=1 & 1<=p70]]] & [p51<=1 & 1<=p51]]]]]]

abstracting: (1<=p51)
states: 131,072 (5)
abstracting: (p51<=1)
states: 278,528 (5)
abstracting: (1<=p70)
states: 16,384 (4)
abstracting: (p70<=1)
states: 278,528 (5)
abstracting: (1<=p6)
states: 131,072 (5)
abstracting: (p6<=1)
states: 278,528 (5)
abstracting: (0<=p23)
states: 278,528 (5)
abstracting: (p23<=0)
states: 131,072 (5)
abstracting: (0<=p62)
states: 278,528 (5)
abstracting: (p62<=0)
states: 147,456 (5)
abstracting: (0<=p56)
states: 278,528 (5)
abstracting: (p56<=0)
states: 262,144 (5)
abstracting: (1<=p1)
states: 147,456 (5)
abstracting: (p1<=1)
states: 278,528 (5)
..-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.296sec

checking: A [~ [EG [[AX [[p35<=1 & 1<=p35]] | [AF [[[p16<=0 & 0<=p16] | [p69<=1 & 1<=p69]]] & EG [[p26<=1 & 1<=p26]]]]]] U AG [E [EF [[[p48<=0 & 0<=p48] & [p8<=1 & 1<=p8]]] U A [~ [[p17<=1 & 1<=p17]] U AX [[[p70<=0 & 0<=p70] | [p2<=1 & 1<=p2]]]]]]]
normalized: [~ [EG [E [true U ~ [E [E [true U [[p8<=1 & 1<=p8] & [p48<=0 & 0<=p48]]] U [~ [EG [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]] & ~ [E [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]] U [[p17<=1 & 1<=p17] & EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]]]]]]]]] & ~ [E [E [true U ~ [E [E [true U [[p8<=1 & 1<=p8] & [p48<=0 & 0<=p48]]] U [~ [EG [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]] & ~ [E [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]] U [[p17<=1 & 1<=p17] & EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]]]]]]] U [EG [[[EG [[p26<=1 & 1<=p26]] & ~ [EG [~ [[[p69<=1 & 1<=p69] | [p16<=0 & 0<=p16]]]]]] | ~ [EX [~ [[p35<=1 & 1<=p35]]]]]] & E [true U ~ [E [E [true U [[p8<=1 & 1<=p8] & [p48<=0 & 0<=p48]]] U [~ [EG [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]] & ~ [E [EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]] U [[p17<=1 & 1<=p17] & EX [~ [[[p2<=1 & 1<=p2] | [p70<=0 & 0<=p70]]]]]]]]]]]]]]]

abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (1<=p17)
states: 147,456 (5)
abstracting: (p17<=1)
states: 278,528 (5)
abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
..
EG iterations: 1
abstracting: (0<=p48)
states: 278,528 (5)
abstracting: (p48<=0)
states: 147,456 (5)
abstracting: (1<=p8)
states: 131,072 (5)
abstracting: (p8<=1)
states: 278,528 (5)
abstracting: (1<=p35)
states: 16,384 (4)
abstracting: (p35<=1)
states: 278,528 (5)
.abstracting: (0<=p16)
states: 278,528 (5)
abstracting: (p16<=0)
states: 147,456 (5)
abstracting: (1<=p69)
states: 131,072 (5)
abstracting: (p69<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (1<=p26)
states: 131,072 (5)
abstracting: (p26<=1)
states: 278,528 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (1<=p17)
states: 147,456 (5)
abstracting: (p17<=1)
states: 278,528 (5)
abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
..
EG iterations: 1
abstracting: (0<=p48)
states: 278,528 (5)
abstracting: (p48<=0)
states: 147,456 (5)
abstracting: (1<=p8)
states: 131,072 (5)
abstracting: (p8<=1)
states: 278,528 (5)
abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (1<=p17)
states: 147,456 (5)
abstracting: (p17<=1)
states: 278,528 (5)
abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
.abstracting: (0<=p70)
states: 278,528 (5)
abstracting: (p70<=0)
states: 262,144 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
..
EG iterations: 1
abstracting: (0<=p48)
states: 278,528 (5)
abstracting: (p48<=0)
states: 147,456 (5)
abstracting: (1<=p8)
states: 131,072 (5)
abstracting: (p8<=1)
states: 278,528 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.225sec

checking: EX [AG [[~ [A [[[p38<=0 & 0<=p38] | [p65<=1 & 1<=p65]] U [p54<=0 & 0<=p54]]] | A [[[[p57<=0 & 0<=p57] | [[p29<=1 & 1<=p29] | [p60<=1 & 1<=p60]]] & [[p45<=0 & 0<=p45] | [p21<=1 & 1<=p21]]] U [p14<=0 & 0<=p14]]]]]
normalized: EX [~ [E [true U ~ [[[~ [EG [~ [[p14<=0 & 0<=p14]]]] & ~ [E [~ [[p14<=0 & 0<=p14]] U [~ [[[[p21<=1 & 1<=p21] | [p45<=0 & 0<=p45]] & [[[p60<=1 & 1<=p60] | [p29<=1 & 1<=p29]] | [p57<=0 & 0<=p57]]]] & ~ [[p14<=0 & 0<=p14]]]]]] | ~ [[~ [EG [~ [[p54<=0 & 0<=p54]]]] & ~ [E [~ [[p54<=0 & 0<=p54]] U [~ [[[p65<=1 & 1<=p65] | [p38<=0 & 0<=p38]]] & ~ [[p54<=0 & 0<=p54]]]]]]]]]]]]

abstracting: (0<=p54)
states: 278,528 (5)
abstracting: (p54<=0)
states: 147,456 (5)
abstracting: (0<=p38)
states: 278,528 (5)
abstracting: (p38<=0)
states: 262,144 (5)
abstracting: (1<=p65)
states: 131,072 (5)
abstracting: (p65<=1)
states: 278,528 (5)
abstracting: (0<=p54)
states: 278,528 (5)
abstracting: (p54<=0)
states: 147,456 (5)
abstracting: (0<=p54)
states: 278,528 (5)
abstracting: (p54<=0)
states: 147,456 (5)
.
EG iterations: 1
abstracting: (0<=p14)
states: 278,528 (5)
abstracting: (p14<=0)
states: 147,456 (5)
abstracting: (0<=p57)
states: 278,528 (5)
abstracting: (p57<=0)
states: 147,456 (5)
abstracting: (1<=p29)
states: 147,456 (5)
abstracting: (p29<=1)
states: 278,528 (5)
abstracting: (1<=p60)
states: 131,072 (5)
abstracting: (p60<=1)
states: 278,528 (5)
abstracting: (0<=p45)
states: 278,528 (5)
abstracting: (p45<=0)
states: 147,456 (5)
abstracting: (1<=p21)
states: 147,456 (5)
abstracting: (p21<=1)
states: 278,528 (5)
abstracting: (0<=p14)
states: 278,528 (5)
abstracting: (p14<=0)
states: 147,456 (5)
abstracting: (0<=p14)
states: 278,528 (5)
abstracting: (p14<=0)
states: 147,456 (5)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.637sec

checking: E [E [EF [[[p21<=0 & 0<=p21] | [p24<=1 & 1<=p24]]] U ~ [A [~ [EX [0<=0]] U [AG [[p64<=0 & 0<=p64]] | ~ [[p6<=1 & 1<=p6]]]]]] U ~ [[AF [[[p25<=0 & 0<=p25] | [[p66<=1 & 1<=p66] | A [[[p22<=0 & 0<=p22] | [p45<=1 & 1<=p45]] U [p30<=1 & 1<=p30]]]]] | [EF [EG [[p49<=1 & 1<=p49]]] & [~ [AF [[p64<=1 & 1<=p64]]] & ~ [AF [EX [[p15<=1 & 1<=p15]]]]]]]]]
normalized: E [E [E [true U [[p24<=1 & 1<=p24] | [p21<=0 & 0<=p21]]] U ~ [[~ [EG [~ [[~ [[p6<=1 & 1<=p6]] | ~ [E [true U ~ [[p64<=0 & 0<=p64]]]]]]]] & ~ [E [~ [[~ [[p6<=1 & 1<=p6]] | ~ [E [true U ~ [[p64<=0 & 0<=p64]]]]]] U [EX [0<=0] & ~ [[~ [[p6<=1 & 1<=p6]] | ~ [E [true U ~ [[p64<=0 & 0<=p64]]]]]]]]]]]] U ~ [[[[EG [~ [EX [[p15<=1 & 1<=p15]]]] & EG [~ [[p64<=1 & 1<=p64]]]] & E [true U EG [[p49<=1 & 1<=p49]]]] | ~ [EG [~ [[[[~ [EG [~ [[p30<=1 & 1<=p30]]]] & ~ [E [~ [[p30<=1 & 1<=p30]] U [~ [[[p45<=1 & 1<=p45] | [p22<=0 & 0<=p22]]] & ~ [[p30<=1 & 1<=p30]]]]]] | [p66<=1 & 1<=p66]] | [p25<=0 & 0<=p25]]]]]]]]

abstracting: (0<=p25)
states: 278,528 (5)
abstracting: (p25<=0)
states: 131,072 (5)
abstracting: (1<=p66)
states: 131,072 (5)
abstracting: (p66<=1)
states: 278,528 (5)
abstracting: (1<=p30)
states: 131,072 (5)
abstracting: (p30<=1)
states: 278,528 (5)
abstracting: (0<=p22)
states: 278,528 (5)
abstracting: (p22<=0)
states: 147,456 (5)
abstracting: (1<=p45)
states: 131,072 (5)
abstracting: (p45<=1)
states: 278,528 (5)
abstracting: (1<=p30)
states: 131,072 (5)
abstracting: (p30<=1)
states: 278,528 (5)
abstracting: (1<=p30)
states: 131,072 (5)
abstracting: (p30<=1)
states: 278,528 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p49)
states: 131,072 (5)
abstracting: (p49<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (1<=p64)
states: 16,384 (4)
abstracting: (p64<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (1<=p15)
states: 147,456 (5)
abstracting: (p15<=1)
states: 278,528 (5)
..
EG iterations: 1
abstracting: (0<=p64)
states: 278,528 (5)
abstracting: (p64<=0)
states: 262,144 (5)
abstracting: (1<=p6)
states: 131,072 (5)
abstracting: (p6<=1)
states: 278,528 (5)
abstracting: (0<=0)
states: 278,528 (5)
.abstracting: (0<=p64)
states: 278,528 (5)
abstracting: (p64<=0)
states: 262,144 (5)
abstracting: (1<=p6)
states: 131,072 (5)
abstracting: (p6<=1)
states: 278,528 (5)
abstracting: (0<=p64)
states: 278,528 (5)
abstracting: (p64<=0)
states: 262,144 (5)
abstracting: (1<=p6)
states: 131,072 (5)
abstracting: (p6<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (0<=p21)
states: 278,528 (5)
abstracting: (p21<=0)
states: 131,072 (5)
abstracting: (1<=p24)
states: 131,072 (5)
abstracting: (p24<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.030sec

checking: [[EF [[AX [[p18<=1 & 1<=p18]] & EF [[p54<=1 & 1<=p54]]]] & AF [~ [E [[[[[p2<=0 & 0<=p2] | [p46<=1 & 1<=p46]] & [[p63<=0 & 0<=p63] | [p16<=1 & 1<=p16]]] | [[[p0<=0 & 0<=p0] | [p16<=1 & 1<=p16]] & [[p35<=0 & 0<=p35] | [p53<=1 & 1<=p53]]]] U [[p48<=0 & 0<=p48] | [[p2<=1 & 1<=p2] | [p5<=1 & 1<=p5]]]]]]] | [EX [[p72<=1 & 1<=p72]] & AG [EF [[[p71<=0 & 0<=p71] & [p66<=1 & 1<=p66]]]]]]
normalized: [[~ [EG [E [[[[[p16<=1 & 1<=p16] | [p63<=0 & 0<=p63]] & [[p46<=1 & 1<=p46] | [p2<=0 & 0<=p2]]] | [[[p53<=1 & 1<=p53] | [p35<=0 & 0<=p35]] & [[p16<=1 & 1<=p16] | [p0<=0 & 0<=p0]]]] U [[[p5<=1 & 1<=p5] | [p2<=1 & 1<=p2]] | [p48<=0 & 0<=p48]]]]] & E [true U [E [true U [p54<=1 & 1<=p54]] & ~ [EX [~ [[p18<=1 & 1<=p18]]]]]]] | [~ [E [true U ~ [E [true U [[p66<=1 & 1<=p66] & [p71<=0 & 0<=p71]]]]]] & EX [[p72<=1 & 1<=p72]]]]

abstracting: (1<=p72)
states: 131,072 (5)
abstracting: (p72<=1)
states: 278,528 (5)
.abstracting: (0<=p71)
states: 278,528 (5)
abstracting: (p71<=0)
states: 147,456 (5)
abstracting: (1<=p66)
states: 131,072 (5)
abstracting: (p66<=1)
states: 278,528 (5)
abstracting: (1<=p18)
states: 131,072 (5)
abstracting: (p18<=1)
states: 278,528 (5)
.abstracting: (1<=p54)
states: 131,072 (5)
abstracting: (p54<=1)
states: 278,528 (5)
abstracting: (0<=p48)
states: 278,528 (5)
abstracting: (p48<=0)
states: 147,456 (5)
abstracting: (1<=p2)
states: 131,072 (5)
abstracting: (p2<=1)
states: 278,528 (5)
abstracting: (1<=p5)
states: 147,456 (5)
abstracting: (p5<=1)
states: 278,528 (5)
abstracting: (0<=p0)
states: 278,528 (5)
abstracting: (p0<=0)
states: 147,456 (5)
abstracting: (1<=p16)
states: 131,072 (5)
abstracting: (p16<=1)
states: 278,528 (5)
abstracting: (0<=p35)
states: 278,528 (5)
abstracting: (p35<=0)
states: 262,144 (5)
abstracting: (1<=p53)
states: 16,384 (4)
abstracting: (p53<=1)
states: 278,528 (5)
abstracting: (0<=p2)
states: 278,528 (5)
abstracting: (p2<=0)
states: 147,456 (5)
abstracting: (1<=p46)
states: 131,072 (5)
abstracting: (p46<=1)
states: 278,528 (5)
abstracting: (0<=p63)
states: 278,528 (5)
abstracting: (p63<=0)
states: 147,456 (5)
abstracting: (1<=p16)
states: 131,072 (5)
abstracting: (p16<=1)
states: 278,528 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.229sec

checking: EX [[[[[[[[p53<=0 & 0<=p53] | [p15<=0 & 0<=p15]] | [[p62<=1 & 1<=p62] | [EF [[[p34<=0 & 0<=p34] | [p72<=1 & 1<=p72]]] | [p44<=1 & 1<=p44]]]] | [[[p45<=0 & 0<=p45] | [[p29<=1 & 1<=p29] | [p39<=0 & 0<=p39]]] | [[[p57<=0 & 0<=p57] & [p5<=1 & 1<=p5]] | [[[p33<=0 & 0<=p33] & [p70<=1 & 1<=p70]] | [[p63<=1 & 1<=p63] & [p26<=0 & 0<=p26]]]]]] & [p46<=1 & 1<=p46]] | [p1<=1 & 1<=p1]] & [[[p61<=0 & 0<=p61] | [p56<=1 & 1<=p56]] | [[p60<=1 & 1<=p60] | [E [~ [[[p42<=0 & 0<=p42] | [p52<=1 & 1<=p52]]] U [p4<=1 & 1<=p4]] | [p26<=1 & 1<=p26]]]]]]
normalized: EX [[[[[[p26<=1 & 1<=p26] | E [~ [[[p52<=1 & 1<=p52] | [p42<=0 & 0<=p42]]] U [p4<=1 & 1<=p4]]] | [p60<=1 & 1<=p60]] | [[p56<=1 & 1<=p56] | [p61<=0 & 0<=p61]]] & [[p1<=1 & 1<=p1] | [[p46<=1 & 1<=p46] & [[[[[[p26<=0 & 0<=p26] & [p63<=1 & 1<=p63]] | [[p70<=1 & 1<=p70] & [p33<=0 & 0<=p33]]] | [[p5<=1 & 1<=p5] & [p57<=0 & 0<=p57]]] | [[[p39<=0 & 0<=p39] | [p29<=1 & 1<=p29]] | [p45<=0 & 0<=p45]]] | [[[[p44<=1 & 1<=p44] | E [true U [[p72<=1 & 1<=p72] | [p34<=0 & 0<=p34]]]] | [p62<=1 & 1<=p62]] | [[p15<=0 & 0<=p15] | [p53<=0 & 0<=p53]]]]]]]]

abstracting: (0<=p53)
states: 278,528 (5)
abstracting: (p53<=0)
states: 262,144 (5)
abstracting: (0<=p15)
states: 278,528 (5)
abstracting: (p15<=0)
states: 131,072 (5)
abstracting: (1<=p62)
states: 131,072 (5)
abstracting: (p62<=1)
states: 278,528 (5)
abstracting: (0<=p34)
states: 278,528 (5)
abstracting: (p34<=0)
states: 147,456 (5)
abstracting: (1<=p72)
states: 131,072 (5)
abstracting: (p72<=1)
states: 278,528 (5)
abstracting: (1<=p44)
states: 16,384 (4)
abstracting: (p44<=1)
states: 278,528 (5)
abstracting: (0<=p45)
states: 278,528 (5)
abstracting: (p45<=0)
states: 147,456 (5)
abstracting: (1<=p29)
states: 147,456 (5)
abstracting: (p29<=1)
states: 278,528 (5)
abstracting: (0<=p39)
states: 278,528 (5)
abstracting: (p39<=0)
states: 147,456 (5)
abstracting: (0<=p57)
states: 278,528 (5)
abstracting: (p57<=0)
states: 147,456 (5)
abstracting: (1<=p5)
states: 147,456 (5)
abstracting: (p5<=1)
states: 278,528 (5)
abstracting: (0<=p33)
states: 278,528 (5)
abstracting: (p33<=0)
states: 147,456 (5)
abstracting: (1<=p70)
states: 16,384 (4)
abstracting: (p70<=1)
states: 278,528 (5)
abstracting: (1<=p63)
states: 131,072 (5)
abstracting: (p63<=1)
states: 278,528 (5)
abstracting: (0<=p26)
states: 278,528 (5)
abstracting: (p26<=0)
states: 147,456 (5)
abstracting: (1<=p46)
states: 131,072 (5)
abstracting: (p46<=1)
states: 278,528 (5)
abstracting: (1<=p1)
states: 147,456 (5)
abstracting: (p1<=1)
states: 278,528 (5)
abstracting: (0<=p61)
states: 278,528 (5)
abstracting: (p61<=0)
states: 262,144 (5)
abstracting: (1<=p56)
states: 16,384 (4)
abstracting: (p56<=1)
states: 278,528 (5)
abstracting: (1<=p60)
states: 131,072 (5)
abstracting: (p60<=1)
states: 278,528 (5)
abstracting: (1<=p4)
states: 131,072 (5)
abstracting: (p4<=1)
states: 278,528 (5)
abstracting: (0<=p42)
states: 278,528 (5)
abstracting: (p42<=0)
states: 147,456 (5)
abstracting: (1<=p52)
states: 131,072 (5)
abstracting: (p52<=1)
states: 278,528 (5)
abstracting: (1<=p26)
states: 131,072 (5)
abstracting: (p26<=1)
states: 278,528 (5)
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.475sec

totally nodes used: 953223 (9.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1134301 8926929 10061230
used/not used/entry size/cache size: 8999189 58109675 16 1024MB
basic ops cache: hits/miss/sum: 155758 800401 956159
used/not used/entry size/cache size: 1210866 15566350 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: 7496 49101 56597
used/not used/entry size/cache size: 48979 8339629 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 66249979
1 776763
2 71077
3 9951
4 1019
5 73
6 2
7 0
8 0
9 0
>= 10 0

Total processing time: 0m10.772sec


BK_STOP 1678531351152

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


iterations count:4971 (19), effective:171 (0)

initing FirstDep: 0m 0.001sec


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

iterations count:529 (2), effective:3 (0)

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

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

iterations count:552 (2), effective:5 (0)

iterations count:4368 (17), effective:162 (0)

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

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

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

iterations count:281 (1), effective:4 (0)

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

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

iterations count:281 (1), effective:4 (0)

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

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

iterations count:281 (1), effective:4 (0)

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

iterations count:2309 (9), effective:64 (0)

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

iterations count:378 (1), effective:4 (0)

iterations count:601 (2), effective:4 (0)

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

iterations count:6248 (24), effective:210 (0)

iterations count:6248 (24), effective:210 (0)

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

iterations count:6248 (24), effective:210 (0)

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

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

iterations count:5207 (20), effective:186 (0)

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

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

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

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

iterations count:293 (1), effective:3 (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="Dekker-PT-015"
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 Dekker-PT-015, 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 r138-smll-167819419200009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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