fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903718100569
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldPPPt-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10045.451 3600000.00 3669067.00 122.40 ?FFF?FT??F?T???T normal

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.r394-oct2-167903718100569.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-003B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718100569
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679523710887

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=ShieldPPPt-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:21:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:21:53] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-22 22:21:53] [INFO ] Transformed 237 places.
[2023-03-22 22:21:53] [INFO ] Transformed 216 transitions.
[2023-03-22 22:21:53] [INFO ] Found NUPN structural information;
[2023-03-22 22:21:53] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
FORMULA ShieldPPPt-PT-003B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 216 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 216 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 215 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 215 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 214 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 214 transition count 193
Applied a total of 46 rules in 142 ms. Remains 214 /237 variables (removed 23) and now considering 193/216 (removed 23) transitions.
// Phase 1: matrix 193 rows 214 cols
[2023-03-22 22:21:53] [INFO ] Computed 34 place invariants in 10 ms
[2023-03-22 22:21:54] [INFO ] Implicit Places using invariants in 691 ms returned []
[2023-03-22 22:21:54] [INFO ] Invariant cache hit.
[2023-03-22 22:21:54] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-03-22 22:21:54] [INFO ] Invariant cache hit.
[2023-03-22 22:21:55] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/237 places, 193/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1691 ms. Remains : 214/237 places, 193/216 transitions.
Support contains 55 out of 214 places after structural reductions.
[2023-03-22 22:21:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 22:21:55] [INFO ] Flatten gal took : 39 ms
FORMULA ShieldPPPt-PT-003B-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 22:21:55] [INFO ] Flatten gal took : 17 ms
[2023-03-22 22:21:55] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 49 out of 214 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:21:56] [INFO ] Invariant cache hit.
[2023-03-22 22:21:56] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:21:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-22 22:21:56] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 22:21:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 336 ms
[2023-03-22 22:21:56] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 22:21:56] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 193/193 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 214 transition count 145
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 166 transition count 145
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 96 place count 166 transition count 127
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 132 place count 148 transition count 127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 140 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 140 transition count 119
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 140 transition count 115
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 136 transition count 115
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 248 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 249 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 267 place count 81 transition count 67
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 81 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 80 transition count 66
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 277 place count 80 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 79 transition count 65
Applied a total of 278 rules in 39 ms. Remains 79 /214 variables (removed 135) and now considering 65/193 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 79/214 places, 65/193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1866414 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :{}
Probabilistic random walk after 1866414 steps, saw 337158 distinct states, run finished after 3003 ms. (steps per millisecond=621 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 79 cols
[2023-03-22 22:21:59] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 22:21:59] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:21:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2023-03-22 22:21:59] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:21:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 22:21:59] [INFO ] After 29ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-22 22:21:59] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 22:22:00] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-22 22:22:00] [INFO ] Invariant cache hit.
[2023-03-22 22:22:00] [INFO ] Implicit Places using invariants in 82 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/79 places, 65/65 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 76 transition count 63
Applied a total of 4 rules in 4 ms. Remains 76 /78 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 76 cols
[2023-03-22 22:22:00] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-22 22:22:00] [INFO ] Implicit Places using invariants in 204 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/79 places, 63/65 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 5 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2023-03-22 22:22:00] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-22 22:22:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-22 22:22:00] [INFO ] Invariant cache hit.
[2023-03-22 22:22:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 22:22:00] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 72/79 places, 61/65 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 556 ms. Remains : 72/79 places, 61/65 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2225315 steps, run timeout after 3001 ms. (steps per millisecond=741 ) properties seen :{}
Probabilistic random walk after 2225315 steps, saw 474209 distinct states, run finished after 3001 ms. (steps per millisecond=741 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:22:03] [INFO ] Invariant cache hit.
[2023-03-22 22:22:03] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-22 22:22:03] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 22:22:03] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:03] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2023-03-22 22:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-22 22:22:03] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 22:22:03] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 72/72 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-22 22:22:04] [INFO ] Invariant cache hit.
[2023-03-22 22:22:04] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-22 22:22:04] [INFO ] Invariant cache hit.
[2023-03-22 22:22:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 22:22:04] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-22 22:22:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 22:22:04] [INFO ] Invariant cache hit.
[2023-03-22 22:22:04] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 72/72 places, 61/61 transitions.
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 61
Applied a total of 16 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 72 cols
[2023-03-22 22:22:04] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 22:22:04] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-22 22:22:04] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 22:22:04] [INFO ] After 23ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:04] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2023-03-22 22:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-22 22:22:04] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 22:22:04] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:04] [INFO ] Flatten gal took : 12 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 10 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 193 transitions.
Computed a total of 50 stabilizing places and 50 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 213 transition count 148
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 169 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 167 transition count 146
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 92 place count 167 transition count 128
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 128 place count 149 transition count 128
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 142 transition count 121
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 142 transition count 121
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 142 place count 142 transition count 117
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 138 transition count 117
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 228 place count 99 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 99 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 98 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 96 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 234 place count 95 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 234 place count 95 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 93 transition count 72
Applied a total of 238 rules in 33 ms. Remains 93 /214 variables (removed 121) and now considering 72/193 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 93/214 places, 72/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 181
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 181
Applied a total of 24 rules in 5 ms. Remains 202 /214 variables (removed 12) and now considering 181/193 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 202/214 places, 181/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 18 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 10 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 213 transition count 146
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 167 transition count 146
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 92 place count 167 transition count 128
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 128 place count 149 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 142 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 142 transition count 121
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 142 place count 142 transition count 118
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 139 transition count 118
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 238 place count 94 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 94 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 93 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 91 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 90 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 244 place count 90 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 88 transition count 67
Applied a total of 248 rules in 35 ms. Remains 88 /214 variables (removed 126) and now considering 67/193 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 88/214 places, 67/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 16 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 181
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 181
Applied a total of 24 rules in 6 ms. Remains 202 /214 variables (removed 12) and now considering 181/193 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 202/214 places, 181/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 181
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 181
Applied a total of 24 rules in 29 ms. Remains 202 /214 variables (removed 12) and now considering 181/193 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 202/214 places, 181/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 20 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 203 transition count 182
Applied a total of 22 rules in 19 ms. Remains 203 /214 variables (removed 11) and now considering 182/193 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 203/214 places, 182/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 11 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 181
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 181
Applied a total of 24 rules in 7 ms. Remains 202 /214 variables (removed 12) and now considering 181/193 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 202/214 places, 181/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 15 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 20 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 205 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 205 transition count 184
Applied a total of 18 rules in 20 ms. Remains 205 /214 variables (removed 9) and now considering 184/193 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 205/214 places, 184/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 9 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 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 47 place count 213 transition count 145
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 166 transition count 145
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 94 place count 166 transition count 127
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 130 place count 148 transition count 127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 140 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 140 transition count 119
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 146 place count 140 transition count 115
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 136 transition count 115
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 236 place count 95 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 95 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 94 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 94 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 92 transition count 70
Applied a total of 242 rules in 28 ms. Remains 92 /214 variables (removed 122) and now considering 70/193 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 92/214 places, 70/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 213 transition count 144
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 165 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 164 transition count 143
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 98 place count 164 transition count 125
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 134 place count 146 transition count 125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 141 place count 139 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 148 place count 139 transition count 118
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 148 place count 139 transition count 115
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 154 place count 136 transition count 115
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 244 place count 91 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 91 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 90 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 88 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 87 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 250 place count 87 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 254 place count 85 transition count 64
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 255 place count 84 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 83 transition count 63
Applied a total of 257 rules in 19 ms. Remains 83 /214 variables (removed 131) and now considering 63/193 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 83/214 places, 63/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 204 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 204 transition count 183
Applied a total of 20 rules in 7 ms. Remains 204 /214 variables (removed 10) and now considering 183/193 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 204/214 places, 183/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 213 transition count 144
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 165 transition count 144
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 96 place count 165 transition count 126
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 132 place count 147 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 139 transition count 118
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 139 transition count 118
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 139 transition count 114
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 135 transition count 114
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 246 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 247 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 89 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 87 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 86 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 252 place count 86 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 84 transition count 63
Applied a total of 256 rules in 25 ms. Remains 84 /214 variables (removed 130) and now considering 63/193 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 84/214 places, 63/193 transitions.
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:22:05] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
FORMULA ShieldPPPt-PT-003B-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:05] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:05] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 22:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 193 transitions and 494 arcs took 1 ms.
Total runtime 12300 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: 214 NrTr: 193 NrArc: 494)

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

