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.r522-tall-167987247100241.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 EisenbergMcGuire-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680823173779

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=EisenbergMcGuire-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 23:19:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 23:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:19:35] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-04-06 23:19:35] [INFO ] Transformed 414 places.
[2023-04-06 23:19:35] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:19:35] [INFO ] Found NUPN structural information;
[2023-04-06 23:19:35] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 395 transition count 1182
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 395 transition count 1182
Applied a total of 38 rules in 67 ms. Remains 395 /414 variables (removed 19) and now considering 1182/1296 (removed 114) transitions.
[2023-04-06 23:19:35] [INFO ] Flow matrix only has 588 transitions (discarded 594 similar events)
// Phase 1: matrix 588 rows 395 cols
[2023-04-06 23:19:35] [INFO ] Computed 19 invariants in 23 ms
[2023-04-06 23:19:36] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-04-06 23:19:36] [INFO ] Flow matrix only has 588 transitions (discarded 594 similar events)
[2023-04-06 23:19:36] [INFO ] Invariant cache hit.
[2023-04-06 23:19:36] [INFO ] State equation strengthened by 219 read => feed constraints.
[2023-04-06 23:19:36] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2023-04-06 23:19:36] [INFO ] Flow matrix only has 588 transitions (discarded 594 similar events)
[2023-04-06 23:19:36] [INFO ] Invariant cache hit.
[2023-04-06 23:19:37] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/414 places, 1182/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 395/414 places, 1182/1296 transitions.
Support contains 100 out of 395 places after structural reductions.
[2023-04-06 23:19:37] [INFO ] Flatten gal took : 112 ms
[2023-04-06 23:19:37] [INFO ] Flatten gal took : 71 ms
[2023-04-06 23:19:38] [INFO ] Input system was already deterministic with 1182 transitions.
Support contains 97 out of 395 places (down from 100) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 63) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-04-06 23:19:38] [INFO ] Flow matrix only has 588 transitions (discarded 594 similar events)
[2023-04-06 23:19:38] [INFO ] Invariant cache hit.
[2023-04-06 23:19:39] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-06 23:19:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:19:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:19:39] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-06 23:19:39] [INFO ] State equation strengthened by 219 read => feed constraints.
[2023-04-06 23:19:40] [INFO ] After 326ms SMT Verify possible using 219 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-06 23:19:40] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 5 ms to minimize.
[2023-04-06 23:19:40] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-04-06 23:19:40] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 1 ms to minimize.
[2023-04-06 23:19:40] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1341 ms
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-04-06 23:19:41] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 884 ms
[2023-04-06 23:19:42] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 23:19:43] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 0 ms to minimize.
[2023-04-06 23:19:43] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-04-06 23:19:43] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:19:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-04-06 23:19:43] [INFO ] After 3720ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-04-06 23:19:43] [INFO ] After 4690ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 156 ms.
Support contains 19 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 395 transition count 1178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 391 transition count 1178
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 8 place count 391 transition count 1074
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 216 place count 287 transition count 1074
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 226 place count 277 transition count 1014
Iterating global reduction 2 with 10 rules applied. Total rules applied 236 place count 277 transition count 1014
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 290 place count 250 transition count 987
Applied a total of 290 rules in 110 ms. Remains 250 /395 variables (removed 145) and now considering 987/1182 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 250/395 places, 987/1182 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 810509 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 810509 steps, saw 230283 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :9
Running SMT prover for 1 properties.
[2023-04-06 23:19:47] [INFO ] Flow matrix only has 393 transitions (discarded 594 similar events)
// Phase 1: matrix 393 rows 250 cols
[2023-04-06 23:19:47] [INFO ] Computed 19 invariants in 7 ms
[2023-04-06 23:19:47] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:19:47] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:19:47] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:19:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:19:47] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 23:19:47] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:47] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:19:47] [INFO ] After 34ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:47] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:19:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-04-06 23:19:48] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:19:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:19:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:19:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 351 ms
[2023-04-06 23:19:48] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-06 23:19:48] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 987/987 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 249 transition count 986
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 2 place count 249 transition count 977
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 20 place count 240 transition count 977
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 239 transition count 971
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 239 transition count 971
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 236 transition count 968
Applied a total of 28 rules in 53 ms. Remains 236 /250 variables (removed 14) and now considering 968/987 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 236/250 places, 968/987 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 857955 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 857955 steps, saw 219828 distinct states, run finished after 3005 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:19:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 23:19:51] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:19:51] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:19:51] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:19:51] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:19:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:19:51] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:19:51] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:19:51] [INFO ] After 32ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:51] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 23:19:51] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 23 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 23:19:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:19:51] [INFO ] Invariant cache hit.
[2023-04-06 23:19:52] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-04-06 23:19:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:19:52] [INFO ] Invariant cache hit.
[2023-04-06 23:19:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:19:52] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-04-06 23:19:52] [INFO ] Redundant transitions in 58 ms returned []
[2023-04-06 23:19:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:19:52] [INFO ] Invariant cache hit.
[2023-04-06 23:19:53] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 863 edges and 236 vertex of which 35 / 236 are part of one of the 6 SCC in 3 ms
Free SCC test removed 29 places
Drop transitions removed 110 transitions
Ensure Unique test removed 572 transitions
Reduce isomorphic transitions removed 682 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 239
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 160 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 159 transition count 238
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 97 place count 159 transition count 226
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 126 place count 142 transition count 226
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 242 place count 84 transition count 168
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 271 place count 84 transition count 139
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 283 place count 78 transition count 148
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 288 place count 78 transition count 143
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 293 place count 78 transition count 138
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 321 place count 78 transition count 110
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 349 place count 50 transition count 110
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 357 place count 50 transition count 110
Applied a total of 357 rules in 30 ms. Remains 50 /236 variables (removed 186) and now considering 110/968 (removed 858) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 50 cols
[2023-04-06 23:19:53] [INFO ] Computed 14 invariants in 1 ms
[2023-04-06 23:19:53] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 23:19:53] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 23:19:53] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 23:19:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:19:53] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:19:53] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:19:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:19:53] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:19:53] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:53] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:19:53] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 23:19:53] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 48 ms
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 36 ms
[2023-04-06 23:19:53] [INFO ] Input system was already deterministic with 1182 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 395 transition count 1176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 389 transition count 1176
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 12 place count 389 transition count 1065
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 234 place count 278 transition count 1065
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 267 transition count 999
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 267 transition count 999
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 310 place count 240 transition count 972
Applied a total of 310 rules in 90 ms. Remains 240 /395 variables (removed 155) and now considering 972/1182 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 90 ms. Remains : 240/395 places, 972/1182 transitions.
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 29 ms
[2023-04-06 23:19:53] [INFO ] Input system was already deterministic with 972 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 395 transition count 1177
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 390 transition count 1176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 389 transition count 1176
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 12 place count 389 transition count 1064
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 236 place count 277 transition count 1064
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 246 place count 267 transition count 1004
Iterating global reduction 3 with 10 rules applied. Total rules applied 256 place count 267 transition count 1004
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 314 place count 238 transition count 975
Applied a total of 314 rules in 54 ms. Remains 238 /395 variables (removed 157) and now considering 975/1182 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 238/395 places, 975/1182 transitions.
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 32 ms
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:19:53] [INFO ] Input system was already deterministic with 975 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 395 transition count 1176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 389 transition count 1176
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 389 transition count 1063
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 276 transition count 1063
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 249 place count 265 transition count 997
Iterating global reduction 2 with 11 rules applied. Total rules applied 260 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 320 place count 235 transition count 967
Applied a total of 320 rules in 50 ms. Remains 235 /395 variables (removed 160) and now considering 967/1182 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 235/395 places, 967/1182 transitions.
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:19:53] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:19:53] [INFO ] Input system was already deterministic with 967 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 395 transition count 1176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 389 transition count 1176
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 12 place count 389 transition count 1067
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 230 place count 280 transition count 1067
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 239 place count 271 transition count 1013
Iterating global reduction 2 with 9 rules applied. Total rules applied 248 place count 271 transition count 1013
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 306 place count 242 transition count 984
Applied a total of 306 rules in 56 ms. Remains 242 /395 variables (removed 153) and now considering 984/1182 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 242/395 places, 984/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 384 transition count 1116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 384 transition count 1116
Applied a total of 22 rules in 9 ms. Remains 384 /395 variables (removed 11) and now considering 1116/1182 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 384/395 places, 1116/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 42 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 385 transition count 1122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 385 transition count 1122
Applied a total of 20 rules in 9 ms. Remains 385 /395 variables (removed 10) and now considering 1122/1182 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 385/395 places, 1122/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 385 transition count 1122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 385 transition count 1122
Applied a total of 20 rules in 10 ms. Remains 385 /395 variables (removed 10) and now considering 1122/1182 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 385/395 places, 1122/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 395 transition count 1177
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 390 transition count 1177
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 10 place count 390 transition count 1065
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 234 place count 278 transition count 1065
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 267 transition count 999
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 267 transition count 999
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 316 place count 237 transition count 969
Applied a total of 316 rules in 49 ms. Remains 237 /395 variables (removed 158) and now considering 969/1182 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 237/395 places, 969/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 20 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 21 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 969 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9189 steps, run visited all 1 properties in 37 ms. (steps per millisecond=248 )
Probabilistic random walk after 9189 steps, saw 6332 distinct states, run finished after 37 ms. (steps per millisecond=248 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 386 transition count 1128
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 386 transition count 1128
Applied a total of 18 rules in 9 ms. Remains 386 /395 variables (removed 9) and now considering 1128/1182 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 386/395 places, 1128/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 385 transition count 1122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 385 transition count 1122
Applied a total of 20 rules in 8 ms. Remains 385 /395 variables (removed 10) and now considering 1122/1182 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 385/395 places, 1122/1182 transitions.
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 37 ms
[2023-04-06 23:19:54] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:54] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 385 transition count 1122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 385 transition count 1122
Applied a total of 20 rules in 10 ms. Remains 385 /395 variables (removed 10) and now considering 1122/1182 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 385/395 places, 1122/1182 transitions.
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 23 ms
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:55] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 385 transition count 1122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 385 transition count 1122
Applied a total of 20 rules in 10 ms. Remains 385 /395 variables (removed 10) and now considering 1122/1182 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 385/395 places, 1122/1182 transitions.
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 23 ms
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:19:55] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 1182/1182 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 384 transition count 1116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 384 transition count 1116
Applied a total of 22 rules in 8 ms. Remains 384 /395 variables (removed 11) and now considering 1116/1182 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 384/395 places, 1116/1182 transitions.
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 20 ms
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 33 ms
[2023-04-06 23:19:55] [INFO ] Input system was already deterministic with 1116 transitions.
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:19:55] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:19:55] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-06 23:19:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 395 places, 1182 transitions and 5520 arcs took 7 ms.
Total runtime 20135 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: 395 NrTr: 1182 NrArc: 5520)

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

net check time: 0m 0.000sec

init dd package: 0m 2.742sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9154384 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105540 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.002sec

38432 50240 145564 180902 230412 255933 248875 255957 289012 321012 336263 328619 344777 357578 965110 1035584 1158131 1200937 1221298 1252167 1206157 1612774 1632481 1782749 1959269

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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r522-tall-167987247100241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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