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.r106-tall-167814482700425.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 DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 57K 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 DES-PT-20a-CTLCardinality-00
FORMULA_NAME DES-PT-20a-CTLCardinality-01
FORMULA_NAME DES-PT-20a-CTLCardinality-02
FORMULA_NAME DES-PT-20a-CTLCardinality-03
FORMULA_NAME DES-PT-20a-CTLCardinality-04
FORMULA_NAME DES-PT-20a-CTLCardinality-05
FORMULA_NAME DES-PT-20a-CTLCardinality-06
FORMULA_NAME DES-PT-20a-CTLCardinality-07
FORMULA_NAME DES-PT-20a-CTLCardinality-08
FORMULA_NAME DES-PT-20a-CTLCardinality-09
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678389577992

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=DES-PT-20a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:19:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 19:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:19:39] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-09 19:19:39] [INFO ] Transformed 195 places.
[2023-03-09 19:19:39] [INFO ] Transformed 152 transitions.
[2023-03-09 19:19:39] [INFO ] Found NUPN structural information;
[2023-03-09 19:19:39] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 17 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2023-03-09 19:19:39] [INFO ] Computed 59 place invariants in 32 ms
[2023-03-09 19:19:40] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-09 19:19:40] [INFO ] Invariant cache hit.
[2023-03-09 19:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 19:19:40] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 820 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 10 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 848 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 65 out of 194 places after structural reductions.
[2023-03-09 19:19:40] [INFO ] Flatten gal took : 38 ms
[2023-03-09 19:19:40] [INFO ] Flatten gal took : 17 ms
[2023-03-09 19:19:40] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 63 out of 194 places (down from 65) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 40) seen :24
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 138 rows 194 cols
[2023-03-09 19:19:41] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-09 19:19:41] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-09 19:19:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 19:19:41] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 19:19:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-09 19:19:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 160 ms returned sat
[2023-03-09 19:19:42] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-09 19:19:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
[2023-03-09 19:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 19:19:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-09 19:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 19:19:43] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-09 19:19:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-09 19:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-09 19:19:43] [INFO ] After 1735ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 737 ms.
[2023-03-09 19:19:44] [INFO ] After 2910ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 11 properties in 355 ms.
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 193 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 193 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 192 transition count 134
Applied a total of 10 rules in 54 ms. Remains 192 /194 variables (removed 2) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 192/194 places, 134/138 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 926432 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 926432 steps, saw 131856 distinct states, run finished after 3004 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 19:19:48] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 19:19:48] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 19:19:48] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:19:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-09 19:19:48] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:19:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 19:19:48] [INFO ] After 49ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 19:19:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-09 19:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 19:19:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2023-03-09 19:19:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2023-03-09 19:19:48] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2023-03-09 19:19:49] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-09 19:19:49] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-09 19:19:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 249 ms
[2023-03-09 19:19:49] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-03-09 19:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 19:19:49] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 19:19:49] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 138 ms.
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-09 19:19:49] [INFO ] Invariant cache hit.
[2023-03-09 19:19:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 19:19:49] [INFO ] Invariant cache hit.
[2023-03-09 19:19:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 19:19:49] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-09 19:19:49] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 19:19:49] [INFO ] Invariant cache hit.
[2023-03-09 19:19:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 19:19:49] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 19:19:49] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 19:19:49] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:19:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2023-03-09 19:19:50] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:19:50] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-09 19:19:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 19:19:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-09 19:19:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2023-03-09 19:19:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2023-03-09 19:19:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 240 ms
[2023-03-09 19:19:50] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 19:19:50] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 12 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 12 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 138 transitions.
FORMULA DES-PT-20a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 92 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 11 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 11 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 194/194 places, 138/138 transitions.
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 11 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 136
Applied a total of 2 rules in 10 ms. Remains 192 /194 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 192/194 places, 136/138 transitions.
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:19:50] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:19:50] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 233 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2000953 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :{}
Probabilistic random walk after 2000953 steps, saw 271250 distinct states, run finished after 3002 ms. (steps per millisecond=666 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 192 cols
[2023-03-09 19:19:53] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-09 19:19:53] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:53] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 19:19:53] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:19:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-09 19:19:54] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 66 ms returned sat
[2023-03-09 19:19:54] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:19:54] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 19:19:54] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 231 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 136/136 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 192 transition count 134
Applied a total of 4 rules in 12 ms. Remains 192 /192 variables (removed 0) and now considering 134/136 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 192/192 places, 134/136 transitions.
Incomplete random walk after 1000000 steps, including 16329 resets, run finished after 2040 ms. (steps per millisecond=490 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2939 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3787624 steps, run timeout after 6001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 3787624 steps, saw 503198 distinct states, run finished after 6003 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 19:20:03] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 19:20:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 19:20:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 19:20:03] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 19:20:03] [INFO ] After 84ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 19:20:03] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1084 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=216 )
FORMULA DES-PT-20a-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 5 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:03] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:03] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 136
Applied a total of 2 rules in 10 ms. Remains 192 /194 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 192/194 places, 136/138 transitions.
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:03] [INFO ] Flatten gal took : 6 ms
[2023-03-09 19:20:03] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1961125 steps, run timeout after 3001 ms. (steps per millisecond=653 ) properties seen :{}
Probabilistic random walk after 1961125 steps, saw 266272 distinct states, run finished after 3001 ms. (steps per millisecond=653 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 192 cols
[2023-03-09 19:20:06] [INFO ] Computed 58 place invariants in 15 ms
[2023-03-09 19:20:06] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 19:20:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-09 19:20:06] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-09 19:20:06] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 19:20:06] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 19:20:06] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 651 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=162 )
FORMULA DES-PT-20a-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:07] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 8 ms
[2023-03-09 19:20:07] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 194/194 places, 138/138 transitions.
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 10 ms
[2023-03-09 19:20:07] [INFO ] Input system was already deterministic with 138 transitions.
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 9 ms
[2023-03-09 19:20:07] [INFO ] Flatten gal took : 7 ms
[2023-03-09 19:20:07] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-09 19:20:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 138 transitions and 675 arcs took 4 ms.
Total runtime 27706 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: 194 NrTr: 138 NrArc: 675)

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