net check time: 0m 0.000sec

init dd package: 0m 2.944sec


RS generation: 0m15.785sec


-> reachability set: #nodes 682137 (6.8e+05) #states 103,970,038,611,097,431,580 (20)



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

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

abstracting: (0<=0)
states: 103,970,038,611,097,431,580 (20)
.........................................................................
before gc: list nodes free: 137065

after gc: idd nodes used:2401178, unused:61598822; list nodes free:278507546
....................................
before gc: list nodes free: 1638064

after gc: idd nodes used:4454524, unused:59545476; list nodes free:271081523
...................................
before gc: list nodes free: 1423906

after gc: idd nodes used:2599525, unused:61400475; list nodes free:279657889
......................................
before gc: list nodes free: 1262355

after gc: idd nodes used:2140369, unused:61859631; list nodes free:281950652
MC time: 5m26.423sec

checking: AX [AF [[p54<=1 & 1<=p54]]]
normalized: ~ [EX [EG [~ [[p54<=1 & 1<=p54]]]]]

abstracting: (1<=p54)
states: 14,162,591,579,292,707,400 (19)
abstracting: (p54<=1)
states: 103,970,038,611,097,431,580 (20)
................................................
before gc: list nodes free: 1164460

after gc: idd nodes used:2284231, unused:61715769; list nodes free:281386523
...........................
before gc: list nodes free: 896934

