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

About the Execution of LTSMin+red for HealthRecord-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3867.636 85647.00 293804.00 543.00 TFFFTTFTFFFTFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347600345.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HealthRecord-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678640845331

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:07:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:07:28] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-12 17:07:28] [INFO ] Transformed 163 places.
[2023-03-12 17:07:28] [INFO ] Transformed 348 transitions.
[2023-03-12 17:07:28] [INFO ] Found NUPN structural information;
[2023-03-12 17:07:28] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 123 transition count 242
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 123 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 121 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 121 transition count 238
Applied a total of 84 rules in 36 ms. Remains 121 /163 variables (removed 42) and now considering 238/319 (removed 81) transitions.
[2023-03-12 17:07:28] [INFO ] Flow matrix only has 229 transitions (discarded 9 similar events)
// Phase 1: matrix 229 rows 121 cols
[2023-03-12 17:07:28] [INFO ] Computed 15 place invariants in 18 ms
[2023-03-12 17:07:28] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 17:07:28] [INFO ] Flow matrix only has 229 transitions (discarded 9 similar events)
[2023-03-12 17:07:28] [INFO ] Invariant cache hit.
[2023-03-12 17:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:07:28] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-12 17:07:28] [INFO ] Flow matrix only has 229 transitions (discarded 9 similar events)
[2023-03-12 17:07:28] [INFO ] Invariant cache hit.
[2023-03-12 17:07:29] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/163 places, 238/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 121/163 places, 238/319 transitions.
Support contains 91 out of 121 places after structural reductions.
[2023-03-12 17:07:29] [INFO ] Flatten gal took : 99 ms
[2023-03-12 17:07:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-15-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:07:29] [INFO ] Flatten gal took : 37 ms
[2023-03-12 17:07:29] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 81 out of 121 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 930 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 64) seen :22
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :3
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-12 17:07:30] [INFO ] Flow matrix only has 229 transitions (discarded 9 similar events)
[2023-03-12 17:07:30] [INFO ] Invariant cache hit.
[2023-03-12 17:07:31] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-12 17:07:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-12 17:07:31] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 17:07:32] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :37
[2023-03-12 17:07:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:07:32] [INFO ] After 398ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :37
[2023-03-12 17:07:32] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 7 ms to minimize.
[2023-03-12 17:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-12 17:07:32] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-12 17:07:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-12 17:07:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-12 17:07:32] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2023-03-12 17:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-12 17:07:33] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2023-03-12 17:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-12 17:07:33] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:07:33] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:07:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-12 17:07:33] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2023-03-12 17:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-12 17:07:33] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-12 17:07:33] [INFO ] After 1788ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :37
Attempting to minimize the solution found.
Minimization took 383 ms.
[2023-03-12 17:07:34] [INFO ] After 3083ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :37
Fused 38 Parikh solutions to 37 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 51 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 238/238 transitions.
Graph (trivial) has 51 edges and 121 vertex of which 2 / 121 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 523 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 21 place count 98 transition count 188
Iterating global reduction 0 with 19 rules applied. Total rules applied 40 place count 98 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 96 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 96 transition count 184
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 90 transition count 219
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 90 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 90 transition count 214
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 90 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 89 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 89 transition count 212
Applied a total of 65 rules in 96 ms. Remains 89 /121 variables (removed 32) and now considering 212/238 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 89/121 places, 212/238 transitions.
Incomplete random walk after 10000 steps, including 1346 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 37) seen :4
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-12 17:07:35] [INFO ] Flow matrix only has 198 transitions (discarded 14 similar events)
// Phase 1: matrix 198 rows 89 cols
[2023-03-12 17:07:35] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-12 17:07:35] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-12 17:07:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 17:07:35] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 17:07:35] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-12 17:07:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 17:07:36] [INFO ] After 235ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:07:36] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2023-03-12 17:07:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 175 ms
[2023-03-12 17:07:37] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-12 17:07:37] [INFO ] After 1948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 212/212 transitions.
Graph (complete) has 403 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 85 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 85 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 84 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 84 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 84 transition count 201
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 82 transition count 199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 80 transition count 209
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 80 transition count 207
Applied a total of 22 rules in 36 ms. Remains 80 /89 variables (removed 9) and now considering 207/212 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 80/89 places, 207/212 transitions.
Incomplete random walk after 10000 steps, including 1573 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-12 17:07:37] [INFO ] Flow matrix only has 190 transitions (discarded 17 similar events)
// Phase 1: matrix 190 rows 80 cols
[2023-03-12 17:07:37] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 17:07:37] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 17:07:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 17:07:38] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:07:38] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 17:07:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 17:07:38] [INFO ] After 204ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 17:07:38] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:07:38] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-12 17:07:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-12 17:07:38] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2023-03-12 17:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-12 17:07:39] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-12 17:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-12 17:07:39] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-12 17:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-12 17:07:39] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-12 17:07:39] [INFO ] After 1473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 2 ms.
Support contains 38 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 207/207 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 205
Applied a total of 4 rules in 11 ms. Remains 78 /80 variables (removed 2) and now considering 205/207 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 78/80 places, 205/207 transitions.
Incomplete random walk after 10000 steps, including 1597 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 466841 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{1=1, 4=1, 5=1, 6=1, 11=1, 12=1, 13=1, 15=1, 18=1, 19=1, 20=1, 22=1, 23=1}
Probabilistic random walk after 466841 steps, saw 66357 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :13
Running SMT prover for 11 properties.
[2023-03-12 17:07:42] [INFO ] Flow matrix only has 187 transitions (discarded 18 similar events)
// Phase 1: matrix 187 rows 78 cols
[2023-03-12 17:07:42] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 17:07:43] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 17:07:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 17:07:43] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:07:43] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 17:07:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 17:07:43] [INFO ] After 87ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 17:07:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-12 17:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-12 17:07:43] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2023-03-12 17:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-12 17:07:43] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-12 17:07:43] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-12 17:07:43] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 17 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 205/205 transitions.
Graph (trivial) has 46 edges and 78 vertex of which 2 / 78 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 74 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 73 transition count 202
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 13 place count 64 transition count 185
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 64 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 63 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 63 transition count 182
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 60 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 59 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 59 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 59 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 57 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 57 transition count 177
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 57 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 57 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 56 transition count 174
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 60 place count 56 transition count 174
Applied a total of 60 rules in 72 ms. Remains 56 /78 variables (removed 22) and now considering 174/205 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 56/78 places, 174/205 transitions.
Incomplete random walk after 10000 steps, including 1620 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 194 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 195 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 179 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 195 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Finished probabilistic random walk after 89119 steps, run visited all 11 properties in 458 ms. (steps per millisecond=194 )
Probabilistic random walk after 89119 steps, saw 16783 distinct states, run finished after 459 ms. (steps per millisecond=194 ) properties seen :11
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-12 17:07:44] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:07:44] [INFO ] Flatten gal took : 18 ms
[2023-03-12 17:07:44] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 77 out of 121 places (down from 80) after GAL structural reductions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 144
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 68 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 68 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 68 transition count 135
Applied a total of 109 rules in 11 ms. Remains 68 /121 variables (removed 53) and now considering 135/238 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 68/121 places, 135/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 142
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 108 place count 63 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 116 place count 63 transition count 125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 63 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 62 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 62 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 62 transition count 111
Applied a total of 130 rules in 10 ms. Remains 62 /121 variables (removed 59) and now considering 111/238 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 62/121 places, 111/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 144
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 144
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 65 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 65 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 64 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 64 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 64 transition count 118
Applied a total of 125 rules in 10 ms. Remains 64 /121 variables (removed 57) and now considering 118/238 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 64/121 places, 118/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Graph (trivial) has 167 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 60 transition count 126
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 60 transition count 126
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 50 transition count 104
Iterating global reduction 0 with 10 rules applied. Total rules applied 135 place count 50 transition count 104
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 145 place count 50 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 47 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 47 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 157 place count 47 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 46 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 162 place count 46 transition count 76
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 46 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 44 transition count 72
Applied a total of 168 rules in 32 ms. Remains 44 /121 variables (removed 77) and now considering 72/238 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 44/121 places, 72/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 67 transition count 136
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 67 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 59 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 59 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 59 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 57 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 138 place count 57 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 56 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 56 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 142 place count 56 transition count 100
Applied a total of 142 rules in 11 ms. Remains 56 /121 variables (removed 65) and now considering 100/238 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 56/121 places, 100/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 67 transition count 135
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 67 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 59 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 59 transition count 118
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 133 place count 59 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 58 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 58 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 58 transition count 104
Applied a total of 138 rules in 8 ms. Remains 58 /121 variables (removed 63) and now considering 104/238 (removed 134) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 58/121 places, 104/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 66 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 66 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 66 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 65 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 65 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 65 transition count 121
Applied a total of 120 rules in 6 ms. Remains 65 /121 variables (removed 56) and now considering 121/238 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 65/121 places, 121/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 57 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 57 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 55 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 55 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 147 place count 55 transition count 95
Applied a total of 147 rules in 7 ms. Remains 55 /121 variables (removed 66) and now considering 95/238 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 55/121 places, 95/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 59 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 59 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 59 transition count 112
Applied a total of 132 rules in 5 ms. Remains 59 /121 variables (removed 62) and now considering 112/238 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 59/121 places, 112/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 63 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 63 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 124 place count 55 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 132 place count 55 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 138 place count 55 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 53 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 53 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 148 place count 53 transition count 94
Applied a total of 148 rules in 10 ms. Remains 53 /121 variables (removed 68) and now considering 94/238 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 53/121 places, 94/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Graph (trivial) has 162 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 63 transition count 132
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 63 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 117 place count 55 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 125 place count 55 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 131 place count 55 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 134 place count 52 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 52 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 52 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 51 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 148 place count 51 transition count 90
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 51 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 49 transition count 85
Applied a total of 155 rules in 25 ms. Remains 49 /121 variables (removed 72) and now considering 85/238 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 49/121 places, 85/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 66 transition count 134
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 66 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 116 place count 60 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 122 place count 60 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 60 transition count 117
Applied a total of 127 rules in 6 ms. Remains 60 /121 variables (removed 61) and now considering 117/238 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/121 places, 117/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 142
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 65 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 65 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 65 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 63 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 63 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 121 place count 63 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 62 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 62 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 62 transition count 115
Applied a total of 125 rules in 10 ms. Remains 62 /121 variables (removed 59) and now considering 115/238 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 62/121 places, 115/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 238/238 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 67 transition count 136
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 67 transition count 136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 60 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 60 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 131 place count 60 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 58 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 58 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 58 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 57 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 57 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 57 transition count 99
Applied a total of 143 rules in 10 ms. Remains 57 /121 variables (removed 64) and now considering 99/238 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 57/121 places, 99/238 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:07:45] [INFO ] Input system was already deterministic with 99 transitions.
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:07:45] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:07:45] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-12 17:07:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 238 transitions and 688 arcs took 1 ms.
Total runtime 17652 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/573/ctl_0_ --ctl=/tmp/573/ctl_1_ --ctl=/tmp/573/ctl_2_ --ctl=/tmp/573/ctl_3_ --ctl=/tmp/573/ctl_4_ --ctl=/tmp/573/ctl_5_ --ctl=/tmp/573/ctl_6_ --ctl=/tmp/573/ctl_7_ --ctl=/tmp/573/ctl_8_ --ctl=/tmp/573/ctl_9_ --ctl=/tmp/573/ctl_10_ --ctl=/tmp/573/ctl_11_ --ctl=/tmp/573/ctl_12_ --ctl=/tmp/573/ctl_13_ --mu-par --mu-opt
FORMULA HealthRecord-PT-15-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-15-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640930978