net check time: 0m 0.000sec

init dd package: 0m 2.755sec


RS generation: 0m42.822sec


-> reachability set: #nodes 821984 (8.2e+05) #states 7,969,347,823,493 (12)



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

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

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA DES-PT-20a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.167sec

checking: EG [[[p136<=0 & 0<=p136] | [p149<=1 & 1<=p149]]]
normalized: EG [[[p136<=0 & 0<=p136] | [p149<=1 & 1<=p149]]]

abstracting: (1<=p149)
states: 5,030,738,730,184 (12)
abstracting: (p149<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p136)
states: 7,969,347,823,493 (12)
abstracting: (p136<=0)
states: 5,030,738,730,185 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.494sec

checking: EF [AX [[[p149<=0 & 0<=p149] | [p161<=1 & 1<=p161]]]]
normalized: E [true U ~ [EX [~ [[[p161<=1 & 1<=p161] | [p149<=0 & 0<=p149]]]]]]

abstracting: (0<=p149)
states: 7,969,347,823,493 (12)
abstracting: (p149<=0)
states: 2,938,609,093,309 (12)
abstracting: (1<=p161)
states: 2,660,803,732,557 (12)
abstracting: (p161<=1)
states: 7,969,347,823,493 (12)
.
before gc: list nodes free: 43083

after gc: idd nodes used:4379489, unused:59620511; list nodes free:267572892
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m20.928sec

checking: AG [E [EX [0<=0] U [[1<=p29 & p29<=1] | AX [[[p91<=0 & 0<=p91] | [p102<=1 & 1<=p102]]]]]]
normalized: ~ [E [true U ~ [E [EX [0<=0] U [~ [EX [~ [[[p102<=1 & 1<=p102] | [p91<=0 & 0<=p91]]]]] | [1<=p29 & p29<=1]]]]]]