after gc: idd nodes used:2909923, unused:61090077; list nodes free:278185855
.................
before gc: list nodes free: 737927

after gc: idd nodes used:5093497, unused:58906503; list nodes free:268143811
.MC time: 4m56.050sec

checking: EX [EX [[p53<=1 & 1<=p53]]]
normalized: EX [EX [[p53<=1 & 1<=p53]]]

abstracting: (1<=p53)
states: 14,162,591,579,292,707,400 (19)
abstracting: (p53<=1)
states: 103,970,038,611,097,431,580 (20)
..-> the formula is FALSE

FORMULA ShieldPPPt-PT-003B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.912sec

checking: AF [[EF [AX [EX [[[p51<=0 & 0<=p51] & [p158<=1 & 1<=p158]]]]] & AF [AX [1<=0]]]]
normalized: ~ [EG [~ [[~ [EG [EX [~ [1<=0]]]] & E [true U ~ [EX [~ [EX [[[p158<=1 & 1<=p158] & [p51<=0 & 0<=p51]]]]]]]]]]]

abstracting: (0<=p51)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p51<=0)
states: 89,845,134,276,343,070,692 (19)
abstracting: (1<=p158)
states: 34,260,651,835,371,139,200 (19)
abstracting: (p158<=1)
states: 103,970,038,611,097,431,580 (20)
..abstracting: (1<=0)
states: 0
..............................................
before gc: list nodes free: 3415813

after gc: idd nodes used:2393845, unused:61606155; list nodes free:280589481
..........................................
before gc: list nodes free: 1876170

after gc: idd nodes used:2643136, unused:61356864; list nodes free:279434867
............MC time: 4m56.003sec

checking: AG [[AF [[[p146<=1 & 1<=p146] | AG [[p164<=1 & 1<=p164]]]] | EG [[p37<=0 & 0<=p37]]]]
normalized: ~ [E [true U ~ [[EG [[p37<=0 & 0<=p37]] | ~ [EG [~ [[~ [E [true U ~ [[p164<=1 & 1<=p164]]]] | [p146<=1 & 1<=p146]]]]]]]]]