--------------------
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
mcc2023
ctl formula name HealthRecord-PT-15-CTLCardinality-00
ctl formula formula --ctl=/tmp/573/ctl_0_
ctl formula name HealthRecord-PT-15-CTLCardinality-01
ctl formula formula --ctl=/tmp/573/ctl_1_
ctl formula name HealthRecord-PT-15-CTLCardinality-02
ctl formula formula --ctl=/tmp/573/ctl_2_
ctl formula name HealthRecord-PT-15-CTLCardinality-03
ctl formula formula --ctl=/tmp/573/ctl_3_
ctl formula name HealthRecord-PT-15-CTLCardinality-05
ctl formula formula --ctl=/tmp/573/ctl_4_
ctl formula name HealthRecord-PT-15-CTLCardinality-06
ctl formula formula --ctl=/tmp/573/ctl_5_
ctl formula name HealthRecord-PT-15-CTLCardinality-07
ctl formula formula --ctl=/tmp/573/ctl_6_
ctl formula name HealthRecord-PT-15-CTLCardinality-08
ctl formula formula --ctl=/tmp/573/ctl_7_
ctl formula name HealthRecord-PT-15-CTLCardinality-10
ctl formula formula --ctl=/tmp/573/ctl_8_
ctl formula name HealthRecord-PT-15-CTLCardinality-11
ctl formula formula --ctl=/tmp/573/ctl_9_
ctl formula name HealthRecord-PT-15-CTLCardinality-12
ctl formula formula --ctl=/tmp/573/ctl_10_
ctl formula name HealthRecord-PT-15-CTLCardinality-13
ctl formula formula --ctl=/tmp/573/ctl_11_
ctl formula name HealthRecord-PT-15-CTLCardinality-14
ctl formula formula --ctl=/tmp/573/ctl_12_
ctl formula name HealthRecord-PT-15-CTLCardinality-15
ctl formula formula --ctl=/tmp/573/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 121 places, 238 transitions and 688 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 238->179 groups
pnml2lts-sym: Regrouping took 0.070 real 0.060 user 0.010 sys
pnml2lts-sym: state vector length is 121; there are 179 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 2150192 group checks and 0 next state calls
pnml2lts-sym: reachability took 15.800 real 62.630 user 0.300 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 413905627 states, 21534 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/573/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/573/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_10_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/573/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/573/ctl_3_ does not hold for the initial state
pnml2lts-sym: group_next: 2611 nodes total
pnml2lts-sym: group_explored: 1711 nodes, 5070 short vectors total
pnml2lts-sym: max token count: 4

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="HealthRecord-PT-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-15, 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 r201-smll-167840347600345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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