abstracting: (p29<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p29)
states: 459,379,921,544 (11)
abstracting: (0<=p91)
states: 7,969,347,823,493 (12)
abstracting: (p91<=0)
states: 5,077,779,951,284 (12)
abstracting: (1<=p102)
states: 1,870,142,561,358 (12)
abstracting: (p102<=1)
states: 7,969,347,823,493 (12)
.abstracting: (0<=0)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 1989436

after gc: idd nodes used:4777976, unused:59222024; list nodes free:267783162
.-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m16.158sec

checking: EF [[[p55<=1 & 1<=p55] & [AG [EF [[p126<=0 & 0<=p126]]] | EF [EX [[[p162<=0 & 0<=p162] | [p105<=1 & 1<=p105]]]]]]]
normalized: E [true U [[~ [E [true U ~ [E [true U [p126<=0 & 0<=p126]]]]] | E [true U EX [[[p105<=1 & 1<=p105] | [p162<=0 & 0<=p162]]]]] & [p55<=1 & 1<=p55]]]

abstracting: (1<=p55)
states: 419,493,839,120 (11)
abstracting: (p55<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p162)
states: 7,969,347,823,493 (12)
abstracting: (p162<=0)
states: 3,223,711,939,282 (12)
abstracting: (1<=p105)
states: 3,761,839,043,938 (12)
abstracting: (p105<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 1474853

after gc: idd nodes used:4397419, unused:59602581; list nodes free:269564610
.abstracting: (0<=p126)
states: 7,969,347,823,493 (12)
abstracting: (p126<=0)
states: 5,030,738,730,185 (12)

before gc: list nodes free: 195480

after gc: idd nodes used:6908126, unused:57091874; list nodes free:258186721

before gc: list nodes free: 767122

after gc: idd nodes used:3280897, unused:60719103; list nodes free:274647436
MC time: 10m26.170sec

checking: EF [[EG [[p19<=1 & 1<=p19]] | [E [AF [EX [[p75<=0 & 0<=p75]]] U EX [[[p63<=0 & 0<=p63] & [p56<=0 & 0<=p56]]]] & EX [AG [[p186<=1 & 1<=p186]]]]]]
normalized: E [true U [[EX [~ [E [true U ~ [[p186<=1 & 1<=p186]]]]] & E [~ [EG [~ [EX [[p75<=0 & 0<=p75]]]]] U EX [[[p56<=0 & 0<=p56] & [p63<=0 & 0<=p63]]]]] | EG [[p19<=1 & 1<=p19]]]]

abstracting: (1<=p19)
states: 339,938,828,086 (11)
abstracting: (p19<=1)
states: 7,969,347,823,493 (12)
..........
before gc: list nodes free: 3255867

after gc: idd nodes used:5557912, unused:58442088; list nodes free:264287900
......
before gc: list nodes free: 966025

after gc: idd nodes used:10644734, unused:53355266; list nodes free:243144635
.
before gc: list nodes free: 115388

after gc: idd nodes used:13360179, unused:50639821; list nodes free:231051542
.
before gc: list nodes free: 1791253

after gc: idd nodes used:14253555, unused:49746445; list nodes free:228708694
.
before gc: list nodes free: 2654729

after gc: idd nodes used:13984984, unused:50015016; list nodes free:230211184
MC time: 8m23.443sec

checking: [EG [[AF [E [[[p131<=1 & 1<=p131] & [[p101<=0 & 0<=p101] | [p108<=1 & 1<=p108]]] U [[[p185<=0 & 0<=p185] | [p116<=1 & 1<=p116]] & [[p127<=0 & 0<=p127] | [p137<=1 & 1<=p137]]]]] & AG [AX [EG [[p132<=1 & 1<=p132]]]]]] | AF [EG [[[[p34<=0 & 0<=p34] | [p104<=1 & 1<=p104]] & EG [[[p180<=0 & 0<=p180] | [p96<=1 & 1<=p96]]]]]]]
normalized: [~ [EG [~ [EG [[EG [[[p96<=1 & 1<=p96] | [p180<=0 & 0<=p180]]] & [[p104<=1 & 1<=p104] | [p34<=0 & 0<=p34]]]]]]] | EG [[~ [E [true U EX [~ [EG [[p132<=1 & 1<=p132]]]]]] & ~ [EG [~ [E [[[[p108<=1 & 1<=p108] | [p101<=0 & 0<=p101]] & [p131<=1 & 1<=p131]] U [[[p137<=1 & 1<=p137] | [p127<=0 & 0<=p127]] & [[p116<=1 & 1<=p116] | [p185<=0 & 0<=p185]]]]]]]]]]

abstracting: (0<=p185)
states: 7,969,347,823,493 (12)
abstracting: (p185<=0)
states: 6,078,581,842,496 (12)
abstracting: (1<=p116)
states: 624,269,451,191 (11)
abstracting: (p116<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p127)
states: 7,969,347,823,493 (12)
abstracting: (p127<=0)
states: 2,938,609,093,309 (12)
abstracting: (1<=p137)
states: 5,030,738,730,184 (12)
abstracting: (p137<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p131)
states: 5,030,738,730,184 (12)
abstracting: (p131<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p101)
states: 7,969,347,823,493 (12)
abstracting: (p101<=0)
states: 5,942,504,255,575 (12)
abstracting: (1<=p108)
states: 3,966,186,324,855 (12)
abstracting: (p108<=1)
states: 7,969,347,823,493 (12)
...
before gc: list nodes free: 2786204

after gc: idd nodes used:9951198, unused:54048802; list nodes free:248655418
...
before gc: list nodes free: 5040963

after gc: idd nodes used:9194519, unused:54805481; list nodes free:252188444

before gc: list nodes free: 4617776

after gc: idd nodes used:15203303, unused:48796697; list nodes free:224562071
.
before gc: list nodes free: 4075796

after gc: idd nodes used:14686632, unused:49313368; list nodes free:227031419
MC time: 6m40.204sec

checking: E [[EX [AF [[[p130<=0 & 0<=p130] | ~ [[p184<=0 & 0<=p184]]]]] & A [AF [[[p174<=0 & 0<=p174] | [[p100<=1 & 1<=p100] | [p184<=0 & 0<=p184]]]] U AG [[[p102<=1 & 1<=p102] | [[p100<=1 & 1<=p100] & [p87<=1 & 1<=p87]]]]]] U [~ [EX [[[[p27<=0 & 0<=p27] | [p23<=1 & 1<=p23]] & [[p145<=0 & 0<=p145] | [p150<=1 & 1<=p150]]]]] & EG [[EX [0<=0] & ~ [[[p174<=0 & 0<=p174] | [p113<=1 & 1<=p113]]]]]]]
normalized: E [[[~ [EG [E [true U ~ [[[[p87<=1 & 1<=p87] & [p100<=1 & 1<=p100]] | [p102<=1 & 1<=p102]]]]]] & ~ [E [E [true U ~ [[[[p87<=1 & 1<=p87] & [p100<=1 & 1<=p100]] | [p102<=1 & 1<=p102]]]] U [EG [~ [[[[p184<=0 & 0<=p184] | [p100<=1 & 1<=p100]] | [p174<=0 & 0<=p174]]]] & E [true U ~ [[[[p87<=1 & 1<=p87] & [p100<=1 & 1<=p100]] | [p102<=1 & 1<=p102]]]]]]]] & EX [~ [EG [~ [[~ [[p184<=0 & 0<=p184]] | [p130<=0 & 0<=p130]]]]]]] U [EG [[~ [[[p113<=1 & 1<=p113] | [p174<=0 & 0<=p174]]] & EX [0<=0]]] & ~ [EX [[[[p150<=1 & 1<=p150] | [p145<=0 & 0<=p145]] & [[p23<=1 & 1<=p23] | [p27<=0 & 0<=p27]]]]]]]

abstracting: (0<=p27)
states: 7,969,347,823,493 (12)
abstracting: (p27<=0)
states: 7,509,967,901,949 (12)
abstracting: (1<=p23)
states: 459,379,525,316 (11)
abstracting: (p23<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p145)
states: 7,969,347,823,493 (12)
abstracting: (p145<=0)
states: 2,938,609,093,309 (12)
abstracting: (1<=p150)
states: 2,938,609,093,308 (12)
abstracting: (p150<=1)
states: 7,969,347,823,493 (12)
.abstracting: (0<=0)
states: 7,969,347,823,493 (12)
.abstracting: (0<=p174)
states: 7,969,347,823,493 (12)
abstracting: (p174<=0)
states: 7,819,928,781,882 (12)
abstracting: (1<=p113)
states: 2,684,218,259,508 (12)
abstracting: (p113<=1)
states: 7,969,347,823,493 (12)
.........
before gc: list nodes free: 5899523

after gc: idd nodes used:7999270, unused:56000730; list nodes free:257536239
.....
before gc: list nodes free: 4530382

after gc: idd nodes used:9010117, unused:54989883; list nodes free:252997170
.MC time: 5m20.657sec

checking: [AF [[[[EF [[[p193<=0 & 0<=p193] & [p71<=1 & 1<=p71]]] | [p85<=0 & 0<=p85]] | ~ [A [EF [[[p187<=0 & 0<=p187] | [p41<=1 & 1<=p41]]] U [[p183<=0 & 0<=p183] | [p24<=0 & 0<=p24]]]]] & AX [AG [[[p113<=0 & 0<=p113] | [p147<=1 & 1<=p147]]]]]] | ~ [E [AG [~ [[~ [[[p182<=0 & 0<=p182] | [p123<=1 & 1<=p123]]] & EX [[p35<=1 & 1<=p35]]]]] U [~ [[AG [[p103<=0 & 0<=p103]] & E [[p22<=1 & 1<=p22] U [[p119<=0 & 0<=p119] | [p11<=1 & 1<=p11]]]]] | [[AF [[[p56<=0 & 0<=p56] | [p179<=1 & 1<=p179]]] & EX [[[p9<=0 & 0<=p9] | [p134<=1 & 1<=p134]]]] | [EF [[[p102<=0 & 0<=p102] | [p49<=1 & 1<=p49]]] & AX [~ [[[p50<=0 & 0<=p50] | [p121<=1 & 1<=p121]]]]]]]]]]
normalized: [~ [E [~ [E [true U [EX [[p35<=1 & 1<=p35]] & ~ [[[p123<=1 & 1<=p123] | [p182<=0 & 0<=p182]]]]]] U [[[E [true U [[p49<=1 & 1<=p49] | [p102<=0 & 0<=p102]]] & ~ [EX [[[p121<=1 & 1<=p121] | [p50<=0 & 0<=p50]]]]] | [EX [[[p134<=1 & 1<=p134] | [p9<=0 & 0<=p9]]] & ~ [EG [~ [[[p179<=1 & 1<=p179] | [p56<=0 & 0<=p56]]]]]]] | ~ [[E [[p22<=1 & 1<=p22] U [[p11<=1 & 1<=p11] | [p119<=0 & 0<=p119]]] & ~ [E [true U ~ [[p103<=0 & 0<=p103]]]]]]]]] | ~ [EG [~ [[~ [EX [E [true U ~ [[[p147<=1 & 1<=p147] | [p113<=0 & 0<=p113]]]]]] & [~ [[~ [EG [~ [[[p24<=0 & 0<=p24] | [p183<=0 & 0<=p183]]]]] & ~ [E [~ [[[p24<=0 & 0<=p24] | [p183<=0 & 0<=p183]]] U [~ [E [true U [[p41<=1 & 1<=p41] | [p187<=0 & 0<=p187]]]] & ~ [[[p24<=0 & 0<=p24] | [p183<=0 & 0<=p183]]]]]]]] | [[p85<=0 & 0<=p85] | E [true U [[p71<=1 & 1<=p71] & [p193<=0 & 0<=p193]]]]]]]]]]

abstracting: (0<=p193)
states: 7,969,347,823,493 (12)
abstracting: (p193<=0)
states: 6,461,485,668,958 (12)
abstracting: (1<=p71)
states: 459,379,921,544 (11)
abstracting: (p71<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 3297153

after gc: idd nodes used:5310068, unused:58689932; list nodes free:269727628
abstracting: (0<=p85)
states: 7,969,347,823,493 (12)
abstracting: (p85<=0)
states: 5,317,600,605,089 (12)
abstracting: (0<=p183)
states: 7,969,347,823,493 (12)
abstracting: (p183<=0)
states: 7,180,730,308,382 (12)
abstracting: (0<=p24)
states: 7,969,347,823,493 (12)
abstracting: (p24<=0)
states: 7,509,967,901,949 (12)
abstracting: (0<=p187)
states: 7,969,347,823,493 (12)
abstracting: (p187<=0)
states: 5,928,481,387,623 (12)
abstracting: (1<=p41)
states: 43,156 (4)
abstracting: (p41<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p183)
states: 7,969,347,823,493 (12)
abstracting: (p183<=0)
states: 7,180,730,308,382 (12)
abstracting: (0<=p24)
states: 7,969,347,823,493 (12)
abstracting: (p24<=0)
states: 7,509,967,901,949 (12)
abstracting: (0<=p183)
states: 7,969,347,823,493 (12)
abstracting: (p183<=0)
states: 7,180,730,308,382 (12)
abstracting: (0<=p24)
states: 7,969,347,823,493 (12)
abstracting: (p24<=0)
states: 7,509,967,901,949 (12)
.......
before gc: list nodes free: 6223768

after gc: idd nodes used:7098189, unused:56901811; list nodes free:261652784
MC time: 4m16.836sec

checking: EF [[[p55<=1 & 1<=p55] & [AG [EF [[p126<=0 & 0<=p126]]] | EF [EX [[[p162<=0 & 0<=p162] | [p105<=1 & 1<=p105]]]]]]]
normalized: E [true U [[E [true U EX [[[p162<=0 & 0<=p162] | [p105<=1 & 1<=p105]]]] | ~ [E [true U ~ [E [true U [p126<=0 & 0<=p126]]]]]] & [p55<=1 & 1<=p55]]]

abstracting: (1<=p55)
states: 419,493,839,120 (11)
abstracting: (p55<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p126)
states: 7,969,347,823,493 (12)
abstracting: (p126<=0)
states: 5,030,738,730,185 (12)

before gc: list nodes free: 4307563

after gc: idd nodes used:8543331, unused:55456669; list nodes free:255065859
abstracting: (1<=p105)
states: 3,761,839,043,938 (12)
abstracting: (p105<=1)
states: 7,969,347,823,493 (12)
abstracting: (0<=p162)
states: 7,969,347,823,493 (12)
abstracting: (p162<=0)
states: 3,223,711,939,282 (12)

before gc: list nodes free: 5094967

after gc: idd nodes used:7982887, unused:56017113; list nodes free:257672361
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6007320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098868 kB

BK_TIME_CONFINEMENT_REACHED

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

828394 900589
iterations count:242391 (1756), effective:23516 (170)

initing FirstDep: 0m 0.000sec


iterations count:30830 (223), effective:2690 (19)

iterations count:10011 (72), effective:541 (3)

iterations count:247 (1), effective:19 (0)

iterations count:1861 (13), effective:162 (1)

iterations count:69683 (504), effective:5697 (41)

sat_reach.icc:155: Timeout: after 625 sec


net_ddint.h:600: Timeout: after 499 sec


iterations count:2090 (15), effective:41 (0)

net_ddint.h:600: Timeout: after 399 sec


ctl_mc.icc:221: Timeout: after 319 sec


iterations count:55889 (404), effective:5254 (38)

iterations count:1798 (13), effective:145 (1)

iterations count:1098 (7), effective:60 (0)

net_ddint.h:600: Timeout: after 255 sec


iterations count:1861 (13), effective:162 (1)

iterations count:69683 (504), effective:5697 (41)

iterations count:247 (1), effective:19 (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="DES-PT-20a"
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 DES-PT-20a, 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 r106-tall-167814482700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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