abstracting: (1<=p146)
states: 13,041,789,841,003,185,936 (19)
abstracting: (p146<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p164)
states: 28,042,916,958,870,000,960 (19)
abstracting: (p164<=1)
states: 103,970,038,611,097,431,580 (20)
.............
before gc: list nodes free: 1516314

after gc: idd nodes used:1563395, unused:62436605; list nodes free:284742149
.........................
before gc: list nodes free: 812113

after gc: idd nodes used:2977282, unused:61022718; list nodes free:278112538
.MC time: 4m27.041sec

checking: [~ [E [[[p169<=0 & 0<=p169] | [p23<=1 & 1<=p23]] U EX [EG [[[p2<=0 & 0<=p2] | [p90<=1 & 1<=p90]]]]]] | AX [[p174<=1 & 1<=p174]]]
normalized: [~ [EX [~ [[p174<=1 & 1<=p174]]]] | ~ [E [[[p23<=1 & 1<=p23] | [p169<=0 & 0<=p169]] U EX [EG [[[p90<=1 & 1<=p90] | [p2<=0 & 0<=p2]]]]]]]

abstracting: (0<=p2)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p2<=0)
states: 103,970,037,533,223,095,627 (20)
abstracting: (1<=p90)
states: 13,671,661,849,521,518,208 (19)
abstracting: (p90<=1)
states: 103,970,038,611,097,431,580 (20)
...........................................................................
EG iterations: 75
.abstracting: (0<=p169)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p169<=0)
states: 74,846,124,514,526,521,052 (19)
abstracting: (1<=p23)
states: 28,316,398,420,001,175,360 (19)
abstracting: (p23<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p174)
states: 14,851,811,621,084,152,008 (19)
abstracting: (p174<=1)
states: 103,970,038,611,097,431,580 (20)
.-> the formula is FALSE

FORMULA ShieldPPPt-PT-003B-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.142sec

checking: AG [AF [EG [[[p66<=0 & 0<=p66] & [[[p92<=0 & 0<=p92] | [p52<=1 & 1<=p52]] & [[p32<=0 & 0<=p32] | [p174<=1 & 1<=p174]]]]]]]
normalized: ~ [E [true U EG [~ [EG [[[[[p174<=1 & 1<=p174] | [p32<=0 & 0<=p32]] & [[p52<=1 & 1<=p52] | [p92<=0 & 0<=p92]]] & [p66<=0 & 0<=p66]]]]]]]

abstracting: (0<=p66)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p66<=0)
states: 92,335,828,817,046,375,580 (19)
abstracting: (0<=p92)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p92<=0)
states: 75,788,906,023,296,509,372 (19)
abstracting: (1<=p52)
states: 14,162,591,579,292,707,400 (19)
abstracting: (p52<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (0<=p32)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p32<=0)
states: 89,115,580,458,030,405,108 (19)
abstracting: (1<=p174)
states: 14,851,811,621,084,152,008 (19)
abstracting: (p174<=1)
states: 103,970,038,611,097,431,580 (20)

before gc: list nodes free: 934899

after gc: idd nodes used:1582586, unused:62417414; list nodes free:284708607
.............................
before gc: list nodes free: 1312774

after gc: idd nodes used:3519822, unused:60480178; list nodes free:275722141
.
before gc: list nodes free: 963548

after gc: idd nodes used:4116828, unused:59883172; list nodes free:272682536
MC time: 4m22.340sec

checking: AF [[[[[p130<=0 & 0<=p130] | [p69<=1 & 1<=p69]] & [[p40<=0 & 0<=p40] | [p84<=1 & 1<=p84]]] & AG [[[0<=p86 & p86<=0] | [p123<=1 & 1<=p123]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[p123<=1 & 1<=p123] | [0<=p86 & p86<=0]]]]] & [[[p84<=1 & 1<=p84] | [p40<=0 & 0<=p40]] & [[p69<=1 & 1<=p69] | [p130<=0 & 0<=p130]]]]]]]

