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-167903717700281.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 ShieldIIPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 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.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679500563602

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=ShieldIIPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:56:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:56:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:56:06] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-22 15:56:06] [INFO ] Transformed 1403 places.
[2023-03-22 15:56:06] [INFO ] Transformed 1303 transitions.
[2023-03-22 15:56:06] [INFO ] Found NUPN structural information;
[2023-03-22 15:56:06] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-020B-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 1204 transition count 1104
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 1204 transition count 1104
Applied a total of 398 rules in 286 ms. Remains 1204 /1403 variables (removed 199) and now considering 1104/1303 (removed 199) transitions.
// Phase 1: matrix 1104 rows 1204 cols
[2023-03-22 15:56:06] [INFO ] Computed 181 place invariants in 42 ms
[2023-03-22 15:56:07] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2023-03-22 15:56:07] [INFO ] Invariant cache hit.
[2023-03-22 15:56:09] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
[2023-03-22 15:56:09] [INFO ] Invariant cache hit.
[2023-03-22 15:56:10] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1204/1403 places, 1104/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4377 ms. Remains : 1204/1403 places, 1104/1303 transitions.
Support contains 87 out of 1204 places after structural reductions.
[2023-03-22 15:56:11] [INFO ] Flatten gal took : 109 ms
[2023-03-22 15:56:11] [INFO ] Flatten gal took : 49 ms
[2023-03-22 15:56:11] [INFO ] Input system was already deterministic with 1104 transitions.
Support contains 82 out of 1204 places (down from 87) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 50) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 15:56:12] [INFO ] Invariant cache hit.
[2023-03-22 15:56:13] [INFO ] [Real]Absence check using 181 positive place invariants in 107 ms returned sat
[2023-03-22 15:56:13] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 15:56:13] [INFO ] [Nat]Absence check using 181 positive place invariants in 60 ms returned sat
[2023-03-22 15:56:15] [INFO ] After 1571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 15:56:16] [INFO ] Deduced a trap composed of 26 places in 413 ms of which 5 ms to minimize.
[2023-03-22 15:56:16] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 1 ms to minimize.
[2023-03-22 15:56:16] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 17 ms to minimize.
[2023-03-22 15:56:17] [INFO ] Deduced a trap composed of 19 places in 600 ms of which 2 ms to minimize.
[2023-03-22 15:56:17] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2023-03-22 15:56:18] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 1 ms to minimize.
[2023-03-22 15:56:18] [INFO ] Deduced a trap composed of 12 places in 538 ms of which 2 ms to minimize.
[2023-03-22 15:56:19] [INFO ] Deduced a trap composed of 30 places in 380 ms of which 1 ms to minimize.
[2023-03-22 15:56:19] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2023-03-22 15:56:19] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2023-03-22 15:56:19] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2023-03-22 15:56:20] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 1 ms to minimize.
[2023-03-22 15:56:20] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-22 15:56:21] [INFO ] Deduced a trap composed of 36 places in 585 ms of which 0 ms to minimize.
[2023-03-22 15:56:21] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-22 15:56:21] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2023-03-22 15:56:21] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2023-03-22 15:56:21] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2023-03-22 15:56:22] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-22 15:56:22] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2023-03-22 15:56:22] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-22 15:56:22] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-22 15:56:22] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2023-03-22 15:56:23] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 1 ms to minimize.
[2023-03-22 15:56:23] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2023-03-22 15:56:23] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-22 15:56:23] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7859 ms
[2023-03-22 15:56:24] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2023-03-22 15:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-22 15:56:25] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 0 ms to minimize.
[2023-03-22 15:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-22 15:56:25] [INFO ] After 11786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-22 15:56:26] [INFO ] After 13774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 604 ms.
Support contains 25 out of 1204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 233 place count 1204 transition count 871
Reduce places removed 233 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 234 rules applied. Total rules applied 467 place count 971 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 468 place count 970 transition count 870
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 468 place count 970 transition count 720
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 768 place count 820 transition count 720
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 775 place count 813 transition count 713
Iterating global reduction 3 with 7 rules applied. Total rules applied 782 place count 813 transition count 713
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 782 place count 813 transition count 707
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 794 place count 807 transition count 707
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 1 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1460 place count 474 transition count 374
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1574 place count 417 transition count 407
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1575 place count 417 transition count 406
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1577 place count 417 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1579 place count 415 transition count 404
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1599 place count 415 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1600 place count 414 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1601 place count 413 transition count 403
Applied a total of 1601 rules in 188 ms. Remains 413 /1204 variables (removed 791) and now considering 403/1104 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 413/1204 places, 403/1104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 403 rows 413 cols
[2023-03-22 15:56:28] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-22 15:56:28] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 15:56:28] [INFO ] [Nat]Absence check using 180 positive place invariants in 20 ms returned sat
[2023-03-22 15:56:29] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 15:56:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 15:56:29] [INFO ] After 418ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 15:56:29] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-22 15:56:30] [INFO ] After 1596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 17 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 403/403 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 413 transition count 400
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 410 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 410 transition count 398
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 408 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 407 transition count 396
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 407 transition count 396
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 406 transition count 395
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 404 transition count 397
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 404 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 403 transition count 396
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 401 transition count 394
Applied a total of 22 rules in 75 ms. Remains 401 /413 variables (removed 12) and now considering 394/403 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 401/413 places, 394/403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 394 rows 401 cols
[2023-03-22 15:56:30] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-22 15:56:31] [INFO ] [Real]Absence check using 180 positive place invariants in 30 ms returned sat
[2023-03-22 15:56:31] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 15:56:31] [INFO ] [Nat]Absence check using 180 positive place invariants in 29 ms returned sat
[2023-03-22 15:56:31] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-22 15:56:31] [INFO ] After 90ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:31] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-22 15:56:31] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 50 ms.
Support contains 12 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 394/394 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 401 transition count 392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 399 transition count 392
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 396 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 396 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 396 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 395 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 394 transition count 386
Applied a total of 16 rules in 30 ms. Remains 394 /401 variables (removed 7) and now considering 386/394 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 394/401 places, 386/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 170490 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170490 steps, saw 109268 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 386 rows 394 cols
[2023-03-22 15:56:35] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-22 15:56:35] [INFO ] [Real]Absence check using 179 positive place invariants in 26 ms returned sat
[2023-03-22 15:56:35] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 15:56:35] [INFO ] [Nat]Absence check using 179 positive place invariants in 59 ms returned sat
[2023-03-22 15:56:36] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 15:56:36] [INFO ] After 170ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:36] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-22 15:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-22 15:56:36] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-22 15:56:36] [INFO ] After 1051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 12 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 386/386 transitions.
Applied a total of 0 rules in 9 ms. Remains 394 /394 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 394/394 places, 386/386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 386/386 transitions.
Applied a total of 0 rules in 8 ms. Remains 394 /394 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2023-03-22 15:56:36] [INFO ] Invariant cache hit.
[2023-03-22 15:56:37] [INFO ] Implicit Places using invariants in 543 ms returned [383]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 546 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 393/394 places, 386/386 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 392 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 392 transition count 385
Applied a total of 2 rules in 23 ms. Remains 392 /393 variables (removed 1) and now considering 385/386 (removed 1) transitions.
// Phase 1: matrix 385 rows 392 cols
[2023-03-22 15:56:37] [INFO ] Computed 178 place invariants in 4 ms
[2023-03-22 15:56:37] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-22 15:56:37] [INFO ] Invariant cache hit.
[2023-03-22 15:56:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-22 15:56:38] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 392/394 places, 385/386 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1749 ms. Remains : 392/394 places, 385/386 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 154739 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154739 steps, saw 99338 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 15:56:41] [INFO ] Invariant cache hit.
[2023-03-22 15:56:42] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2023-03-22 15:56:42] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 15:56:42] [INFO ] [Nat]Absence check using 178 positive place invariants in 63 ms returned sat
[2023-03-22 15:56:42] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:42] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-22 15:56:42] [INFO ] After 215ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:43] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-03-22 15:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-22 15:56:43] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-22 15:56:43] [INFO ] After 1264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 120 ms.
Support contains 12 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 385/385 transitions.
Applied a total of 0 rules in 9 ms. Remains 392 /392 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 392/392 places, 385/385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 385/385 transitions.
Applied a total of 0 rules in 7 ms. Remains 392 /392 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2023-03-22 15:56:43] [INFO ] Invariant cache hit.
[2023-03-22 15:56:43] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-22 15:56:43] [INFO ] Invariant cache hit.
[2023-03-22 15:56:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-22 15:56:44] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-22 15:56:44] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-22 15:56:44] [INFO ] Invariant cache hit.
[2023-03-22 15:56:44] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1304 ms. Remains : 392/392 places, 385/385 transitions.
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 43 place count 392 transition count 385
Applied a total of 43 rules in 13 ms. Remains 392 /392 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 385 rows 392 cols
[2023-03-22 15:56:44] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-22 15:56:44] [INFO ] [Real]Absence check using 178 positive place invariants in 41 ms returned sat
[2023-03-22 15:56:45] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 15:56:45] [INFO ] [Nat]Absence check using 178 positive place invariants in 59 ms returned sat
[2023-03-22 15:56:45] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-22 15:56:45] [INFO ] After 177ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:45] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-22 15:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-22 15:56:46] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-22 15:56:46] [INFO ] After 1217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 15:56:46] [INFO ] Flatten gal took : 64 ms
[2023-03-22 15:56:46] [INFO ] Flatten gal took : 34 ms
[2023-03-22 15:56:46] [INFO ] Input system was already deterministic with 1104 transitions.
Computed a total of 325 stabilizing places and 325 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1187 transition count 1087
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1187 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1186 transition count 1086
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1185 transition count 1085
Applied a total of 38 rules in 176 ms. Remains 1185 /1204 variables (removed 19) and now considering 1085/1104 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 1185/1204 places, 1085/1104 transitions.
[2023-03-22 15:56:46] [INFO ] Flatten gal took : 32 ms
[2023-03-22 15:56:46] [INFO ] Flatten gal took : 32 ms
[2023-03-22 15:56:46] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1185 transition count 1085
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1183 transition count 1083
Applied a total of 42 rules in 231 ms. Remains 1183 /1204 variables (removed 21) and now considering 1083/1104 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 1183/1204 places, 1083/1104 transitions.
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 30 ms
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 15:56:47] [INFO ] Input system was already deterministic with 1083 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1183 transition count 1083
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1181 transition count 1081
Applied a total of 46 rules in 230 ms. Remains 1181 /1204 variables (removed 23) and now considering 1081/1104 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 1181/1204 places, 1081/1104 transitions.
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 28 ms
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 28 ms
[2023-03-22 15:56:47] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1203 transition count 859
Reduce places removed 244 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 246 rules applied. Total rules applied 490 place count 959 transition count 857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 492 place count 957 transition count 857
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 492 place count 957 transition count 709
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 788 place count 809 transition count 709
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 798 place count 799 transition count 699
Iterating global reduction 3 with 10 rules applied. Total rules applied 808 place count 799 transition count 699
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 808 place count 799 transition count 690
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 826 place count 790 transition count 690
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 0 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1464 place count 471 transition count 371
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1465 place count 470 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1466 place count 469 transition count 370
Applied a total of 1466 rules in 139 ms. Remains 469 /1204 variables (removed 735) and now considering 370/1104 (removed 734) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 469/1204 places, 370/1104 transitions.
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 16 ms
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:56:47] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1189 transition count 1089
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1189 transition count 1089
Applied a total of 30 rules in 97 ms. Remains 1189 /1204 variables (removed 15) and now considering 1089/1104 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1189/1204 places, 1089/1104 transitions.
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 32 ms
[2023-03-22 15:56:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 15:56:48] [INFO ] Input system was already deterministic with 1089 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 245 transitions
Trivial Post-agglo rules discarded 245 transitions
Performed 245 trivial Post agglomeration. Transition count delta: 245
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1203 transition count 858
Reduce places removed 245 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 247 rules applied. Total rules applied 492 place count 958 transition count 856
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 494 place count 957 transition count 855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 956 transition count 855
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 495 place count 956 transition count 707
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 791 place count 808 transition count 707
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 803 place count 796 transition count 695
Iterating global reduction 4 with 12 rules applied. Total rules applied 815 place count 796 transition count 695
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 815 place count 796 transition count 684
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 837 place count 785 transition count 684
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 4 with 636 rules applied. Total rules applied 1473 place count 467 transition count 366
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1474 place count 467 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1475 place count 466 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1477 place count 464 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1477 place count 464 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1479 place count 463 transition count 364
Applied a total of 1479 rules in 158 ms. Remains 463 /1204 variables (removed 741) and now considering 364/1104 (removed 740) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 158 ms. Remains : 463/1204 places, 364/1104 transitions.
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:56:48] [INFO ] Input system was already deterministic with 364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1184 transition count 1084
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1184 transition count 1084
Applied a total of 40 rules in 98 ms. Remains 1184 /1204 variables (removed 20) and now considering 1084/1104 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1184/1204 places, 1084/1104 transitions.
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 25 ms
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 26 ms
[2023-03-22 15:56:48] [INFO ] Input system was already deterministic with 1084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1183 transition count 1083
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1181 transition count 1081
Applied a total of 46 rules in 226 ms. Remains 1181 /1204 variables (removed 23) and now considering 1081/1104 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 1181/1204 places, 1081/1104 transitions.
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 48 ms
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 24 ms
[2023-03-22 15:56:48] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1203 transition count 859
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 246 rules applied. Total rules applied 490 place count 959 transition count 857
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 492 place count 958 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 957 transition count 856
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 147 Pre rules applied. Total rules applied 493 place count 957 transition count 709
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 787 place count 810 transition count 709
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 800 place count 797 transition count 696
Iterating global reduction 4 with 13 rules applied. Total rules applied 813 place count 797 transition count 696
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 813 place count 797 transition count 684
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 837 place count 785 transition count 684
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 4 with 638 rules applied. Total rules applied 1475 place count 466 transition count 365
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1477 place count 464 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1479 place count 462 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1479 place count 462 transition count 362
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1481 place count 461 transition count 362
Applied a total of 1481 rules in 109 ms. Remains 461 /1204 variables (removed 743) and now considering 362/1104 (removed 742) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 461/1204 places, 362/1104 transitions.
[2023-03-22 15:56:48] [INFO ] Flatten gal took : 9 ms
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 10 ms
[2023-03-22 15:56:49] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1183 transition count 1083
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1181 transition count 1081
Applied a total of 46 rules in 164 ms. Remains 1181 /1204 variables (removed 23) and now considering 1081/1104 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 1181/1204 places, 1081/1104 transitions.
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 37 ms
[2023-03-22 15:56:49] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1184 transition count 1084
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1182 transition count 1082
Applied a total of 44 rules in 160 ms. Remains 1182 /1204 variables (removed 22) and now considering 1082/1104 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 1182/1204 places, 1082/1104 transitions.
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 22 ms
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 15:56:49] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 1203 transition count 855
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 250 rules applied. Total rules applied 498 place count 955 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 499 place count 954 transition count 853
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 499 place count 954 transition count 706
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 793 place count 807 transition count 706
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 806 place count 794 transition count 693
Iterating global reduction 3 with 13 rules applied. Total rules applied 819 place count 794 transition count 693
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 819 place count 794 transition count 681
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 843 place count 782 transition count 681
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 1 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1475 place count 466 transition count 365
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1477 place count 464 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1479 place count 462 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1479 place count 462 transition count 362
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1481 place count 461 transition count 362
Applied a total of 1481 rules in 139 ms. Remains 461 /1204 variables (removed 743) and now considering 362/1104 (removed 742) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 461/1204 places, 362/1104 transitions.
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 10 ms
[2023-03-22 15:56:49] [INFO ] Flatten gal took : 10 ms
[2023-03-22 15:56:49] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1204/1204 places, 1104/1104 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1185 transition count 1085
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1183 transition count 1083
Applied a total of 42 rules in 164 ms. Remains 1183 /1204 variables (removed 21) and now considering 1083/1104 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 1183/1204 places, 1083/1104 transitions.
[2023-03-22 15:56:50] [INFO ] Flatten gal took : 21 ms
[2023-03-22 15:56:50] [INFO ] Flatten gal took : 22 ms
[2023-03-22 15:56:50] [INFO ] Input system was already deterministic with 1083 transitions.
[2023-03-22 15:56:50] [INFO ] Flatten gal took : 31 ms
[2023-03-22 15:56:50] [INFO ] Flatten gal took : 25 ms
[2023-03-22 15:56:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 15:56:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1204 places, 1104 transitions and 2848 arcs took 5 ms.
Total runtime 44283 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: 1204 NrTr: 1104 NrArc: 2848)

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

net check time: 0m 0.013sec

init dd package: 0m 3.055sec


before gc: list nodes free: 1504269

after gc: idd nodes used:49032332, unused:14967668; list nodes free:69541753

RS generation: 14m11.600sec


-> last computed set: #nodes 49031130 (4.9e+07) #states 2,028,929,628,184,319,683,104,157 (24)


CANNOT_COMPUTE


BK_STOP 1679501494632

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

idd.cc:820: DD Exception: No free nodes

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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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-167903717700281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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