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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 1.9M 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-100B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679532158431

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-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:42:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:42:41] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-23 00:42:41] [INFO ] Transformed 7803 places.
[2023-03-23 00:42:41] [INFO ] Transformed 7103 transitions.
[2023-03-23 00:42:41] [INFO ] Found NUPN structural information;
[2023-03-23 00:42:42] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldPPPt-PT-100B-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1073 places :
Symmetric choice reduction at 0 with 1073 rule applications. Total rules 1073 place count 6730 transition count 6030
Iterating global reduction 0 with 1073 rules applied. Total rules applied 2146 place count 6730 transition count 6030
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2147 place count 6729 transition count 6029
Iterating global reduction 0 with 1 rules applied. Total rules applied 2148 place count 6729 transition count 6029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2149 place count 6728 transition count 6028
Iterating global reduction 0 with 1 rules applied. Total rules applied 2150 place count 6728 transition count 6028
Applied a total of 2150 rules in 5666 ms. Remains 6728 /7803 variables (removed 1075) and now considering 6028/7103 (removed 1075) transitions.
// Phase 1: matrix 6028 rows 6728 cols
[2023-03-23 00:42:48] [INFO ] Computed 1101 place invariants in 74 ms
[2023-03-23 00:42:52] [INFO ] Implicit Places using invariants in 4103 ms returned []
[2023-03-23 00:42:52] [INFO ] Invariant cache hit.
[2023-03-23 00:42:55] [INFO ] Implicit Places using invariants and state equation in 3472 ms returned []
Implicit Place search using SMT with State Equation took 7665 ms to find 0 implicit places.
[2023-03-23 00:42:55] [INFO ] Invariant cache hit.
[2023-03-23 00:43:01] [INFO ] Dead Transitions using invariants and state equation in 6213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6728/7803 places, 6028/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19555 ms. Remains : 6728/7803 places, 6028/7103 transitions.
Support contains 110 out of 6728 places after structural reductions.
[2023-03-23 00:43:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 00:43:02] [INFO ] Flatten gal took : 320 ms
FORMULA ShieldPPPt-PT-100B-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 00:43:02] [INFO ] Flatten gal took : 205 ms
[2023-03-23 00:43:03] [INFO ] Input system was already deterministic with 6028 transitions.
Support contains 95 out of 6728 places (down from 110) after GAL structural reductions.
FORMULA ShieldPPPt-PT-100B-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=11 ) properties (out of 57) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-23 00:43:04] [INFO ] Invariant cache hit.
[2023-03-23 00:43:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 744 ms returned sat
[2023-03-23 00:43:11] [INFO ] After 6671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-23 00:43:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 829 ms returned sat
[2023-03-23 00:43:36] [INFO ] After 14284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :33
[2023-03-23 00:43:36] [INFO ] After 14333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 00:43:36] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Fused 34 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 12651 ms.
Support contains 58 out of 6728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Drop transitions removed 1362 transitions
Trivial Post-agglo rules discarded 1362 transitions
Performed 1362 trivial Post agglomeration. Transition count delta: 1362
Iterating post reduction 0 with 1362 rules applied. Total rules applied 1362 place count 6728 transition count 4666
Reduce places removed 1362 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 1371 rules applied. Total rules applied 2733 place count 5366 transition count 4657
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2742 place count 5357 transition count 4657
Performed 784 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 784 Pre rules applied. Total rules applied 2742 place count 5357 transition count 3873
Deduced a syphon composed of 784 places in 12 ms
Reduce places removed 784 places and 0 transitions.
Iterating global reduction 3 with 1568 rules applied. Total rules applied 4310 place count 4573 transition count 3873
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 4317 place count 4566 transition count 3866
Iterating global reduction 3 with 7 rules applied. Total rules applied 4324 place count 4566 transition count 3866
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4324 place count 4566 transition count 3862
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4332 place count 4562 transition count 3862
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7730 place count 2863 transition count 2163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7731 place count 2863 transition count 2162
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7733 place count 2862 transition count 2161
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7935 place count 2761 transition count 2161
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8137 place count 2660 transition count 2161
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 12 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 8307 place count 2575 transition count 2161
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8311 place count 2575 transition count 2157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 8315 place count 2571 transition count 2157
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 5 with 292 rules applied. Total rules applied 8607 place count 2571 transition count 2157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8608 place count 2570 transition count 2156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8609 place count 2569 transition count 2156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8609 place count 2569 transition count 2154
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8613 place count 2567 transition count 2154
Applied a total of 8613 rules in 2700 ms. Remains 2567 /6728 variables (removed 4161) and now considering 2154/6028 (removed 3874) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2700 ms. Remains : 2567/6728 places, 2154/6028 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Interrupted probabilistic random walk after 49923 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49923 steps, saw 43563 distinct states, run finished after 3011 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 2154 rows 2567 cols
[2023-03-23 00:43:55] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-23 00:43:58] [INFO ] [Real]Absence check using 1100 positive place invariants in 388 ms returned sat
[2023-03-23 00:43:58] [INFO ] After 2835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-23 00:44:01] [INFO ] [Nat]Absence check using 1100 positive place invariants in 377 ms returned sat
[2023-03-23 00:44:09] [INFO ] After 5807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-23 00:44:09] [INFO ] State equation strengthened by 635 read => feed constraints.
[2023-03-23 00:44:15] [INFO ] After 6673ms SMT Verify possible using 635 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-23 00:44:16] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 5 ms to minimize.
[2023-03-23 00:44:16] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 2 ms to minimize.
[2023-03-23 00:44:17] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2023-03-23 00:44:17] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 1 ms to minimize.
[2023-03-23 00:44:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2133 ms
[2023-03-23 00:44:18] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 2 ms to minimize.
[2023-03-23 00:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-23 00:44:19] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
[2023-03-23 00:44:19] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 12 ms to minimize.
[2023-03-23 00:44:20] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2023-03-23 00:44:20] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:44:21] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-23 00:44:21] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-23 00:44:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2526 ms
[2023-03-23 00:44:22] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-23 00:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-23 00:44:22] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2023-03-23 00:44:23] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 00:44:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:44:23] [INFO ] After 25353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:32
Parikh walk visited 12 properties in 6051 ms.
Support contains 38 out of 2567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2567/2567 places, 2154/2154 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 2567 transition count 2151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2564 transition count 2151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 2564 transition count 2145
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 2558 transition count 2145
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 2547 transition count 2134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 2544 transition count 2134
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 2544 transition count 2133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 2543 transition count 2133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 2543 transition count 2133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 2542 transition count 2132
Applied a total of 50 rules in 637 ms. Remains 2542 /2567 variables (removed 25) and now considering 2132/2154 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 2542/2567 places, 2132/2154 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 44727 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44727 steps, saw 38510 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 2132 rows 2542 cols
[2023-03-23 00:44:34] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-23 00:44:36] [INFO ] [Real]Absence check using 1100 positive place invariants in 578 ms returned sat
[2023-03-23 00:44:36] [INFO ] After 2076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 00:44:38] [INFO ] [Nat]Absence check using 1100 positive place invariants in 323 ms returned sat
[2023-03-23 00:44:43] [INFO ] After 3537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-23 00:44:43] [INFO ] State equation strengthened by 316 read => feed constraints.
[2023-03-23 00:44:46] [INFO ] After 3326ms SMT Verify possible using 316 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-23 00:44:47] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 1 ms to minimize.
[2023-03-23 00:44:47] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-23 00:44:47] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 1 ms to minimize.
[2023-03-23 00:44:48] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 0 ms to minimize.
[2023-03-23 00:44:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1649 ms
[2023-03-23 00:44:49] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2023-03-23 00:44:50] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2023-03-23 00:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-23 00:44:51] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 1 ms to minimize.
[2023-03-23 00:44:52] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 14 ms to minimize.
[2023-03-23 00:44:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 933 ms
[2023-03-23 00:44:53] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 25 ms to minimize.
[2023-03-23 00:44:54] [INFO ] Deduced a trap composed of 5 places in 837 ms of which 2 ms to minimize.
[2023-03-23 00:44:55] [INFO ] Deduced a trap composed of 5 places in 1036 ms of which 3 ms to minimize.
[2023-03-23 00:44:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2783 ms
[2023-03-23 00:44:56] [INFO ] Deduced a trap composed of 7 places in 532 ms of which 2 ms to minimize.
[2023-03-23 00:44:57] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 1 ms to minimize.
[2023-03-23 00:44:57] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2023-03-23 00:44:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1830 ms
[2023-03-23 00:44:58] [INFO ] After 15427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 2822 ms.
[2023-03-23 00:45:01] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 11804 ms.
Support contains 38 out of 2542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2542/2542 places, 2132/2132 transitions.
Applied a total of 0 rules in 130 ms. Remains 2542 /2542 variables (removed 0) and now considering 2132/2132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 2542/2542 places, 2132/2132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2542/2542 places, 2132/2132 transitions.
Applied a total of 0 rules in 108 ms. Remains 2542 /2542 variables (removed 0) and now considering 2132/2132 (removed 0) transitions.
[2023-03-23 00:45:13] [INFO ] Invariant cache hit.
[2023-03-23 00:45:16] [INFO ] Implicit Places using invariants in 2694 ms returned [2525, 2529]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2712 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2540/2542 places, 2132/2132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2538 transition count 2130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2538 transition count 2130
Applied a total of 4 rules in 201 ms. Remains 2538 /2540 variables (removed 2) and now considering 2130/2132 (removed 2) transitions.
// Phase 1: matrix 2130 rows 2538 cols
[2023-03-23 00:45:16] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-23 00:45:18] [INFO ] Implicit Places using invariants in 2253 ms returned []
[2023-03-23 00:45:18] [INFO ] Invariant cache hit.
[2023-03-23 00:45:20] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-03-23 00:45:29] [INFO ] Implicit Places using invariants and state equation in 10911 ms returned []
Implicit Place search using SMT with State Equation took 13192 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2538/2542 places, 2130/2132 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16213 ms. Remains : 2538/2542 places, 2130/2132 transitions.
[2023-03-23 00:45:30] [INFO ] Flatten gal took : 258 ms
[2023-03-23 00:45:30] [INFO ] Flatten gal took : 201 ms
[2023-03-23 00:45:30] [INFO ] Input system was already deterministic with 6028 transitions.
Computed a total of 1602 stabilizing places and 1602 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 6703 transition count 6003
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 6703 transition count 6003
Applied a total of 50 rules in 2268 ms. Remains 6703 /6728 variables (removed 25) and now considering 6003/6028 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2268 ms. Remains : 6703/6728 places, 6003/6028 transitions.
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 146 ms
[2023-03-23 00:45:33] [INFO ] Flatten gal took : 162 ms
[2023-03-23 00:45:34] [INFO ] Input system was already deterministic with 6003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 6703 transition count 6003
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 6703 transition count 6003
Applied a total of 50 rules in 2429 ms. Remains 6703 /6728 variables (removed 25) and now considering 6003/6028 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2430 ms. Remains : 6703/6728 places, 6003/6028 transitions.
[2023-03-23 00:45:36] [INFO ] Flatten gal took : 139 ms
[2023-03-23 00:45:36] [INFO ] Flatten gal took : 165 ms
[2023-03-23 00:45:37] [INFO ] Input system was already deterministic with 6003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 6706 transition count 6006
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 6706 transition count 6006
Applied a total of 44 rules in 2329 ms. Remains 6706 /6728 variables (removed 22) and now considering 6006/6028 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2329 ms. Remains : 6706/6728 places, 6006/6028 transitions.
[2023-03-23 00:45:39] [INFO ] Flatten gal took : 135 ms
[2023-03-23 00:45:39] [INFO ] Flatten gal took : 158 ms
[2023-03-23 00:45:40] [INFO ] Input system was already deterministic with 6006 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6727 transition count 4631
Reduce places removed 1396 places and 0 transitions.
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2792 place count 5331 transition count 4631
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 789 Pre rules applied. Total rules applied 2792 place count 5331 transition count 3842
Deduced a syphon composed of 789 places in 14 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 2 with 1578 rules applied. Total rules applied 4370 place count 4542 transition count 3842
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 4392 place count 4520 transition count 3820
Iterating global reduction 2 with 22 rules applied. Total rules applied 4414 place count 4520 transition count 3820
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4414 place count 4520 transition count 3802
Deduced a syphon composed of 18 places in 11 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 4450 place count 4502 transition count 3802
Performed 1598 Post agglomeration using F-continuation condition.Transition count delta: 1598
Deduced a syphon composed of 1598 places in 5 ms
Reduce places removed 1598 places and 0 transitions.
Iterating global reduction 2 with 3196 rules applied. Total rules applied 7646 place count 2904 transition count 2204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7647 place count 2904 transition count 2203
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7649 place count 2903 transition count 2202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7651 place count 2901 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7652 place count 2900 transition count 2200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 7652 place count 2900 transition count 2198
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 7656 place count 2898 transition count 2198
Applied a total of 7656 rules in 2082 ms. Remains 2898 /6728 variables (removed 3830) and now considering 2198/6028 (removed 3830) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2082 ms. Remains : 2898/6728 places, 2198/6028 transitions.
[2023-03-23 00:45:42] [INFO ] Flatten gal took : 60 ms
[2023-03-23 00:45:42] [INFO ] Flatten gal took : 66 ms
[2023-03-23 00:45:42] [INFO ] Input system was already deterministic with 2198 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA ShieldPPPt-PT-100B-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1389 transitions
Trivial Post-agglo rules discarded 1389 transitions
Performed 1389 trivial Post agglomeration. Transition count delta: 1389
Iterating post reduction 0 with 1389 rules applied. Total rules applied 1389 place count 6727 transition count 4638
Reduce places removed 1389 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1391 rules applied. Total rules applied 2780 place count 5338 transition count 4636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2782 place count 5336 transition count 4636
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 789 Pre rules applied. Total rules applied 2782 place count 5336 transition count 3847
Deduced a syphon composed of 789 places in 15 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 4360 place count 4547 transition count 3847
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 4381 place count 4526 transition count 3826
Iterating global reduction 3 with 21 rules applied. Total rules applied 4402 place count 4526 transition count 3826
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 4402 place count 4526 transition count 3808
Deduced a syphon composed of 18 places in 29 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 4438 place count 4508 transition count 3808
Performed 1595 Post agglomeration using F-continuation condition.Transition count delta: 1595
Deduced a syphon composed of 1595 places in 5 ms
Reduce places removed 1595 places and 0 transitions.
Iterating global reduction 3 with 3190 rules applied. Total rules applied 7628 place count 2913 transition count 2213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7629 place count 2913 transition count 2212
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7631 place count 2912 transition count 2211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7633 place count 2910 transition count 2209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7634 place count 2909 transition count 2209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 7634 place count 2909 transition count 2207
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 7638 place count 2907 transition count 2207
Applied a total of 7638 rules in 2068 ms. Remains 2907 /6728 variables (removed 3821) and now considering 2207/6028 (removed 3821) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2068 ms. Remains : 2907/6728 places, 2207/6028 transitions.
[2023-03-23 00:45:44] [INFO ] Flatten gal took : 60 ms
[2023-03-23 00:45:44] [INFO ] Flatten gal took : 70 ms
[2023-03-23 00:45:45] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 6706 transition count 6006
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 6706 transition count 6006
Applied a total of 44 rules in 2302 ms. Remains 6706 /6728 variables (removed 22) and now considering 6006/6028 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 6706/6728 places, 6006/6028 transitions.
[2023-03-23 00:45:47] [INFO ] Flatten gal took : 150 ms
[2023-03-23 00:45:47] [INFO ] Flatten gal took : 176 ms
[2023-03-23 00:45:48] [INFO ] Input system was already deterministic with 6006 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6702 transition count 6002
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6702 transition count 6002
Applied a total of 52 rules in 2454 ms. Remains 6702 /6728 variables (removed 26) and now considering 6002/6028 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2454 ms. Remains : 6702/6728 places, 6002/6028 transitions.
[2023-03-23 00:45:50] [INFO ] Flatten gal took : 138 ms
[2023-03-23 00:45:50] [INFO ] Flatten gal took : 155 ms
[2023-03-23 00:45:51] [INFO ] Input system was already deterministic with 6002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6727 transition count 4631
Reduce places removed 1396 places and 0 transitions.
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2792 place count 5331 transition count 4631
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 789 Pre rules applied. Total rules applied 2792 place count 5331 transition count 3842
Deduced a syphon composed of 789 places in 14 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 2 with 1578 rules applied. Total rules applied 4370 place count 4542 transition count 3842
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 4391 place count 4521 transition count 3821
Iterating global reduction 2 with 21 rules applied. Total rules applied 4412 place count 4521 transition count 3821
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 4412 place count 4521 transition count 3804
Deduced a syphon composed of 17 places in 12 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 4446 place count 4504 transition count 3804
Performed 1600 Post agglomeration using F-continuation condition.Transition count delta: 1600
Deduced a syphon composed of 1600 places in 6 ms
Reduce places removed 1600 places and 0 transitions.
Iterating global reduction 2 with 3200 rules applied. Total rules applied 7646 place count 2904 transition count 2204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7647 place count 2904 transition count 2203
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7649 place count 2903 transition count 2202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7651 place count 2901 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7652 place count 2900 transition count 2200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 7652 place count 2900 transition count 2198
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 7656 place count 2898 transition count 2198
Applied a total of 7656 rules in 2013 ms. Remains 2898 /6728 variables (removed 3830) and now considering 2198/6028 (removed 3830) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2026 ms. Remains : 2898/6728 places, 2198/6028 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 58 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 62 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 2198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87544 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87544 steps, saw 64695 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2198 rows 2898 cols
[2023-03-23 00:45:56] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-23 00:45:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 290 ms returned sat
[2023-03-23 00:45:59] [INFO ] After 2252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:45:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 257 ms returned sat
[2023-03-23 00:46:01] [INFO ] After 1501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:46:01] [INFO ] After 1690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-23 00:46:01] [INFO ] After 2530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1986 ms.
Support contains 2 out of 2898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2898/2898 places, 2198/2198 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 2798 transition count 2098
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 402 place count 2697 transition count 2098
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 604 place count 2596 transition count 2098
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 796 place count 2500 transition count 2098
Applied a total of 796 rules in 603 ms. Remains 2500 /2898 variables (removed 398) and now considering 2098/2198 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 2500/2898 places, 2098/2198 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15637 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 419036 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted probabilistic random walk after 1881757 steps, run timeout after 60001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 1881757 steps, saw 1047719 distinct states, run finished after 60004 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-23 00:47:24] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-23 00:47:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 227 ms returned sat
[2023-03-23 00:47:26] [INFO ] After 1877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:47:27] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2023-03-23 00:47:28] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:47:28] [INFO ] After 1685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-23 00:47:29] [INFO ] After 2381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1504 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2500/2500 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-23 00:47:30] [INFO ] Invariant cache hit.
[2023-03-23 00:47:32] [INFO ] Implicit Places using invariants in 1534 ms returned []
[2023-03-23 00:47:32] [INFO ] Invariant cache hit.
[2023-03-23 00:47:36] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5988 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2498/2500 places, 2098/2098 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 221 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-23 00:47:36] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-23 00:47:39] [INFO ] Implicit Places using invariants in 2372 ms returned []
[2023-03-23 00:47:39] [INFO ] Invariant cache hit.
[2023-03-23 00:47:43] [INFO ] Implicit Places using invariants and state equation in 4483 ms returned []
Implicit Place search using SMT with State Equation took 6858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2500 places, 2096/2098 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13153 ms. Remains : 2496/2500 places, 2096/2098 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15813 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 423342 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted probabilistic random walk after 1994966 steps, run timeout after 60001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 1994966 steps, saw 1528038 distinct states, run finished after 60002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 00:49:04] [INFO ] Invariant cache hit.
[2023-03-23 00:49:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 247 ms returned sat
[2023-03-23 00:49:06] [INFO ] After 1784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:49:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2023-03-23 00:49:08] [INFO ] After 1183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:49:08] [INFO ] After 1379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-23 00:49:08] [INFO ] After 2030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1460 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 96 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 96 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-23 00:49:10] [INFO ] Invariant cache hit.
[2023-03-23 00:49:12] [INFO ] Implicit Places using invariants in 2526 ms returned []
[2023-03-23 00:49:12] [INFO ] Invariant cache hit.
[2023-03-23 00:49:16] [INFO ] Implicit Places using invariants and state equation in 4035 ms returned []
Implicit Place search using SMT with State Equation took 6563 ms to find 0 implicit places.
[2023-03-23 00:49:16] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-23 00:49:16] [INFO ] Invariant cache hit.
[2023-03-23 00:49:18] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8274 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2627 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 00:49:20] [INFO ] Invariant cache hit.
[2023-03-23 00:49:21] [INFO ] [Real]Absence check using 1098 positive place invariants in 232 ms returned sat
[2023-03-23 00:49:22] [INFO ] After 1471ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 00:49:23] [INFO ] After 1838ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 00:49:23] [INFO ] After 2342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 00:49:23] [INFO ] [Nat]Absence check using 1098 positive place invariants in 228 ms returned sat
[2023-03-23 00:49:25] [INFO ] After 1438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 00:49:25] [INFO ] After 1892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 00:49:25] [INFO ] After 2422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15875 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 428640 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen 0
Interrupted probabilistic random walk after 1976798 steps, run timeout after 60001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 1976798 steps, saw 1515275 distinct states, run finished after 60001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 00:50:46] [INFO ] Invariant cache hit.
[2023-03-23 00:50:48] [INFO ] [Real]Absence check using 1098 positive place invariants in 1122 ms returned sat
[2023-03-23 00:50:49] [INFO ] After 2858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:50:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2023-03-23 00:50:51] [INFO ] After 1616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:50:51] [INFO ] After 1779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-23 00:50:51] [INFO ] After 2527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1462 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 98 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 165 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-23 00:50:53] [INFO ] Invariant cache hit.
[2023-03-23 00:50:56] [INFO ] Implicit Places using invariants in 2722 ms returned []
[2023-03-23 00:50:56] [INFO ] Invariant cache hit.
[2023-03-23 00:51:00] [INFO ] Implicit Places using invariants and state equation in 4173 ms returned []
Implicit Place search using SMT with State Equation took 6925 ms to find 0 implicit places.
[2023-03-23 00:51:00] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-23 00:51:00] [INFO ] Invariant cache hit.
[2023-03-23 00:51:02] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8686 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2533 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 00:51:04] [INFO ] Invariant cache hit.
[2023-03-23 00:51:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 223 ms returned sat
[2023-03-23 00:51:07] [INFO ] After 1882ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 00:51:07] [INFO ] After 2308ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 00:51:07] [INFO ] After 2829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 00:51:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-23 00:51:09] [INFO ] After 1630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 00:51:10] [INFO ] After 2018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 00:51:10] [INFO ] After 2600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97098 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97098 steps, saw 73060 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 00:51:13] [INFO ] Invariant cache hit.
[2023-03-23 00:51:13] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:51:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 201 ms returned sat
[2023-03-23 00:51:15] [INFO ] After 1273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:51:15] [INFO ] After 1407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-23 00:51:15] [INFO ] After 2010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2496 transition count 2095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2495 transition count 2095
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 175 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2096 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 2494/2496 places, 2095/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92850 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92850 steps, saw 69596 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2023-03-23 00:51:19] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-23 00:51:19] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:51:20] [INFO ] [Nat]Absence check using 1098 positive place invariants in 222 ms returned sat
[2023-03-23 00:51:21] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:51:21] [INFO ] After 1364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-23 00:51:21] [INFO ] After 2080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 88 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 86 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-23 00:51:21] [INFO ] Invariant cache hit.
[2023-03-23 00:51:24] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2023-03-23 00:51:24] [INFO ] Invariant cache hit.
[2023-03-23 00:51:28] [INFO ] Implicit Places using invariants and state equation in 4482 ms returned []
Implicit Place search using SMT with State Equation took 6837 ms to find 0 implicit places.
[2023-03-23 00:51:28] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-23 00:51:28] [INFO ] Invariant cache hit.
[2023-03-23 00:51:30] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9127 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2494 transition count 2095
Applied a total of 595 rules in 295 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2023-03-23 00:51:31] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-23 00:51:31] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:51:32] [INFO ] [Nat]Absence check using 1098 positive place invariants in 209 ms returned sat
[2023-03-23 00:51:33] [INFO ] After 1167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:51:33] [INFO ] After 1333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-23 00:51:33] [INFO ] After 2038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92888 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92888 steps, saw 69624 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-23 00:51:37] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-23 00:51:37] [INFO ] [Real]Absence check using 1098 positive place invariants in 233 ms returned sat
[2023-03-23 00:51:39] [INFO ] After 2042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:51:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 230 ms returned sat
[2023-03-23 00:51:40] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:51:41] [INFO ] After 1442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-23 00:51:41] [INFO ] After 2191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2495 transition count 2095
Applied a total of 2 rules in 172 ms. Remains 2495 /2496 variables (removed 1) and now considering 2095/2096 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 2495/2496 places, 2095/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93661 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93661 steps, saw 70270 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-23 00:51:44] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-23 00:51:45] [INFO ] [Real]Absence check using 1098 positive place invariants in 220 ms returned sat
[2023-03-23 00:51:46] [INFO ] After 1778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:51:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 240 ms returned sat
[2023-03-23 00:51:48] [INFO ] After 1468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:51:48] [INFO ] After 1630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-23 00:51:48] [INFO ] After 2398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 94 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 87 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-23 00:51:49] [INFO ] Invariant cache hit.
[2023-03-23 00:51:51] [INFO ] Implicit Places using invariants in 2363 ms returned []
[2023-03-23 00:51:51] [INFO ] Invariant cache hit.
[2023-03-23 00:51:55] [INFO ] Implicit Places using invariants and state equation in 4106 ms returned []
Implicit Place search using SMT with State Equation took 6474 ms to find 0 implicit places.
[2023-03-23 00:51:55] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-23 00:51:55] [INFO ] Invariant cache hit.
[2023-03-23 00:51:57] [INFO ] Dead Transitions using invariants and state equation in 2053 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8707 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 249 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-23 00:51:58] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-23 00:51:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 313 ms returned sat
[2023-03-23 00:52:00] [INFO ] After 1921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:52:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 231 ms returned sat
[2023-03-23 00:52:01] [INFO ] After 1365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:52:02] [INFO ] After 1633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-23 00:52:02] [INFO ] After 2347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 215 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-23 00:52:02] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-23 00:52:03] [INFO ] [Real]Absence check using 1098 positive place invariants in 302 ms returned sat
[2023-03-23 00:52:04] [INFO ] After 1980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:52:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 256 ms returned sat
[2023-03-23 00:52:06] [INFO ] After 1283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:52:06] [INFO ] After 1451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-23 00:52:06] [INFO ] After 2247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6702 transition count 6002
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6702 transition count 6002
Applied a total of 52 rules in 2298 ms. Remains 6702 /6728 variables (removed 26) and now considering 6002/6028 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2299 ms. Remains : 6702/6728 places, 6002/6028 transitions.
[2023-03-23 00:52:09] [INFO ] Flatten gal took : 175 ms
[2023-03-23 00:52:09] [INFO ] Flatten gal took : 228 ms
[2023-03-23 00:52:09] [INFO ] Input system was already deterministic with 6002 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6727 transition count 4631
Reduce places removed 1396 places and 0 transitions.
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2792 place count 5331 transition count 4631
Performed 787 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 787 Pre rules applied. Total rules applied 2792 place count 5331 transition count 3844
Deduced a syphon composed of 787 places in 12 ms
Reduce places removed 787 places and 0 transitions.
Iterating global reduction 2 with 1574 rules applied. Total rules applied 4366 place count 4544 transition count 3844
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 4388 place count 4522 transition count 3822
Iterating global reduction 2 with 22 rules applied. Total rules applied 4410 place count 4522 transition count 3822
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4410 place count 4522 transition count 3804
Deduced a syphon composed of 18 places in 25 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 4446 place count 4504 transition count 3804
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: 1597
Deduced a syphon composed of 1597 places in 5 ms
Reduce places removed 1597 places and 0 transitions.
Iterating global reduction 2 with 3194 rules applied. Total rules applied 7640 place count 2907 transition count 2207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7641 place count 2907 transition count 2206
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7643 place count 2906 transition count 2205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7645 place count 2904 transition count 2203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7646 place count 2903 transition count 2203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 7646 place count 2903 transition count 2201
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 7650 place count 2901 transition count 2201
Applied a total of 7650 rules in 2064 ms. Remains 2901 /6728 variables (removed 3827) and now considering 2201/6028 (removed 3827) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2064 ms. Remains : 2901/6728 places, 2201/6028 transitions.
[2023-03-23 00:52:12] [INFO ] Flatten gal took : 58 ms
[2023-03-23 00:52:12] [INFO ] Flatten gal took : 63 ms
[2023-03-23 00:52:12] [INFO ] Input system was already deterministic with 2201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 6707 transition count 6007
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 6707 transition count 6007
Applied a total of 42 rules in 2222 ms. Remains 6707 /6728 variables (removed 21) and now considering 6007/6028 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2222 ms. Remains : 6707/6728 places, 6007/6028 transitions.
[2023-03-23 00:52:14] [INFO ] Flatten gal took : 146 ms
[2023-03-23 00:52:14] [INFO ] Flatten gal took : 165 ms
[2023-03-23 00:52:15] [INFO ] Input system was already deterministic with 6007 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1385 transitions
Trivial Post-agglo rules discarded 1385 transitions
Performed 1385 trivial Post agglomeration. Transition count delta: 1385
Iterating post reduction 0 with 1385 rules applied. Total rules applied 1385 place count 6727 transition count 4642
Reduce places removed 1385 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1390 rules applied. Total rules applied 2775 place count 5342 transition count 4637
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2780 place count 5337 transition count 4637
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 789 Pre rules applied. Total rules applied 2780 place count 5337 transition count 3848
Deduced a syphon composed of 789 places in 12 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 4358 place count 4548 transition count 3848
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 4379 place count 4527 transition count 3827
Iterating global reduction 3 with 21 rules applied. Total rules applied 4400 place count 4527 transition count 3827
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 4400 place count 4527 transition count 3809
Deduced a syphon composed of 18 places in 13 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 4436 place count 4509 transition count 3809
Performed 1595 Post agglomeration using F-continuation condition.Transition count delta: 1595
Deduced a syphon composed of 1595 places in 6 ms
Reduce places removed 1595 places and 0 transitions.
Iterating global reduction 3 with 3190 rules applied. Total rules applied 7626 place count 2914 transition count 2214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7627 place count 2914 transition count 2213
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7629 place count 2913 transition count 2212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7631 place count 2911 transition count 2210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7632 place count 2910 transition count 2210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 7632 place count 2910 transition count 2208
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 7636 place count 2908 transition count 2208
Applied a total of 7636 rules in 2019 ms. Remains 2908 /6728 variables (removed 3820) and now considering 2208/6028 (removed 3820) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2020 ms. Remains : 2908/6728 places, 2208/6028 transitions.
[2023-03-23 00:52:17] [INFO ] Flatten gal took : 63 ms
[2023-03-23 00:52:17] [INFO ] Flatten gal took : 70 ms
[2023-03-23 00:52:17] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 6728/6728 places, 6028/6028 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6727 transition count 4631
Reduce places removed 1396 places and 0 transitions.
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2792 place count 5331 transition count 4631
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 789 Pre rules applied. Total rules applied 2792 place count 5331 transition count 3842
Deduced a syphon composed of 789 places in 13 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 2 with 1578 rules applied. Total rules applied 4370 place count 4542 transition count 3842
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 4392 place count 4520 transition count 3820
Iterating global reduction 2 with 22 rules applied. Total rules applied 4414 place count 4520 transition count 3820
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4414 place count 4520 transition count 3802
Deduced a syphon composed of 18 places in 13 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 4450 place count 4502 transition count 3802
Performed 1598 Post agglomeration using F-continuation condition.Transition count delta: 1598
Deduced a syphon composed of 1598 places in 6 ms
Reduce places removed 1598 places and 0 transitions.
Iterating global reduction 2 with 3196 rules applied. Total rules applied 7646 place count 2904 transition count 2204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7647 place count 2904 transition count 2203
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7649 place count 2903 transition count 2202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7651 place count 2901 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7652 place count 2900 transition count 2200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 7652 place count 2900 transition count 2198
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 7656 place count 2898 transition count 2198
Applied a total of 7656 rules in 2117 ms. Remains 2898 /6728 variables (removed 3830) and now considering 2198/6028 (removed 3830) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2117 ms. Remains : 2898/6728 places, 2198/6028 transitions.
[2023-03-23 00:52:19] [INFO ] Flatten gal took : 56 ms
[2023-03-23 00:52:19] [INFO ] Flatten gal took : 59 ms
[2023-03-23 00:52:19] [INFO ] Input system was already deterministic with 2198 transitions.
[2023-03-23 00:52:20] [INFO ] Flatten gal took : 140 ms
[2023-03-23 00:52:20] [INFO ] Flatten gal took : 167 ms
[2023-03-23 00:52:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-23 00:52:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6728 places, 6028 transitions and 15656 arcs took 29 ms.
Total runtime 579124 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: 6728 NrTr: 6028 NrArc: 15656)

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

net check time: 0m 0.004sec

init dd package: 0m 3.383sec


before gc: list nodes free: 386520

after gc: idd nodes used:25703411, unused:38296589; list nodes free:159305236

before gc: list nodes free: 994273

after gc: idd nodes used:51393507, unused:12606493; list nodes free:56545192

RS generation: 30m53.415sec


-> last computed set: #nodes 51386781 (5.1e+07) #states 4,318,245,869,563,045,805,051,780 (24)


CANNOT_COMPUTE


BK_STOP 1679534641481

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.091sec

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="ShieldPPPt-PT-100B"
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-100B, 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-167903718200697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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