abstracting: (0<=p130)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p130<=0)
states: 103,970,038,209,371,808,814 (20)
abstracting: (1<=p69)
states: 1,265,661,950,701,503 (15)
abstracting: (p69<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (0<=p40)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p40<=0)
states: 91,126,464,315,676,999,852 (19)
abstracting: (1<=p84)
states: 25,282,694,774,616,192 (16)
abstracting: (p84<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p86<=0)
states: 69,542,612,578,045,021,148 (19)
abstracting: (0<=p86)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p123)
states: 13,911,018,606,367,213,312 (19)
abstracting: (p123<=1)
states: 103,970,038,611,097,431,580 (20)
......................................................................................
before gc: list nodes free: 4408034

after gc: idd nodes used:3049700, unused:60950300; list nodes free:277954828
...................................................................................................................
before gc: list nodes free: 4427430

after gc: idd nodes used:3122771, unused:60877229; list nodes free:277524925
.MC time: 3m53.196sec

checking: AF [[E [[[[p158<=1 & 1<=p158] | [p151<=0 & 0<=p151]] | [[p26<=0 & 0<=p26] | [p121<=1 & 1<=p121]]] U ~ [AF [[p77<=1 & 1<=p77]]]] & EG [[p31<=1 & 1<=p31]]]]
normalized: ~ [EG [~ [[EG [[p31<=1 & 1<=p31]] & E [[[[p121<=1 & 1<=p121] | [p26<=0 & 0<=p26]] | [[p151<=0 & 0<=p151] | [p158<=1 & 1<=p158]]] U EG [~ [[p77<=1 & 1<=p77]]]]]]]]

abstracting: (1<=p77)
states: 14,855,699,859,944,869,613 (19)
abstracting: (p77<=1)
states: 103,970,038,611,097,431,580 (20)
....................................................
before gc: list nodes free: 1662458

after gc: idd nodes used:4218494, unused:59781506; list nodes free:272898660
.MC time: 3m27.195sec

checking: EG [AF [[[p164<=1 & 1<=p164] & [AX [[p162<=0 & 0<=p162]] & [[[p78<=0 & 0<=p78] | [p0<=1 & 1<=p0]] | [[p47<=1 & 1<=p47] | [[p2<=0 & 0<=p2] & [p122<=1 & 1<=p122]]]]]]]]
normalized: EG [~ [EG [~ [[[[[[[p122<=1 & 1<=p122] & [p2<=0 & 0<=p2]] | [p47<=1 & 1<=p47]] | [[p0<=1 & 1<=p0] | [p78<=0 & 0<=p78]]] & ~ [EX [~ [[p162<=0 & 0<=p162]]]]] & [p164<=1 & 1<=p164]]]]]]

abstracting: (1<=p164)
states: 28,042,916,958,870,000,960 (19)
abstracting: (p164<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (0<=p162)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p162<=0)
states: 75,927,121,652,316,355,164 (19)
.abstracting: (0<=p78)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p78<=0)
states: 103,970,038,610,751,400,810 (20)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p47)
states: 424,858,108,417,480,144 (17)
abstracting: (p47<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (0<=p2)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p2<=0)
states: 103,970,037,533,223,095,627 (20)
abstracting: (1<=p122)
states: 13,851,204,484,688,347,088 (19)
abstracting: (p122<=1)
states: 103,970,038,611,097,431,580 (20)
......................
before gc: list nodes free: 1838059

after gc: idd nodes used:3602165, unused:60397835; list nodes free:275460418
..............................................................................................
before gc: list nodes free: 2530002

after gc: idd nodes used:3748753, unused:60251247; list nodes free:274808889
.MC time: 3m 4.261sec

checking: AG [[E [[A [[[p182<=0 & 0<=p182] | [p74<=1 & 1<=p74]] U [p34<=0 & 0<=p34]] | [[p186<=1 & 1<=p186] & [[p68<=0 & 0<=p68] | [p103<=1 & 1<=p103]]]] U [A [[[p208<=0 & 0<=p208] | [p135<=1 & 1<=p135]] U [p172<=1 & 1<=p172]] & [[p213<=1 & 1<=p213] | [p4<=1 & 1<=p4]]]] & [EF [[[p167<=0 & 0<=p167] | [p58<=1 & 1<=p58]]] | [AX [[p35<=0 & 0<=p35]] | [[p139<=1 & 1<=p139] & [p199<=1 & 1<=p199]]]]]]
normalized: ~ [E [true U ~ [[[[[[p199<=1 & 1<=p199] & [p139<=1 & 1<=p139]] | ~ [EX [~ [[p35<=0 & 0<=p35]]]]] | E [true U [[p58<=1 & 1<=p58] | [p167<=0 & 0<=p167]]]] & E [[[[[p103<=1 & 1<=p103] | [p68<=0 & 0<=p68]] & [p186<=1 & 1<=p186]] | [~ [EG [~ [[p34<=0 & 0<=p34]]]] & ~ [E [~ [[p34<=0 & 0<=p34]] U [~ [[[p74<=1 & 1<=p74] | [p182<=0 & 0<=p182]]] & ~ [[p34<=0 & 0<=p34]]]]]]] U [[[p4<=1 & 1<=p4] | [p213<=1 & 1<=p213]] & [~ [EG [~ [[p172<=1 & 1<=p172]]]] & ~ [E [~ [[p172<=1 & 1<=p172]] U [~ [[[p135<=1 & 1<=p135] | [p208<=0 & 0<=p208]]] & ~ [[p172<=1 & 1<=p172]]]]]]]]]]]]

abstracting: (1<=p172)
states: 29,122,577,146,706,519,616 (19)
abstracting: (p172<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (0<=p208)
states: 103,970,038,611,097,431,580 (20)
abstracting: (p208<=0)
states: 91,508,273,018,538,902,084 (19)
abstracting: (1<=p135)
states: 14,852,819,966,254,958,608 (19)
abstracting: (p135<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p172)
states: 29,122,577,146,706,519,616 (19)
abstracting: (p172<=1)
states: 103,970,038,611,097,431,580 (20)
abstracting: (1<=p172)
states: 29,122,577,146,706,519,616 (19)
abstracting: (p172<=1)
states: 103,970,038,611,097,431,580 (20)
...................................................
before gc: list nodes free: 4022967

after gc: idd nodes used:3867774, unused:60132226; list nodes free:274431216
........MC time: 2m44.010sec

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

abstracting: (0<=0)
states: 103,970,038,611,097,431,580 (20)
..................................................
before gc: list nodes free: 3299653

after gc: idd nodes used:3471764, unused:60528236; list nodes free:276404354
......................................
before gc: list nodes free: 2201645

after gc: idd nodes used:4107225, unused:59892775; list nodes free:273171535
..................................
before gc: list nodes free: 1971720

after gc: idd nodes used:3986563, unused:60013437; list nodes free:273806177
...............................
before gc: list nodes free: 1716091

after gc: idd nodes used:5245403, unused:58754597; list nodes free:267831888
.....................................
before gc: list nodes free: 1664915

after gc: idd nodes used:3968650, unused:60031350; list nodes free:273796903
.....................................................
before gc: list nodes free: 1583864

after gc: idd nodes used:3930832, unused:60069168; list nodes free:273838847
........................................................................................................
before gc: list nodes free: 2193947

after gc: idd nodes used:4132496, unused:59867504; list nodes free:273022758
............................................................................
EG iterations: 422
-> the formula is TRUE

FORMULA ShieldPPPt-PT-003B-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6101740 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099324 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


iterations count:36776 (190), effective:5494 (28)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 325 sec


net_ddint.h:600: Timeout: after 295 sec


iterations count:45723 (236), effective:4700 (24)

net_ddint.h:600: Timeout: after 295 sec


iterations count:4022 (20), effective:366 (1)

net_ddint.h:600: Timeout: after 266 sec


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

net_ddint.h:600: Timeout: after 261 sec


iterations count:3763 (19), effective:354 (1)

net_ddint.h:600: Timeout: after 232 sec


net_ddint.h:600: Timeout: after 206 sec


net_ddint.h:600: Timeout: after 183 sec


iterations count:8151 (42), effective:723 (3)

net_ddint.h:600: Timeout: after 163 sec

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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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 r394-oct2-167903718100569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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